Eqs.(3)–(4): actual target-absent and target-present return–idler states
OpenQAlgorithms.Papers.Independent.Intakenext100.P85.returned_gaussian_pairLet and . Prepare the SPDC number state above, transmit the signal, and retain the idler perfectly. Under replace the signal with an independent thermal mode of mean . Under apply the thermal beam splitter , with independent bath mean . The actual returned pairs are normalized zero-mean Gaussian densities with
where , , , and . The covariance uses and vacuum variance . This supplies the physical hypothesis pair, with bounded realizations of every channel slice included as conclusions.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P85
noncomputable section
open MeasureTheory Filter
open scoped BigOperators ENNReal Topology
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Intakenext100.P85
open QAlgorithms.Papers.Independent.Claimed50.P19 (Cov)
open QAlgorithms.Papers.Independent.Renew46.P41 (coherentProductCoefficient)
/-- Source p.2, Eqs.(3)–(4): actual outputs of replacement/thermal-loss
on the constructed SPDC pair, with idler untouched. Gaussianity and the
covariance identities are conclusions, not channel/input assumptions. -/
theorem returned_gaussian_pair (k NS NB : ℝ) (hk : 0 < k) (hk1 : k < 1)
(hNS : 0 ≤ NS) (hNB : 0 ≤ NB) (W : G.FockWeylSystem 2) :
∀ present : Bool,
TargetRealized 1 present k NB (onePair (spdcArray NS)) ∧
T.IsDensity (qiReturn present k NS NB) ∧
SourceGaussian W (qiReturn present k NS NB) 0 (returnCov present k NS NB) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P85
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all real , , , and every unitary Weyl family on with entries , where
the following holds for both Boolean choices “absent” and “present.” To specify the returned kernel literally, let be the chosen -vector with coordinates
or zero if such a vector does not exist, and put . For any one-mode kernel , let be a chosen bounded operator with those matrix entries, or zero if none exists, and put . Define
The absent signal map is
and the present signal map is
The last sum is over the product index set ; these definitions use total infinite sums. For each idler pair , set , and define the returned kernel . The theorem asserts that both and , for every , are realized by their chosen bounded operators with exactly those matrix entries; this is the stated one-coordinate realization condition, including both intermediate stages. It asserts that , reindexed by two-mode occupations, is a density kernel: it has a coordinate expansion with summable products of -norms, every finite quadratic form is real and nonnegative, and its real diagonal is summable with sum one. It further asserts that its chosen bounded realization has exactly these entries, is positive and self-adjoint, has a representation with summable products of norms, and has summable diagonal of trace one; and, writing
that is symmetric and positive definite, is positive semidefinite for , , and every has summable trace diagonal with
Both zero signal energy and zero background energy are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.