Cat normalization, annihilation eigenoperator and loss syndromes
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.cat_checksLet be an integer and a real coherent amplitude. Set , , and for . All are positive, these two states are normalized and orthogonal, and
The states belong to the natural domain of the annihilation power. For , the loss Kraus operator and satisfy for . These phases are distinct. Its specified square root acts on the two logical states with eigenvalues . Thus the check distinguishes these loss counts, with residues repeating thereafter.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
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 p.9 (5.5)--(5.7): normalization, annihilation eigenoperator, and the
S+1 distinct loss syndromes, with normalized physical states on the full domain.
The printed claim of non-unit-modulus check eigenvalues is a source slip and is omitted. -/
theorem cat_checks (a : ℝ) (ha : 0 < a) (S : ℕ) (g : ℝ) (hg0 : 0 < g) (hg1 : g < 1) :
(∀ r : ℤ, 0 < catNorm a S r) ∧
(∀ mu : Fin 2, (catNorm a S ((S + 1) * mu.val : ℕ) : ℂ) = catNormFourier a S mu) ∧
(∀ mu : Fin 2, fockDomain (catCodeCoordinates a S mu) ∧ fockNormSq (catCodeCoordinates a S mu) = 1 ∧
annDomain (2 * (S + 1)) (catCodeCoordinates a S mu) ∧
annPower (2 * (S + 1)) (catCodeCoordinates a S mu) = (a : ℂ) ^ (2 * (S + 1)) • catCodeCoordinates a S mu) ∧
fockInner (catCodeCoordinates a S 0) (catCodeCoordinates a S 1) = 0 ∧
(∀ mu : Fin 2, residueLogicalZ S (catCodeCoordinates a S mu) = (-1 : ℂ) ^ mu.val • catCodeCoordinates a S mu) ∧
(∀ (l : Fin (S + 1)) (mu : Fin 2),
residueCheck S (lossVector g l.val (catCodeCoordinates a S mu)) =
Complex.exp (-Complex.I * (2 * Real.pi * (l.val : ℝ) / (S + 1))) •
lossVector g l.val (catCodeCoordinates a S mu)) ∧
Function.Injective (fun l : Fin (S + 1) =>
Complex.exp (-Complex.I * (2 * Real.pi * (l.val : ℝ) / (S + 1)))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real , natural number , and real with , put , and define
where denotes an indicator. For a complex sequence , define
The theorem asserts all of the following jointly: for every integer ; for each ,
as an equality in ; each series is summable and equals , the series is summable, and ; moreover,
For every , every , and every , it also asserts
and the map is injective on . The case is included; then this last domain is a singleton.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.