Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Elementary random preparation of the fixed Werner state

Proved
QAlgorithms.Papers.Independent.Support50.P42.werner_preparation

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let W=I4/8+∣Ψ−⟩⟨Ψ−∣/2W=I_4/8+|\Psi^-\rangle\langle\Psi^-|/2W=I4​/8+∣Ψ−⟩⟨Ψ−∣/2, a normalized two-qubit Werner density. For n≥0n\ge0n≥0, choose nnn independent fair bits ziz_izi​. At position iii, use a singlet if zi=1z_i=1zi​=1 and locally prepare I4/4I_4/4I4​/4 otherwise. If ωz\omega_zωz​ is the resulting product state and K(z)=∑iziK(z)=\sum_i z_iK(z)=∑i​zi​, then

2−n∑zωz=W⊗n,K(z)≤n,EK=n/2.2^{-n}\sum_z\omega_z=W^{\otimes n},\qquad K(z)\le n,\qquad \mathbb E K=n/2.2−nz∑​ωz​=W⊗n,K(z)≤n,EK=n/2.

For every choice zzz an actual local protocol prepares ωz\omega_zωz​ from exactly K(z)K(z)K(z) supplied singlets. An initial supply of nnn is sufficient; n/2n/2n/2 is expected consumption, rather than a deterministic budget. This is the elementary preparation in Eq. (11), separate from the improved external results cited later.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P42

open scoped BigOperators Matrix ComplexConjugate

open MeasureTheory ProbabilityTheory

attribute [local instance] Classical.propDecidable Classical.decEq

-- Reuse the exact accepted objects, without introducing same-name aliases.

open Information100.P21 (Op Vec FiniteLOCC)

open Dependency50.P42 (dimensionedPower singlets)

open Dependency50.P48 (pureFidelity)

open Gap48.P32 (pairOfState)

open Next46.P39 (rectAct)

/-- PDF p.17, Eq.(11): independent fair local preparation of W tensor n.
Each branch is an actual LOCC protocol consuming its number of singlet choices;
that number is bounded by n and has expectation n/2, never a fixed n/2 budget. -/
theorem werner_preparation (n : ℕ) :
    IsDensityMatrix wernerState ∧
    (((2 : ℝ)^n)⁻¹ : ℂ) • (∑ z : Fin n → Bool, wernerBranch n z)=dimensionedPower wernerState n ∧
    ((2 : ℝ)^n)⁻¹*(∑ z : Fin n → Bool, (downCount z : ℝ))=(n : ℝ)/2 ∧
    (∀ z : Fin n → Bool, downCount z≤n ∧
      ∃ L : Superop (Fin (2^(downCount z)) × Fin (2^(downCount z))) (Fin (2^n) × Fin (2^n)),
        FiniteLOCC L ∧ L (singlets (downCount z))=wernerBranch n z) := by sorry

end QAlgorithms.Papers.Independent.Support50.P42

end
Source
Concentrating Partial Entanglement by Local Operations, arXiv:quant-ph/9511030v1, PDF p. 17, §V, Eq.(11): elementary random preparation of the fixed Werner state
Read-back

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

For every natural number nnn, including zero, let s=(∣01⟩−∣10⟩)/2s=(|01\rangle-|10\rangle)/\sqrt2s=(∣01⟩−∣10⟩)/2​, S=ss†S=ss^\daggerS=ss†, and W=18I4+12SW=\tfrac18I_4+\tfrac12SW=81​I4​+21​S. For a Boolean string z∈{0,1}nz\in\{0,1\}^nz∈{0,1}n, let d(z)d(z)d(z) be its number of true bits and let WzW_zWz​ be the grouped tensor product whose iii-th bipartite factor is SSS when ziz_izi​ is true and I4/4I_4/4I4​/4 otherwise, reindexed on each party using the fixed equivalence between binary strings and {0,…,2n−1}\{0,\ldots,2^n-1\}{0,…,2n−1}. Then WWW is positive semidefinite of trace one,

2−n∑z∈{0,1}nWz=W[n],2−n∑z∈{0,1}nd(z)=n2,2^{-n}\sum_{z\in\{0,1\}^n}W_z=W^{[n]}, \qquad 2^{-n}\sum_{z\in\{0,1\}^n}d(z)=\frac n2,2−nz∈{0,1}n∑​Wz​=W[n],2−nz∈{0,1}n∑​d(z)=2n​,

and, for every such zzz, d(z)≤nd(z)\le nd(z)≤n and there exists a finite recursive LOCC map LzL_zLz​ from matrices on C2d(z)⊗C2d(z)\mathbb C^{2^{d(z)}}\otimes\mathbb C^{2^{d(z)}}C2d(z)⊗C2d(z) to matrices on C2n⊗C2n\mathbb C^{2^n}\otimes\mathbb C^{2^n}C2n⊗C2n satisfying Lz(Sd(z))=WzL_z(S_{d(z)})=W_zLz​(Sd(z)​)=Wz​. Here W[n]W^{[n]}W[n] is the similarly reindexed tensor power, and SjS_jSj​ is the reindexed jjj-fold singlet tensor power. Finite recursive LOCC maps are generated by identities and complete finite local Kraus measurements on either party, followed by outcome-dependent recursive continuations and summation over outcomes. At n=0n=0n=0, the unique string is empty, its count is zero, all tensor products are the scalar matrix 111, and the average count is zero.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · 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