Lemma 1: pure Gaussian input reduction
OpenQAlgorithms.Papers.Independent.Support50.P28.pure_gaussian_input_reductionConsider 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 be any centered Gaussian channel on modes and let be real. Let be the centered pure Gaussian densities, where pure means the rank-one density of a unit vector. Then
This permits optimization over pure Gaussian inputs. It is an equality of suprema, with no assertion that either supremum is attained; no convexity of is imposed.
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.4, Lemma 1, (34): supremum reduction, with no optimizer assertion.
The channel's all-density law includes the displaced pure states in its proof. -/
theorem pure_gaussian_input_reduction {n : ℕ} (hn : 0 < n)
(E : CenteredOscillatorChannel (Fin n)) (p : ℝ) (hp : 1 < p) :
maximalOutputPurity p E.map = pureMaximalOutputPurity p E.map := by sorry
end QAlgorithms.Papers.Independent.Support50.P28
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Fix and a real . For a label set , call a matrix nuclear if it has entries , where and ; call it a state if it is nuclear, all its finite quadratic forms are real and nonnegative, and its real diagonal is summable with sum . For a finite mode set , take , and let have the blocks . Define
Let consist of states for which there exists a real symmetric with positive semidefinite such that, for every real , each inner series and the outer series defining are summable and . Let be the states in whose entries are for some with . A centered oscillator channel supplies real matrices , a map on all coefficient matrices, and a state-valued output assignment with coefficients . Its requirements are , positive semidefinite, preservation of nuclear matrices, additivity and complex homogeneity on nuclear matrices, and preservation of states under every finite blockwise extension
including the vacuous state requirement when . For every input state and every , the output characteristic series are summable as above and
For any matrix , choose a bounded operator with coordinate coefficients if one exists, and otherwise set ; put
using continuous functional calculus powers, extended nonnegative real powers, and . For every such channel on , the asserted equality is
Both sides are suprema in ; the statement does not assert that either supremum is attained.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.