Fidelity and common-exponent Chernoff product laws
OpenQAlgorithms.Papers.Independent.Intakethird100.P54.product_lawsLet 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.
Let , where each normalized pure factor has one signal mode and an arbitrary finite retained idler register. The factors need not be identical or NDS. The grouped product is normalized, and for each common ,
These identities reduce a product experiment to its individual factors. They do not assert multiplicativity after independently minimizing the exponent in each factor.
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
/-- Product laws for arbitrary, possibly different and non-NDS, pure factors,
PDF p.6, (46)–(47). The same s is used in every factor; optimized coefficients
are not asserted to multiply. Equation (47)'s missing factor subscript is restored. -/
theorem product_laws {M : ℕ} (hM : 0 < M) (c : Channels) (hc : ValidSplitters c)
(J : Fin M → ℕ) (psi : ∀ m, Hilbert (Occupation (Fin (J m)) × Occupation (Fin 1)))
(hpsi : ∀ m, ‖psi m‖ = 1) :
‖productOpticalProbe J psi‖ = 1 ∧
outputFidelity c (productOpticalProbe J psi) = ∏ m, outputFidelity c (psi m) ∧
∀ s ∈ Set.Icc (0 : ℝ) 1,
outputChernoffAt c (productOpticalProbe J psi) s = ∏ m, outputChernoffAt c (psi m) s := 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 with . Let two splitters have reflectances , phases , , and , satisfying and . For each , choose , possibly zero, and a norm-one vector , identifying a one-mode occupation with its single natural-number entry. Define from the function
using that function if it is square-summable and zero otherwise. For any probe with a finite set of signal modes, define when componentwise and zero otherwise, and define its returned kernels by , where . Write for the supremum of over unit square-summable vectors on the probe’s output labels times , with marginals and . A resolution of a kernel means summable nonnegative weights of sum , vectors unit at positive weights and orthogonal at distinct positive weights, and the entrywise representation ; zero-weight vectors are unrestricted. Write
where the resolutions are of , and if and otherwise. Empty defining sets for these real suprema give value . The theorem asserts
There is no additional orthogonality condition on the input probes, and the endpoints use the stated zero-weight convention.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.