§II.C, Eq.(4): single-letter capacity of conjugate degradable channels
OpenQAlgorithms.Papers.Independent.Support50.P01.conjugateDegradable_capacityLet , , and have positive finite dimensions and fixed orthonormal bases. Fix an isometry and define the channel and its genuine complement . Density operators are positive semidefinite with trace one, and all entropies use base-two logarithms with . Write , , and , with arbitrary entangled block inputs. Conjugate degradability means one CPTP map satisfies for every operator ; conjugate antidegradability reverses the receiver and environment in this identity. If is conjugate degradable, then
for some density operator . This is the attained single-letter capacity formula.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P01
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel IsDegradable dilationPower maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)
open QAlgorithms.Papers.Independent.Information100.P08 (maximallyMixed)
open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {a b e c : ℕ}
/-- PDF pp.1,3–4, Eq.(4): single-letter capacity, including attainment. -/
theorem conjugateDegradable_capacity (ha : 0<a) (hb : 0<b) (he : 0<e)
(U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateDegradable U) :
quantumCapacity (receiverChannel U) = maximumCoherentInformation U ∧
∃ rho, IsDensityMatrix rho ∧ coherentInformation (receiverChannel U) rho = maximumCoherentInformation U ∧
∀ sigma, IsDensityMatrix sigma → coherentInformation (receiverChannel U) sigma ≤ coherentInformation (receiverChannel U) rho := by sorry
end QAlgorithms.Papers.Independent.Support50.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive natural numbers and every complex matrix , assume and that there exists a channel such that for every complex matrix , where and . A channel here means a map admitting finitely many matrices with and ; the transpose is ordinary transpose. For a density matrix , meaning and , set
where square roots use continuous functional calculus and . Define
The tensor extension acts by , and applies to each block of the reference register. Then , and there exists a density matrix on such that and for every density matrix on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.