Section V final unnumbered result: conformally symplectic multimode factors
OpenQAlgorithms.Papers.Independent.Support50.P28.conformal_multimode_multiplicativeConsider finitely many complete bosonic modes, with no photon cutoff or energy constraint. Covariances use the interleaved coordinates , , and doubled vacuum covariance . A centered Gaussian channel is an actual completely positive trace-preserving map, with covariance action and , where are real, , and .
Write for the normalized centered Gaussian densities and, for real , put . For a finite channel family, multiplicativity means equality of the joint Gaussian-input supremum to the product of the factor suprema; joint inputs may be entangled.
Let and let act on modes. Suppose , where and , with the canonical form on those modes. Then for every real ,
This is the explicit last-paragraph scope in Section V. The scalars need not agree, and the noise matrices need not be positive definite. The paper's explanation through Proposition 2 does not establish the unequal-scalar case as written; that proof issue is recorded without adding an absent hypothesis.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P28
noncomputable section
open scoped BigOperators ENNReal ComplexOrder Matrix
namespace QAlgorithms.Papers.Independent.Support50.P28
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsDensity IsTraceClassChannel rankOne)
open QAlgorithms.Papers.Independent.Claimed50.P47
(Occupation gaussianStateCharacteristic singleCharacteristic weylKernel)
open QAlgorithms.Papers.Independent.Claimed50.P30 (phiMinus)
/-- PDF p.7, last paragraph: the written conformally symplectic multimode
scope, without equality of the positive scalar factors and without Y>0.
The source's claimed implication from Proposition 2 is an incomplete proof route;
the explicit statement is retained unchanged, with this issue recorded. -/
theorem conformal_multimode_multiplicative {r : ℕ} (hr : 0 < r)
(m : Fin r → ℕ) (hm : ∀ i, 0 < m i)
(E : (i : Fin r) → CenteredOscillatorChannel (Fin (m i)))
(x : Fin r → ℝ) (hx : ∀ i, 0 < x i)
(S : (i : Fin r) → OscillatorCovariance (Fin (m i)))
(hS : ∀ i, PreservesInterleavedSigma (S i)) (hX : ∀ i, (E i).X = x i • S i)
(p : ℝ) (hp : 1 < p) : GaussianPurityMultiplicative p E := by sorry
end QAlgorithms.Papers.Independent.Support50.P28
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let be natural numbers for , and let be centered oscillator channels on . For each , let be real and let be a real matrix on satisfying
Fix a real . In the state spaces used here, a matrix on is nuclear when with and ; it is a state when its finite quadratic forms are also real and nonnegative and its real diagonal is summable with sum . For finite , put and define
The centered Gaussian states are states admitting a real symmetric with such that, for every , the inner and outer characteristic series are summable and . A channel requires real , , , preservation of nuclear matrices, additivity and complex homogeneity on that class, and state preservation under every finite blockwise ancilla extension; size is included and vacuous. Its specified output is a state with coefficients , summable characteristic series, and
for every input state. For any coefficient matrix , choose a bounded operator with those coefficients if one exists, and otherwise use ; define
with continuous functional calculus powers and in . On , define by applying blocks successively, with block acting by
Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.