Section IV.A: private capacity of a degradable erasure channel (domain correction)
OpenQAlgorithms.Papers.Independent.Support50.P07.erasure_privateCapacityLet and . The erasure channel sends an input density operator on to , where the erasure flag is orthogonal to the input subspace. Then
This is the degradable parameter range used by the source's argument.
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.A, PDF p.6, SOURCE DOMAIN CORRECTION: the printed sentence calls
all erasure channels degradable. The argument requires p<=1/2; at d=2,p=1 the printed
RHS is -1. Restrict to the degradable range and retain the positive input dimension. -/
theorem erasure_privateCapacity [Nonempty E]
(d : ℕ) (hd : 0 < d)
(U : Matrix (Option (Fin d) × E) (Fin d) ℂ) (hU : IsIsometry U)
(p : ℝ) (hp : p ∈ Set.Icc 0 (1 / 2)) (hmap : receiverChannel U = erasureMap d p) :
fullTracePrivateCapacity U = (1 - 2 * p) * Real.logb 2 d ∧
QAlgorithms.Papers.Independent.Information100.P80.quantumCapacity (receiverChannel U) =
(1 - 2 * p) * Real.logb 2 d := 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 a finite, nonempty type with decidable equality, let be a positive natural number, and let satisfy . Let , and assume that its receiver map has entries
for . Define as the real supremum of rates such that, for every and , some integer has the property that every admits a positive message count , input density matrices on , and a receiver measurement , , satisfying and
A density matrix is positive semidefinite with trace , , and has zero entries between different classical labels and blocks
Define as the real supremum of nonnegative rates admitting a sequence, for every natural number , of positive message dimensions , encoding channels , and decoding channels , such that their entanglement fidelities
and, for every , eventually. Here is the projector onto , and a channel admits a finite Kraus representation with . Tensor powers act independently on the factors; the sequence includes , using empty tensor products and total division by zero. The assertion is
The cases , , and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.