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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A framework using reverse detection-estimation gaps proves that low-degree algorithms incur at least p^{d/4-1/2}/polylog(p) distortion when approximating the spectral norm of order-d symmetric tensors, matching upper bounds up to logs under the low-degree conjecture.
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.
-
A Framework for Computational Lower Bounds in Nontrivial Norm Approximation
A framework using reverse detection-estimation gaps proves that low-degree algorithms incur at least p^{d/4-1/2}/polylog(p) distortion when approximating the spectral norm of order-d symmetric tensors, matching upper bounds up to logs under the low-degree conjecture.