Unnumbered strengthening of Theorem 8: independent entanglement transmission
OpenQAlgorithms.Papers.Independent.Gap48.P39.two_epr_transmissionLet be any finite-dimensional CPTP broadcast channel on positive-dimensional systems, and let be a unit pure state, with retained local reference factors that may be correlated. Put . If both coherent informations below are positive, then
Entropies are in bits. The transmission region is independently defined: Alice receives the sender halves of two independent EPR pairs, leaves their external reference halves untouched, applies a CPTP encoder into the block channel inputs, and Bob and Charlie decode locally. A single joint squared-fidelity test compares the result with the independent EPR product. The region is the closure of nonnegative floor-exponential-rank rates with vanishing error and no side communication or preshared assistance. This is transmission of supplied entanglement, distinct from freely preparing the reference/input state of a generation code.
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]
/-- Unnumbered strengthening of Theorem 8, PDF p.13: independent two-EPR
TRANSMISSION at the same coherent-information rates, with fixed external references. -/
theorem two_epr_transmission [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 ∈ twoEprTransmissionCapacity N := 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 finite nonempty types with decidable equality. Let be a map from complex matrices on to complex matrices on , for a finite family satisfying , and let be a norm-one vector on . Apply to its -indexed pure-density blocks to obtain ; let and , where the partial traces sum matching indices of the named registers. Define
with , , evaluated by continuous functional calculus. If and , then belongs to the closure in of the set of nonnegative pairs having this property: for every , every sufficiently large positive integer admits an encoder from matrices of dimension to matrices on , and separate decoders from matrices on to dimensions , where , ; each map has a finite Kraus representation with . Between encoder and decoders use the linear map specified by
Starting with , whose entry is precisely when its reference and transmitted labels match on both row and column and zero otherwise, apply the encoder, this word map, and the separate decoders to the transmitted registers, retaining the references. The resulting must satisfy , where , using continuous functional calculus. The conclusion is membership in the closure of these rate pairs.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.