EPR geometric loss probabilities and sector overlaps
OpenQAlgorithms.Papers.Independent.Intakethird100.P54.epr_loss_coefficientsLet 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 .
For one signal-idler pair and per-pair signal energy , the normalized NDS state is
Its mean signal energy is . The actual loss probability and overlap, with convergent defining series, satisfy
The integer powers give at and all positive-loss sectors vanish. This is the sector data for the EPR fidelity and Chernoff formulas.
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
/-- EPR geometric loss probabilities and loss-sector overlap, PDF p.9, (73)–(75).
N is per-pair signal energy, not total energy of a multipair probe. -/
theorem epr_loss_coefficients (c : Channels) (hc : ValidSplitters c) (hr : Reading c)
(N : ℝ) (hN : 0 ≤ N) :
Memℓp (tmsvCoefficients 1 N) 2 ∧ ‖tmsvProbe 1 N‖=1 ∧
HasSignalEnergy (tmsvProbe 1 N) N ∧ IsNDS (tmsvProbe 1 N) ∧
(∀ b k, lossProbability c (tmsvProbe 1 N) b (fun _ => k)=
(((1-(c b).reflectance)*N)^k / ((1-(c b).reflectance)*N+1)^(k+1))) ∧
(∀ k, Summable (lossOverlapTerm c (tmsvProbe 1 N) (fun _ => k)) ∧
lossOverlap c (tmsvProbe 1 N) (fun _ => k)=
(((c false).t*(c true).t*N)^k / ((1-(c false).r*(c true).r)*N+1)^(k+1) : ℝ)) := 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 consist of splitters indexed by , with reflectances and phases , satisfying , , and , and let satisfy . Write and , and identify each one-mode occupation function with its unique natural-number value. Define by
and let be this coefficient function if it is square summable, and the zero vector otherwise. For , define if , and otherwise. Let be the coefficient function as an vector if square summable, and otherwise, and put . The assertion is that is square summable, , is summable with , and
Furthermore, every and satisfy
and for every , the complex-valued family is summable and
where the real number on the right is regarded as a complex number. The statement includes , , and reflectance endpoints; zeroth powers, including , equal , and all the displayed denominators are positive under the hypotheses. Infinite sums use the total-sum convention, giving for a nonsummable family, although summability is explicitly asserted for the moment and overlap families above.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.