Papers
Topics
Authors
Recent
Search
2000 character limit reached

QMA has perfect completeness

Published 11 Sep 2026 in quant-ph and cs.CC | (2609.13032v1)

Abstract: We prove QMA=QMA1\mathsf{QMA} = \mathsf{QMA_1}, i.e., every quantum Merlin-Arthur proof system can be made perfectly complete. Our construction uses only Hadamard, Toffoli, and XX gates, yielding a universal gate set for QMA1\mathsf{QMA_1}. As a consequence, quantum $3$-SAT is QMA\mathsf{QMA}-complete. The construction relativizes to classical oracles, so known classical-oracle separations of QMA\mathsf{QMA} from QCMA\mathsf{QCMA} extend to QMA1\mathsf{QMA_1}.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 2 tweets with 12 likes about this paper.