Eq.(44): equivalence of AEP and operational cost identity
OpenQAlgorithms.Papers.Independent.Intakethird100.P65.aep_iff_operationalAll systems have finite positive dimension and fixed computational bases. Matrix order is Loewner order and logarithms are base two.
For a CPTP channel , the channel AEP and the equality of entanglement-assisted capacity with NS simulation cost are equivalent:
The limit assertion includes existence in the printed order. Both operational quantities are defined from actual codes; the cited background capacity formula is not made a hypothesis.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P65
noncomputable section
open Filter QAlgorithms
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Topology
namespace QAlgorithms.Papers.Independent.Intakethird100.P65
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P09 (transposeBob)
open QAlgorithms.Papers.Independent.Dependency50.P35 (maxRelative)
open QAlgorithms.Papers.Independent.Independent2.P01 (dampingKraus damping)
open QAlgorithms.Papers.Independent.Gap48.P33 (phaseFlipChannel)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P34 (choi)
open QAlgorithms.Papers.Independent.Information100.P62 (Stochastic)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized purifiedDistance)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer permute)
open QAlgorithms.Papers.Independent.Information100.P71 (diamond channelPower channelRelative)
open QAlgorithms.Papers.Independent.Support50.P39 (quantumMutualInformation)
variable {A B C D R : Type} [Fintype A] [DecidableEq A]
[Fintype B] [DecidableEq B] [Fintype C] [DecidableEq C]
[Fintype D] [DecidableEq D] [Fintype R] [DecidableEq R]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty R]
/-- Eq.(44), PDF p.10: two-way equivalence, without assuming the cited
entanglement-assisted vanishingErrorQuantumCapacity identity as a new hypothesis. -/
theorem aep_iff_operational (N : Superop A B) (hN : IsChannel N) :
IteratedLimit (fun e n => smoothChannelInfo (channelPower N n) e / n) (channelMutualInfo N) ↔
vanishingErrorQuantumCapacity .ent N = vanishingErrorSimulationCost .ns N := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite index types , with decidable equality, let be a channel, meaning a finite Kraus sum with . The declaration asserts an equivalence between the iterated-limit statement and the operational equality defined here. Put , , , and
Density matrices are positive semidefinite with trace . Define in the extended reals, , and
where is the normalized maximally entangled matrix on the input and an identical reference, with entry the inverse input dimension when both index pairs have equal coordinates and otherwise; either extended-real infinity converts to . The diamond norm uses all matrices of trace norm at most on an input-sized reference tensor the input, with . The iterated-limit statement is that there exists such that, for every ,
To define the operational side, for and , let be the infimum of , where
Nonsignalling assistance permits channels whose two output marginals, on every matrix, are channel functions of their respective input marginals. Entanglement assistance permits precisely maps obtained by adjoining a density matrix on two finite positive-dimensional ancillary systems and applying a channel locally to each input together with its ancillary share. Let be the extended-real supremum of nonnegative real such that, for every and slack , eventually every positive admits a positive integer with and . Let be the extended-real infimum of nonnegative real with the corresponding conditions and . Tensor powers act by . The asserted equivalence is that the stated iterated limit holds if and only if ; the operational error conditions concern infima and do not assert realizing assistance maps.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.