Related papers: Complexity classification of local Hamiltonian pro…
We study the complexity of finding the ground state energy density of a local Hamiltonian on a lattice in the thermodynamic limit of infinite lattice size. We formulate this rigorously as a function problem, in which we request an estimate…
Quantum satisfiability is a constraint satisfaction problem that generalizes classical boolean satisfiability. In the quantum k-SAT problem, each constraint is specified by a k-local projector and is satisfied by any state in its nullspace.…
Understanding the mechanisms responsible for the equilibration of isolated quantum many-body systems is a long-standing open problem. In this work we obtain a statistical relationship between the equilibration properties of Hamiltonians and…
We study the complexity of local search for the Boolean constraint satisfaction problem (CSP), in the following form: given a CSP instance, that is, a collection of constraints, and a solution to it, the question is whether there is a…
Schroedinger equation on a Hilbert space ${\cal H}$, represents a linear Hamiltonian dynamical system on the space of quantum pure states, the projective Hilbert space $P {\cal H}$. Separable states of a bipartite quantum system form a…
In this note we present two natural restrictions of the local Hamiltonian problem which are BQP-complete under Karp reduction. Restrictions complete for QCMA, QMA_1, and MA were demonstrated previously.
Quantum Hamiltonians that are fine-tuned to their so-called Rokhsar-Kivelson (RK) points, first presented in the context of quantum dimer models, are defined by their representations in preferred bases in which their ground state wave…
The $k$-local Hamiltonian problem is a central model for quantum many-body systems and Hamiltonian complexity. Semidefinite programming and noncommutative sum-of-squares hierarchies provide systematic certificates for ground-state energies,…
We present two complementary approaches for determining the reference for the covariant Hamiltonian boundary term quasi-local energy and test them on spherically symmetric spacetimes. On the one hand, we isometrically match the 2-surface…
We define predictive states and predictive complexity for quantum systems composed of distinct subsystems. This complexity is a generalization of entanglement entropy. It is inspired by the statistical or forecasting complexity of…
The concept of energy-dependent forces in quantum mechanics is re-analysed. We suggest a simplification of their study via the representation of each self-adjoint and energy-dependent Hamiltonian H=H(E) with real spectrum by an auxiliary…
The Local Hamiltonian problem is the problem of estimating the least eigenvalue of a local Hamiltonian, and is complete for the class QMA. The 1D problem on a chain of qubits has heuristics which work well, while the 13-state qudit case has…
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…
In this work, we study the problems of certifying and learning quantum $k$-local Hamiltonians, for a constant $k$. Our main contributions are as follows: - Certification of Hamiltonians. We show that certifying a local Hamiltonian in…
The complexity of the commuting local Hamiltonians (CLH) problem still remains a mystery after two decades of research of quantum Hamiltonian complexity; it is only known to be contained in NP for few low parameters. Of particular interest…
Essential to the description of a quantum system are its local degrees of freedom, which enable the interpretation of subsystems and dynamics in the Hilbert space. While a choice of local tensor factorization of the Hilbert space is often…
We study a simple and exactly solvable model for the generation of random satisfiability problems. These consist of $\gamma N$ random boolean constraints which are to be satisfied simultaneously by $N$ logical variables. In…
The computational complexity of simulating the dynamics of physical quantum systems is a central question at the interface of quantum physics and computer science. In this work, we address this question for the simulation of exponentially…
The solution space of many classical optimization problems breaks up into clusters which are extensively distant from one another in the Hamming metric. Here, we show that an analogous quantum clustering phenomenon takes place in the ground…
The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k>=3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been…