Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Near-power projection to exact standard singlets

Proved
QAlgorithms.Papers.Independent.Support50.P42.standardization

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

prove2quantum

Let D>0D>0D>0 and ℓ≥0\ell\ge0ℓ≥0 be integers and let ϵ>0\epsilon>0ϵ>0 satisfy 2ℓ≤D<(1+ϵ)2ℓ2^\ell\le D<(1+\epsilon)2^\ell2ℓ≤D<(1+ϵ)2ℓ. Start with D−1/2∑j=0D−1∣j,j⟩D^{-1/2}\sum_{j=0}^{D-1}|j,j\rangleD−1/2∑j=0D−1​∣j,j⟩. Projection onto the first 2ℓ2^\ell2ℓ Schmidt coordinates, with its orthogonal complement as failure, is a complete local measurement. Its success probability is

q=2ℓD>1−ϵ,0≤1−q<ϵ.q=\frac{2^\ell}{D}>1-\epsilon,\qquad 0\le1-q<\epsilon.q=D2ℓ​>1−ϵ,0≤1−q<ϵ.

The successful subnormalized density is qqq times the normalized maximally entangled state of local rank 2ℓ2^\ell2ℓ. Local unitaries convert that state exactly into ℓ\ellℓ standard singlets. If D=2ℓD=2^\ellD=2ℓ, failure has probability zero and needs no normalization. This states the paper's finite standardization step using local ranks.

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.7: exact successful conversion and the strict near-power probability
bounds. These are local ranks. At D=2^ell failure has downCount zero, and is never
normalized. Local unitaries put the successful state into ell standard singlets. -/
theorem standardization (D ell : ℕ) (hD : 0<D) (epsilon : ℝ)
    (he : 0<epsilon) (hlo : 2^ell≤D)
    (hhi : (D : ℝ)<(1+epsilon)*(2 : ℝ)^ell) :
    (trim D ell)ᴴ*trim D ell+(trimFailure D ell)ᴴ*trimFailure D ell=1 ∧
    pureDensity (rectAct (Matrix.kronecker (trim D ell) (trim D ell)) (uniformKet D))=
      (((2 : ℝ)^ell/D : ℝ) : ℂ) • pureDensity (uniformKet (2^ell)) ∧
    1-epsilon<(2 : ℝ)^ell/D ∧
    0≤1-(2 : ℝ)^ell/D ∧ 1-(2 : ℝ)^ell/D<epsilon ∧
    ∃ U V : Matrix.unitaryGroup (Fin (2^ell)) ℂ,
      conjSuperop (Matrix.kronecker (U : Op (Fin (2^ell))) (V : Op (Fin (2^ell))))
        (pureDensity (uniformKet (2^ell)))=singlets ell := by sorry

end QAlgorithms.Papers.Independent.Support50.P42

end
Source
Concentrating Partial Entanglement by Local Operations, arXiv:quant-ph/9511030v1, PDF p. 7, §II: near-power standardization to exact singlets
Read-back

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

For natural numbers D,ℓD,\ellD,ℓ with D>0D>0D>0, and a real ϵ>0\epsilon>0ϵ>0, assume 2ℓ≤D<(1+ϵ)2ℓ2^\ell\le D<(1+\epsilon)2^\ell2ℓ≤D<(1+ϵ)2ℓ. Define T:CD→C2ℓT:\mathbb C^D\to\mathbb C^{2^\ell}T:CD→C2ℓ by Tij=1T_{ij}=1Tij​=1 when the numerical indices i,ji,ji,j are equal and 000 otherwise, define FFF on CD\mathbb C^DCD to be diagonal with entry 000 for j<2ℓj<2^\ellj<2ℓ and 111 otherwise, and define ΦD=D−1/2∑j=0D−1∣j,j⟩\Phi_D=D^{-1/2}\sum_{j=0}^{D-1}|j,j\rangleΦD​=D−1/2∑j=0D−1​∣j,j⟩. Then

T†T+F†F=ID,∣(T⊗T)ΦD⟩⟨(T⊗T)ΦD∣=2ℓD ∣Φ2ℓ⟩⟨Φ2ℓ∣,T^\dagger T+F^\dagger F=I_D,\qquad |(T\otimes T)\Phi_D\rangle\langle(T\otimes T)\Phi_D| =\frac{2^\ell}{D}\,|\Phi_{2^\ell}\rangle\langle\Phi_{2^\ell}|,T†T+F†F=ID​,∣(T⊗T)ΦD​⟩⟨(T⊗T)ΦD​∣=D2ℓ​∣Φ2ℓ​⟩⟨Φ2ℓ​∣,

and

1−ϵ<2ℓD,0≤1−2ℓD<ϵ.1-\epsilon<\frac{2^\ell}{D},\qquad 0\le1-\frac{2^\ell}{D}<\epsilon.1−ϵ<D2ℓ​,0≤1−D2ℓ​<ϵ.

There also exist unitaries U,VU,VU,V on C2ℓ\mathbb C^{2^\ell}C2ℓ such that

(U⊗V)∣Φ2ℓ⟩⟨Φ2ℓ∣(U⊗V)†=(∣ψ−⟩⟨ψ−∣)⊗ℓ,(U\otimes V)|\Phi_{2^\ell}\rangle\langle\Phi_{2^\ell}|(U\otimes V)^\dagger =(|\psi^-\rangle\langle\psi^-|)^{\otimes\ell},(U⊗V)∣Φ2ℓ​⟩⟨Φ2ℓ​∣(U⊗V)†=(∣ψ−⟩⟨ψ−∣)⊗ℓ,

where ψ−=(∣0,1⟩−∣1,0⟩)/2\psi^-=(|0,1\rangle-|1,0\rangle)/\sqrt2ψ−=(∣0,1⟩−∣1,0⟩)/2​ and the tensor power on the right is indexed by the fixed cardinality equivalences from length-ℓ\ellℓ strings in {0,1}\{0,1\}{0,1} to {0,…,2ℓ−1}\{0,\ldots,2^\ell-1\}{0,…,2ℓ−1}, separately on the two parties. Here rank-one matrices have entries vxvy‾v_x\overline{v_y}vx​vy​​. There is no upper bound on ϵ\epsilonϵ; ℓ=0\ell=0ℓ=0 is included, and the target is then the one-dimensional identity.

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