Binomial-code mean occupation including the single-rail corner
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.binomial_meanprove2quantum
Let be integers and set . Define the two full-Fock states
They are normalized, mutually orthogonal, and have finite first photon-number moments. For their equally weighted logical mixture,
In particular is allowed and gives mean occupation .
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 p.11 (6.2): all nonnegative N,S, including the single-rail corner. -/
theorem binomial_mean (N S : ℕ) :
(∀ mu : Fin 2, fockDomain (binomialCodeCoordinates N S mu) ∧ fockNormSq (binomialCodeCoordinates N S mu) = 1 ∧
fockMomentDomain (binomialCodeCoordinates N S mu) 1) ∧
fockInner (binomialCodeCoordinates N S 0) (binomialCodeCoordinates N S 1) = 0 ∧
codeMoment (binomialCodeCoordinates N S) 1 = ((N + 1 : ℕ) : ℝ) * (S + 1) / 2 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P65
end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 11, §VI (6.2): binomial mean occupation
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of natural numbers , including zero, define , for , by
with zero at all other coordinates. For each , the series is summable and equals , and the series is summable. Furthermore,
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.