Erasure cpp coding: exact integer-message fidelity and normal approximation
OpenQAlgorithms.Papers.Independent.Support50.P04.erasure_exact_and_expansionLet be a CPTP channel on finite positive-dimensional complex Hilbert spaces with fixed orthonormal bases. Write and for the maximum unassisted and classical-post-processing assisted entanglement-transmission rates. A code has a positive integer message dimension , rate , and squared fidelity to the normalized maximally entangled target at least . A cpp encoder may retain sender memory; its decoder is LOCC across that memory and the receiver outputs, with its final quantum output at the receiver and no preshared entanglement. For the pure-flag qubit erasure channel , with , every integer has optimal cpp squared fidelity
An actual cpp code with this message dimension attains this value. Fix . All logarithms are binary and is the standard Gaussian quantile. Remainder constants may depend on the fixed channel and error, and are chosen before the block length: there are and such that the displayed bound holds for every integer . If , then
The finite-block formula retains both channel endpoints and integer-message rounding.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P04
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
open QAlgorithms
namespace QAlgorithms.Papers.Independent.Support50.P04
variable {A B E : Type} [Fintype A] [DecidableEq A]
variable [Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]
/-- arXiv:1504.04617v2, PDF pp.5–6,18–19, Result 2, Eqs.(8)–(9),(69)–(70).
Printed Eq.(8) is an inversion shorthand; changed to exact fixed-INTEGER-M
optimal fidelity and attainment. Integer rounding need not saturate epsilon.
Only the Gaussian clause excludes beta=0,1; the exact clause includes them. -/
theorem erasure_exact_and_expansion (beta : ℝ) (hb0 : 0 ≤ beta) (hb1 : beta ≤ 1) :
(∀ n M : ℕ, 0 < n → 0 < M →
optimalCppFidelity (QAlgorithms.Papers.Independent.Renew46.P36.flaggedErasure (A := Fin 2) beta) n M = (erasureFidelityFormula beta n M : EReal) ∧
∃ C : CppCode (Fin n → Fin 2) (Fin n → Option (Fin 2)),
C.M = M ∧ cppFidelity (piSuperop (fun _ : Fin n => (QAlgorithms.Papers.Independent.Renew46.P36.flaggedErasure (A := Fin 2) beta))) C = erasureFidelityFormula beta n M) ∧
(0 < beta → beta < 1 → ∀ epsilon : ℝ, 0 < epsilon → epsilon < 1 →
constantRemainderExpansion (fun n => cppBoundary (QAlgorithms.Papers.Independent.Renew46.P36.flaggedErasure (A := Fin 2) beta) n epsilon)
(1-beta) (beta*(1-beta)) epsilon) := by sorry
end QAlgorithms.Papers.Independent.Support50.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with , let map matrices to matrices indexed by , with ordinary block , entry equal to , and all cross entries zero. A code for a channel consists of positive integers , a channel , and a channel ; channels are finite Kraus sums with . The decoder must satisfy this additional receiver rule: there are positive integers , isometries , , a map on , and a channel such that . The required property of is the following countable-history limit condition. An instrument has completely positive complex-linear branches, its branch outputs are summable for every matrix, and their sum preserves trace; complete positivity means positivity after amplification by every finite identity register. A local round has branches that are tensor products of two local maps, with one party’s maps forming an instrument and the other party’s map a channel for each outcome. A raw history instrument starts with a local round and extends by applying an outcome-dependent local round to each previous branch, encoding each pair of successive history labels by the fixed pairing of natural numbers. There must be a sequence of raw history instruments, each having a positive finite number of rounds and each extending its predecessor by one such round, and single-outcome instruments obtained from by coarse-graining their outcomes, such that
where the identity register has the same dimension as , and coarse-graining means summing branches over fibers of a function on outcome labels. For such a code, define , where the swap puts the retained -register first, and define , with . The theorem asserts that for every natural and , the supremum in the extended reals of these fidelities over all such codes for having logical dimension exactly equals the real number
embedded in the extended reals, and that an individual such code attains this number. Moreover, if , then for every , writing
as an extended-real supremum, there exist and a natural such that every satisfies
Here , is the infimum of the real for which the standard normal integral up to is at least , and . The exact finite-block assertion includes , with zeroth powers equal to ; the expansion requires the strict interior conditions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.