Theorem 4: generalized-dephasing classical–quantum capacity
OpenQAlgorithms.Papers.Independent.Gap48.P39.generalized_dephasing_cqLet be nonempty finite basis sets and let each be a unit vector, without any orthogonality assumption. Define , with indexed by , and . Its closed unassisted common-classical/Alice–Bob-EPR capacity region is
where the union ranges over distributions with and . Entropies are in bits; denotes the normalized rank-one density matrix. The operational criterion is vanishing maximum joint squared-fidelity error to both common labels and an independent EPR target, with no side communication or preshared resources. Only the dilation is isometric; is discarded from . This provides an exact single-letter formula while retaining jointly in the quantum-rate bound.
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 4, PDF pp.8,10,14: generalized-dephasing CQ capacity, |T|≤|X|.
CE remains joint in the quantum bound; only E is traced for Charlie's information. -/
theorem generalized_dephasing_cq [Nonempty X] [Nonempty C] [Nonempty E]
(D : DephasingData X (C × E)) :
cqGenerationCapacity (generalizedDephasingBroadcast D) = dephasingRegion D (traceRight : Superop (C × E) C) := 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 register index types with decidable equality, and let have norm for every . Define on arbitrary matrices by
Its classical–quantum generation capacity, as defined here, is the closure of the nonnegative pairs satisfying this condition: for every , for every sufficiently large integer , with and , one can choose a unit vector for every , a Bob instrument from the first output to with classical outcome , and a Charlie POVM on with outcome , such that for every the decoded joint state has squared fidelity at least with the state having and an EPR state between the untouched reference and Bob’s quantum output. The instrument consists of finitely many Kraus matrices with ; a POVM consists of positive semidefinite matrices summing to . Squared fidelity is . The asserted capacity equals exactly the set of nonnegative pairs for which there exist and probabilities summing to , such that, writing ,
the inequalities
hold, where with applied by continuous functional calculus. Channel uses are the tensor power , with the outputs grouped by receiver. Zero rates and zero probabilities are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.