Manuscript Em04-A@2 · Em04-A-v2.tex · theorem · f5b28abc
Theorem: Probability comparison with arithmetic error
Compressed oscillator position measurements › Separate preparation, tail, quadrature, and arithmetic errors · lines 1288–1338 · proof included or linked
Em04-A@2#thm:bosonerror, Em04-A@2#eq:bosonbudget, Em04-A@2#eq:tail
Let be an oscillator state, a density matrix on , and a Hermitian numerical matrix with a certified bound
Then
The tail term is bounded by
The preparation term can use (eq:stateerror) and (eq:dispbound). A separately rounded scalar evaluation of the trace requires its own additional certified error.
Proof. Insert the exact probabilities for on , then on , followed by the exact trapezoidal value. The effect inequality in Lemma lem:projection, the outside-domain probability, Theorem thm:trap, and the arithmetic norm bound control the four differences.
The pointwise inequality proves the first tail bound. For a vector ,
A convex decomposition proves the mixed-state bound.
Displayed formulas in this passage
Em04-A@2#eq:bosonbudget · line 1298
Em04-A@2#eq:tail · line 1311
unlabeled · line 1293
unlabeled · line 1331