Section IV.B: amplitude-damping bound for independent phase/amplitude errors
OpenQAlgorithms.Papers.Independent.Support50.P07.independentPauli_privateCapacity_boundLet and define . Set and . Then
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 exact decomposition is retained: with and ,
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, SOURCE DOMAIN CORRECTION: the printed rotated damping
identity uses sqrt((1-2q)^2)=1-2q, so only its q<=1/2 branch is transcribed. At q=1
it would identify conjugation by Y with the identity. The exact equal mixture is
retained, with R=(I+iX)/sqrt(2)=exp(i*pi*X/4). No all-q relabeling is assumed. -/
theorem independentPauli_privateCapacity_bound [Nonempty E]
(U : Matrix (Fin 2 × E) (Fin 2) ℂ)
(hU : IsIsometry U) (q : ℝ) (hq : q ∈ Set.Icc 0 (1 / 2))
(hmap : receiverChannel U = independentPauliChannel q) :
let rot : Matrix (Fin 2) (Fin 2) ℂ :=
(Real.sqrt 2 : ℂ)⁻¹ • (1 + Complex.I • pauliMatrices 1)
independentPauliChannel q = (fun rho =>
(1 / 2 : ℂ) •
(rot * amplitudeDampingChannel (4 * q * (1 - q)) (rotᴴ * rho * rot) * rotᴴ) +
(1 / 2 : ℂ) •
(rot * pauliMatrices 1 *
amplitudeDampingChannel (4 * q * (1 - q))
(pauliMatrices 1 * rotᴴ * rho * rot * pauliMatrices 1) *
pauliMatrices 1 * rotᴴ)) ∧
fullTracePrivateCapacity U ≤ dampingBound (4 * q * (1 - q)) := 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 . With
define
and assume that for every matrix . Put , , and define
Define as the real supremum of rates such that, for every and , there is an integer such that every admits , input density matrices , and a receiver measurement , , for which and
Here density means positive semidefinite of trace , , and has zero entries between distinct classical labels and blocks
Let
where , with . The assertion is both the following equality of maps on all matrices and the following capacity bound:
The endpoints and , hence and , are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.