Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8: unassisted simultaneous bipartite entanglement generation

Open
QAlgorithms.Papers.Independent.Gap48.P39.two_epr_generation

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

prove2quantum

Let N:A′→BC\mathcal N:A'\to BCN:A′→BC be a finite-dimensional CPTP channel, and let ∣ψ⟩ABACA′|\psi\rangle^{A_BA_CA'}∣ψ⟩AB​AC​A′ be a unit pure state on positive-dimensional systems. The systems AB,ACA_B,A_CAB​,AC​ are retained locally by Alice; their joint state need not factor. Put σ=(idABAC⊗N)(ψ)\sigma=(\mathrm{id}_{A_BA_C}\otimes\mathcal N)(\psi)σ=(idAB​AC​​⊗N)(ψ) and compute both marginal coherent informations in bits. If both are strictly positive, then

(I(AB⟩B)σ, I(AC⟩C)σ)∈Egen(N).\bigl(I(A_B\rangle B)_\sigma,\ I(A_C\rangle C)_\sigma\bigr)\in\mathcal E_{\mathrm{gen}}(\mathcal N).(I(AB​⟩B)σ​, I(AC​⟩C)σ​)∈Egen​(N).

Here Egen\mathcal E_{\mathrm{gen}}Egen​ is the closed unassisted two-EPR generation region. Its codes have one joint pure block preparation with locally retained references and separate receiver CPTP decoders, and are tested by a single squared-fidelity criterion against the product of independent Alice–Bob and Alice–Charlie EPR states. Ranks follow ⌊2nR⌋\lfloor2^{nR}\rfloor⌊2nR⌋, errors vanish, and there is no initial shared entanglement or final side communication. This generates the two computed resources simultaneously, rather than a GHZ/EPR pair.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P39
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Gap48.P39

open QAlgorithms.Papers.Independent.Information100.P21 (Op)

open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)

open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks holevoInfo)

open QAlgorithms.Papers.Independent.Dependency50.P19 (both epr mutualInformation marginalRA marginalRB)

open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)

open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity conditionalEntropy groupedChannelPower)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C X T E : Type}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype X] [DecidableEq X]

variable [Fintype T] [DecidableEq T] [Fintype E] [DecidableEq E]

/-- Theorem 8, PDF p.13: both positive coherent informations achievable
simultaneously, with independent final EPRs. Alice's reference factors need not be independent. -/
theorem two_epr_generation [Nonempty A] [Nonempty B] [Nonempty C]
    {AB AC : Type} [Fintype AB] [Fintype AC] [DecidableEq AB] [DecidableEq AC]
    [Nonempty AB] [Nonempty AC] (N : Superop A (B × C)) (hN : IsChannel N)
    (psi : EuclideanSpace ℂ ((AB × AC) × A)) (hp : IsState psi)
    (hB : 0 < (twoEprInformation N psi).1) (hC : 0 < (twoEprInformation N psi).2) :
    twoEprInformation N psi ∈ twoEprCapacity N := by sorry

end QAlgorithms.Papers.Independent.Gap48.P39

end
Source
Quantum broadcast channels, arXiv:quant-ph/0603098v2, PDF p. 13, Theorem 8: unassisted simultaneous bipartite entanglement generation
Read-back

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

Let A,B,C,AB,ACA,B,C,A_B,A_CA,B,C,AB​,AC​ be finite nonempty types with decidable equality. Let NNN be a map from complex matrices on AAA to complex matrices on B×CB\times CB×C admitting a finite Kraus representation N(X)=∑jKjXKj†N(X)=\sum_jK_jXK_j^\daggerN(X)=∑j​Kj​XKj†​, ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, and let ψ\psiψ be a norm-one vector on (AB×AC)×A(A_B\times A_C)\times A(AB​×AC​)×A. Apply NNN to the AAA-indexed blocks of ∣ψ⟩⟨ψ∣|\psi\rangle\langle\psi|∣ψ⟩⟨ψ∣, retaining AB,ACA_B,A_CAB​,AC​, to obtain ρ\rhoρ. Let XBX_BXB​ be its marginal on AB×BA_B\times BAB​×B, formed by summing matching AC,CA_C,CAC​,C indices, and let XCX_CXC​ be its marginal on AC×CA_C\times CAC​×C, formed by summing matching AB,BA_B,BAB​,B indices. Set

qB=H(tr⁡ABXB)−H(XB),qC=H(tr⁡ACXC)−H(XC),q_B=H(\operatorname{tr}_{A_B}X_B)-H(X_B), \qquad q_C=H(\operatorname{tr}_{A_C}X_C)-H(X_C),qB​=H(trAB​​XB​)−H(XB​),qC​=H(trAC​​XC​)−H(XC​),

where H(M)=−Re⁡tr⁡(f(M))H(M)=-\operatorname{Re}\operatorname{tr}(f(M))H(M)=−Retr(f(M)), f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x, using continuous functional calculus. If qB>0q_B>0qB​>0 and qC>0q_C>0qC​>0, then (qB,qC)(q_B,q_C)(qB​,qC​) belongs to the closure in R2\mathbb R^2R2 of the following set of nonnegative pairs (rB,rC)(r_B,r_C)(rB​,rC​): for every ϵ>0\epsilon>0ϵ>0, all sufficiently large positive integers nnn admit a norm-one vector ξ\xiξ on ({0,…,k−1}×{0,…,l−1})×An(\{0,\ldots,k-1\}\times\{0,\ldots,l-1\})\times A^n({0,…,k−1}×{0,…,l−1})×An, with k=⌊2nrB⌋k=\lfloor2^{nr_B}\rfloork=⌊2nrB​⌋, l=⌊2nrC⌋l=\lfloor2^{nr_C}\rfloorl=⌊2nrC​⌋, and separate decoder maps from matrices on Bn,CnB^n,C^nBn,Cn to dimensions k,lk,lk,l, each having a finite normalized Kraus representation. Apply the linear word map

Nn(Ea,a′)(b,c),(b′,c′)=∏i=0n−1N(Eai,ai′)(bi,ci),(bi′,ci′)\mathcal N_n(E_{a,a'})_{(b,c),(b',c')} =\prod_{i=0}^{n-1}N(E_{a_i,a'_i})_{(b_i,c_i),(b'_i,c'_i)}Nn​(Ea,a′​)(b,c),(b′,c′)​=i=0∏n−1​N(Eai​,ai′​​)(bi​,ci​),(bi′​,ci′​)​

and then these decoders to the word blocks of ∣ξ⟩⟨ξ∣|\xi\rangle\langle\xi|∣ξ⟩⟨ξ∣, retaining the reference pair, to obtain ZZZ. It must satisfy F(Z,Ωk,l)≥1−ϵF(Z,\Omega_{k,l})\ge1-\epsilonF(Z,Ωk,l​)≥1−ϵ, where Ωk,l\Omega_{k,l}Ωk,l​ has entry 1/(kl)1/(kl)1/(kl) exactly when reference and decoded labels match on both row and column, and zero otherwise, and F(X,Y)=(Re⁡tr⁡X YX)2F(X,Y)=(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Y\sqrt X})^2F(X,Y)=(RetrX​YX​​)2. The conclusion is membership in this closure; the hypotheses require both displayed information quantities to be strictly positive.

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

    Confirmed by the moderator at approval.

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