StoqMA(2) contains NP via Õ(√n)-qubit unentangled stoquastic proofs (nearly perfect completeness) and is contained in EXP, with ETH-optimal parameters matching a refined BKS Sum-of-Squares bound.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
roles
method 1polarities
use method 1representative citing papers
Stoquastic Sparse Hamiltonians is StoqMA-complete and its separable version is StoqMA(2)-complete.
RFOX maintains a flat spectral gap via non-stoquastic XX catalyst plus analytic counter-diabatic ZX driving, yielding near-optimal solutions on random-field Ising models with up to 10x fewer Trotter steps.
The 2-local stoquastic Hamiltonian problem on 2D square qubit lattices is StoqMA-complete.
citing papers explorer
-
The power of unentanglement without destructive interference
StoqMA(2) contains NP via Õ(√n)-qubit unentangled stoquastic proofs (nearly perfect completeness) and is contained in EXP, with ETH-optimal parameters matching a refined BKS Sum-of-Squares bound.
-
The Complexity of Stoquastic Sparse Hamiltonians
Stoquastic Sparse Hamiltonians is StoqMA-complete and its separable version is StoqMA(2)-complete.
-
RFOX (Rotated-Field Oscillatory eXchange) quantum algorithm: Towards Parameter-Free Quantum Optimizers
RFOX maintains a flat spectral gap via non-stoquastic XX catalyst plus analytic counter-diabatic ZX driving, yielding near-optimal solutions on random-field Ising models with up to 10x fewer Trotter steps.
-
The Complexity of Local Stoquastic Hamiltonians on 2D Lattices
The 2-local stoquastic Hamiltonian problem on 2D square qubit lattices is StoqMA-complete.