Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.2 Corollaries, item 2 and the R basis

Open
QAlgorithms.Papers.Independent.Intakethird100.P03.reversible_completeness

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N,M⊆{0,1}nN,M\subseteq\{0,1\}^nN,M⊆{0,1}n, and let G:N→MG:N\to MG:N→M be a bijection. Each of the bases CτC_\tauCτ​ and R={NOT,CNOT,Toffoli}R=\{\mathrm{NOT},\mathrm{CNOT},\mathrm{Toffoli}\}R={NOT,CNOT,Toffoli} admits an exact finite operation sequence satisfying

∣x,0⟩⟼∣G(x),0⟩(x∈N).|x,0\rangle\longmapsto |G(x),0\rangle\qquad(x\in N).∣x,0⟩⟼∣G(x),0⟩(x∈N).

Here CτC_\tauCτ​ consists of the XOR lifts of NOT and AND together with CNOT. There is no efficiency claim for an arbitrary bijection.

This supplies the source's clean reversible completeness in both stated bases.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate Kronecker

namespace QAlgorithms.Papers.Independent.Intakethird100.P03

open QAlgorithms.Papers.Independent.Renew46.P01 (cleanVector)

attribute [local instance] Classical.propDecidable

/-- PDF p.8, Corollary 2 and the next paragraph: exact clean representation of every
partial bijection in both C_tau and R. No efficiency bound is claimed. -/
theorem reversible_completeness (n : ℕ) (N M : Set (Qubits n)) (e : N ≃ M) :
    (∃ (w : ℕ) (c : Circuit cTauBasis (n + w)), ∀ x : N,
      act c.unitary (inputState x.val w) = inputState (e x).val w) ∧
    (∃ (w : ℕ) (c : Circuit rBasis (n + w)), ∀ x : N,
      act c.unitary (inputState x.val w) = inputState (e x).val w) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P03

end
Source
Quantum measurements and the Abelian Stabilizer Problem, arXiv:quant-ph/9511026v1, PDF p. 8, §2.2 Corollaries, item 2 and the R basis
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number nnn, every pair of subsets N,M⊆{0,1}nN,M\subseteq\{0,1\}^nN,M⊆{0,1}n, and every bijection e:N→Me:N\to Me:N→M, both of the following existence statements hold: there are a natural number www and a circuit on n+wn+wn+w bits using only the gates (a,b)↦(a,b⊕¬a)(a,b)\mapsto(a,b\mathbin{\oplus}\neg a)(a,b)↦(a,b⊕¬a), (a,b,c)↦(a,b,c⊕(a∧b))(a,b,c)\mapsto(a,b,c\mathbin{\oplus}(a\land b))(a,b,c)↦(a,b,c⊕(a∧b)), and (a,b)↦(a,b⊕a)(a,b)\mapsto(a,b\mathbin{\oplus}a)(a,b)↦(a,b⊕a), which sends ∣x,0w⟩|x,0^w\rangle∣x,0w⟩ exactly to ∣e(x),0w⟩|e(x),0^w\rangle∣e(x),0w⟩ for every x∈Nx\in Nx∈N; and there are a possibly different natural number www and circuit with the same input-output property using only the gates a↦¬aa\mapsto\neg aa↦¬a, controlled-NOT, and (a,b,c)↦(a,b,c⊕(a∧b))(a,b,c)\mapsto(a,b,c\mathbin{\oplus}(a\land b))(a,b,c)↦(a,b,c⊕(a∧b)). Here each gate acts on an injectively chosen ordered collection of wires and leaves the remaining wires unchanged, circuit gates are applied in list order, and ∣x,0w⟩|x,0^w\rangle∣x,0w⟩ denotes the coordinate vector at xxx followed by www false bits. No gate-count or ancilla-count bound is asserted, and no behavior is prescribed for inputs outside NNN. The statement includes n=0n=0n=0; when NNN is empty, the required input-output conditions are vacuous.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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