Stoquastic Sparse Hamiltonians is StoqMA-complete and its separable version is StoqMA(2)-complete.
The Complexity of the Local Hamiltonian Problem
4 Pith papers cite this work, alongside 423 external citations. Polarity classification is still indexing.
4
Pith papers citing it
423
external citations · Crossref
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Quantum Gibbs samplers thermalize to Gibbs states in polynomial time at high temperatures for Lieb-Robinson bounded Hamiltonians and are BQP-complete at low temperatures via circuit-to-Hamiltonian reductions.
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.
A review of how quantum information science is expected to provide new tools and insights for nuclear and high-energy physics phenomenology and quantum simulations.
citing papers explorer
-
The Complexity of Stoquastic Sparse Hamiltonians
Stoquastic Sparse Hamiltonians is StoqMA-complete and its separable version is StoqMA(2)-complete.
-
Efficient thermalization and universal quantum computing with quantum Gibbs samplers
Quantum Gibbs samplers thermalize to Gibbs states in polynomial time at high temperatures for Lieb-Robinson bounded Hamiltonians and are BQP-complete at low temperatures via circuit-to-Hamiltonian reductions.
-
An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.
-
Quantum Complexity and New Directions in Nuclear Physics and High-Energy Physics Phenomenology
A review of how quantum information science is expected to provide new tools and insights for nuclear and high-energy physics phenomenology and quantum simulations.