Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2: one-qubit gate teleportation

Proved
QAlgorithms.Papers.Independent.Intakenext100.P52.one_qubit_gate_teleportation

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let UUU be any one-qubit unitary, and write ∣Bcd⟩=(ZcXd⊗I)∣ϕ2⟩|B_{cd}\rangle=(Z^cX^d\otimes I)|\phi_2\rangle∣Bcd​⟩=(ZcXd⊗I)∣ϕ2​⟩ for bits c,dc,dc,d, where ∣ϕ2⟩=(∣00⟩+∣11⟩)/2|\phi_2\rangle=(|00\rangle+|11\rangle)/\sqrt2∣ϕ2​⟩=(∣00⟩+∣11⟩)/2​. The four kets ∣B(U)cd⟩=(U†⊗I)∣Bcd⟩|B(U)_{cd}\rangle=(U^\dagger\otimes I)|B_{cd}\rangle∣B(U)cd​⟩=(U†⊗I)∣Bcd​⟩ are orthonormal. For every normalized input ∣ψ⟩|\psi\rangle∣ψ⟩, measuring registers 1,21,21,2 against one of these kets, with resource ∣ϕ2⟩23|\phi_2\rangle_{23}∣ϕ2​⟩23​, gives

∣bcd⟩=12XdZcU∣ψ⟩,Pr⁡(c,d)=∥bcd∥2=14.|b_{cd}\rangle=\frac12 X^dZ^cU|\psi\rangle,\qquad \Pr(c,d)=\|b_{cd}\|^2=\frac14.∣bcd​⟩=21​XdZcU∣ψ⟩,Pr(c,d)=∥bcd​∥2=41​.

Thus 2∣bcd⟩2|b_{cd}\rangle2∣bcd​⟩ is the conditional output. The choice U=IU=IU=I includes ordinary teleportation with the same labels.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P52
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Intakenext100.P52

open QAlgorithms.Papers.Independent.Information100.P21 (Vec)

open QAlgorithms.Papers.Independent.Gap20.P01 (applyRect)

/-- Rotated Bell gate teleportation, PDF pp.2–4, including U=I as Fig.1.
All four measured kets are orthonormal; branches retain their coefficient 1/2. -/
theorem one_qubit_gate_teleportation (U : Matrix Bool Bool ℂ)
    (hU : U ∈ Matrix.unitaryGroup Bool ℂ) :
    Orthonormal ℂ (fun p : QubitPair => rotatedBell U p.1 p.2) ∧
    ∀ (psi : Vec Bool), IsState psi → ∀ c d : Bool,
      let b := teleportContraction psi (finiteMaxEntangled Bool) (rotatedBell U c d)
      b = (1 / 2 : ℂ) • act (pauliByproduct d c * U) psi ∧
      ‖b‖ ^ 2 = (1 / 4 : ℝ) ∧ (2 : ℂ) • b = act (pauliByproduct d c * U) psi := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P52

end
Source
An introduction to measurement based quantum computation, arXiv:quant-ph/0508124v2, PDF p. 2, §2: one-qubit gate teleportation
Read-back

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

For every unitary complex matrix UUU indexed by Booleans, write Ω=(∣00⟩+∣11⟩)/2\Omega=(|00\rangle+|11\rangle)/\sqrt2Ω=(∣00⟩+∣11⟩)/2​, X=(0110)X=\begin{pmatrix}0&1\\1&0\end{pmatrix}X=(01​10​), and Z=diag⁡(1,−1)Z=\operatorname{diag}(1,-1)Z=diag(1,−1), where false and true are denoted by 000 and 111, and ∣ij⟩|ij\rangle∣ij⟩ is the coordinate unit vector at (i,j)(i,j)(i,j). The four vectors

Bc,dU=(U†⊗I2)(ZcXd⊗I2)Ω,c,d∈{0,1},B^U_{c,d}=(U^\dagger\otimes I_2)(Z^cX^d\otimes I_2)\Omega, \qquad c,d\in\{0,1\},Bc,dU​=(U†⊗I2​)(ZcXd⊗I2​)Ω,c,d∈{0,1},

are orthonormal. Moreover, for every ψ∈C{0,1}\psi\in\mathbb C^{\{0,1\}}ψ∈C{0,1} with Euclidean norm 111 and every pair of Boolean values c,dc,dc,d, define bbb by bℓ=∑i,j∈{0,1}Bc,dU(i,j)‾ ψi Ω(j,ℓ)b_\ell=\sum_{i,j\in\{0,1\}}\overline{B^U_{c,d}(i,j)}\,\psi_i\,\Omega(j,\ell)bℓ​=∑i,j∈{0,1}​Bc,dU​(i,j)​ψi​Ω(j,ℓ). Then

b=12XdZcUψ,∥b∥2=14,2b=XdZcUψ.b=\frac12X^dZ^cU\psi, \qquad \|b\|^2=\frac14, \qquad 2b=X^dZ^cU\psi.b=21​XdZcUψ,∥b∥2=41​,2b=XdZcUψ.
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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