StoqMA(2) contains NP with Õ(√n)-qubit proofs and completeness error 2^{-polylog(n)}, is contained in EXP, and satisfies StoqMA(k)=StoqMA(2) for k≥2 when completeness error is negligible.
Oracle separation of BQP and PH
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Stochastic Commutator Synthesis integrates sub-cubic Solovay-Kitaev with Gibbs-sampled commutator selection and randomized compilation to cut T-counts by 10-25% and raise fidelity by up to 35% on Forrelation circuits.
citing papers explorer
-
Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
StoqMA(2) contains NP with Õ(√n)-qubit proofs and completeness error 2^{-polylog(n)}, is contained in EXP, and satisfies StoqMA(k)=StoqMA(2) for k≥2 when completeness error is negligible.
-
Sub-Cubic Quantum Gate Synthesis via Stochastic Commutator Decomposition
Stochastic Commutator Synthesis integrates sub-cubic Solovay-Kitaev with Gibbs-sampled commutator selection and randomized compilation to cut T-counts by 10-25% and raise fidelity by up to 35% on Forrelation circuits.