The complexity of stoquastic local Hamiltonian problems

  title={The complexity of stoquastic local Hamiltonian problems},
  author={Sergey Bravyi and David P. DiVincenzo and Roberto Oliveira and Barbara M. Terhal},
  journal={Quantum Information & Computation},
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… CONTINUE READING
Highly Cited
This paper has 113 citations. REVIEW CITATIONS


Publications citing this paper.

114 Citations

Citations per Year
Semantic Scholar estimates that this publication has 114 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 30 references

Trading Group Theory for Randomness

STOC • 1985
View 3 Excerpts
Highly Influenced


A. Bessen
Bravyi and B.M. Terhal. Merlin-Arthur Games and Stoquastic Complexity • 2006
View 2 Excerpts

Quantum Computing, Postselection, and Probabilistic Polynomial-Time

Electronic Colloquium on Computational Complexity • 2005
View 1 Excerpt


D. Aharonov
van Dam, Z. Landau, S. Lloyd, J. Kempe, and O. Regev. Universality of Adiabatic Quantum Computation. In Proceedings of 45th FOCS, • 2004
View 2 Excerpts

Similar Papers

Loading similar papers…