Attainable fixed-inner coset-entropy concatenation rate
OpenQAlgorithms.Papers.Independent.Support50.P40.cosetEntropy_rateFix a normalized additive inner code, , and complete syndrome and logical-Pauli coset representatives. Its phase-inclusive commuting stabilizer excludes and has independent generators. For independent depolarization with , define and , where ranges over the four logical Paulis and over syndromes. Write for finite entropy in bits, with , and set .
The signed yield satisfies
If , it is attainable by keeping this inner code fixed and increasing the additive outer block size. Precisely, for every , all sufficiently large outer sizes admit logical qubits, an additive outer isometric encoder, and a local CPTP decoder such that . One choice of encoder and decoder works for every normalized unknown input with fidelity at least , and has entanglement fidelity at least . The scheme uses physical noisy channel calls and no preshared entanglement or side communication.
Attainability is attributed by the paper to Shor–Smolin [14]; the compact coset formula is the present paper's derivation. Negative signed yields are not negative capacities.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P40
namespace QAlgorithms.Papers.Independent.Support50.P40
open QAlgorithms QAlgorithms.Stabilizer
open scoped ComplexConjugate Matrix
noncomputable section
/-- PDF pp.11--13, Eqs.(13)--(20), Fig.4 p.28. Attainability of the
concatenation scheme is attributed on p.11 to Shor--Smolin [14],
quant-ph/9604006; this paper derives its coset-entropy expression. The
positive signed yield is attained by this fixed-inner scheme, not merely
bounded by an unrelated capacity parameter. -/
theorem cosetEntropy_rate {m : ℕ} (C : InnerCode m) (T : CosetChoices C)
(f : ℝ) (hf0 : 0 ≤ f) (hf1 : f ≤ 1) :
signedYield C T f = (1 - conditionalBellEntropy C T f) / (m + 1) ∧
(0 < signedYield C T f → FixedInnerAchievable C f (signedYield C T f)) := by sorry
end
end QAlgorithms.Papers.Independent.Support50.P40
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any natural number, put , and write . For a Pauli label string , let be its tensor product of the usual matrices , with , and let count its nonidentity entries. Write for the subgroup of unitary matrices generated by all on qubits, where . The inner-code data consist of an abelian subgroup containing no , and orthonormal vectors spanning exactly the common fixed space of . Define the label sets
and require . Let be the matrix with columns . Multiplication of labels discards Pauli phases, equivalently adding modulo the pairs , , , at each coordinate. The representative data are strings , indexed by , and , indexed by Pauli labels , such that is the all-identity string, every label string belongs to exactly one set , every , every element of belongs to exactly one set , and for every complex matrix . For every real satisfying , define
The total real logarithm gives a zero contribution at a zero entry. The theorem asserts
and further asserts the following implication if . For every and , there is a natural number such that, for every natural number , there exist a natural number , an encoder matrix , and a decoding map from matrices on to matrices on , with
The range of must be the common fixed space of some abelian subgroup containing no . The map must admit a finite Kraus representation with . Define
where and , and define the transmission map
Here is the linear tensor product map, applying to each matrix factor. For
the required conclusions are
and, for every vector with ,
The statement allows , , and ; empty tensor products have value . When , the achievability implication imposes no requirement.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.