Theorem 2: private capacity of a degradable channel
OpenQAlgorithms.Papers.Independent.Support50.P07.degradable_privateCapacitySuppose is degradable: there exists a CPTP map from its receiver output to the full complementary output of the same dilation. Let , optimizing over all density operators on the input. Then
Here , the vectors are normalized purifications, and a reference copy suffices.
All quantum registers are finite and nonzero, states have trace one, pure vectors have norm one, and entropy and logarithms are in bits. Operational private capacities use memoryless powers, positive blocklengths and message counts, uniform messages, arbitrary mixed block inputs, and normalized decoding POVMs. A code is good when its joint decoded message/environment state has full trace norm less than the error from a perfectly correlated uniform pair tensor its actual common environment marginal. Rates use every positive error and rate slack at all sufficiently large blocklengths. Symmetric assistance allows one arbitrary finite symmetric channel per block without charging its dimension.
This result supplies a capacity identity or bound for the channel family and resource model stated above.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P07
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Support50.P07
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
dilationPower idealJoint maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (productDilation)
open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation)
variable {A B E C D F : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype E] [DecidableEq E] [Fintype C] [DecidableEq C]
variable [Fintype D] [DecidableEq D] [Fintype F] [DecidableEq F]
/-- Theorem 2, PDF pp.2–3: the unrestricted mixed-input coherent-information optimum,
equivalently the pure-reference/input purification optimum, equals private capacity.
The operational equality Cp=Q announced immediately before the theorem is retained. -/
theorem degradable_privateCapacity [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ)
(hU : IsIsometry U) (hd : IsDegradable U) :
fullTracePrivateCapacity U = maximumCoherentInformation U ∧
maximumCoherentInformation U = purificationCoherentInformation U ∧
fullTracePrivateCapacity U =
QAlgorithms.Papers.Independent.Information100.P80.quantumCapacity (receiverChannel U) := by sorry
end QAlgorithms.Papers.Independent.Support50.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite, nonempty types with decidable equality, and let satisfy . Define and . Assume that there is a channel such that for every matrix , where a channel means a map admitting a finite Kraus representation with . A density matrix is positive semidefinite with trace , and write , with zero eigenvalues contributing zero. Define
For clarity, define as follows. For uses, put , whose entries are . A code consists of a positive integer , density matrices on , and positive semidefinite matrices on with , for . Its decoded joint matrix , indexed by , has zero entries unless both classical labels agree between row and column, and its remaining entries are
Set and . Then is the real supremum of all such that, for every and every , there is for which every admits such a code with and ; here , with no factor in this error. Define as the real supremum of nonnegative rates for which there is a sequence, indexed by every natural number , of positive integers , encoding channels , and decoding channels , such that
where and . Tensor powers act independently on their factors; at they use the empty product, and the displayed rate quotient uses the total convention . The assertion is the conjunction
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.