Stoquastic Sparse Hamiltonians is StoqMA-complete and its separable version is StoqMA(2)-complete.
and Chuang, Isaac L
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Symmetry counting of error configurations yields closed-form approximations for logical error rates in surface codes.
Quantum algorithms reduce magic-square Diophantine detection to period finding via QFT and shifted oracles for structured solutions.
citing papers explorer
-
The Complexity of Stoquastic Sparse Hamiltonians
Stoquastic Sparse Hamiltonians is StoqMA-complete and its separable version is StoqMA(2)-complete.
-
Closed form logical error rate approximations for surface codes
Symmetry counting of error configurations yields closed-form approximations for logical error rates in surface codes.
-
Quantum Algorithms for Magic Square Diophantine Equations
Quantum algorithms reduce magic-square Diophantine detection to period finding via QFT and shifted oracles for structured solutions.