Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5 Figures 6–7: elementary one-bit teleportation

Proved
QAlgorithms.Papers.Independent.Intakenext100.P52.one_bit_teleportation

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

prove2quantum

Let ∣ψ⟩|\psi\rangle∣ψ⟩ be a normalized input, adjoin ∣+⟩|+\rangle∣+⟩, apply CZCZCZ, and destructively measure the first site in the ordered basis M(θ)={(∣0⟩+(−1)seiθ∣1⟩)/2:s=0,1}M(\theta)=\{(|0\rangle+(-1)^s e^{i\theta}|1\rangle)/\sqrt2:s=0,1\}M(θ)={(∣0⟩+(−1)seiθ∣1⟩)/2​:s=0,1}. With W(θ)=Hdiag⁡(1,eiθ)W(\theta)=H\operatorname{diag}(1,e^{i\theta})W(θ)=Hdiag(1,eiθ), the surviving branch is

∣bs⟩=12XsW(−θ)∣ψ⟩,Pr⁡(s)=12.|b_s\rangle=\frac1{\sqrt2}X^sW(-\theta)|\psi\rangle,\qquad\Pr(s)=\frac12.∣bs​⟩=2​1​XsW(−θ)∣ψ⟩,Pr(s)=21​.

For θ=0\theta=0θ=0 this is XsH∣ψ⟩/2X^sH|\psi\rangle/\sqrt2XsH∣ψ⟩/2​. A three-site line with two XXX measurements has branch Xs2Zs1∣ψ⟩/2X^{s_2}Z^{s_1}|\psi\rangle/2Xs2​Zs1​∣ψ⟩/2. These are the elementary normalized-resource primitives for the cluster constructions.

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)

/-- Figures 6–7, PDF pp.9–10: negative angle and branch normalization retained.
The two X-measurement chain is included in source Pauli order X^(s2) Z^(s1). -/
theorem one_bit_teleportation (psi : Vec Bool) (hpsi : IsState psi) :
    (∀ theta : ℝ, ∀ s : Bool,
      let b := lineBranch 1 (fun _ => theta) (fun _ => s) psi
      b = ((Real.sqrt 2)⁻¹ : ℂ) • act (pauliX ^ s.toNat * wGate (-theta)) psi ∧
      ‖b‖ ^ 2 = (1 / 2 : ℝ)) ∧
    (∀ s : Bool, lineBranch 1 (fun _ => 0) (fun _ => s) psi =
      ((Real.sqrt 2)⁻¹ : ℂ) • act (pauliX ^ s.toNat * hadamard) psi) ∧
    (∀ s : Fin 2 → Bool, lineBranch 2 (fun _ => 0) s psi =
      (1 / 2 : ℂ) • act (pauliByproduct (s 1) (s 0)) psi) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P52

end
Source
An introduction to measurement based quantum computation, arXiv:quant-ph/0508124v2, PDF p. 9, §5 Figures 6–7: elementary one-bit teleportation
Read-back

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

For every vector ψ∈C{0,1}\psi\in\mathbb C^{\{0,1\}}ψ∈C{0,1} with Euclidean norm 111, the following three assertions hold. To specify the branch vectors literally, for kkk angles αi\alpha_iαi​ and outcomes si∈{0,1}s_i\in\{0,1\}si​∈{0,1}, define their amplitude at y∈{0,1}y\in\{0,1\}y∈{0,1} by Bk(α,s;ψ)(y)=2−k∑z∈{0,1}k+1zk=yψ(z0)(−1)∑i=0k−1zizi+1+∑i=0k−1siziexp⁡ ⁣(−i∑i=0k−1αizi)\displaystyle B_k(\alpha,s;\psi)(y)=2^{-k}\sum_{\substack{z\in\{0,1\}^{k+1}\\z_k=y}}\psi(z_0)(-1)^{\sum_{i=0}^{k-1}z_i z_{i+1}+\sum_{i=0}^{k-1}s_i z_i}\exp\!\left(-\mathrm i\sum_{i=0}^{k-1}\alpha_i z_i\right)Bk​(α,s;ψ)(y)=2−kz∈{0,1}k+1zk​=y​∑​ψ(z0​)(−1)∑i=0k−1​zi​zi+1​+∑i=0k−1​si​zi​exp(−ii=0∑k−1​αi​zi​). Write H=2−1/2(111−1)H=2^{-1/2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=2−1/2(11​1−1​), 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). For every real θ\thetaθ and Boolean sss, B1((θ),(s);ψ)=2−1/2XsHdiag⁡(1,e−iθ)ψ\displaystyle B_1((\theta),(s);\psi)=2^{-1/2}X^sH\operatorname{diag}(1,e^{-\mathrm i\theta})\psiB1​((θ),(s);ψ)=2−1/2XsHdiag(1,e−iθ)ψ and its squared norm is 1/21/21/2. For every Boolean sss, B1((0),(s);ψ)=2−1/2XsHψ\displaystyle B_1((0),(s);\psi)=2^{-1/2}X^sH\psiB1​((0),(s);ψ)=2−1/2XsHψ. Finally, for every pair of Boolean outcomes s0,s1s_0,s_1s0​,s1​, B2((0,0),s;ψ)=12Xs1Zs0ψ\displaystyle B_2((0,0),s;\psi)=\tfrac12X^{s_1}Z^{s_0}\psiB2​((0,0),s;ψ)=21​Xs1​Zs0​ψ.

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