相关论文: Quantum NP - A Survey

Ohya and Volovich have been proposed a new quantum computation model with chaos amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper we study the complexity of the SAT algorithm by counting the…

The Kitaev honeycomb model is a paradigm of exactly-solvable models, showing non-trivial physical properties such as topological quantum order, abelian and non-abelian anyons, and chirality. Its solution is one of the most beautiful…

We show that finding the lowest eigenvalue of a 3-local symmetric stochastic matrix is QMA-complete. We also show that finding the highest energy of a stoquastic Hamiltonian is QMA-complete and that adiabatic quantum computation using…

The first of the two related papers analising and explaining the origin, manifestations and parodoxical features of the quantum potential (QP) from the non-relativistic and relativistic point of view. QP arises in the quantum Hamiltonian,…

We show that there exists a universal quantum Turing machine (UQTM) that can simulate every other QTM until the other QTM has halted and then halt itself with probability one. This extends work by Bernstein and Vazirani who have shown that…

In this review we give a brief overview of quantum simulation as applied to the study of complex systems. In particular, we cover the basic ideas of quantum simulation, neuromorphic computation, the Sachdev-Ye-Kitaev model, as well as…

The problem 2-quantum-satisfiability (2-QSAT) is the generalisation of the 2-CNF-SAT problem to quantum bits, and is equivalent to determining whether or not a spin-1/2 Hamiltonian with two-body terms is frustration-free. Similarly to the…

We study the complexity of QMA proof systems with inverse exponentially small promise gap. We show that this class can be exactly characterized by PSPACE, the class of problems solvable with a polynomial amount of memory. As applications we…

Robin Hirsch posed in 1996 the 'Really Big Complexity Problem': classify the computational complexity of the network satisfaction problem for all finite relation algebras A. We provide a complete classification for the case that A is…

We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we show hardness of a classical tiling problem on an N x N…

We generalize a theorem of Kapranov by showing that the Hall algebra of the category of coherent sheaves on a weighted projective line (over a finite field) provides a realization of the (quantized) enveloping algebra of a certain nilpotent…

Star products on the classical double group of a simple Lie group and on corresponding symplectic grupoids are given so that the quantum double and the "quantized tangent bundle" are obtained in the deformation description. "Complex"…

The topical quantum computation paradigm is a transposition of the Turing machine into the quantum framework. Implementations based on this paradigm have limitations as to the number of: qubits, computation steps, efficient quantum…

I construct lowest-energy representations of non-centrally extended algebras of Noether symmetries, including diffeomorphisms and reparametrizations of the observer's trajectory. This may be viewed as a new scheme for quantization. First…

The problem 2-LOCAL HAMILTONIAN has been shown to be complete for the quantum computational class QMA, see quant-ph/0406180. In this paper we show that this important problem remains QMA-complete when the interactions of the 2-local…

We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the…

A long-standing open problem in quantum complexity theory is whether ${\sf QMA}$, the quantum analogue of ${\sf NP}$, is equal to ${\sf QMA}_1$, its one-sided error variant. We show that ${\sf QMA}={\sf QMA}^{\infty}= {\sf QMA}_1^{\infty}$,…

In analogy of classical Kolmogorov complexity we develop a theory of the algorithmic information in bits contained in any one of continuously many pure quantum states: quantum Kolmogorov complexity. Classical Kolmogorov complexity coincides…

We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with…

In this second part of the `essay on the completion of quantum theory' we define the {\em unitary setting of completed quantum mechanics}, by adding as intrinsic data to those from Part I (arXiv:1711.08643) the choice of a north pole N and…