Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7: uniform CZ one-bit decomposition of teleportation

Proved
QAlgorithms.Papers.Independent.Intakenext100.P52.h_bond_teleportation_two_one_bit_steps

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

prove2quantum

Let ∣H⟩=CZ∣++⟩|H\rangle=CZ|++\rangle∣H⟩=CZ∣++⟩ and ∣hcd⟩=(XdZc⊗I)∣H⟩|h_{cd}\rangle=(X^dZ^c\otimes I)|H\rangle∣hcd​⟩=(XdZc⊗I)∣H⟩. These four kets are orthonormal, and CZ∣hcd⟩CZ|h_{cd}\rangleCZ∣hcd​⟩ has the same density as ∣xc⟩∣xd⟩|x_c\rangle|x_d\rangle∣xc​⟩∣xd​⟩, where ∣xs⟩=(∣0⟩+(−1)s∣1⟩)/2|x_s\rangle=(|0\rangle+(-1)^s|1\rangle)/\sqrt2∣xs​⟩=(∣0⟩+(−1)s∣1⟩)/2​. For every normalized input, teleportation using resource ∣H⟩|H\rangle∣H⟩ and measurement ket ∣hcd⟩|h_{cd}\rangle∣hcd​⟩ has the same surviving branch density as two successive CZCZCZ-plus-XXX one-bit steps:

∣bcd⟩⟨bcd∣=14XdZc∣ψ⟩⟨ψ∣ZcXd,Pr⁡(c,d)=14.|b_{cd}\rangle\langle b_{cd}|=\tfrac14 X^dZ^c|\psi\rangle\langle\psi|Z^cX^d,\qquad\Pr(c,d)=\tfrac14.∣bcd​⟩⟨bcd​∣=41​XdZc∣ψ⟩⟨ψ∣ZcXd,Pr(c,d)=41​.

Source correction: in the ordered I,X,Z,XZI,X,Z,XZI,X,Z,XZ list, the local XXX-basis rays are ++,+−,−+,−−++,+-,-+,--++,+−,−+,−−. The printed list swaps the last two labels; branch phases are absorbed by densities.

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)

/-- Common one-bit primitive, PDF p.16. Printed CZ basis list swaps its last
two ray labels: corrected I,X,Z,XZ labels are ++,+-,-+,--, up to phase.
The H-bond teleportation instrument equals the two sequential CZ/X steps. -/
theorem h_bond_teleportation_two_one_bit_steps :
    Orthonormal ℂ (fun p : QubitPair => hBell p.1 p.2) ∧
    (∀ c d : Bool, pureDensity (act (controlled pauliZ) (hBell c d)) =
      pureDensity (tensorVec (equatorial 0 c) (equatorial 0 d))) ∧
    (∀ (psi : Vec Bool), IsState psi → ∀ c d : Bool,
      let v := teleportContraction psi hBond (hBell c d)
      pureDensity v = pureDensity (lineBranch 2 (fun _ => 0) ![c,d] psi) ∧
      pureDensity v = (1 / 4 : ℝ) • pureDensity (act (pauliByproduct d c) psi) ∧
      ‖v‖ ^ 2 = (1 / 4 : ℝ)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P52

end
Source
An introduction to measurement based quantum computation, arXiv:quant-ph/0508124v2, PDF p. 16, §7: uniform CZ one-bit decomposition of teleportation
Read-back

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

Identify bits with 0,10,10,1, write X∣a⟩=∣a⊕1⟩X|a\rangle=|a\oplus1\rangleX∣a⟩=∣a⊕1⟩, Z∣a⟩=(−1)a∣a⟩Z|a\rangle=(-1)^a|a\rangleZ∣a⟩=(−1)a∣a⟩, D∣a,b⟩=(−1)ab∣a,b⟩D|a,b\rangle=(-1)^{ab}|a,b\rangleD∣a,b⟩=(−1)ab∣a,b⟩, ec(a)=(−1)ca/2e_c(a)=(-1)^{ca}/\sqrt2ec​(a)=(−1)ca/2​, h(a,b)=(−1)ab/2h(a,b)=(-1)^{ab}/2h(a,b)=(−1)ab/2, and hcd=(XdZc⊗I)hh_{cd}=(X^dZ^c\otimes I)hhcd​=(XdZc⊗I)h. The theorem asserts that the four vectors hcdh_{cd}hcd​ form an orthonormal family; that for every c,dc,dc,d,

(Dhcd)(Dhcd)†=(ec⊗ed)(ec⊗ed)†;(Dh_{cd})(Dh_{cd})^\dagger =(e_c\otimes e_d)(e_c\otimes e_d)^\dagger;(Dhcd​)(Dhcd​)†=(ec​⊗ed​)(ec​⊗ed​)†;

and that for every complex bit-indexed vector ψ\psiψ with ∥ψ∥=1\|\psi\|=1∥ψ∥=1 and every c,dc,dc,d, the vector

vk=∑i,jhcd(i,j)‾ ψi h(j,k)v_k=\sum_{i,j}\overline{h_{cd}(i,j)}\,\psi_i\,h(j,k)vk​=i,j∑​hcd​(i,j)​ψi​h(j,k)

satisfies

vv†=Lcd(ψ)Lcd(ψ)†=14(XdZcψ)(XdZcψ)†,∥v∥2=14,vv^\dagger=L_{cd}(\psi)L_{cd}(\psi)^\dagger =\frac14(X^dZ^c\psi)(X^dZ^c\psi)^\dagger, \qquad \|v\|^2=\frac14,vv†=Lcd​(ψ)Lcd​(ψ)†=41​(XdZcψ)(XdZcψ)†,∥v∥2=41​,

where the two-site measurement branch appearing here is explicitly

Lcd(ψ)b=12∑a,t∈{0,1}ψa(−1)at+tbec(a)‾ ed(t)‾.L_{cd}(\psi)_b =\frac12\sum_{a,t\in\{0,1\}} \psi_a(-1)^{at+tb}\overline{e_c(a)}\,\overline{e_d(t)}.Lcd​(ψ)b​=21​a,t∈{0,1}∑​ψa​(−1)at+tbec​(a)​ed​(t)​.

For any vector uuu, the matrix uu†uu^\daggeruu† has entries uxuy‾u_x\overline{u_y}ux​uy​​; the asserted comparisons of these matrices do not assert equality of the corresponding vectors.

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