Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The physical repetition verifier has the tensor acceptance effect

Proved
QMAPerfectCompleteness.Main.Repetition.CircuitProof.acceptanceOperator_pi

by Dorian Rudolph · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

qma-perfect-completeness-bbe19ef

Let V be a G₂ verifier and let n be any natural number. Run n copies on disjoint registers and compute the AND of their outputs with the literal reversible flag circuit. Under the proof-register regrouping bijection phi, the resulting acceptance operator is

(Erepeat⁡n(V))p,q=(⨂i=0n−1EV)ϕ(p),ϕ(q).(E_{\operatorname{repeat}_n(V)})_{p,q} =\left(\bigotimes_{i=0}^{n-1}E_V\right)_{\phi(p),\phi(q)}.(Erepeatn​(V)​)p,q​=(i=0⨂n−1​EV​)ϕ(p),ϕ(q)​.

The equality includes initialization of all copy ancillas and AND flags; n=0 uses the empty tensor product. It is an operator identity on the full proof space, so the later soundness bound applies to arbitrary entangled proofs.

Preamble
/- Generated from Solutions.RepetitionCircuit by authoritative Stage-2 skeleton subtraction.
Original explanatory text, declaration names and scoped commands are retained.
Only selected proof cuts, import rewrites and fact-indexed platform edits are applied. -/
import Definitions.Def_QMAPerfectCompleteness_Main_Cyclic
import Definitions.Def_QMAPerfectCompleteness_Main_Compiler
import Definitions.Def_QMAPerfectCompleteness_Proof_BlockEncoding
import Definitions.Def_QMAPerfectCompleteness_Proof_CircuitUnitary
import Definitions.Def_QMAPerfectCompleteness_Proof_ControlCircuits
import Definitions.Def_QMAPerfectCompleteness_Proof_Cyclic
import Definitions.Def_QMAPerfectCompleteness_Proof_EuclideanStates
import Definitions.Def_QMAPerfectCompleteness_Proof_Repetition
import Definitions.Def_QMAPerfectCompleteness_Proof_RepetitionCircuit
import Definitions.Def_QMAPerfectCompleteness_Proof_ReversibleGadgets

/- Namespace registrations retained from original proof-only imports. -/
namespace QMAPerfectCompleteness.Main.DiagonalProof
end QMAPerfectCompleteness.Main.DiagonalProof



open Matrix
open scoped Kronecker ComplexOrder

set_option backward.isDefEq.respectTransparency false
namespace QMAPerfectCompleteness.Main.Repetition.CircuitProof
end QMAPerfectCompleteness.Main.Repetition.CircuitProof
section
open QMAPerfectCompleteness QMAPerfectCompleteness.Main QMAPerfectCompleteness.Main.Repetition QMAPerfectCompleteness.Main.Repetition.CircuitProof
open Circuit ReversibleGadgets VerifierAnalysis








































/-! Generic finite tensor matrices on function-indexed copy registers. -/

































































Formal statement

theorem QMAPerfectCompleteness.Main.Repetition.CircuitProof.acceptanceOperator_pi (V : Verifier gatesG2) (n : ℕ) :
    (Circuit.verifier V n).acceptanceOperator =
      (piMatrix (fun _ : Fin n => V.acceptanceOperator)).submatrix (proofEquiv V n) (proofEquiv V n) := by sorry
Source
Auxiliary formalization source: commit bbe19efbde567e5c8f7fe21655fd0c4da3573e4d, Solutions/RepetitionCircuit.lean:497–524. Paper context: Sabee Grewal and Dorian Rudolph, QMA has perfect completeness, user-provided main.tex. Auxiliary literal-circuit realization of the tensor acceptance effect used for constant-gap amplification in the proof of Theorem 1.1.

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