Proposition 3: arbitrary invertible multimode factors at p=2
OpenQAlgorithms.Papers.Independent.Support50.P28.multimode_two_purity_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 be Gaussian channels, where factor acts on complete modes. Assume for every . Then
The partition is by channels, each of which may have several modes. No equal-sign, equal-determinant, or positive-definite-noise hypothesis is imposed. The norm here is the Schatten -norm, whose square is ordinary purity.
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, Proposition 3: arbitrary invertible multimode channel factors at
p=2. No equal-sign, equal-determinant or strictly positive noise restriction. -/
theorem multimode_two_purity_multiplicative {r : ℕ} (hr : 0 < r)
(m : Fin r → ℕ) (hm : ∀ i, 0 < m i)
(E : (i : Fin r) → CenteredOscillatorChannel (Fin (m i)))
(hX : ∀ i, (E i).X.det ≠ 0) : GaussianPurityMultiplicative 2 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 a natural number for every , and let be a centered oscillator channel on the mode set . Assume for every . The state and channel requirements are these: a matrix on a label set is nuclear if for with , and it is a state if its finite quadratic forms are also real and nonnegative and its real diagonal is summable with sum . For finite , let , , and
A state belongs to when some real symmetric satisfies and, for every , each inner characteristic series and the outer series are summable and . Each channel has real satisfying and . Its matrix map preserves nuclear matrices, is additive and complex homogeneous on them, and preserves states under every finite blockwise ancilla extension, including the vacuous size . Its specified output state has coefficients , summable characteristic series, and characteristic
for every input state. Let be a chosen bounded operator with coordinate coefficients if one exists, and otherwise, and define
where the operator power is the continuous functional calculus power and in . On , form by applying block maps in increasing order, where
Then
The block sizes and number of blocks are all positive; the purity exponent in this assertion is exactly .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.