Theorem 7: simultaneous AC and BC entanglement using receiver state merging
OpenQAlgorithms.Papers.Independent.Gap48.P39.receiver_merging_generationLet be a finite-dimensional CPTP broadcast channel on positive-dimensional systems. Let be a unit pure reference/input state and put . For any nonnegative rates with
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.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P39
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite types with the required decidable equalities. Let be a channel from matrices on to matrices on , meaning that for some finite family with , and let satisfy . Put , where the extension applies to each -indexed matrix block, put , and put ; partial traces mean summing diagonal entries over the register removed. Write , with applied by continuous functional calculus. For every pair of real numbers satisfying
the pair satisfies the following achievability assertion: for every , there is such that every natural admits and a unit encoding vector on , where and , together with a Bob instrument having outcomes and finite Kraus operators whose total adjoint products sum to , and an outcome dependent Charlie channel admitting a finite trace preserving Kraus representation. Applying independently to the input registers, applying these two receiver maps, retaining the encoding reference register, and summing over the instrument outcome produces a matrix satisfying
where , in register order , has entry when the first and third indices agree on each side and the second and fourth indices agree on each side, and entry 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.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.