bin(2,1) syndrome unitary and its eigenspaces
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.binomial_smallSyndromeFor bin, let be the normalized codewords, supported on occupations . In the invariant space define , , and . These seven vectors form an orthonormal basis. Embed the standard spin- on the even occupations and spin- on the odd occupations. Then the unitary
has eigenvalues on , on , on , and on . Thus its eigenspaces distinguish the listed error sectors without distinguishing the logical label. The dephasing residual coefficient is ; printed (6.20)'s coefficient 2 is false. Identity extension acts outside this finite invariant subspace.
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.17 (6.21), Table III: orthonormal syndrome eigenspaces for I,a,n.
The seven-dimensional space is an invariant subspace of this finite-support example,
not a global oscillator cutoff. Printed (6.20) uses coefficient 2; the residual
is normalized by sqrt(3), its actual norm from variance 3, to preserve the
Table III rays. The printed equality itself remains separately deferred. -/
theorem binomial_smallSyndrome :
(let B : Matrix (Fin 7) (Fin 7) ℂ := fun n j => smallBasis j n
Bᴴ * B = 1) ∧
smallUnitaryᴴ * smallUnitary = 1 ∧
(∀ j : Fin 7, smallUnitary.mulVec (smallBasis j) =
Complex.exp (Complex.I * (if j.val < 2 then 6 * Real.pi / 5
else if j.val < 4 then 4 * Real.pi / 5 else if j.val < 6 then 2 * Real.pi / 5 else 0)) •
smallBasis j) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P65
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be the complex matrix whose columns, indexed by , are
Let have diagonal , off-diagonal entries and , and all other off-diagonal entries zero, and put . The theorem asserts , , and, writing for column of ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.