Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4.4 Corollary: controlled one-qubit gate

Open
QAlgorithms.Papers.Independent.Intakethird100.P03.controlled_qubit

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

prove2quantum

For every one-qubit unitary UUU, controlled UUU has an exact representation in the basis QQQ, with auxiliary work returned to zero:

∣c⟩∣ξ⟩∣0⟩⟼∣c⟩Uc∣ξ⟩∣0⟩.|c\rangle|\xi\rangle|0\rangle\longmapsto|c\rangle U^c|\xi\rangle|0\rangle.∣c⟩∣ξ⟩∣0⟩⟼∣c⟩Uc∣ξ⟩∣0⟩.

The equality holds linearly on the entire two-qubit input space. It retains the relative phase on the control and asserts neither a finite universal gate set nor an optimal gate count.

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.14, Corollary: exact clean controlled one-qubit synthesis in Q.
The relative phase on the control is retained, with no approximation parameter. -/
theorem controlled_qubit (U : Matrix Bool Bool ℂ)
    (hU : U ∈ Matrix.unitaryGroup Bool ℂ) :
    ∃ (w : ℕ) (c : Circuit kitaevGateBasis (2 + w)),
      ∀ v : EuclideanSpace ℂ (Qubits 2),
        act c.unitary (cleanVector w v) =
          cleanVector w (act (Gate.ofMatrix2 (controlled U)).mat v) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P03

end
Source
Quantum measurements and the Abelian Stabilizer Problem, arXiv:quant-ph/9511026v1, PDF p. 14, §2.4.4 Corollary: controlled one-qubit gate
Read-back

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

For every complex 2×22\times22×2 matrix UUU indexed by Boolean values and satisfying U†U=UU†=IU^\dagger U=UU^\dagger=IU†U=UU†=I, there exist a natural number www and a finite circuit ccc on 2+w2+w2+w qubits with the following property. Its allowed gates are all unitary one-qubit matrices, the two-qubit gate (a,b)↦(a,b⊕a)(a,b)\mapsto(a,b\mathbin{\oplus}a)(a,b)↦(a,b⊕a), and the three-qubit gate (a,b,t)↦(a,b,t⊕(a∧b))(a,b,t)\mapsto(a,b,t\mathbin{\oplus}(a\land b))(a,b,t)↦(a,b,t⊕(a∧b)); each gate acts on an injectively chosen ordered collection of wires and leaves the remaining wires unchanged. Let CCC be the product of these embedded gate matrices, with the listed gates acting in list order. Define v~w(x,a)=v(x)\widetilde v_w(x,a)=v(x)vw​(x,a)=v(x) when the www-bit string aaa is all false, and 000 otherwise. Then, for every two-qubit vector vvv, without a normalization requirement,

Cv~w=(BUv)~w,C\widetilde v_w=\widetilde{(B_Uv)}_w,Cvw​=(BU​v)​w​,

where BUB_UBU​ applies the identity to the second qubit when the first qubit is false, and applies UUU to the second qubit when the first is true. The number www may be zero.

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