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