Theorem 4, Eq.(7): Gaussian channel synthesis
ProvedQAlgorithms.Papers.Independent.Bridge50.P16.gaussianSynthesisLet be Gaussian CPTP channels on bosonic modes, with real gain matrices , symmetric noise matrices , and displacement vectors . Use interleaved quadratures with and vacuum covariance . Then their composition is the full Gaussian channel with specification
The specification is the all-input Weyl characteristic-function law, not only a rule for Gaussian input moments. This gives the channel composition used in subsequent loss/amplifier identities.
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P16
noncomputable section
open Filter MeasureTheory
open scoped BigOperators ENNReal NNReal Matrix ComplexOrder
namespace QAlgorithms.Papers.Independent.Bridge50.P16
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
open QAlgorithms.Papers.Independent.Frontier30.P08 (interleavedSymplecticForm)
open QAlgorithms.Papers.Independent.Dependency50.P30 (thermalEntropyBits)
open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)
open QAlgorithms.Papers.Independent.Information100.P34 (choi)
open QAlgorithms.Papers.Independent.Dependency50.P32 (CPTP applyChoi)
/-- Theorem 4, PDF p.3 Eq.(7); known result credited to [45] Eq.(26).
All three affine Gaussian parameters are retained on the full multimode channel. -/
theorem gaussianSynthesis {n : ℕ} (hn : 0 < n)
(E1 E2 : T.Operation (Fin n → ℕ) (Fin n → ℕ))
(M1 M2 V1 V2 : Matrix (PhaseIndex n) (PhaseIndex n) ℝ)
(d1 d2 : PhaseIndex n → ℝ)
(h1 : GaussianSpecification E1 M1 V1 d1)
(h2 : GaussianSpecification E2 M2 V2 d2) :
GaussianSpecification (E2 ∘ E1) (M2 * M1)
(M2 * V1 * M2.transpose + V2) (M2.mulVec d1 + d2) := by sorry
end QAlgorithms.Papers.Independent.Bridge50.P16
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number , put , , and let be the real matrix indexed by with if or , if , and if . The statement concerns arbitrary functions from complex matrices indexed by to such matrices, real matrices indexed by , and real vectors indexed by . To specify its hypotheses and conclusion, call a matrix indexed by any set trace class when there exist sequences such that and for every ; call it a density matrix when it is trace class, every finite quadratic form , for finite and arbitrary , has zero imaginary part and nonnegative real part, and its real diagonal is summable with sum . A function is a channel here when it preserves trace-class matrices, is additive and complex-homogeneous on them, and for every natural number , applying to the -indexed blocks of any density matrix indexed by produces a density matrix; explicitly, this blockwise application has entry
For a complex matrix indexed by , define
where
For each , assume that is a channel in the just-specified sense, ,
and, for every trace-class and every real vector indexed by ,
Then the same complete list of properties holds for with
In particular, the conclusion asserts that this composition is a channel, is symmetric, is positive semidefinite, and its characteristic expression obeys the displayed transformation with these for every trace-class input. All infinite sums in the characteristic expression are the total infinite-sum operation; their summability is not separately assumed or asserted. The finite ancillary dimension includes , for which there are no density matrices to test.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.