Definitions for Multiplicativity of maximal output purities of Gaussian channels under Gaussian inputs
DefinitionQAlgorithms_Papers_Independent_Support50_P28The objects the formalized statements of Multiplicativity of maximal output purities of Gaussian channels under Gaussian inputs (arXiv:quant-ph/0406065) are stated in. Each was checked against the paper by a blind read-back and a moderator.
OscillatorPhase: PDF p.2: the source interleaved coordinate order.OscillatorCovariance: PDF p.2: real covariance arrays, not density matrices.OscillatorCoeff: PDF pp.2--3: arrays of actual oscillator-operator oscillatorCoefficients.interleavedSigma: PDF p.2: canonical interleavedSigma with sigma_xp=+1, sigma_px=-1.groupedIndex: PDF p.2: permutation to the accepted grouped Weyl coordinates; no rescaling.groupedVector: PDF p.2: source phase vector in the accepted grouped coordinates.groupedCovariance: PDF p.2: covariance permutation used only for the accepted Weyl formula.oscillatorCharacteristic: PDF p.2, (4): oscillatorCharacteristic of the actual density, with the fixed Fock Weyl kernel.WeylTraceSummable: PDF p.2, (4): convergence of both sums in the trace/Weyl pairing. Each row is an l2 pairing; the outer series is a trace-class/bounded trace.PhysicalOscillatorCovariance: PDF p.2, corrected (6)--(8): physical symmetric doubled covariance.HasCenteredGaussianCovariance: PDF pp.2--3: centered Gaussian ACTUAL density with its covariance. Normalization and nuclear trace class are carried by State. The corrected oscillatorCharacteristic exponent is -xi^T interleavedSigma^T G interleavedSigma xi/4, not printed (6).IsCenteredGaussianDensity: PDF p.2: all centered Gaussian densities, without an energy bound.IsPureOscillatorDensity: PDF pp.2,4: purity is a rank-one density of a unit vector; no infinite squeezing.OscillatorOperator: PDF p.3: operators on the completed oscillator space, never a photon truncation.oscillatorNumberBasis: PDF p.3: complete number basis of l2.oscillatorCoefficients: PDF p.3: row=bra, column=ket, with conjugate-linearity on the bra.realizeOscillatorCoeff: PDF p.3: unique bounded realization of an operator array when it exists. All arrays used as states are nuclear (State or CPTP output), hence have a unique realization on the completed number basis. The off-domain zero is not a state.positivePower: PDF p.3, (24): genuine positive spectral functional calculus, independent of G.tracePower: PDF pp.3--4, (24),(27): positive spectral trace, retaining infinity rather than a default-zero nonsummable real trace. On a density and p>1 it is finite.pNorm: PDF p.3, (24): Schatten p-norm of an actual density, extended off its domain.gaussianCovarianceMap: PDF p.3, (18): fixed covariance action; the transpose is on the left.GaussianCPCondition: PDF p.3, (16): full Hermitian CP condition, including singular noise.gaussianWeylArgument: PDF p.3: the Weyl-coordinate pullback compatible with (18).noiseMultiplier: PDF p.3: source quadratic noise in the same Weyl coordinates, with /4.CenteredOscillatorChannel: PDF p.3, (15)--(19), interpreted consistently with (18): an actual CPTP map on ALL trace class. Its defining Weyl law holds for every density, not just Gaussian inputs. No output-purity or multiplicativity assertion is a field.maximalOutputPurity: PDF p.4, (31): supremum on actual centered Gaussian input densities. ENNReal suprema avoid empty/unbounded real defaults; the physical set is nonempty and <=1.pureMaximalOutputPurity: PDF p.4, (34): the same supremum restricted to pure Gaussian densities.replaceOccupation: PDF pp.3--4: replace one whole channel's occupation string, keeping all other modes.applyOscillatorBlock: PDF pp.3--4, (36): apply a local map to every off-diagonal block. The other factors form an arbitrary completed oscillator ancilla.tensorOscillatorChannel: PDF pp.3--4, (36): actual finite tensor product of the full channel maps. The fold applies each factor once; it is not a rule only on product inputs.GaussianPurityMultiplicative: PDF p.4, (37): global Gaussian inputs may be entangled across channel blocks.scalarX: PDF p.5, (40): canonical X computed from its factor, including det X=0.scalarY: PDF p.5, (40): canonical Y computed from its factor, including det Y=0.EqualSigns: PDF p.5: equal determinant signs, including the common zero sign.PreservesInterleavedSigma: PDF p.2, (9): source convention S^T interleavedSigma S=interleavedSigma.WilliamsonSpectrum: PDF p.2, (12): Williamson spectrum with multiplicity, not singular values of the generally nonnormal i interleavedSigma G. Ordering is immaterial to products.fp: PDF p.4, (28): reuse the exact accepted f_p.spectralFp: PDF p.4, (29): F_p from an explicitly identified symplectic spectrum.kyFan: PDF p.4, (30): intrinsic Ky Fan sum over all r-dimensional orthonormal frames. For nonempty mode sets this equals the sum of the r largest density eigenvalues with zero padding. ENNReal prevents an unbounded-real default.OscillatorMajorizes: PDF p.4, (30): spectral majorization of actual positive trace-one densities.productInput: PDF pp.3--5: oscillatorCoefficients of an actual tensor product of factor states.sourceBeta: PDF p.8, (A1): the one-mode sourceBeta matrix.sourceDelta: PDF p.8, (A1): the one-mode sourceDelta matrix.oneModeGenerator: PDF p.8, (A2): sigma2, sourceBeta and sourceDelta. Ordering does not affect a basis.GeneratorIndex: PDF p.8, (A2)--(A5): three single-mode and four unordered-pair generators.sourceSymplecticGenerator: PDF p.8, (A2)--(A4): the actual embedded one/two-mode matrices. Pair labels 0,1 are the two skew generators in (A3); 2,3 are the symmetric ones in (A4).InSymplecticAlgebra: PDF p.8: infinitesimal symplecticity, not a subgroup of symmetric matrices.CompactGeneratorIndex: PDF p.8: skew infinitesimal generators of the compact passive subgroup.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P30
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P47
/-!
Serafini--Eisert--Wolf, arXiv:quant-ph/0406065v1.
Full occupation-number Hilbert spaces, no cutoff or energy constraint.
The paper's proof convention is vacuum-I doubled covariance and hbar=1.
Printed (6),(7),(15),(38),(69),(71),(B6) have the discrepancies recorded in
MODERATION_NOTES.md. No frozen definition is changed. The defective
P47.HasBipartiteMoments predicate is never used. Spectral powers are powers of
actual bounded density operators; the Gaussian spectral formula is a theorem.
Compilation and independent moderation are pending the separate batch handoff.
-/
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.2: the source interleaved coordinate order. -/
abbrev OscillatorPhase (I : Type) := I × Fin 2
/-- PDF p.2: real covariance arrays, not density matrices. -/
abbrev OscillatorCovariance (I : Type) := Matrix (OscillatorPhase I) (OscillatorPhase I) ℝ
/-- PDF pp.2--3: arrays of actual oscillator-operator oscillatorCoefficients. -/
abbrev OscillatorCoeff (I : Type) := Matrix (Occupation I) (Occupation I) ℂ
/-- PDF p.2: canonical interleavedSigma with sigma_xp=+1, sigma_px=-1. -/
def interleavedSigma (I : Type) : OscillatorCovariance I :=
fun i j => if i.1 = j.1 then
if i.2 = j.2 then 0 else if i.2 = 0 then 1 else -1
else 0
/-- PDF p.2: permutation to the accepted grouped Weyl coordinates; no rescaling. -/
def groupedIndex {I : Type} : I ⊕ I → OscillatorPhase I
| Sum.inl i => (i, 0)
| Sum.inr i => (i, 1)
/-- PDF p.2: source phase vector in the accepted grouped coordinates. -/
def groupedVector {I : Type} (xi : OscillatorPhase I → ℝ) : I ⊕ I → ℝ := xi ∘ groupedIndex
/-- PDF p.2: covariance permutation used only for the accepted Weyl formula. -/
def groupedCovariance {I : Type} (G : OscillatorCovariance I) : Matrix (I ⊕ I) (I ⊕ I) ℝ :=
G.submatrix groupedIndex groupedIndex
/-- PDF p.2, (4): oscillatorCharacteristic of the actual density, with the fixed Fock Weyl kernel. -/
def oscillatorCharacteristic {I : Type} [Fintype I] (A : OscillatorCoeff I) (xi : OscillatorPhase I → ℝ) : ℂ :=
singleCharacteristic A (groupedVector xi)
/-- PDF p.2, (4): convergence of both sums in the trace/Weyl pairing.
Each row is an l2 pairing; the outer series is a trace-class/bounded trace. -/
def WeylTraceSummable {I : Type} [Fintype I] (A : OscillatorCoeff I) (xi : OscillatorPhase I → ℝ) : Prop :=
(∀ u, Summable (fun v => A u v * weylKernel (groupedVector xi) v u)) ∧
Summable (fun u => ∑' v, A u v * weylKernel (groupedVector xi) v u)
/-- PDF p.2, corrected (6)--(8): physical symmetric doubled covariance. -/
def PhysicalOscillatorCovariance {I : Type} [Fintype I] (G : OscillatorCovariance I) : Prop :=
G.transpose = G ∧
(G.map (fun x : ℝ => (x : ℂ)) +
Complex.I • (interleavedSigma I).map (fun x : ℝ => (x : ℂ))).PosSemidef
/-- PDF pp.2--3: centered Gaussian ACTUAL density with its covariance.
Normalization and nuclear trace class are carried by State. The corrected
oscillatorCharacteristic exponent is -xi^T interleavedSigma^T G interleavedSigma xi/4, not printed (6). -/
def HasCenteredGaussianCovariance {I : Type} [Fintype I]
(rho : State (Occupation I)) (G : OscillatorCovariance I) : Prop :=
PhysicalOscillatorCovariance G ∧ ∀ xi,
WeylTraceSummable rho.coefficients xi ∧
oscillatorCharacteristic rho.coefficients xi =
gaussianStateCharacteristic 0 (groupedCovariance G) (groupedVector xi)
/-- PDF p.2: all centered Gaussian densities, without an energy bound. -/
def IsCenteredGaussianDensity {I : Type} [Fintype I] (rho : State (Occupation I)) : Prop :=
∃ G, HasCenteredGaussianCovariance rho G
/-- PDF pp.2,4: purity is a rank-one density of a unit vector; no infinite squeezing. -/
def IsPureOscillatorDensity {I : Type} (rho : State (Occupation I)) : Prop :=
∃ u : Hilbert (Occupation I), ‖u‖ = 1 ∧ rho.coefficients = rankOne u
/-- PDF p.3: operators on the completed oscillator space, never a photon truncation. -/
abbrev OscillatorOperator (I : Type) := Hilbert (Occupation I) →L[ℂ] Hilbert (Occupation I)
/-- PDF p.3: complete number basis of l2. -/
def oscillatorNumberBasis (I : Type) : HilbertBasis (Occupation I) ℂ (Hilbert (Occupation I)) :=
⟨LinearIsometryEquiv.refl ℂ (Hilbert (Occupation I))⟩
/-- PDF p.3: row=bra, column=ket, with conjugate-linearity on the bra. -/
def oscillatorCoefficients {I : Type} (T : OscillatorOperator I) : OscillatorCoeff I :=
fun u v => inner ℂ (oscillatorNumberBasis I u) (T (oscillatorNumberBasis I v))
/-- PDF p.3: unique bounded realization of an operator array when it exists.
All arrays used as states are nuclear (State or CPTP output), hence have a unique
realization on the completed number basis. The off-domain zero is not a state. -/
def realizeOscillatorCoeff {I : Type} (A : OscillatorCoeff I) : OscillatorOperator I :=
if h : ∃ T : OscillatorOperator I, oscillatorCoefficients T = A then Classical.choose h else 0
/-- PDF p.3, (24): genuine positive spectral functional calculus, independent of G. -/
def positivePower {I : Type} (A : OscillatorCoeff I) (p : ℝ) : OscillatorOperator I := by
letI : ContinuousFunctionalCalculus ℂ (OscillatorOperator I) IsStarNormal :=
IsStarNormal.instContinuousFunctionalCalculus (A := OscillatorOperator I)
letI : ContinuousFunctionalCalculus ℝ (OscillatorOperator I) IsSelfAdjoint :=
IsSelfAdjoint.instContinuousFunctionalCalculus (A := OscillatorOperator I)
exact CFC.rpow (realizeOscillatorCoeff A) p
/-- PDF pp.3--4, (24),(27): positive spectral trace, retaining infinity rather
than a default-zero nonsummable real trace. On a density and p>1 it is finite. -/
def tracePower {I : Type} (p : ℝ) (A : OscillatorCoeff I) : ℝ≥0∞ :=
∑' u, ENNReal.ofReal
(inner ℂ (oscillatorNumberBasis I u) (positivePower A p (oscillatorNumberBasis I u))).re
/-- PDF p.3, (24): Schatten p-norm of an actual density, extended off its domain. -/
def pNorm {I : Type} (p : ℝ) (A : OscillatorCoeff I) : ℝ≥0∞ :=
(tracePower p A).rpow (1 / p)
/-- PDF p.3, (18): fixed covariance action; the transpose is on the left. -/
def gaussianCovarianceMap {I : Type} [Fintype I] (X Y G : OscillatorCovariance I) : OscillatorCovariance I :=
X.transpose * G * X + Y
/-- PDF p.3, (16): full Hermitian CP condition, including singular noise. -/
def GaussianCPCondition {I : Type} [Fintype I] (X Y : OscillatorCovariance I) : Prop :=
Y.transpose = Y ∧
(Y.map (fun x : ℝ => (x : ℂ)) + Complex.I •
(interleavedSigma I - X.transpose * interleavedSigma I * X).map (fun x : ℝ => (x : ℂ))).PosSemidef
/-- PDF p.3: the Weyl-coordinate pullback compatible with (18). -/
def gaussianWeylArgument {I : Type} [Fintype I] (X : OscillatorCovariance I) (xi : OscillatorPhase I → ℝ) : OscillatorPhase I → ℝ :=
((interleavedSigma I).transpose * X * interleavedSigma I).mulVec xi
/-- PDF p.3: source quadratic noise in the same Weyl coordinates, with /4. -/
def noiseMultiplier {I : Type} [Fintype I] (Y : OscillatorCovariance I) (xi : OscillatorPhase I → ℝ) : ℂ :=
gaussianStateCharacteristic 0 (groupedCovariance Y) (groupedVector xi)
/-- PDF p.3, (15)--(19), interpreted consistently with (18): an actual CPTP
map on ALL trace class. Its defining Weyl law holds for every density, not just
Gaussian inputs. No output-purity or multiplicativity assertion is a field. -/
structure CenteredOscillatorChannel (I : Type) [Fintype I] where
X : OscillatorCovariance I
Y : OscillatorCovariance I
admissible : GaussianCPCondition X Y
map : OscillatorCoeff I → OscillatorCoeff I
cptp : IsTraceClassChannel map
output : State (Occupation I) → State (Occupation I)
output_coefficients : ∀ rho, (output rho).coefficients = map rho.coefficients
characteristic_law : ∀ rho xi,
WeylTraceSummable (output rho).coefficients xi ∧
oscillatorCharacteristic (output rho).coefficients xi =
oscillatorCharacteristic rho.coefficients (gaussianWeylArgument X xi) * noiseMultiplier Y xi
/-- PDF p.4, (31): supremum on actual centered Gaussian input densities. ENNReal
suprema avoid empty/unbounded real defaults; the physical set is nonempty and <=1. -/
def maximalOutputPurity {I : Type} [Fintype I] (p : ℝ) (E : OscillatorCoeff I → OscillatorCoeff I) : ℝ≥0∞ :=
⨆ rho : {rho : State (Occupation I) // IsCenteredGaussianDensity rho}, pNorm p (E rho.val.coefficients)
/-- PDF p.4, (34): the same supremum restricted to pure Gaussian densities. -/
def pureMaximalOutputPurity {I : Type} [Fintype I] (p : ℝ) (E : OscillatorCoeff I → OscillatorCoeff I) : ℝ≥0∞ :=
⨆ rho : {rho : State (Occupation I) // IsCenteredGaussianDensity rho ∧ IsPureOscillatorDensity rho},
pNorm p (E rho.val.coefficients)
/-- PDF pp.3--4: replace one whole channel's occupation string, keeping all other modes. -/
def replaceOccupation {r : ℕ} {m : Fin r → ℕ} (i : Fin r)
(u : Occupation (Σ j, Fin (m j))) (a : Occupation (Fin (m i))) :
Occupation (Σ j, Fin (m j)) :=
fun j => if h : j.1 = i then a (h ▸ j.2) else u j
/-- PDF pp.3--4, (36): apply a local map to every off-diagonal block.
The other factors form an arbitrary completed oscillator ancilla. -/
def applyOscillatorBlock {r : ℕ} {m : Fin r → ℕ} (i : Fin r)
(E : OscillatorCoeff (Fin (m i)) → OscillatorCoeff (Fin (m i)))
(A : OscillatorCoeff (Σ j, Fin (m j))) : OscillatorCoeff (Σ j, Fin (m j)) :=
fun u v => E (fun a b => A (replaceOccupation i u a) (replaceOccupation i v b))
(fun k => u ⟨i, k⟩) (fun k => v ⟨i, k⟩)
/-- PDF pp.3--4, (36): actual finite tensor product of the full channel maps.
The fold applies each factor once; it is not a rule only on product inputs. -/
def tensorOscillatorChannel {r : ℕ} {m : Fin r → ℕ}
(E : (i : Fin r) → CenteredOscillatorChannel (Fin (m i)))
(A : OscillatorCoeff (Σ j, Fin (m j))) : OscillatorCoeff (Σ j, Fin (m j)) :=
(List.finRange r).foldl (fun B i => applyOscillatorBlock i (E i).map B) A
/-- PDF p.4, (37): global Gaussian inputs may be entangled across channel blocks. -/
def GaussianPurityMultiplicative {r : ℕ} {m : Fin r → ℕ} (p : ℝ)
(E : (i : Fin r) → CenteredOscillatorChannel (Fin (m i))) : Prop :=
maximalOutputPurity p (tensorOscillatorChannel E) = ∏ i, maximalOutputPurity p (E i).map
/-- PDF p.5, (40): canonical X computed from its factor, including det X=0. -/
def scalarX (E : CenteredOscillatorChannel (Fin 1)) : OscillatorCovariance (Fin 1) :=
Real.sqrt |E.X.det| • 1
/-- PDF p.5, (40): canonical Y computed from its factor, including det Y=0. -/
def scalarY (E : CenteredOscillatorChannel (Fin 1)) : OscillatorCovariance (Fin 1) :=
Real.sqrt E.Y.det • 1
/-- PDF p.5: equal determinant signs, including the common zero sign. -/
def EqualSigns {r : ℕ} (E : Fin r → CenteredOscillatorChannel (Fin 1)) : Prop :=
∀ i j, (if (E i).X.det < 0 then (-1 : ℤ) else if (E i).X.det = 0 then 0 else 1) =
(if (E j).X.det < 0 then (-1 : ℤ) else if (E j).X.det = 0 then 0 else 1)
/-- PDF p.2, (9): source convention S^T interleavedSigma S=interleavedSigma. -/
def PreservesInterleavedSigma {I : Type} [Fintype I] (S : OscillatorCovariance I) : Prop :=
S.transpose * interleavedSigma I * S = interleavedSigma I
/-- PDF p.2, (12): Williamson spectrum with multiplicity, not singular values
of the generally nonnormal i interleavedSigma G. Ordering is immaterial to products. -/
def WilliamsonSpectrum {I : Type} [Fintype I] (G : OscillatorCovariance I) (nu : I → ℝ) : Prop :=
(∀ i, 1 ≤ nu i) ∧ ∃ S : OscillatorCovariance I, PreservesInterleavedSigma S ∧
S.transpose * G * S = Matrix.diagonal (fun i => nu i.1)
/-- PDF p.4, (28): reuse the exact accepted f_p. -/
def fp (p x : ℝ) : ℝ := phiMinus p x
/-- PDF p.4, (29): F_p from an explicitly identified symplectic spectrum. -/
def spectralFp {I : Type} [Fintype I] (p : ℝ) (nu : I → ℝ) : ℝ := ∏ i, fp p (nu i)
/-- PDF p.4, (30): intrinsic Ky Fan sum over all r-dimensional orthonormal
frames. For nonempty mode sets this equals the sum of the r largest density
eigenvalues with zero padding. ENNReal prevents an unbounded-real default. -/
def kyFan {I : Type} (A : OscillatorCoeff I) (r : ℕ) : ℝ≥0∞ :=
⨆ v : {v : Fin r → Hilbert (Occupation I) // Orthonormal ℂ v},
∑ j, ENNReal.ofReal (inner ℂ (v.val j) (realizeOscillatorCoeff A (v.val j))).re
/-- PDF p.4, (30): spectral majorization of actual positive trace-one densities. -/
def OscillatorMajorizes {I : Type} (A B : OscillatorCoeff I) : Prop := ∀ r : ℕ, kyFan B r ≤ kyFan A r
/-- PDF pp.3--5: oscillatorCoefficients of an actual tensor product of factor states. -/
def productInput {r : ℕ} {m : Fin r → ℕ}
(rho : (i : Fin r) → State (Occupation (Fin (m i)))) : OscillatorCoeff (Σ j, Fin (m j)) :=
fun u v => ∏ i, (rho i).coefficients (fun k => u ⟨i, k⟩) (fun k => v ⟨i, k⟩)
/-- PDF p.8, (A1): the one-mode sourceBeta matrix. -/
def sourceBeta : Matrix (Fin 2) (Fin 2) ℝ := !![1, 0; 0, -1]
/-- PDF p.8, (A1): the one-mode sourceDelta matrix. -/
def sourceDelta : Matrix (Fin 2) (Fin 2) ℝ := !![0, 1; 1, 0]
/-- PDF p.8, (A2): sigma2, sourceBeta and sourceDelta. Ordering does not affect a basis. -/
def oneModeGenerator (a : Fin 3) : Matrix (Fin 2) (Fin 2) ℝ :=
if a = 0 then !![0, 1; -1, 0] else if a = 1 then sourceBeta else sourceDelta
/-- PDF p.8, (A2)--(A5): three single-mode and four unordered-pair generators. -/
abbrev GeneratorIndex (n : ℕ) :=
(Fin n × Fin 3) ⊕ ({ij : Fin n × Fin n // ij.1 < ij.2} × Fin 4)
/-- PDF p.8, (A2)--(A4): the actual embedded one/two-mode matrices. Pair labels
0,1 are the two skew generators in (A3); 2,3 are the symmetric ones in (A4). -/
def sourceSymplecticGenerator {n : ℕ} (a : GeneratorIndex n) : OscillatorCovariance (Fin n) :=
match a with
| Sum.inl a => fun i j =>
if i.1 = a.1 ∧ j.1 = a.1 then oneModeGenerator a.2 i.2 j.2 else 0
| Sum.inr a => fun i j =>
if i.1 = a.1.val.1 ∧ j.1 = a.1.val.2 then
if a.2 = 0 then !![0, 1; -1, 0] i.2 j.2
else if a.2 = 1 then -(1 : Matrix (Fin 2) (Fin 2) ℝ) i.2 j.2
else if a.2 = 2 then sourceDelta i.2 j.2 else sourceBeta i.2 j.2
else if i.1 = a.1.val.2 ∧ j.1 = a.1.val.1 then
if a.2 = 0 then !![0, 1; -1, 0] i.2 j.2
else if a.2 = 1 then (1 : Matrix (Fin 2) (Fin 2) ℝ) i.2 j.2
else if a.2 = 2 then sourceDelta i.2 j.2 else sourceBeta i.2 j.2
else 0
/-- PDF p.8: infinitesimal symplecticity, not a subgroup of symmetric matrices. -/
def InSymplecticAlgebra {n : ℕ} (K : OscillatorCovariance (Fin n)) : Prop :=
K.transpose * interleavedSigma (Fin n) + interleavedSigma (Fin n) * K = 0
/-- PDF p.8: skew infinitesimal generators of the compact passive subgroup. -/
abbrev CompactGeneratorIndex (n : ℕ) :=
{a : GeneratorIndex n // (sourceSymplecticGenerator a).transpose = -sourceSymplecticGenerator a}
example : interleavedSigma (Fin 1) (0, 0) (0, 1) = 1 := by simp [interleavedSigma]
example : interleavedSigma (Fin 1) (0, 1) (0, 0) = -1 := by simp [interleavedSigma]
example (X G : OscillatorCovariance (Fin 1)) : gaussianCovarianceMap X 0 G = X.transpose * G * X := by
simp [gaussianCovarianceMap]
example {I : Type} (T : OscillatorOperator I) : oscillatorCoefficients (realizeOscillatorCoeff (oscillatorCoefficients T)) = oscillatorCoefficients T := by
unfold realizeOscillatorCoeff
split_ifs with h
· exact Classical.choose_spec h
· exact (h ⟨T, rfl⟩).elim
example : fp 2 1 = 4 := by
norm_num [fp, phiMinus, Real.rpow_natCast]
example : sourceSymplecticGenerator (Sum.inl ((0 : Fin 1), (0 : Fin 3))) (0, 0) (0, 1) = 1 := by
simp [sourceSymplecticGenerator, oneModeGenerator]
example : sourceSymplecticGenerator (Sum.inl ((0 : Fin 1), (1 : Fin 3))) (0, 1) (0, 1) = -1 := by
norm_num [sourceSymplecticGenerator, oneModeGenerator, sourceBeta]
example (m : Fin 0 → ℕ) (E : (i : Fin 0) → CenteredOscillatorChannel (Fin (m i)))
(A : OscillatorCoeff (Σ j, Fin (m j))) : tensorOscillatorChannel E A = A := by
simp [tensorOscillatorChannel]
example : sourceSymplecticGenerator (Sum.inr (⟨((0 : Fin 2), (1 : Fin 2)), by decide⟩, (1 : Fin 4)))
(0, 0) (1, 0) = -1 := by
norm_num [sourceSymplecticGenerator]
example : sourceSymplecticGenerator (Sum.inr (⟨((0 : Fin 2), (1 : Fin 2)), by decide⟩, (1 : Fin 4)))
(1, 0) (0, 0) = 1 := by
norm_num [sourceSymplecticGenerator]
end QAlgorithms.Papers.Independent.Support50.P28
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P28.CenteredOscillatorChannel
For any finite type , which may be empty, put , , and . A centered oscillator channel is the following collection of data and conditions. It has real matrices indexed by , with
where , , and all other entries are zero. It has a function satisfying these requirements: it preserves matrices admitting a representation with and ; it is additive and complex homogeneous on such matrices; and, for every natural number and every density matrix indexed by , the matrix
is a density matrix. Here, on any label set, a density matrix means a matrix admitting the preceding summable representation, whose quadratic form on every finite set of labels is real and nonnegative, and whose real diagonal entries are summable with sum ; in particular, no density matrix exists on an empty label set, so the requirement has no instances. The channel also has a function from density states on to density states on , agreeing with on their coefficient matrices. Finally, for every input density state with coefficient matrix and every , writing for the coefficients of , it requires
The characteristic function here is the particular iterated sum
where
For , each inner sum over must be summable, and the resulting outer sum over must be summable. This summability condition is imposed on the output in the characteristic law; the input characteristic function is defined by the displayed total sums. When is empty, is a singleton, the quadrature index set is empty, and the products over are .
QAlgorithms.Papers.Independent.Support50.P28.CompactGeneratorIndex
For every natural number , define the compact generator index type as the subtype of generator indices whose associated real matrix is skew-symmetric, meaning . Explicitly, it retains the single-mode indices , , whose matrix has the block at , and the pair indices , , with or : label places that same block at both and , while label places at and at ; all unlisted blocks are zero. The subtype includes the proof of the skew-symmetry condition and is empty when .
QAlgorithms.Papers.Independent.Support50.P28.EqualSigns
For any natural number and any family , indexed by , of centered oscillator channels on one mode, this predicate requires
where is the real matrix supplied by , and the integer-valued sign is for a negative determinant, for determinant zero, and for a positive determinant. Thus zero determinants are included. The condition is vacuous for and automatically holds for .
QAlgorithms.Papers.Independent.Support50.P28.GaussianCPCondition
For any finite type and real matrices indexed by , this predicate requires and
where complexification embeds each real entry into , and has entries , , with all other entries zero. Positive semidefiniteness means that the displayed complex matrix is Hermitian and every complex-vector quadratic form is nonnegative. There is no invertibility requirement on . Empty is allowed, and then the condition holds for the empty matrices.
QAlgorithms.Papers.Independent.Support50.P28.GaussianPurityMultiplicative
For every natural number , every family indexed by , every real , and every family of centered oscillator channels on modes, this predicate means exactly
where is the coefficient map supplied by , , and applies the maps in increasing block order: starting from , its -th update replaces by
Replacing block means replacing its occupation coordinates by or and retaining all other coordinates. For any finite mode set , consists of coefficient matrices on admitting a summable nuclear representation , with , real nonnegative finite quadratic forms, summable real diagonal of sum , and a symmetric real with such that
Here has blocks , and is the summable iterated series
with every inner sum and the outer sum summable for every . The quantity being optimized is
where is a selected bounded operator with coefficient matrix , or zero if none exists, and its power is defined by real continuous functional calculus. The superscript denotes extended nonnegative real exponentiation, and . There is no restriction on , so zero and negative values are included; at , under total division. The supremum on the left includes centered Gaussian inputs across all blocks without a product-input restriction. Zero-sized blocks are allowed. For , the sequential map is the identity and the product on the right is .
QAlgorithms.Papers.Independent.Support50.P28.GeneratorIndex
For every natural number , define the generator index type to be the disjoint union
Thus an index carries either a single mode and one of three labels, or a strictly ordered pair of modes and one of four labels, with the two kinds distinguished by their disjoint-union tags. For , this type is empty.
QAlgorithms.Papers.Independent.Support50.P28.HasCenteredGaussianCovariance
For any finite type , write , and let be a state with coefficient matrix on : explicitly, there are sequences with and ; for every finite and every , the sum is real and nonnegative; and the family is summable with sum . For a real matrix on , the defined property requires and positive semidefinite, where has blocks for each label and zero entries between different labels; it further requires, for every ,
together with summability of the inner complex family over for each , and summability over of those inner sums. Here
Empty is allowed: is then a singleton, all phase sums are empty, and the displayed equality requires the sole coefficient of to equal .
QAlgorithms.Papers.Independent.Support50.P28.InSymplecticAlgebra
For any natural number and any real matrix indexed by , define membership in the symplectic algebra by the equation
No further condition on is included. For , the equation holds for the unique matrix with empty index set.
QAlgorithms.Papers.Independent.Support50.P28.IsCenteredGaussianDensity
For any finite type , write , and let be a state with coefficient matrix on : this means that for sequences satisfying , that every finite quadratic form is real and nonnegative for every finite and every , and that the real diagonal entries are summable with sum . The defined property says that there exists a real matrix on such that , is positive semidefinite, and, for every real function on ,
Here has block at each label and zero entries between labels, , and
For each , the inner complex family over must be summable for every , and the resulting inner sums must be summable over . The existence of is asserted without uniqueness. Empty is included, with empty phase matrices and a singleton occupation index set.
QAlgorithms.Papers.Independent.Support50.P28.IsPureOscillatorDensity
For any type , put and . Let be a state: its coefficient matrix admits a representation , where and ; every finite quadratic form is real and nonnegative; and the real diagonal entries are summable with sum . The predicate defined here holds precisely when there exists with such that for every . No finiteness or countability assumption is imposed on , and may be empty.
QAlgorithms.Papers.Independent.Support50.P28.OscillatorCoeff
For any type , an oscillator coefficient matrix is an arbitrary complex matrix whose row and column labels are functions . No boundedness, summability, positivity, or normalization condition is imposed. If is empty, there is exactly one function , so these are matrices.
QAlgorithms.Papers.Independent.Support50.P28.OscillatorCovariance
For any type , an oscillator covariance is a real matrix indexed in both directions by , equivalently an arbitrary function . This abbreviation imposes no symmetry or positivity condition and requires neither finiteness nor nonemptiness of .
QAlgorithms.Papers.Independent.Support50.P28.OscillatorMajorizes
For any type and any two complex matrices indexed by , say that oscillator-majorizes if, for every natural number ,
Here, for , is a chosen bounded complex-linear operator whose coordinate matrix is , or the zero operator if none exists. Suprema and sums take values in , and an empty supremum is . The quantifier includes , when both sides are ; neither matrix is required to be a density matrix.
QAlgorithms.Papers.Independent.Support50.P28.OscillatorOperator
For any type , an oscillator operator is a bounded complex-linear map from to itself, where . There are no positivity, trace-class, or normalization requirements. The type may be infinite or empty; when is empty, has one element.
QAlgorithms.Papers.Independent.Support50.P28.OscillatorPhase
For any type , the oscillator phase index set is . Thus each element consists of a label and one of two indices, or . No finiteness or nonemptiness assumption is imposed on ; if is empty, this index set is empty.
QAlgorithms.Papers.Independent.Support50.P28.PhysicalOscillatorCovariance
For any finite type and any real matrix indexed by , this property means that and that the complex matrix , with viewed entrywise as complex, is positive semidefinite. Here , , and all other entries are zero. Positive semidefiniteness means that this complex matrix is Hermitian and its quadratic form is nonnegative on every complex vector. No strict positive definiteness is required. Empty is included, and both conditions then hold for the unique empty matrix.
QAlgorithms.Papers.Independent.Support50.P28.PreservesInterleavedSigma
For any finite type and any real matrix indexed by , this predicate is the equality
where , , and every other entry is zero. No separate hypothesis on is imposed. Empty is allowed, and then this is an equality of empty matrices and holds automatically.
QAlgorithms.Papers.Independent.Support50.P28.WeylTraceSummable
For any finite type , any complex matrix indexed by functions , and any real function on , put and
The defined property says both that, for every occupation function , the complex family
is summable, and that the family of its inner sums, indexed by , is summable. These are two successive summability requirements; no joint summability requirement is stated. Empty is allowed, in which case both families have one term and the property always holds.
QAlgorithms.Papers.Independent.Support50.P28.WilliamsonSpectrum
For any finite type , any real matrix indexed by , and any function , this predicate requires for every and the existence of a real matrix with the same indices such that
Here , , and all other entries are zero; each therefore appears twice on the displayed diagonal. There is no ordering requirement on and no separately stated symmetry or physical-covariance hypothesis on . If is empty, the inequalities and matrix equations are vacuous, and the predicate holds.
QAlgorithms.Papers.Independent.Support50.P28.applyOscillatorBlock
For every natural number , family indexed by , index , arbitrary function from complex matrices indexed by to matrices with the same indices, and complex matrix indexed by occupation assignments on , this defines a matrix on those full occupation assignments by
Here , and equals when and otherwise; the replacement in is defined identically. No linearity, positivity, channel, or summability hypothesis is imposed on or . A block with still has one occupation assignment, so acts on a matrix and is not required to act trivially. When , no index exists.
QAlgorithms.Papers.Independent.Support50.P28.fp
For arbitrary real numbers and , define
Both powers use the total real-power operation, so this definition includes zero or negative bases and imposes no restriction on or .
QAlgorithms.Papers.Independent.Support50.P28.gaussianCovarianceMap
For any finite type and any three real matrices indexed by , this defines the real matrix
The matrices need not be symmetric, positive, or satisfy any covariance or channel condition. The empty type is included, in which case the result is the empty matrix.
QAlgorithms.Papers.Independent.Support50.P28.gaussianWeylArgument
For any finite type , real matrix indexed by , and real vector , this defines the vector
where , , and every other entry of is zero. Matrix-vector multiplication uses finite sums. No symmetry, positivity, or channel condition is imposed on , and empty is included.
QAlgorithms.Papers.Independent.Support50.P28.groupedCovariance
For any type and any real matrix indexed by , this defines a matrix on by , where sends the first copy of to and the second copy to . Equivalently, its four blocks have entries , , , and , respectively. No finiteness, symmetry, or positivity is assumed.
QAlgorithms.Papers.Independent.Support50.P28.groupedIndex
For any type , this defines a map , where the domain consists of two distinguished copies of : an element in the first copy maps to , and an element in the second copy maps to . The definition also applies when is empty.
QAlgorithms.Papers.Independent.Support50.P28.groupedVector
For any type and any real function , this defines a real function on two distinguished copies of by assigning to in the first copy and to in the second copy. No finiteness or nonemptiness assumption is imposed.
QAlgorithms.Papers.Independent.Support50.P28.interleavedSigma
For any type , this defines the real matrix on by
Thus different labels have zero entries between them, and each label has the block . No finiteness or nonemptiness assumption is required; for empty , this is the empty matrix.
QAlgorithms.Papers.Independent.Support50.P28.kyFan
For any type , let be the set of occupation functions and let , with coordinate unit vectors . Given any complex matrix and any natural number , let be a chosen bounded complex-linear operator satisfying for every , if such an operator exists; otherwise let . Define
where each nonnegative summand and the supremum are taken in . No positivity, self-adjointness, trace condition, or finiteness assumption on is required. For , the value is ; if no orthonormal -tuple exists, the supremum is also .
QAlgorithms.Papers.Independent.Support50.P28.maximalOutputPurity
For any finite type , any real , and any function , where , this defines the extended nonnegative number
Here , the sum takes values in , and the outer power is the extended nonnegative real power. For any coefficient matrix , is a selected bounded complex linear operator on with matrix coefficients , if such an operator exists, and is the zero operator otherwise; is its real continuous functional-calculus power, and is the coordinate unit vector. The supremum ranges over precisely the following matrices : they admit a representation with ; every finitely supported quadratic form of is real and nonnegative; the real diagonal is summable with sum ; and there exists a real matrix indexed by such that
The matrix has blocks , and the characteristic function is
for every , all inner sums and the resulting outer sum must be summable. No channel, linearity, positivity, or bounded-realization condition is assumed for , and no restriction such as is imposed. In particular, is included, with under total real division, making the displayed extended power for each admissible input. An empty supremum is . The type may be empty, in which case is a singleton.
QAlgorithms.Papers.Independent.Support50.P28.noiseMultiplier
For any finite type , real matrix indexed by , and real vector , this defines the complex number
with the real exponent embedded into , where , , and all other entries are zero. This is the specified Gaussian characteristic expression with zero mean, after regrouping the two quadrature coordinates into . No symmetry or positivity condition is required of , so no bound by is part of the definition. For empty , the sum is zero and the value is .
QAlgorithms.Papers.Independent.Support50.P28.oneModeGenerator
For any index , define the real matrix
QAlgorithms.Papers.Independent.Support50.P28.oscillatorCharacteristic
For any finite type , any complex matrix indexed by occupation functions , and any , this defines
where, for and ,
No summability or density assumption is required: each infinite complex sum is the total sum operation, which takes the value zero when its family is not summable. Empty is included; then the product is , there is one occupation function, and is the sole entry of .
QAlgorithms.Papers.Independent.Support50.P28.oscillatorCoefficients
For any type and any bounded complex-linear operator on , where , this defines the complex matrix indexed by whose entries are
where is at occupation and elsewhere, and the inner product is conjugate-linear in its first argument. Thus is the -coordinate of . No positivity or trace-class assumption is imposed, and may be empty or infinite.
QAlgorithms.Papers.Independent.Support50.P28.oscillatorNumberBasis
For any type , this defines the canonical orthonormal Hilbert basis of , indexed by , using the identity linear isometry of . Its vector , for , has coordinate at and at every other occupation. No finiteness or countability assumption is required; for empty , this basis has one vector.
QAlgorithms.Papers.Independent.Support50.P28.pNorm
For any type , real number , and complex matrix indexed by , where , this defines
Here is the coordinate unit vector of , is a classically selected bounded complex-linear realization of if one exists and is zero otherwise, and uses the total continuous-functional-calculus real power. The outer power is the extended-nonnegative-real power. There are no positivity, summability, or realizability assumptions, and may be negative or zero; at , real division gives , so the defined value is , including when the inner sum is zero or infinite.
QAlgorithms.Papers.Independent.Support50.P28.positivePower
For any type , any complex matrix indexed by , with , and any real exponent , this defines the continuous-functional-calculus real power on . Here is a classically selected bounded complex-linear operator satisfying for all coordinate unit vectors , if such an operator exists, and is the zero operator otherwise. The definition installs the complex functional calculus for normal operators and the real functional calculus for self-adjoint operators, then uses the total operation for real powers. It imposes no positivity, self-adjointness, realizability, or trace-class hypothesis on , and allows zero and negative .
QAlgorithms.Papers.Independent.Support50.P28.productInput
For any natural number , any family of natural numbers indexed by , and any family of states with coefficient matrices indexed by , define a complex matrix on occupation functions of the disjoint union by
Being a state here means that, for each , there exist sequences with and ; every finite quadratic form , for finite and arbitrary , is real and nonnegative; and the real diagonal entries are summable with sum . Zero values of are allowed. If , is empty and the resulting matrix has its single entry equal to the empty product .
QAlgorithms.Papers.Independent.Support50.P28.pureMaximalOutputPurity
For any finite type , any real , and any function , where , this defines
Here ; is the coordinate unit vector in ; is a selected bounded complex linear operator with coefficient matrix , if one exists, and zero otherwise; its power is taken by real continuous functional calculus; and the outer power is extended nonnegative real exponentiation. The inputs must satisfy all of these conditions: for square-summable vectors with ; all its finite quadratic forms are real and nonnegative; its real diagonal is summable with sum ; there is a unit vector with ; and there is a real matrix , indexed by , satisfying
Here has blocks , and
Every inner sum and the resulting outer sum must be summable for every . The function is otherwise arbitrary, and may be zero or negative. At , total real division gives , so each admissible input contributes . An empty supremum is . Empty is allowed and gives a singleton occupation label set.
QAlgorithms.Papers.Independent.Support50.P28.realizeOscillatorCoeff
For any type and any complex matrix indexed by , where , this defines an operator on as follows: if there exists a bounded complex-linear operator satisfying for every , it selects such an operator by classical choice; otherwise it returns the zero operator. Here is the coordinate unit vector at . The definition accepts arbitrary matrices, including those with no bounded operator realization, and requires no finiteness or countability assumption on .
QAlgorithms.Papers.Independent.Support50.P28.replaceOccupation
For every natural number , every family of natural numbers , every index , every occupation assignment on the disjoint union
and every occupation assignment , this defines the assignment
Thus it replaces exactly block , retaining every other value. If , that block has no coordinates and the result is . If , there is no possible argument .
QAlgorithms.Papers.Independent.Support50.P28.scalarX
For any centered oscillator channel on the singleton mode set , let be its real matrix indexed by , hence a matrix. This defines the real covariance-indexed matrix
The determinant is first replaced by its absolute value, so zero, positive, and negative determinants are all covered, and determinant zero gives the zero matrix.
QAlgorithms.Papers.Independent.Support50.P28.scalarY
For any centered oscillator channel on the singleton mode set , let be its real matrix indexed by , hence a matrix. This defines
There is no absolute value around the determinant. The square root is the total real square-root function, which is zero for nonpositive arguments; in particular, determinant zero gives the zero matrix.
QAlgorithms.Papers.Independent.Support50.P28.sourceBeta
Define the real matrix indexed by , in that order, by
QAlgorithms.Papers.Independent.Support50.P28.sourceDelta
Define the real matrix indexed by , in that order, by
QAlgorithms.Papers.Independent.Support50.P28.sourceSymplecticGenerator
For any natural number and any generator index , define a real matrix indexed by pairs with and , viewing it as an array of blocks. Write
If is a single-mode index , where , its only possibly nonzero block is , equal respectively to . If is a pair index , where and , all blocks vanish except the following:
For , there is no generator index to supply as an argument.
QAlgorithms.Papers.Independent.Support50.P28.spectralFp
For any finite type , any real number , and any function , define
using total real powers without assuming positivity of the bases or exponent. The type may be empty, in which case the product is .
QAlgorithms.Papers.Independent.Support50.P28.tensorOscillatorChannel
For every natural number , every family indexed by , every family of centered oscillator channel data on the modes, and every complex coefficient matrix indexed by occupation assignments on , this defines the result of applying the coefficient maps successively in the order . Explicitly, set and, for , set
the defined output is . Here , and replacing block changes to while retaining all coordinates in other blocks. Each supplies its Gaussian complete-positivity data, its map preserving summable nuclear representations and linear on those matrices, its density-state output agreeing with that map, finite-ancilla density preservation, and its summable output characteristic law; this construction uses its coefficient map. The argument itself need not be a density matrix or admit a nuclear representation. If , the function is the identity. Blocks with are allowed and still involve their supplied maps on matrices indexed by the singleton empty occupation assignment.
QAlgorithms.Papers.Independent.Support50.P28.tracePower
For any type , real number , and complex matrix indexed by , where , this defines an extended nonnegative real number
Here is the coordinate unit vector in , is a bounded complex-linear operator realizing the entries of , selected by classical choice if one exists and set to zero otherwise, and is its total continuous-functional-calculus real power. Each real summand is converted to an extended nonnegative real before summation, so negative real diagonal values contribute zero and the sum may be . No summability, positivity, realizability, or restriction on is assumed, and the index type need not be finite or countable.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.