Matrix analysis
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Threshold Computation and Cryptographic Security
SIAM Journal on Computing
Adiabatic quantum state generation and statistical zero knowledge
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Succinct quantum proofs for properties of finite groups
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Classical and Quantum Computation
Classical and Quantum Computation
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The Complexity of the Local Hamiltonian Problem
SIAM Journal on Computing
The complexity of quantum spin systems on a two-dimensional square lattice
Quantum Information & Computation
Complexity of Stoquastic Frustration-Free Hamiltonians
SIAM Journal on Computing
Locality bounds on hamiltonians for stabilizer codes
Quantum Information & Computation
Measuring 4-local qubit observables could probabilistically solve PSPACE
Quantum Information & Computation
Complexity of commuting Hamiltonians on a square lattice of qubits
Quantum Information & Computation
| Hi-index | 0.00 |
We study the complexity of the Local Hamiltonian Problem (denoted as LH-MIN) in the special case when a Hamiltonian obeys the condition that all off-diagonal matrix elements in the standard basis are real and non-positive. We will call such Hamiltonians, which are common in the natural world, stoquastic. An equivalent characterization of stoquastic Hamiltonians is that they have an entry-wise non-negative Gibbs density matrix for any temperature. We prove that LH-MIN for stoquastic Hamiltonians belongs to the complexity class AM -- a probabilistic version of NP with two rounds of communication between the prover and the verifier. We also show that 2-local stoquastic LH-MIN is hard for the class MA. With the additional promise of having a polynomial spectral gap, we show that stoquastic LH-MIN belongs to the class PostBPP=BPPpath--a generalization of BPP in which a post-selective readout is allowed. This last result also shows that any problem solved by adiabatic quantum computation using stoquastic Hamiltonians is in PostBPP.