Section IV.C: symmetric-assisted depolarizing capacity bound
OpenQAlgorithms.Papers.Independent.Support50.P07.depolarizing_ssPrivateCapacity_boundFor , let , let , and set . Let . Write for the lower convex envelope on , namely the infimum of over finite nonnegative weights summing to one with and . Then
Here is total Pauli error; the QBER is .
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.
The same bound on the unassisted capacity, , is included explicitly.
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.C, PDF pp.6–7: convex envelope of the three displayed ss bounds.
Here p is total Pauli error, not QBER. Above p=1/4 the zero bound suffices, including
where the low-noise damping decomposition no longer applies. -/
theorem depolarizing_ssPrivateCapacity_bound [Nonempty E]
(U : Matrix (Fin 2 × E) (Fin 2) ℂ)
(hU : IsIsometry U) (p : ℝ) (hp : p ∈ Set.Icc 0 1)
(hmap : receiverChannel U = depolarizingChannel p) :
ssPrivateCapacity U ≤ depolarizingEnvelope p ∧
fullTracePrivateCapacity U ≤ depolarizingEnvelope p := 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 satisfy , and let . Using
assume that, for every matrix ,
For a dilation , a code consists of , positive semidefinite input matrices of trace , and a measurement , . Its decoded joint matrix is zero between distinct classical labels and has blocks
Its error is
Define as the real supremum of such that, for every and , some ensures that every admits a code for with and . Define by the same quantifiers, allowing at each block length an arbitrary integer , a code for the dilation
and input density matrices satisfying the separate row and column symmetries
The integer may depend on the tolerances and block length, and has no growth bound in this definition. Write , with , and define
Let be the real infimum of
over every positive integer and real families satisfying , , , and ; zero weights are allowed. The assertion is
Both endpoints and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.