Corrected clipped coherent-information capacity formula
OpenQAlgorithms.Papers.Independent.Support50.P39.clippedCoherentCapacityLet be a positive semidefinite density operator of trace one on two nonzero finite dimensional complex registers and , whose dimensions may differ. Alice and Bob receive arbitrarily many independent copies of this one fixed state for free. Alice may send quantum systems to Bob through a noiseless channel; there is no free classical communication or feedback. Arbitrary local CPTP encodings, ancillas, disposal, and joint decoding are allowed. Entropies use logarithms to base two.
Write for the operational supremum of classical bits per transmitted qubit: first choose integers and ; a block of channel uses sends a system of dimension and consumes copies. For each error tolerance and rate slack, all sufficiently large positive admit encoders for all -bit messages and one common decoder whose success is at least for every message. The normalized rate is , with vanishing error and arbitrarily small rate slack.
For every positive integer and every CPTP map with arbitrary positive finite output dimension, put . Write , , and . Quotients below range only over outputs with .
Let be the set of all corresponding positive-entropy quotients , and let be the mutual-information quotient set above. Then
The set is nonempty and contained in . This reformulation displays the compression tradeoff between positive coherent information and the sender's entropy.
Formalization Note The denominator printed as in Eq. (5) is corrected to the processed entropy , exactly as in Eq. (15). The equivalence holds after optimization and inclusion of baseline one; it is not a pointwise equality of clipped and signed quotients.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P39
namespace QAlgorithms.Papers.Independent.Support50.P39
noncomputable section
open QAlgorithms
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- arXiv:quant-ph/0106080v3, PDF p.3 Eq. (5), corrected using PDF p.7 Eq. (15),
and p.8. CORRECTION: S(rho_A) printed in Eq. (5) is replaced with the
entropy of Lambda(rho_A tensor n), as explicitly printed in Eq. (15).
For an entangled pure state, the printed denominator would give 1+n rather
than 2 under identity preprocessing. The mutual-information form agrees only
after optimization AND inclusion of baseline 1; no pointwise clipped identity
with mutual information is asserted for negative signed coherent information. -/
theorem clippedCoherentCapacity {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] [Nonempty A] [Nonempty B]
(rho : Matrix (A × B) (A × B) ℂ) (hrho : IsDensityMatrix rho) :
(coherentRatios rho).Nonempty ∧ BddAbove (coherentRatios rho) ∧
(∀ r ∈ coherentRatios rho, 0 ≤ r ∧ r ≤ 1) ∧
denseCodingCapacity rho = 1 + sSup (coherentRatios rho) ∧
max 1 (sSup (mutualRatios rho)) = 1 + sSup (coherentRatios rho) := by sorry
end
end QAlgorithms.Papers.Independent.Support50.P39
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be finite, nonempty types with decidable equality, and let be a positive semidefinite complex matrix on with trace . Write , where is applied by continuous functional calculus, and write for the partial traces over Bob and Alice. A channel means a map for some finite family with . Let . For every positive integer , positive output dimension , and channel , put , where acts on each Alice matrix block with Bob's indices fixed. Let and respectively consist of the ratios
over precisely these choices with . Define the operational capacity as the real supremum of the following rates : , and there exist integers such that, for every and every , there is so that every with admits an satisfying , channels for all -bit strings , and positive semidefinite matrices on , satisfying and for every . The declaration asserts that is nonempty and bounded above, that every satisfies , and that
Zero-message codes are allowed, while ratios with zero Alice entropy are excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.