Lemma 2, (39)–(40): scalar-block multiplicativity reduction
OpenQAlgorithms.Papers.Independent.Support50.P28.scalar_block_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 and let be single-mode Gaussian channels with equal signs of , including a common zero sign. For real , form physical canonical Gaussian channels with
Their existence is part of the assertion. The tensor product of the original channels is multiplicative at if and only if that of these canonical channels is multiplicative at .
This reduces the multiplicativity question to scalar one-mode blocks. It does not assert symplectic congruence of singular noise to zero or existence of a finite-squeezing optimizer.
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.5, Lemma 2, (39)--(40): scalar-block multiplicativity equivalence.
The canonical channels are constructed in the conclusion; neither their existence
nor any symplectic congruence of rank-one noise is assumed. Common zero signs
are included. Negative signs use global input time reversal in the source. -/
theorem scalar_block_reduction {r : ℕ} (hr : 0 < r)
(E : Fin r → CenteredOscillatorChannel (Fin 1)) (hsign : EqualSigns E)
(p : ℝ) (hp : 1 < p) :
∃ F : Fin r → CenteredOscillatorChannel (Fin 1),
(∀ i, (F i).X = scalarX (E i) ∧ (F i).Y = scalarY (E i)) ∧
(GaussianPurityMultiplicative p E ↔ GaussianPurityMultiplicative p F) := 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 real, and let , , be centered one-mode oscillator channels. Here, for any label set , nuclear matrices have representations with and ; states are nuclear matrices with real nonnegative finite quadratic forms and summable real diagonal of sum . For a finite mode set , set , let have blocks , and define
A state is in if some real symmetric satisfies and, for every , the inner and outer characteristic series are summable and . A channel has real , , , and a matrix map preserving nuclear matrices and additive and complex homogeneous on them. Every finite blockwise extension, obtained by applying to each ancilla-indexed block, sends states to states; this includes all ancilla sizes , with size vacuous. Its specified state output has coefficients , summable characteristic series, and characteristic
for every input state . For a matrix , let be a chosen bounded operator with coefficients , or if none exists, and define
Powers of operators use continuous functional calculus, and in . For channels on blocks , let apply the block maps in increasing order , where a block application is
replaces precisely block of the occupation tuple. Define multiplicativity to mean . Assume the signs of all agree, where the sign is for a negative determinant, for zero, and otherwise; in particular, the all-zero case is included. Then there exists another family of centered one-mode channels , with maps , such that
and
The scalar square roots are real square roots.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.