It is found that the statistical level fluctuations of the AQC 3-SAT problem undergo a transition from a poisson (regular) fluctuation form to a form consistent with the predictions of Random Matrix Theory. We present data which suggests this transition correlates with the computational phase transition in the classical 3-SAT problem. Application to Gaussian Processes and implication for experiment is discussed.
Kolmogorov complexity is a measure of the information contained in a binary string. We investigate here the notion of quantum Kolmogorov complexity, a measure of the information required to describe a quantum state. We show that for any definition of quantum Kolmogorov complexity measuring the number of classical bits required to describe a pure quantum state, there exists a pure n-qubit state which requires exponentially many bits of description. This is shown by relating the classical communication complexity to the quantum Kolmogorov complexity. Furthermore we give some examples of how quan…
Following the recent approach of using order domains to construct Grobner bases from general projective varieties, we examine the parity and time-reversal arguments relating de Witt and Lyman's assertion that all path weights associated with homotopy in dimensions d <= 2 form a faithful representation of the fundamental group of a quantum system. We then show how the most general polynomial ring obtained for a fermionic quantum system does not, in fact, admit a faithful representation, and so give a general prescription for calcluating Grobner bases for finite temperature many-body quantum sys…
Completely positive, trace preserving (CPT) maps and Lindblad master equations are both widely used to describe the dynamics of open quantum systems. The connection between these two descriptions is a classic topic in mathematical physics. One direction was solved by the now famous result due to Lindblad, Kossakowski Gorini and Sudarshan, who gave a complete characterisation of the master equations that generate completely positive semi-groups. However, the other direction has remained open: given a CPT map, is there a Lindblad master equation that generates it (and if so, can we find it's for…
Can the computational complexity theory of computer science and mathematics say something new about unresolved problems in quantum physics? Particularly, can the P versus NP question in the computational complexity theory be a factor in the elucidation of the emergency of classicality in quantum mechanics? The paper compares two different ways of deriving classicality from the quantum formalism resulted from two differing hypotheses regarding the P versus NP question -- the approach of the quantum decoherence theory implying that P = NP and the computational complexity approach which assumes t…
This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of quantum complexity classes based on these notions, such as BQP, QMA, and QIP, are presented. Other topics in quantum complexity, including quantum advice, space-bounded quantum computation, and bounded-depth quantum circuits, are also discussed.
I give a very brief non-technical introduction to the intersection of the fields of spin systems and computational complexity. The focus is on spin glasses and their relationship to NP-complete problems.
A precise estimation of the computational complexity in Shor's factoring algorithm under the condition that the large integer we want to factorize is composed by the product of two prime numbers, is derived by the results related to number theory. Compared with Shor's original estimation, our estimation shows that one can obtain the solution under such a condition, by less computational complexity.
We prove upper and lower bounds relating the quantum gate complexity of a unitary operation, U, to the optimal control cost associated to the synthesis of U. These bounds apply for any optimal control problem, and can be used to show that the quantum gate complexity is essentially equivalent to the optimal control cost for a wide range of problems, including time-optimal control and finding minimal distances on certain Riemannian, subriemannian, and Finslerian manifolds. These results generalize the results of Nielsen, Dowling, Gu, and Doherty, Science 311, 1133-1135 (2006), which showed that …
Computational and physical complexity of synthesizing random multi-qudit quantum states and unitary operators
Advanced ICT Research Institute, National Institute of Information and Communications Technology（先进ICT研究所，信息通信技术研究所）；Research Institute for Science and Technology, Tokyo University of Science（科学技术研究所，东京理科大学）；Institute for Quantum Information and Matter and Department of Physics, California Institute of Technology（量子信息与物质研究所和物理系，加州理工学院）
Measurements on current quantum processors are subject to hardware imperfections that lead to readout errors. These errors manifest themselves as a bias in quantum expectation values. Here, we propose a very simple method that forces the bias in the expectation value to appear as a multiplicative factor that can be measured directly and removed at the cost of an increase in the sampling complexity for the observable. The method assumes no specific form of the noise, but only requires that the noise is `weak' to avoid excessive sampling overhead. We provide bounds relating the error in the expe…
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPR-pairs). Some lower bound techniques are available for qubit communication complexity, but except for the inner product function, no bounds are known for the model with unlimited prior entanglement. We show that the log-rank lower bound extends to the strongest model (qubit communication + unlimited prior entanglement). By relating the rank of the communication matrix to properties of polynomials, we are able to derive some strong bounds fo…
These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.
We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on computational complexity of the quantum search algorithm. We show that only for small amounts of noise the quantum search algorithm is still more efficient than any classical algorithm.
We study the relation between quantum computational complexity and general relativity. The quantum computational complexity is proposed to be quantified by the shortest length of geodesic quantum curves. We examine the complexity/volume duality in a geodesic causal ball in the framework of Fermi normal coordinates and derive the full non-linear Einstein equation. Using insights from the complexity/action duality, we argue that the accelerated expansion of the universe could be driven by the quantum complexity and free from coincidence and fine-tunning problems.
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.
We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon the formal treatment of partial separability, we measure the complexity of an entangled quantum state by determining (i) how hard to approximate it from a fixed classical state and (ii) how hard to distinguish it from all partially separable states. We further consider the Kolmogorovian-style descriptive complexity of approximation and distinction of partial …
Computational complexity is essential to understanding the properties of black hole horizons. The problem of Alice creating a firewall behind the horizon of Bob's black hole is a problem of computational complexity. In general we find that while creating firewalls is possible, it is extremely difficult and probably impossible for black holes that form in sudden collapse, and then evaporate. On the other hand if the radiation is bottled up then after an exponentially long period of time firewalls may be common. It is possible that gravity will provide tools to study problems of complexity; espe…
An emerging insight is that ground states of symmetry-protected topological orders (SPTO's) possess latent computational complexity in terms of their many-body entanglement. By introducing a fractional symmetry of SPTO, which requires the invariance under 3-colorable symmetries of a lattice, we prove that every renormalization fixed-point state of 2D $(\mathbb{Z}_2)^m$ SPTO with fractional symmetry can be utilized for universal quantum computation using only Pauli measurements, as long as it belongs to a nontrivial 2D SPTO phase. Our infinite family of fixed-point states may serve as a base mo…
We determine the computational power of preparing Projected Entangled Pair States (PEPS), as well as the complexity of classically simulating them, and generally the complexity of contracting tensor networks. While creating PEPS allows to solve PP problems, the latter two tasks are both proven to be #P-complete. We further show how PEPS can be used to approximate ground states of gapped Hamiltonians, and that creating them is easier than creating arbitrary PEPS. The main tool for our proofs is a duality between PEPS and postselection which allows to use existing results from quantum compexity.
In this note, we provide a unifying framework to investigate the computational complexity of classical spin models and give the full classification on spin models in terms of system dimensions, randomness, external magnetic fields and types of spin coupling. We further discuss about the implications of NP-complete Hamiltonian models in physics and the fundamental limitations of all numerical methods imposed by such models. We conclude by a brief discussion on the picture when quantum computation and quantum complexity theory are included.
In this addendum to [arXiv:1402.5674] two points are discussed. In the first additional evidence is provided for a dual connection between the geometric length of an Einstein-Rosen bridge and the computational complexity of the quantum state of the dual CFT's. The relation between growth of complexity and Page's ``Extreme Cosmic Censorship" principle is also remarked on. The second point involves a gedanken experiment in which Alice measures a complete set of commuting observables at her end of an Einstein-Rosen bridge is discussed. An apparent paradox is resolved by appealing to the propertie…
In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations. Theoretical computer science suggests that these restrictions are not mere shortcomings of the algorithm designers and programmers but could stem from the inherent difficulty of simulating quantum systems. Extensions of computer science and information processing exploiting quantum mechanics has led to new ways of understanding the ultimate limitations of computational power. Interestingly, this perspective helps us understand widely used m…
