The Guided Local Hamiltonian problem for stoquastic Hamiltonians is promise BPP-hard (even 2-local on lattices), BQP-hard under fixed local constraints, and admits a deterministic classical approximation algorithm when promise gap, overlap, and spectral gap are constant with constant-depth local-pre
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2025 3verdicts
UNVERDICTED 3representative citing papers
The succinct state 2-local Hamiltonian problem for qubit Hamiltonians is promise-MA-complete.
The 2-local stoquastic Hamiltonian problem on 2D square qubit lattices is StoqMA-complete.
citing papers explorer
-
The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians
The Guided Local Hamiltonian problem for stoquastic Hamiltonians is promise BPP-hard (even 2-local on lattices), BQP-hard under fixed local constraints, and admits a deterministic classical approximation algorithm when promise gap, overlap, and spectral gap are constant with constant-depth local-pre
-
On the Complexity of the Succinct State Local Hamiltonian Problem
The succinct state 2-local Hamiltonian problem for qubit Hamiltonians is promise-MA-complete.
-
The Complexity of Local Stoquastic Hamiltonians on 2D Lattices
The 2-local stoquastic Hamiltonian problem on 2D square qubit lattices is StoqMA-complete.