Explicit linear-BSC-to-CSS code conversion
ProvedQAlgorithms.Papers.Independent.Support50.P04.linear_bsc_css_conversionLet , , and let be surjective. Let the injective linear encoder have image , and let the classical syndrome decoder choose with for every syndrome. For , give errors probability . The CSS isometry is ; its decoder measures the syndrome projector and uses Kraus operators . There is an actual CPTP entanglement-transmission code with exactly these maps, , and
Thus the quantum squared entanglement fidelity equals the classical uniform-message average decoding success at the same block length and dimension.
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.16–17: explicit linear-BSC-to-CSS conversion.
Printed parity-check row count log n-log M; changed to n-k for binary [n,k] codes.
The syndrome-consistent decoder and all syndrome outcomes are retained. Its actual
entanglement fidelity equals the classical UNIFORM-message average success. -/
theorem linear_bsc_css_conversion {n k : ℕ} (hn : 0 < n) (hk : k ≤ n)
(H : BinaryWord n →ₗ[ZMod 2] BinaryWord (n-k)) (hH : Function.Surjective H)
(word : BinaryWord k →ₗ[ZMod 2] BinaryWord n) (hword : Function.Injective word)
(hker : LinearMap.range word = LinearMap.ker H)
(estimate : BinaryWord (n-k) → BinaryWord n) (hestimate : ∀ s, H (estimate s) = s)
(gamma : ℝ) (hg0 : 0 ≤ gamma) (hg1 : gamma ≤ 1) :
∃ C : QAlgorithms.Papers.Independent.Information100.P80.TransmissionCode (Fin n → Fin 2) (Fin n → Fin 2),
C.M = 2^k ∧
HEq C.encoder (conjSuperop (cssIsometry word)) ∧
HEq C.decoder (cssDecoder H word estimate) ∧
QAlgorithms.Papers.Independent.Information100.P80.transmissionFidelity (piSuperop (fun _ : Fin n => (QAlgorithms.Papers.Independent.Information100.P27.qubitDephasing (1-2*gamma)))) C = classicalLinearSuccess gamma H word estimate := by sorry
end QAlgorithms.Papers.Independent.Support50.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers with and , let be a surjective linear map, and let be an injective linear map with . Let be any function satisfying for every syndrome , and let . For , define
where values of are represented by . Using the fixed finite-set enumeration of , define the matrix from dimensions into qubits by , define , and define the diagonal matrix by . The assertion is that there exists a transmission code with message dimension exactly , whose encoder, after identifying its message space with dimension , is exactly , and whose decoder is exactly
Both maps are channels, meaning finite Kraus sums with complete Kraus families, and its entanglement fidelity through independent copies of the map preserving diagonal entries and multiplying off-diagonal entries by is exactly
Entanglement fidelity is the overlap with the normalized maximally entangled state of dimension after applying the effective encoded, transmitted, and decoded map to its second half. The cases , giving , and , giving a zero-dimensional syndrome vector space, are included; the subtraction is natural-number subtraction.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.