Unentangled counting attains the collective Chernoff rate
OpenQAlgorithms.Papers.Independent.Intakenext100.P96.unentangled_countingWork in the retained vacuum/single-photon model, on a signal space with vacuum and orthogonal single-photon modes. Let be the background probability per mode, with , and let be the reflection probability. Set
Let be any unit single-photon vector with zero vacuum amplitude, let , and put .
For this statement assume , , and .
For states , write , including one-sided limits at singular endpoints.
Prepare identical inputs independently with independent background noise, keeping all parameters fixed across trials. Let be the minimum equal-prior error among all joint binary effects on the returned copies. Let
be the minimum error after recording the full number of yes outcomes, for yes probabilities under the two hypotheses. Define
For and ,
Thus the projector measurement repeated on each copy, followed by optimal count-based decisions, attains the collective error exponent. The factor depends only on , independently of and the unit input .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P96
noncomputable section
open Filter
open scoped BigOperators Topology ComplexConjugate ComplexOrder Matrix.Norms.L2Operator
namespace QAlgorithms.Papers.Independent.Intakenext100.P96
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.4--5: counting signal-projector outcomes with optimal classical
postprocessing attains the quantum Chernoff rate, independently of d and psi.
No finite-n equality of collective and counting errors is asserted. -/
theorem unentangled_counting (p : ModelParameters) (hb : 0 < p.b)
(hdb : (p.d : ℝ) * p.b < 1) (heta0 : 0 < p.eta) (heta1 : p.eta < 1)
(psi : EuclideanSpace ℂ (Fin p.d)) (hpsi : IsState psi) :
illuminationChernoffFactor (background p.d p.b) (signalPresent p.b p.eta psi) =
binaryChernoff p.b (p.b * (1 - p.eta) + p.eta) ∧
Tendsto (errorFactor (iidEqualPriorError (background p.d p.b) (signalPresent p.b p.eta psi)))
atTop (nhds (binaryChernoff p.b (p.b * (1 - p.eta) + p.eta))) ∧
Tendsto (errorFactor (countingError p.b (p.b * (1 - p.eta) + p.eta)))
atTop (nhds (binaryChernoff p.b (p.b * (1 - p.eta) + p.eta))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P96
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let consist of and with , , , and , and assume additionally , , and . For any unit vector , define, on , the matrices , with , and . Put and
For each natural number , let and , indexed by ; let
where the first infimum is extended-real and sends either infinity to zero. The theorem asserts
with denoting continuous functional calculus. Both limits run over natural numbers, and all infima over exclude and ; the assumptions permit .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.