StoqMa(k) equals StoqMa for any polynomial k via a positive value-based de Finetti theorem that approximates nonnegative product values with symmetric extensions.
New bounds for matching vector families
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Polynomial-time algorithms for the Polynomial Freiman-Ruzsa theorem and equivalent formulations over F_2^n, based on an optimized quadratic Goldreich-Levin procedure.
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.
citing papers explorer
-
The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
StoqMa(k) equals StoqMa for any polynomial k via a positive value-based de Finetti theorem that approximates nonnegative product values with symmetric extensions.
-
An algorithmic Polynomial Freiman-Ruzsa theorem
Polynomial-time algorithms for the Polynomial Freiman-Ruzsa theorem and equivalent formulations over F_2^n, based on an optimized quadratic Goldreich-Levin procedure.
-
An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.