Pure-loss jump times change only a scalar at fixed count
OpenQAlgorithms.Papers.Independent.Intakenext100.P65.pureLoss_jumpTimesLet , let be an integer, and let . Put . Form the chronological trajectory operator by alternating no-jump factors over successive intervals with annihilations, followed by the final no-jump interval. As in (8.3), omit scalar jump-rate factors. Its number-basis formula has a bounded extension to every oscillator Hilbert vector, and
The output is square summable for every square-summable input. No zero-probability branch is normalized. Thus jump times provide only a scalar at fixed loss count. Obtaining the count by parity monitoring separately presupposes fixed initial parity and ideal arbitrarily fast QND parity measurements.
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.22 (8.3)--(8.4): jump-time dependence is a positive scalar for a fixed
lost-photon count. The domain clause excludes renormalization of zero branches.
Parity tracking additionally needs fixed input parity and ideal fast QND measurements;
this operator identity itself is valid on arbitrary physical input vectors. -/
theorem pureLoss_jumpTimes (k t : ℝ) (hk : 0 < k) (ht : 0 < t) (l : ℕ)
(times : Fin l → ℝ) (hord : Monotone times)
(hrange : ∀ i, 0 ≤ times i ∧ times i ≤ t) :
let g := 1 - Real.exp (-k * t)
0 < trajectoryScalar k times g ∧
(∀ v : FockCoordinates, fockDomain v →
fockDomain (jumpTrajectory k t times v) ∧
jumpTrajectory k t times v = (trajectoryScalar k times g : ℂ) • lossVector g l v) := 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 with and , every , and every nondecreasing sequence of times , put and
Then . Moreover, for every complex sequence satisfying , the following output sequence is also square summable: start with , , recursively set and , and finish with . Its coordinates satisfy
No normalization of is assumed, and is included. Times may coincide and may equal either endpoint. The case is included: the time conditions are vacuous, , and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.