Theorem 12: entropy upper bound for a general Pauli channel
OpenQAlgorithms.Papers.Independent.Support50.P07.pauli_privateCapacity_boundLet have sum , and let be the standard qubit Pauli matrices. For the channel , with any full Stinespring realization, one has
The identity endpoint is included; is binary entropy in bits.
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]
/-- Theorem 12, PDF p.7: full probability simplex, including the identity endpoint.
The proof's p_i/s at s=0 is not a hypothesis of this statement. -/
theorem pauli_privateCapacity_bound [Nonempty E]
(U : Matrix (Fin 2 × E) (Fin 2) ℂ)
(hU : IsIsometry U) (p : Fin 3 → ℝ) (hp : ∀ i, 0 ≤ p i)
(hs : ∑ i, p i ≤ 1) (hmap : receiverChannel U = qubitPauliProbabilityChannel p) :
fullTracePrivateCapacity U ≤ 1 - binEntropy2 (∑ i, p i) := 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, and let satisfy . Let satisfy , and assume equality of maps on all complex matrices:
Define as the real supremum of nonnegative rates such that, for every , every sufficiently large positive integer admits , density input matrices on , and a receiver POVM , with . Density matrices are positive semidefinite with trace one, and POVM elements are positive semidefinite and sum to . For the independently applied dilation , let and ; require , using the full trace norm . Then , where , with zero contributions at or . No strict positivity of the individual , nor a restriction , is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.