Corrected exact Fock ideal-memory error
OpenQAlgorithms.Papers.Independent.Intakethird100.P54.fock_ideal_errorLet 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 . For any multimode Fock occupation with total signal photon number ,
Photon counting followed by decision one exactly when the total returned count equals is optimal, including the tie.
Source correction. Printed equation (71) contains an extraneous before . The counting rule and the next paragraph's equality force the displayed correction; the printed formula would be negative. Independent moderation of this correction remains required.
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
/-- Exact Fock ideal-memory error, PDF p.9, (71)–(72). SOURCE CORRECTION:
printed (71) has an extraneous 'ln' before 1/2. It is deleted here because the
printed counting rule and the following equality Pe=F/2 force R0^K/2; a logarithm
would make a probability negative. Preserve the printed formula in items/HARD. -/
theorem fock_ideal_error {M : ℕ} (hM : 0 < M) (c : Channels)
(hc : ValidSplitters c) (hr : Reading c) (h1 : (c true).reflectance=1)
(n : Occupation (Fin M)) :
outputError c (fock n)=(c false).reflectance^photons n/2 ∧
outputError c (fock n)=outputFidelity c (fock n)/2 ∧
outputError c (fock n)=outputChernoff c (fock n)/2 ∧
∃ E, IsOpticalEffect E ∧ CountsAs E (fun q => decide (photons q=photons n)) ∧
sectorRisk c (fock n) E (1/2) (1/2)=outputError c (fock n) := 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 specify splitters with reflectances and phases , satisfying , unequal fields , , and . Fix , put , and let be the unit coordinate vector at in . Set for , and otherwise, and define , , and as the coefficient function if square summable, and as the zero vector otherwise. A resolution of a kernel is , with nonnegative summable weights totaling , unit vectors at positive weights, and orthogonality for distinct positive-weight vectors; zero-weight vectors are unrestricted. Define as the real infimum over resolutions and bounded complex-linear effects , satisfying and , of . Define as the real supremum of over norm-one , where , whose marginals and equal , respectively. Finally put
where and otherwise. All extrema are real, with value for empty defining sets, and infinite sums have value if not summable. The assertion is
and there exists an effect such that, for every vector and label , if , and otherwise, and such that
The hypotheses allow and ; every zeroth power, including , is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.