Repeated joint tests attain the collective Chernoff rate
OpenQAlgorithms.Papers.Independent.Intakenext100.P96.entangled_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
Use the resource , transmitting only the signal and retaining the ancillary photon perfectly. Write , , and .
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
Repeat the ideal joint measurement on each returning signal and its own retained ancilla. With and ,
This states that these separate measurements followed by optimal decisions from the full count attain the unrestricted collective error exponent. It does not identify single-shot error with many-copy error or assert an efficient physical detector.
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.7--8: repeated joint yes/no tests with optimal count postprocessing
attain the collective Chernoff rate. This is not equality of single-shot and
many-copy error probabilities, nor a claim of efficient detector implementation. -/
theorem entangled_counting (p : ModelParameters) (hb : 0 < p.b)
(hdb : (p.d : ℝ) * p.b < 1) (heta0 : 0 < p.eta) (heta1 : p.eta < 1) :
illuminationChernoffFactor (pairAbsent p.d p.b) (pairPresent p.d p.b p.eta) =
binaryChernoff (p.b / (p.d : ℝ)) ((1 - p.eta) * (p.b / (p.d : ℝ)) + p.eta) ∧
Tendsto (errorFactor (iidEqualPriorError (pairAbsent p.d p.b) (pairPresent p.d p.b p.eta)))
atTop (nhds (binaryChernoff (p.b / (p.d : ℝ))
((1 - p.eta) * (p.b / (p.d : ℝ)) + p.eta))) ∧
Tendsto (errorFactor (countingError (p.b / (p.d : ℝ))
((1 - p.eta) * (p.b / (p.d : ℝ)) + p.eta)))
atTop (nhds (binaryChernoff (p.b / (p.d : ℝ))
((1 - p.eta) * (p.b / (p.d : ℝ)) + 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 a natural number and real numbers satisfying , , and , and assume additionally , , and . On the space with basis , put , and define
Write , where powers use continuous functional calculus of real power functions, and put
For every natural , let be one half of the real conversion of the following infimum, taken in the extended real numbers:
where means positive semidefinite; the real conversion sends either infinite extended-real value to . Here tensor powers have entries , so the zeroth tensor power is the matrix with entry . Also define
The declaration asserts the equality and the two limits
where tends to infinity through natural numbers and the roots are real powers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.