Leading-order single-loss cat sweet spot
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.cat_sweetSpotprove2quantum
Consider the projected-coherent cat states with real . Their mean photon numbers are finite. Equality of their mean photon numbers, which is the leading-order no-loss backaction condition, is equivalent to
This is the pole-free form of . It does not assert exact finite-loss correction, nor treat the approximate numerical root as an exact constant.
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.10 (5.9)--(5.10): exact leading-order condition, cross-multiplied to
avoid turning tangent poles into solutions. Rounded numerical roots are not equalities. -/
theorem cat_sweetSpot (a : ℝ) (ha : 0 < a) :
(fockMomentDomain (catCodeCoordinates a 1 0) 1 ∧ fockMomentDomain (catCodeCoordinates a 1 1) 1) ∧
(numberMoment (catCodeCoordinates a 1 0) 1 = numberMoment (catCodeCoordinates a 1 1) 1 ↔
Real.sin (a ^ 2) * Real.cosh (a ^ 2) +
Real.cos (a ^ 2) * Real.sinh (a ^ 2) = 0) := 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 A (5.9)–(5.10): leading-order single-loss cat sweet spot
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real , define, for ,
The theorem asserts that both series and are summable, and that their sums are equal if and only if
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.