Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact preparation from finitely many standard singlets

Proved
QAlgorithms.Papers.Independent.Support50.P42.arbitrary_state_preparation

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

prove2quantum

Let ρAB\rho_{AB}ρAB​ be any positive semidefinite trace-one density on positive finite local dimensions a,ba,ba,b, including pure and mixed targets. Put q=⌈log⁡2b⌉q=\lceil\log_2b\rceilq=⌈log2​b⌉. There is an exact local protocol using qqq shared singlets and at most 2q2q2q classical bits from Alice to Bob such that

L((∣Ψ−⟩⟨Ψ−∣)⊗q)=ρAB.\mathcal L\bigl((|\Psi^-\rangle\langle\Psi^-|)^{\otimes q}\bigr)=\rho_{AB}.L((∣Ψ−⟩⟨Ψ−∣)⊗q)=ρAB​.

The classical bound is witnessed by a complete Alice instrument with at most 22q2^{2q}22q communicated outcomes and conditional Bob channels. When b=2rb=2^rb=2r, the direct resource count is q=rq=rq=r. This is a sufficient preparation method; it does not assert optimality.

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)

/-- Abstract and PDF pp.15--17: exact finite preparation of pure or mixed
states. Printed on pp.15--16: log2 b singlets and 2 log2 b cbits. Changed:
choose the explicit qubit embedding q=ceil(log2 b), giving q singlets and at most
2q cbits. This makes the standard-singlet count integral for general b; for
b=2^q the direct count remains exactly q. This is a sufficient budget. -/
theorem arbitrary_state_preparation (a b : ℕ) (ha : 0<a) (hb : 0<b)
    (rho : Op (Fin a × Fin b)) (hrho : IsDensityMatrix rho) :
    (∃ L : Superop (Fin (2^(Nat.clog 2 b)) × Fin (2^(Nat.clog 2 b))) (Fin a × Fin b),
      FiniteLOCC L ∧ OneWayBits (2*Nat.clog 2 b) L ∧ L (singlets (Nat.clog 2 b))=rho) ∧
    (∀ q : ℕ, b=2^q → Nat.clog 2 b=q) := by sorry

end QAlgorithms.Papers.Independent.Support50.P42

end
Source
Concentrating Partial Entanglement by Local Operations, arXiv:quant-ph/9511030v1, PDF p. 1, Abstract and §V: exact finite preparation of pure or mixed shared states
Read-back

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

For every pair of positive natural numbers a,ba,ba,b, and every positive semidefinite matrix ρ\rhoρ of trace one on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb, put q=⌈log⁡2b⌉q=\lceil\log_2 b\rceilq=⌈log2​b⌉, with this integer understood as the natural-number ceiling logarithm. There exists a map LLL from matrices on C2q⊗C2q\mathbb C^{2^q}\otimes\mathbb C^{2^q}C2q⊗C2q to matrices on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb such that LLL is a finite recursive LOCC map, LLL has the one-way form specified below with a budget of 2q2q2q bits, and

L(Sq)=ρ.L(S_q)=\rho.L(Sq​)=ρ.

Here SqS_qSq​ is the qqq-fold tensor power of the projector onto (∣01⟩−∣10⟩)/2(|01\rangle-|10\rangle)/\sqrt2(∣01⟩−∣10⟩)/2​, reindexed on each side by the fixed equivalence between qqq binary digits and {0,…,2q−1}\{0,\ldots,2^q-1\}{0,…,2q−1}; S0S_0S0​ is the scalar matrix 111. Finite recursive LOCC maps are generated by identity maps and by applying a finite complete Kraus family on either party, choosing a further such map according to the outcome, and summing the resulting branches. The one-way requirement means that there exist natural numbers k,rk,rk,r, with k≤22qk\le2^{2q}k≤22q, Alice matrices Ai,z:C2q→CaA_{i,z}:\mathbb C^{2^q}\to\mathbb C^aAi,z​:C2q→Ca, and Bob channels Bi:Mat⁡2q→Mat⁡bB_i:\operatorname{Mat}_{2^q}\to\operatorname{Mat}_bBi​:Mat2q​→Matb​, such that ∑i,zAi,z†Ai,z=I\sum_{i,z}A_{i,z}^\dagger A_{i,z}=I∑i,z​Ai,z†​Ai,z​=I and, for every matrix XXX,

L(X)=∑i(id⁡⊗Bi)(∑z(Ai,z⊗I)X(Ai,z†⊗I)).L(X)=\sum_i(\operatorname{id}\otimes B_i) \left(\sum_z(A_{i,z}\otimes I)X(A_{i,z}^\dagger\otimes I)\right).L(X)=i∑​(id⊗Bi​)(z∑​(Ai,z​⊗I)X(Ai,z†​⊗I)).

Each Bob channel has a finite Kraus representation with completeness sum III. Additionally, for every natural number jjj, b=2jb=2^jb=2j implies ⌈log⁡2b⌉=j\lceil\log_2 b\rceil=j⌈log2​b⌉=j. The case b=1b=1b=1 is included, giving q=0q=0q=0, a scalar singlet input, and at most one classical outcome.

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