Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7: simultaneous AC and BC entanglement using receiver state merging

Open
QAlgorithms.Papers.Independent.Gap48.P39.receiver_merging_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 broadcast channel on positive-dimensional systems. Let ∣ψ⟩AA′|\psi\rangle^{AA'}∣ψ⟩AA′ be a unit pure reference/input state and put σ=(idA⊗N)(ψ)\sigma=(\mathrm{id}_A\otimes\mathcal N)(\psi)σ=(idA​⊗N)(ψ). For any nonnegative rates QC,QBCQ_C,Q_{BC}QC​,QBC​ with

QC<I(A⟩BC)σ,I(B⟩C)σ>0,QBC<I(B⟩C)σ,Q_C<I(A\rangle BC)_\sigma,\qquad I(B\rangle C)_\sigma>0,\qquad Q_{BC}<I(B\rangle C)_\sigma,QC​<I(A⟩BC)σ​,I(B⟩C)σ​>0,QBC​<I(B⟩C)σ​,

there is one protocol generating independent Alice–Charlie and Bob–Charlie EPR resources at those respective rates. Entropies are in bits. For every positive error tolerance and all sufficiently large positive blocklengths, Alice prepares a pure reference/block input, Bob applies a rectangular instrument and sends its classical branch freely to Charlie, and Charlie uses a branch-dependent CPTP decoder. A single joint squared-fidelity test to the product of the two floor-exponential-rank EPRs succeeds with error at most the tolerance. No initial shared entanglement or other side communication is supplied. This retains the second independent resource in the same one-way receiver-assisted protocol.

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 7, PDF p.13: BOTH resources in the SAME protocol, strictly below
the two informations, only free one-way Bob-to-Charlie classical communication. -/
theorem receiver_merging_generation [Nonempty A] [Nonempty B] [Nonempty C]
    {R : Type} [Fintype R] [DecidableEq R] [Nonempty R]
    (N : Superop A (B × C)) (hN : IsChannel N)
    (psi : EuclideanSpace ℂ (R × A)) (hp : IsState psi)
    (QC QBC : ℝ) (hQC : 0 ≤ QC) (hQBC : 0 ≤ QBC)
    (hAC : QC < (mergingInformation N psi).1)
    (hpos : 0 < (mergingInformation N psi).2)
    (hBC : QBC < (mergingInformation N psi).2) :
    assistedAchievable N (QC, QBC) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P39

end
Source
Quantum broadcast channels, arXiv:quant-ph/0603098v2, PDF p. 13, Theorem 7: simultaneous AC and BC entanglement using receiver state merging
Read-back

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

Let A,B,C,RA,B,C,RA,B,C,R be nonempty finite types with the required decidable equalities. Let NNN be a channel from matrices on AAA to matrices on B×CB\times CB×C, meaning that N(X)=∑jKjXKj†N(X)=\sum_jK_jXK_j^\daggerN(X)=∑j​Kj​XKj†​ for some finite family with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, and let ψ∈CR×A\psi\in\mathbb C^{R\times A}ψ∈CR×A satisfy ∥ψ∥=1\|\psi\|=1∥ψ∥=1. Put ρ=(idR⊗N)(∣ψ⟩⟨ψ∣)\rho=(\mathrm{id}_R\otimes N)(|\psi\rangle\langle\psi|)ρ=(idR​⊗N)(∣ψ⟩⟨ψ∣), where the extension applies NNN to each RRR-indexed matrix block, put β=Tr⁡Rρ\beta=\operatorname{Tr}_R\rhoβ=TrR​ρ, and put βC=Tr⁡Bβ\beta_C=\operatorname{Tr}_B\betaβC​=TrB​β; partial traces mean summing diagonal entries over the register removed. Write H(X)=−Re⁡Tr⁡(f(X))H(X)=-\operatorname{Re}\operatorname{Tr}(f(X))H(X)=−ReTr(f(X)), with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x applied by continuous functional calculus. For every pair of real numbers QC,QBCQ_C,Q_{BC}QC​,QBC​ satisfying

0≤QC<H(β)−H(ρ),0≤QBC<H(βC)−H(β),0<H(βC)−H(β),0\le Q_C<H(\beta)-H(\rho), \qquad 0\le Q_{BC}<H(\beta_C)-H(\beta), \qquad 0<H(\beta_C)-H(\beta),0≤QC​<H(β)−H(ρ),0≤QBC​<H(βC​)−H(β),0<H(βC​)−H(β),

the pair (QC,QBC)(Q_C,Q_{BC})(QC​,QBC​) satisfies the following achievability assertion: for every ε>0\varepsilon>0ε>0, there is n0>0n_0>0n0​>0 such that every natural n≥n0n\ge n_0n≥n0​ admits m>0m>0m>0 and a unit encoding vector on Fin⁡k×An\operatorname{Fin}k\times A^nFink×An, where k=⌊2nQC⌋Nk=\lfloor2^{nQ_C}\rfloor_{\mathbb N}k=⌊2nQC​⌋N​ and l=⌊2nQBC⌋Nl=\lfloor2^{nQ_{BC}}\rfloor_{\mathbb N}l=⌊2nQBC​⌋N​, together with a Bob instrument Bn→Fin⁡lB^n\to\operatorname{Fin}lBn→Finl having mmm outcomes and finite Kraus operators whose total adjoint products sum to III, and an outcome dependent Charlie channel Cn→Fin⁡k×Fin⁡lC^n\to\operatorname{Fin}k\times\operatorname{Fin}lCn→Fink×Finl admitting a finite trace preserving Kraus representation. Applying NNN independently to the nnn input registers, applying these two receiver maps, retaining the encoding reference register, and summing over the instrument outcome produces a matrix ω\omegaω satisfying

(Re⁡Tr⁡ω Tk,l ω)2≥1−ε,\left(\operatorname{Re}\operatorname{Tr} \sqrt{\sqrt\omega\,T_{k,l}\,\sqrt\omega}\right)^2\ge1-\varepsilon,(ReTrω​Tk,l​ω​​)2≥1−ε,

where Tk,lT_{k,l}Tk,l​, in register order k,l,k,lk,l,k,lk,l,k,l, has entry 1/(kl)1/(kl)1/(kl) when the first and third indices agree on each side and the second and fourth indices agree on each side, and entry 000 otherwise. Both rate inequalities are strict; the assumptions permit either rate to be zero and can hold only when both displayed entropy differences are 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