The complexity of stoquastic local Hamiltonian problems

zbMATH Open1192.81055arXivquant-ph/0606140MaRDI QIDQ3525296FDOQ3525296

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

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

Mathematics Subject Classification ID

Quantum computation (81P68)

Cited In (16)

• 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
• Separability and entanglement of resonating valence-bond states
• How quantum are non-negative wave functions?
• Title not available (Why is that?)
• 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
• Mind the gap: achieving a super-Grover quantum speedup by jumping to the end
• Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians
• Approximating ground and excited state energies on a quantum computer
• StoqMA meets distribution testing
• Complexity of stoquastic frustration-free Hamiltonians
• Title not available (Why is that?)

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)