Explicit Fock Chernoff optimizer and exponent
OpenQAlgorithms.Papers.Independent.Intakethird100.P54.fock_chernoffLet be the finite number of signal modes and the finite number of retained idler modes, on the full optical Fock spaces. The two channels have equal priors, independent vacuum environments, reflectances , field magnitudes and , and distinct complex reflection coefficients . Every signal mode sees the same channel; idlers are retained losslessly and environment outputs are inaccessible. Write for squared Uhlmann fidelity, for minimum average error over all joint binary receivers, , and , with zero powers interpreted as support projections. Here the common phase is removed, so and . Put .
Assume , and let a Fock probe have total photon number . Put , , and
Then minimizes , , and
The per-photon gain is defined by with . It is not asserted to be large for all channels. At , .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P54
noncomputable section
open scoped BigOperators ComplexConjugate
open MeasureTheory Filter
namespace QAlgorithms.Papers.Independent.Intakethird100.P54
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)
open QAlgorithms.Papers.Independent.Dependency50.P39 (coherentCoefficient)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- Number-state Chernoff bound and derived optimizer, PDF p.8, (66)–(69).
The gain is a defined per-photon ratio, not a universal large-gain claim. -/
theorem fock_chernoff {M : ℕ} (hM : 0 < M) (c : Channels)
(hc : ValidSplitters c) (hr : Reading c) (h0 : 0 < (c false).reflectance)
(h1 : (c true).reflectance < 1) (n : Occupation (Fin M)) :
fockOptimizer c ∈ Set.Icc (0 : ℝ) 1 ∧
(∀ s ∈ Set.Icc (0 : ℝ) 1,
outputChernoffAt c (fock n) s=(fockCoefficient c s)^photons n ∧
fockCoefficient c (fockOptimizer c) ≤ fockCoefficient c s) ∧
outputChernoff c (fock n)=(fockCoefficient c (fockOptimizer c))^photons n ∧
outputError c (fock n) ≤ (fockCoefficient c (fockOptimizer c))^photons n/2 ∧
(fockCoefficient c (fockOptimizer c))^photons n =
Real.exp (-numberExponent c*(photons n : ℝ)) ∧
exponentGain c=numberExponent c/coherentExponent c := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P54
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let satisfy , and let consist of two splitters with reflectances and phases , satisfying , , , , and . Fix , set , and let be the unit coordinate vector at in . Define for , and otherwise, and , where . A resolution of a kernel is , with nonnegative summable weights totaling , unit vectors at positive weights, and orthogonality between distinct positive-weight vectors; zero-weight vectors are unrestricted. Put
where and otherwise. Define as the real infimum over these resolutions and bounded complex-linear satisfying and , of . The suprema and infima are real, with value on empty defining sets; infinite sums have value if not summable. Define the following real quantities, using real powers in :
The assertion is that , that every satisfies
and that
It also asserts that the quantity named exponent gain, whose definition is the ratio of the number exponent to the coherent exponent , equals . The occupation vector is allowed, so is included and the powers with exponent then equal ; no uniqueness of is asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.