The complexity of stoquastic local Hamiltonian problems

MaRDI QIDQ3525296zbMATH OpenFDO

Authors Sergey Bravyi, David P. DiVincenzo, Barbara M. Terhal, Roberto I. Oliveira

Publication date 12 September 2008

Full work available at URL https://arxiv.org/abs/quant-ph/0606140

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Complexity of stoquastic frustration-free Hamiltonians
• The Complexity of the Local Hamiltonian Problem
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Complexity classification of local Hamiltonian problems
• On complexity of the quantum Ising model

Cited in

(16)

• scientific article; zbMATH DE number 5568625 (Why is no real title available?)
• Permutation matrix representation quantum Monte Carlo
• Complexity of commuting Hamiltonians on a square lattice of qubits
• Generalized phase-space techniques to explore quantum phase transitions in critical quantum spin systems
• How quantum are non-negative wave functions?
• Separability and entanglement of resonating valence-bond states
• scientific article; zbMATH DE number 6351479 (Why is no real title available?)
• Complexity classification of local Hamiltonian problems
• On complexity of the quantum Ising model
• Bounding quantum gate error rate based on reported average fidelity
• Universal computation with quantum fields
• Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians
• Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
• Approximating ground and excited state energies on a quantum computer
• StoqMA meets distribution testing
• Complexity of stoquastic frustration-free Hamiltonians

This page was built for publication: The complexity of stoquastic local Hamiltonian problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525296)