Section IV.A–B: amplitude-damping private capacity
OpenQAlgorithms.Papers.Independent.Support50.P07.amplitudeDamping_privateCapacityFor , let be amplitude damping with Kraus matrices and . Then
The maximum is attained; it equals zero for .
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]
/-- Section IV.B, PDF p.6: all physical damping parameters; maximum is attained,
and is zero in the antidegradable regime. t exchanges populations relative to IV.A. -/
theorem amplitudeDamping_privateCapacity [Nonempty E]
(U : Matrix (Fin 2 × E) (Fin 2) ℂ)
(hU : IsIsometry U) (gamma : ℝ) (hg : gamma ∈ Set.Icc 0 1)
(hmap : receiverChannel U = amplitudeDampingChannel gamma) :
fullTracePrivateCapacity U = dampingBound gamma ∧
∃ t : ℝ, t ∈ Set.Icc 0 1 ∧ dampingBound gamma =
binEntropy2 (t * (1 - gamma)) - binEntropy2 (t * gamma) := by sorry
end QAlgorithms.Papers.Independent.Support50.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite nonempty type with decidable equality, every complex matrix satisfying , and every , assume that, for every complex matrix ,
Then
and there exists attaining this supremum:
Here , and is the supremum of nonnegative rates for which every and admit an integer such that, for every integer , there are messages, input density matrices , and positive semidefinite receiver measurement matrices with , satisfying and
All message indices range over , , density matrices are positive semidefinite with trace , and , without a factor . The entire interval for is included; uniqueness of is not asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.