Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1 — QMA=QMA1HT\mathrm{QMA}=\mathrm{QMA}_1^{HT}QMA=QMA1HT​

Proved
QMAPerfectCompleteness.Main.qma_eq_qma1_hadamard_toffoli

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1perfect-completenessqmaquantum-complexity

Every quantum Merlin–Arthur proof system can be made perfectly complete using only Hadamard and Toffoli gates:

QMA=QMA1HT,HT={H,Toffoli}.\mathrm{QMA}=\mathrm{QMA}_1^{HT},\qquad HT=\{H,\mathrm{Toffoli}\}.QMA=QMA1HT​,HT={H,Toffoli}.

This is an equality of classes of binary promise problems. Here QMA has completeness 2/32/32/3 and soundness 1/31/31/3 over a universal gate set. A problem lies in QMA1HT\mathrm{QMA}_1^{HT}QMA1HT​ if a polynomial-time algorithm maps each input to a verifier over HHH and Toffoli such that on YES inputs some proof, an arbitrary complex density matrix on polynomially many qubits, is accepted with probability exactly 111, and on NO inputs every proof is accepted with probability at most 1/21/21/2.

The theorem resolves the question, open since Bravyi introduced QMA1\mathrm{QMA}_1QMA1​, of whether perfect completeness changes the power of QMA. It also shows that HTHTHT is universal for QMA1\mathrm{QMA}_1QMA1​, a question for which approximate synthesis gives no answer because approximating a gate can lower an acceptance probability of one.

Differences from the source:

  • encoding: QMA is QMAG(2/3,1/3)\mathrm{QMA}_{\mathcal G}(2/3,1/3)QMAG​(2/3,1/3) for any universal gate set G\mathcal GG, well defined by Solovay-Kitaev and amplification → the fixed gate set {H,Λ(P)}\{H,\Lambda(P)\}{H,Λ(P)}; reason: it is the universal set the source's proof of Lemma 3.1 starts from, and the source states that the choice does not matter
  • encoding: a polynomial-time algorithm maps xxx to a verifier VxV_xVx​ → a multi-stack machine (Turing.TM2ComputableInPolyTime) outputs a self-delimiting code of VxV_xVx​ with every number in unary; gate sets are lists of exact unitary matrices, without the approximability clause of §2; reason: all numbers in a polynomial-size circuit are polynomially bounded, so unary and binary codes define the same class, and the three gate sets used here have explicitly computable entries
Preamble
import Definitions.Def_QMAPerfectCompleteness_Main_Compiler

open Matrix
Formal statement
namespace QMAPerfectCompleteness.Main

/-- Theorem 1.1 (p. 2; proof p. 11): `QMA = QMA₁^{HT}`, as classes of promise problems. -/
theorem qma_eq_qma1_hadamard_toffoli : QMA = QMA1 gatesHT := by sorry

end QMAPerfectCompleteness.Main
Source
Sabee Grewal, Dorian Rudolph, QMA has perfect completeness, STOC 2027 submission #490 (October 2026), p. 2, Theorem 1.1; proof p. 11; Definition 2.1, p. 6
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me