Exact cat diagonal QEC blocks and large-amplitude ratios
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.cat_diagonalQecprove2quantum
Fix integers and . For real , use the normalized projected-coherent cat basis, and set with residues modulo . Put and . The actual compressed block has entries
For each logical label, as . The comparison Poisson mean varies with amplitude, so this is not convergence to one fixed probability distribution.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P65
open MeasureTheory Filter
open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open scoped ComplexConjugate Matrix Topology
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF pp.10--11 (5.11)--(5.13): exact diagonal blocks and their two coefficients;
the large-a assertion is about ratios, not a fixed limiting Poisson law. -/
theorem cat_diagonalQec (S : ℕ) (g : ℝ) (hg0 : 0 < g) (hg1 : g < 1) (l : ℕ) :
(∀ a > (0 : ℝ), qecBlock (catCodeCoordinates a S) g l l =
fun i j => if i = j then ((poissonWeight a g l * catLossRatio a S g l i : ℝ) : ℂ) else 0) ∧
(∀ a > (0 : ℝ),
qecC (catCodeCoordinates a S) g l l = poissonWeight a g l *
(catLossRatio a S g l 0 + catLossRatio a S g l 1) / 2 ∧
qecZ (catCodeCoordinates a S) g l l = poissonWeight a g l *
(catLossRatio a S g l 0 - catLossRatio a S g l 1) / 2) ∧
(∀ mu : Fin 2, Tendsto (fun a => catLossRatio a S g l mu) atTop (nhds 1)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P65
end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 10, §V B (5.11)–(5.13): exact cat diagonal QEC blocks
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , real with , and natural number , define, for real and integer ,
and, for and , set
The residue difference in is taken in , including negative values. The theorem asserts that, for every ,
and also
Finally, for each , it asserts . There is no upper bound on , and and are included.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.