Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper establishes the equality between QMA and QMA₁, proving that every quantum Merlin-Arthur proof system can be made perfectly complete using a restricted universal gate set of Hadamard, Toffoli, and X gates. The result confirms that quantum 3-SAT is QMA-complete and extends known classical-oracle separations to the perfect-completeness setting.
Sources coveringarXiv, AI Alignment Forum, Fortune, Quantum Computing Report
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

QMA has perfect completeness

arXiv1 min read

arXiv:2609.13032v1 Announce Type: new Abstract: We prove $\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 $X$ gates, yielding a universal gate set for $\mathsf{QMA_1}$. As a consequence, quantum $3$-SAT is $\mathsf{QMA}$-complete. The construction relativizes to classical oracles, so known classical-oracle separations of $\mathsf{QMA}$ from $\mathsf{QCMA}$ extend to $\mathsf{QMA_1}$.

Abstract:We prove $\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 $X$ gates, yielding a universal gate set for $\mathsf{QMA_1}$. As a consequence, quantum $3$-SAT is $\mathsf{QMA}$-complete. The construction relativizes to classical oracles, so known classical-oracle separations of $\mathsf{QMA}$ from $\mathsf{QCMA}$ extend to $\mathsf{QMA_1}$.

Quantum Physics (quant-ph); Computational Complexity (cs.CC)

arXiv:2609.13032 [quant-ph]

(or arXiv:2609.13032v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.13032 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 153 words

Related coverage