2000 character limit reached
QMA has perfect completeness
Published 11 Sep 2026 in quant-ph and cs.CC | (2609.13032v1)
Abstract: We prove , i.e., every quantum Merlin-Arthur proof system can be made perfectly complete. Our construction uses only Hadamard, Toffoli, and gates, yielding a universal gate set for . As a consequence, quantum $3$-SAT is -complete. The construction relativizes to classical oracles, so known classical-oracle separations of from extend to .
Paper Prompts
Sign up for free to create and run prompts on this paper.