Geometries for universal quantum computation with matchgates

Matchgates are a group of two-qubit gates associated with free fermions. They are classically simulatable if restricted to act between nearest neighbors on a one-dimensional chain, but become universal for quantum computation with longer-range interactions. We describe various alternative geometries with nearest-neighbor interactions that result in universal quantum computation with matchgates only, including subtle departures from the chain. Our results pave the way for new quantum computer architectures that rely solely on the simple interactions associated with matchgates.Comment: 6 pages, 4 figures. Updated version includes an appendix extending one of the result

Infinite ergodic theory and Non-extensive entropies

We bring into account a series of result in the infinite ergodic theory that we believe that they are relevant to the theory of non-extensive entropie

On conformal measures and harmonic functions for group extensions

We prove a Perron-Frobenius-Ruelle theorem for group extensions of topological Markov chains based on a construction of $\sigma$-finite conformal measures and give applications to the construction of harmonic functions.Comment: To appear in Proceedings of "New Trends in Onedimensional Dynamics, celebrating the 70th birthday of Welington de Melo

Physical consequences of P≠\neqNP and the DMRG-annealing conjecture

Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {\em need not} be a Turing machine and, thus, these theorems do not apply directly to it. But {\em classical simulations} of physical processes are programs running on Turing machines and, as such, are subject to them. In this work, computational complexity theory is applied to classical simulations of systems performing an adiabatic quantum computation (AQC), based on an annealed extension of the density matrix renormalization group (DMRG). We conjecture that the computational time required for those classical simulations is controlled solely by the {\em maximal entanglement} found during the process. Thus, lower bounds on the growth of entanglement with the system size can be provided. In some cases, quantum phase transitions can be predicted to take place in certain inhomogeneous systems. Concretely, physical conclusions are drawn from the assumption that the complexity classes {\bf P} and {\bf NP} differ. As a by-product, an alternative measure of entanglement is proposed which, via Chebyshev's inequality, allows to establish strict bounds on the required computational time.Comment: Accepted for publication in JSTA

USP7 Enforces Heterochromatinization of p53 Target Promoters by Protecting SUV39H1 from MDM2-Mediated Degradation

SummaryThe H3K9me3 repressive histone conformation of p53 target promoters is abrogated in response to p53 activation by MDM2-mediated SUV39H1 degradation. Here, we present evidence that the USP7 deubiquitinase protects SUV39H1 from MDM2-mediated ubiquitination in the absence of p53 stimulus. USP7 occupies p53 target promoters in unstressed conditions, a process that is abrogated with p53 activation associated with loss of the H3K9me3 mark on these same promoters. Mechanistically, USP7 forms a trimeric complex with MDM2 and SUV39H1, independent of DNA, and modulates MDM2-dependent SUV39H1 ubiquitination. Furthermore, we show that this protective function of USP7 on SUV39H1 is independent of p53. Finally, USP7 blocking cooperates with p53 in inducing apoptosis by enhancing p53 promoter occupancy and dependent transactivation of target genes. These results uncover a layer of the p53 transcriptional program mediated by USP7, which restrains relaxation of local chromatin conformation at p53 target promoters

Stabilizer notation for Spekkens' toy theory

Spekkens has introduced a toy theory [Phys. Rev. A, 75, 032110 (2007)] in order to argue for an epistemic view of quantum states. I describe a notation for the theory (excluding certain joint measurements) which makes its similarities and differences with the quantum mechanics of stabilizer states clear. Given an application of the qubit stabilizer formalism, it is often entirely straightforward to construct an analogous application of the notation to the toy theory. This assists calculations within the toy theory, for example of the number of possible states and transformations, and enables superpositions to be defined for composite systems.Comment: 7+4 pages, 5 tables. v2: Clarifications added and typos fixed in response to referee comment

Understanding Anomalous Transport in Intermittent Maps: From Continuous Time Random Walks to Fractals

We show that the generalized diffusion coefficient of a subdiffusive intermittent map is a fractal function of control parameters. A modified continuous time random walk theory yields its coarse functional form and correctly describes a dynamical phase transition from normal to anomalous diffusion marked by strong suppression of diffusion. Similarly, the probability density of moving particles is governed by a time-fractional diffusion equation on coarse scales while exhibiting a specific fine structure. Approximations beyond stochastic theory are derived from a generalized Taylor-Green-Kubo formula.Comment: 4 pages, 3 eps figure

Exponential Separation of Quantum and Classical Online Space Complexity

Although quantum algorithms realizing an exponential time speed-up over the best known classical algorithms exist, no quantum algorithm is known performing computation using less space resources than classical algorithms. In this paper, we study, for the first time explicitly, space-bounded quantum algorithms for computational problems where the input is given not as a whole, but bit by bit. We show that there exist such problems that a quantum computer can solve using exponentially less work space than a classical computer. More precisely, we introduce a very natural and simple model of a space-bounded quantum online machine and prove an exponential separation of classical and quantum online space complexity, in the bounded-error setting and for a total language. The language we consider is inspired by a communication problem (the set intersection function) that Buhrman, Cleve and Wigderson used to show an almost quadratic separation of quantum and classical bounded-error communication complexity. We prove that, in the framework of online space complexity, the separation becomes exponential.Comment: 13 pages. v3: minor change

A meteorologically-driven yield reduction model for spring and winter wheat

A yield reduction model for spring and winter wheat was developed for large-area crop condition assessment. Reductions are expressed in percentage from a base yield and are calculated on a daily basis. The algorithm contains two integral components: a two-layer soil water budget model and a crop calendar routine. Yield reductions associated with hot, dry winds (Sukhovey) and soil moisture stress are determined. Input variables include evapotranspiration, maximum temperature and precipitation; subsequently crop-stage, available water holding percentage and stress duration are evaluated. No specific base yield is required and may be selected by the user; however, it may be generally characterized as the maximum likely to be produced commercially at a location