Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 3, step-outcome rule — each Bell outcome has probability 1/16; the step applies U(β) if i₁ = j₁ and U(−β) = U(β)† if i₁ ≠ j₁

Proved
EntanglingOps.BinaryPhase.step_outcome_rule

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

bell-measurementloccnonlocal-gatep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Fix a real β\betaβ and let systems A1A2A_1A_2A1​A2​ and B1B2B_1B_2B1​B2​ be in the state ∣ψβ⟩|\psi_\beta\rangle∣ψβ​⟩ of Eq. (10). Measure A2A3A_2A_3A2​A3​ and B2B3B_2B_3B2​B3​ in the Bell basis ∣Ψi1,i2⟩=(1⊗σi1,i2)∣Φ⟩|\Psi_{i_1,i_2}\rangle=(\mathbb 1\otimes\sigma_{i_1,i_2})|\Phi\rangle∣Ψi1​,i2​​⟩=(1⊗σi1​,i2​​)∣Φ⟩, where σ1,1=1\sigma_{1,1}=\mathbb 1σ1,1​=1, σ1,2=σx\sigma_{1,2}=\sigma_xσ1,2​=σx​, σ2,1=σy\sigma_{2,1}=\sigma_yσ2,1​=σy​, σ2,2=σz\sigma_{2,2}=\sigma_zσ2,2​=σz​; on outcome ∣Ψi⟩|\Psi_{i}\rangle∣Ψi​⟩ for A2A3A_2A_3A2​A3​ apply σi\sigma_{i}σi​ to A1A_1A1​, and on outcome ∣Ψj⟩|\Psi_j\rangle∣Ψj​⟩ for B2B3B_2B_3B2​B3​ apply σj\sigma_jσj​ to B1B_1B1​. Let Kβ(i,j)K_\beta(i,j)Kβ​(i,j) be the resulting operator from A3B3A_3B_3A3​B3​ to A1B1A_1B_1A1​B1​. Then:

  1. for all outcomes i=(i1,i2)i=(i_1,i_2)i=(i1​,i2​), j=(j1,j2)j=(j_1,j_2)j=(j1​,j2​) there is c∈Cc\in\mathbb Cc∈C with ∣c∣2=1/16|c|^2=1/16∣c∣2=1/16 and
Kβ(i,j)={c U(β)if i1=j1,c U(−β)if i1≠j1;K_\beta(i,j)=\begin{cases}c\,U(\beta)&\text{if }i_1=j_1,\\ c\,U(-\beta)&\text{if }i_1\neq j_1;\end{cases}Kβ​(i,j)={cU(β)cU(−β)​if i1​=j1​,if i1​=j1​;​
  1. U(β)†=U(−β)U(\beta)^\dagger=U(-\beta)U(β)†=U(−β);
  2. on every density matrix ρ\rhoρ of A3B3A_3B_3A3​B3​, each of the 16 outcomes has probability Re⁡Tr⁡(Kβ(i,j) ρ Kβ(i,j)†)=1/16\operatorname{Re}\operatorname{Tr}(K_\beta(i,j)\,\rho\,K_\beta(i,j)^\dagger)=1/16ReTr(Kβ​(i,j)ρKβ​(i,j)†)=1/16.

So all outcomes are equally probable, and the step applies the gate U(β)U(\beta)U(β) in 8 of the 16 cases and its inverse in the others. This is the elementary step of the protocol.

Differences from the source:

  • generalization: the step with resource ψ_{α_N} → every real β; reason: the protocol's step k uses β = 2^{k−1}α_N; β = α_N is an instance
  • reading: Bell basis |Ψ_{i1,i2}⟩ = 𝟙 ⊗ σ_{i1,i2}|Ψ⟩ with |Ψ⟩ not defined → |Ψ⟩ := |Φ⟩ of Eq. (5) at d = 2, i.e. |Φ⁺⟩ (bellVec); reason: the only reading under which the page's rule (i)/(ii) holds: with |Ψ⁺⟩ all 16 outcomes violate it, with |Φ⟩ all 16 satisfy it
  • encoding: 'the resulting operation will be U(α_N)' (resp. U(−α_N)) → the step's Kraus operator equals c·U(±β) with |c|² = 1/16; reason: the post-measurement state is K ρ K†/Tr(K ρ K†) = U ρ U†; the scalar is the outcome's amplitude
  • encoding: labels (i1,i2) ∈ {1,2}², steps k = 1, …, N → 0-based labels in Fin 2 × Fin 2 and 0-based list positions (the paper's step k is position k − 1, with resource ψ_{2^{k−1}α_N}); reason: Lean indexing convention; same objects
Preamble
import Mathlib
import Definitions.Def_EntanglingOps_BinaryPhase_Model
Formal statement
namespace EntanglingOps.BinaryPhase

open Matrix
open scoped Kronecker ComplexOrder

/-- p. 3, the step-outcome rule: with the resource `|ψ_β⟩`, each of the 16 Bell outcomes
`(i, j)` (Alice's on `A₂A₃`, Bob's on `B₂B₃`), followed by the corrections `σ_i` on `A₁` and
`σ_j` on `B₁`, acts on `A₃B₃ → A₁B₁` as `c · U(β)` if `i₁ = j₁` and `c · U(−β)` if `i₁ ≠ j₁`,
with `|c|² = 1/16`; `U(β)† = U(−β)`; and every outcome has probability `1/16` on every input
density matrix. Stated for every real `β` (the paper's step uses `β = α_N`). -/
theorem step_outcome_rule :
    (∀ (β : ℝ) (i j : Fin 2 × Fin 2), ∃ c : ℂ, Complex.normSq c = 1 / 16 ∧
        stepKraus β i j = c • gate (if i.1 = j.1 then β else -β)) ∧
    (∀ β : ℝ, (gate β)ᴴ = gate (-β)) ∧
    (∀ (β : ℝ) (i j : Fin 2 × Fin 2) (ρ : Matrix (Fin 2 × Fin 2) (Fin 2 × Fin 2) ℂ),
        ρ.PosSemidef → ρ.trace = 1 →
        (Matrix.trace (stepKraus β i j * ρ * (stepKraus β i j)ᴴ)).re = 1 / 16) := by sorry

end EntanglingOps.BinaryPhase
Source
Cirac, Dür, Kraus, Lewenstein, Entangling operations and their implementation using a small amount of entanglement, arXiv:quant-ph/0007057v1, p. 3, protocol paragraph ('Note that all outcomes of the measurement are equally probable … (ii) U(α_N)† = U(−α_N) if i1 ≠ j1')
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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