Definitions for Gaussian relative entropy of entanglement
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P46The objects the formalized statements of Gaussian relative entropy of entanglement (arXiv:quant-ph/0402109) are stated in. Each was checked against the paper by a blind read-back and a moderator.
operatorRelativeEntropy: PDF p.4, (16): extended Umegaki entropy in nats via finite orthogonal compressions of generalized entropy, including its unequal-trace correction. Infinity on support failure is preserved; no covariance expression defines D.densityEntropy: PDF pp.4–5: independently defined spectral entropy in nats. The continuous weight -x log x vanishes at zero; the nonnegative trace retains infinity.ree: PDF p.4: unrestricted REE; no energy, rank or Gaussian restriction.StateBorder: PDF p.4: boundary inside normalized states in trace norm.GroupedPhase: PDF p.2: grouped coordinates, all q before all p.ModeMatrix: PDF p.2: real covariance/exponential arrays, not density operators.groupedCCR: PDF p.2, (3): grouped canonical form with [q_j,p_k]=i delta_jk.IsPhysicalCovariance: PDF p.2: symmetric covariance with alpha-i Delta/2 nonnegative.StrictPhysical: PDF pp.2–3: finite exponential chart, excluding pure normal modes.IsSymplecticMatrix: PDF p.2, (2)–(3): invertible real symplectic transformation.normalDiagonal: PDF p.2: repeat each normal-mode scalar in both blocks.modeEM: PDF p.2: used only with gamma>1/2, never at a pure mode.coth: PDF p.3: scalar coth, used on positive finite normal parameters.CMEM: PDF pp.2–3, (4),(14): CM and finite EM have a common Williamson chart. Existence from a given covariance is a conclusion, not a premise below.HasGaussian: PDF pp.2,4,6: actual Gaussian density with physical symmetric covariance. The accepted Weyl convention uses doubled covariance, hence 2 • alpha. The explicit symmetry guard avoids the defective frozen moments predicate. Trace class and normalization are provided by State.IsGaussianDensity: PDF p.4, (19): all Gaussian states, including displacements and pure modes.gree: PDF p.4, (19), p.12: extended infimum over all actual separable Gaussian states. It also makes sense for non-Gaussian rho; attainment is separate.GaussianBorder: PDF pp.4–6: separability border relative to physical Gaussian covariances. Every positive covariance neighborhood meets inseparable Gaussian states. Means are fixed because displacements are local; pure covariances are included.CenteredGaussianKernel: PDF p.2, (1),(4): centered Gaussianity on a single complete occupation space. This generic interface also covers matrices before a bipartite regrouping.thermalGibbsKernel: PDF p.2, (1),(4): normalized thermal Gibbs density in the number basis. For positive m its diagonal weights are the normalized exp(-m(k+1/2)) weights. The half-quanta cancel against the reciprocal partition function.HasFiniteEM: PDF pp.2,8, (1),(2): actual finite Gibbs exponential, independently of covariance identities. A bounded metaplectic unitary conjugates the normalized thermal Gibbs density; its action is tested on EVERY bounded Weyl operator. Thus the quadratic exponential is specified spectrally on the completed space, without treating unbounded quadratures as bounded matrices or assuming an entropy formula. The source's EM is S^(-T) diag(m,m) S^(-1).GaussianEM: PDF pp.2–3: the finite covariance chart AND its actual Gibbs meaning. The operator bridge is a conclusion of the conversion theorems, never an additional hypothesis on a supplied Gaussian density. CMEM retains the coordinate relation; this predicate adds its independently specified meaning.joinedCoefficients: PDF p.2: regroup the SAME full bipartite density into one occupation space. No marginal, truncation or new state is chosen.Two: PDF pp.3,8: one oscillator per party, retaining the named A|B cut.pairValues: PDF p.3: two mode values in party order.symmetricModeBlock: PDF pp.3,8: symmetric real two-by-two block [[a,c],[c,b]].standardCM: PDF p.8, (36): ordinary covariance convention, without a factor 1/2.symmetricCM: PDF p.3, (12): half-covariance convention specific to m,kq,kp.symmetricSq: PDF p.3, (13): the symmetric-state block Sq.symplecticLift: PDF p.3: a block symplectic candidate; invertibility is proved in the results.symmetricGammas: PDF p.3, following (14): symplectic eigenvalues, including the pure endpoint.emFrom: PDF p.3, (14): the finite EM constructed from a specified normal chart.normalization: PDF p.4, (17): reciprocal partition function, not the partition function.bosonic: PDF p.5: bosonic entropy in nats, with 0 log 0=0.covarianceObjective: PDF p.4, (18): the finite covariance expression, not the definition of D.displacementPenalty: PDF p.6, (28): the displacement correction with z in the source Weyl convention W(z)=exp(i F^T z). The displaced density mean is -Delta z.weylDisplacedDensity: PDF p.6, (27): the actual W(z) sigma W(z)^* coefficients. The accepted Weyl argument is xi=Delta*z, since W_xi=exp(i xi^T Delta F)=exp(i F^T z).hyperbolicMixing: PDF pp.5,8: two-mode squeezing R(r).modeRotation: PDF p.5, (25): passive rotation, with the source's signs.xSqueeze: PDF pp.7–9: the actual symplectic X(x), with inverse p scalings.squeezeBoth: PDF p.8: a two-mode squeeze acting with opposite r on p.rotateBoth: PDF p.8: the same passive rotation on q and p.ySqueeze: PDF p.7: equal local squeezes Y(y), with y>0 at every use.congruence: PDF p.8: covariance congruence, with its transpose explicit.covarianceType: PDF p.8: the symmetric chart takes precedence over overlapping raw ratios.CovSeparable: PDF pp.8–9: physical Gaussian covariance separability on the actual 1|1 cut.CovBorder: PDF pp.8–9: physical border adjacent to entangled Gaussian states.typeICM: PDF p.8: reverse the type-I diagonalization to construct the covariance.typeIICM: PDF pp.8–9: reverse the type-II diagonalization.TypeIIDomain: PDF p.9, following (38): nontrivial type-II parameter chart.borderLeft: PDF pp.8–9, (37),(38): common left-hand side, with unsquared factor 1/2.borderRightI: PDF p.8, (37): plus sign on the squared-eigenvalue sum.borderRightII: PDF p.9, (38): minus sign on the squared-eigenvalue sum.PositiveRoots: PDF p.9: solve x^2+x^(-2)=K in its positive domain.exceptionalDelta: PDF p.9: delta=(gamma_A^2-1/4)(gamma_B^2-1/4), not a symplectic form.exceptionalLower: PDF p.9: first triangular type-III border Sq.exceptionalUpper: PDF p.9: second triangular type-III border Sq.symmetricBorderQ: PDF p.9, (39): symmetric border Sq in the p.3 normalization.borderCMFrom: PDF p.9: construct a covariance from the displayed Sq and symplectic spectrum.symmetricCandidateCM: PDF pp.9,11, (39),(41): a symmetric border candidate, after the remaining common local squeezing. This is a covariance construction even at pure modes.symmetricValue: PDF p.11, (41): two-variable operator-defined objective, including endpoints. For fixed normal covariances, eliminate y>0 and evaluate actual Umegaki entropy of the explicitly constructed density. Uniqueness of Gaussian characteristic functions means the state variable introduces no extra variational freedom. At gamma=1/2 this definition uses the actual singular density, not Real.log 0, not an assigned scalar limit, and not GREE itself.symmetricObjective: PDF p.11, (41): finite scalar chart of the independent operator objective. The factor 1/2 multiplies the entire square root; coth and tanh each occur as products at half arguments. The state entropy is added separately.tmstObjective: PDF p.11, (42): one-variable objective, with u the positive finite EM normal parameter. This is not used to define the operator divergence or GREE.tmstBorderCM: PDF pp.9,11: a symmetric TMST border with equal normal eigenvalues.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P13
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P47
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P13
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P18
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P41
/-!
Chen, arXiv:quant-ph/0402109v3; PDF pages throughout.
Accepted-paper imports follow the independent-paper override. Full oscillator
states have no cutoff. Divergence is independent of covariance formulas.
Covariances are symmetric with vacuum I/2. Pure modes remain in the state space;
CMEM is only a finite chart. HasBipartiteMoments is never used.
Compilation is pending the separate mechanical handoff.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P46
open scoped BigOperators ENNReal ComplexOrder Matrix
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsSeparable)
open QAlgorithms.Papers.Independent.Dependency50.P13
(finiteRelativeEntropy compression entropyWeight)
open QAlgorithms.Papers.Independent.Claimed50.P47
(Occupation bipartiteCharacteristic bipartiteWeyl gaussianStateCharacteristic)
-- These accepted definitions have the same completed Hilbert-space meaning.
open QAlgorithms.Papers.Independent.Next46.P13 (coordinateBasis)
open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)
open QAlgorithms.Papers.Independent.Claimed50.P41 (IsDiagonal)
/-- PDF p.4, (16): extended Umegaki entropy in nats via finite orthogonal
compressions of generalized entropy, including its unequal-trace correction.
Infinity on support failure is preserved; no covariance expression defines D. -/
def operatorRelativeEntropy {I : Type} (rho sigma : State I) : ℝ≥0∞ :=
⨆ n : ℕ, ⨆ v : {v : Fin n → Hilbert I // Orthonormal ℂ v},
finiteRelativeEntropy (compression v.val (boundedOperator rho.coefficients))
(compression v.val (boundedOperator sigma.coefficients))
/-- PDF pp.4–5: independently defined spectral entropy in nats. The continuous
weight -x log x vanishes at zero; the nonnegative trace retains infinity. -/
def densityEntropy {I : Type} (rho : State I) : ℝ≥0∞ := by
letI : ContinuousFunctionalCalculus ℂ (Hilbert I →L[ℂ] Hilbert I) IsStarNormal :=
IsStarNormal.instContinuousFunctionalCalculus (A := Hilbert I →L[ℂ] Hilbert I)
letI : ContinuousFunctionalCalculus ℝ (Hilbert I →L[ℂ] Hilbert I) IsSelfAdjoint :=
IsSelfAdjoint.instContinuousFunctionalCalculus (A := Hilbert I →L[ℂ] Hilbert I)
exact ∑' i, ENNReal.ofReal
(inner ℂ (coordinateBasis I i)
((cfc entropyWeight (boundedOperator rho.coefficients)) (coordinateBasis I i))).re
/-- PDF p.4: unrestricted REE; no energy, rank or Gaussian restriction. -/
def ree {I J : Type} (rho : State (I × J)) : ℝ≥0∞ :=
⨅ sigma : {sigma : State (I × J) // IsSeparable sigma.coefficients},
operatorRelativeEntropy rho sigma.val
/-- PDF p.4: boundary inside normalized states in trace norm. -/
def StateBorder {I J : Type} (sigma : State (I × J)) : Prop :=
sigma ∈ frontier {tau : State (I × J) | IsSeparable tau.coefficients}
/-- PDF p.2: grouped coordinates, all q before all p. -/
abbrev GroupedPhase (I : Type) := I ⊕ I
/-- PDF p.2: real covariance/exponential arrays, not density operators. -/
abbrev ModeMatrix (I : Type) := Matrix (GroupedPhase I) (GroupedPhase I) ℝ
/-- PDF p.2, (3): grouped canonical form with [q_j,p_k]=i delta_jk. -/
def groupedCCR (I : Type) [Fintype I] : ModeMatrix I := Matrix.fromBlocks 0 1 (-1) 0
/-- PDF p.2: symmetric covariance with alpha-i Delta/2 nonnegative. -/
def IsPhysicalCovariance {I : Type} [Fintype I] (alpha : ModeMatrix I) : Prop :=
alpha.transpose = alpha ∧
(alpha.map (fun x : ℝ => (x : ℂ)) -
(Complex.I / 2) • (groupedCCR I).map (fun x : ℝ => (x : ℂ))).PosSemidef
/-- PDF pp.2–3: finite exponential chart, excluding pure normal modes. -/
def StrictPhysical {I : Type} [Fintype I] (alpha : ModeMatrix I) : Prop :=
alpha.transpose = alpha ∧
(alpha.map (fun x : ℝ => (x : ℂ)) -
(Complex.I / 2) • (groupedCCR I).map (fun x : ℝ => (x : ℂ))).PosDef
/-- PDF p.2, (2)–(3): invertible real symplectic transformation. -/
def IsSymplecticMatrix {I : Type} [Fintype I] (S : ModeMatrix I) : Prop :=
IsUnit S ∧ S * groupedCCR I * S.transpose = groupedCCR I
/-- PDF p.2: repeat each normal-mode scalar in both blocks. -/
def normalDiagonal {I : Type} [Fintype I] (g : I → ℝ) : ModeMatrix I :=
Matrix.fromBlocks (Matrix.diagonal g) 0 0 (Matrix.diagonal g)
/-- PDF p.2: used only with gamma>1/2, never at a pure mode. -/
def modeEM (gamma : ℝ) : ℝ := Real.log ((2 * gamma + 1) / (2 * gamma - 1))
/-- PDF p.3: scalar coth, used on positive finite normal parameters. -/
def coth (x : ℝ) : ℝ := Real.cosh x / Real.sinh x
/-- PDF pp.2–3, (4),(14): CM and finite EM have a common Williamson chart.
Existence from a given covariance is a conclusion, not a premise below. -/
def CMEM {I : Type} [Fintype I] (alpha M : ModeMatrix I) : Prop :=
∃ (S : ModeMatrix I) (g : I → ℝ), IsSymplecticMatrix S ∧ (∀ j, 1 / 2 < g j) ∧
alpha = S * normalDiagonal g * S.transpose ∧
M = S.transpose⁻¹ * normalDiagonal (modeEM ∘ g) * S⁻¹
/-- PDF pp.2,4,6: actual Gaussian density with physical symmetric covariance.
The accepted Weyl convention uses doubled covariance, hence 2 • alpha.
The explicit symmetry guard avoids the defective frozen moments predicate.
Trace class and normalization are provided by State. -/
def HasGaussian {A B : Type} [Fintype A] [Fintype B]
(rho : State (Occupation A × Occupation B))
(d : GroupedPhase (A ⊕ B) → ℝ) (alpha : ModeMatrix (A ⊕ B)) : Prop :=
IsPhysicalCovariance alpha ∧ ∀ xi,
(∀ u, Summable (fun v => rho.coefficients u v * bipartiteWeyl xi v u)) ∧
Summable (fun u => ∑' v, rho.coefficients u v * bipartiteWeyl xi v u) ∧
bipartiteCharacteristic rho.coefficients xi =
gaussianStateCharacteristic d (2 • alpha) xi
/-- PDF p.4, (19): all Gaussian states, including displacements and pure modes. -/
def IsGaussianDensity {A B : Type} [Fintype A] [Fintype B]
(rho : State (Occupation A × Occupation B)) : Prop :=
∃ d alpha, HasGaussian rho d alpha
/-- PDF p.4, (19), p.12: extended infimum over all actual separable Gaussian
states. It also makes sense for non-Gaussian rho; attainment is separate. -/
def gree {A B : Type} [Fintype A] [Fintype B]
(rho : State (Occupation A × Occupation B)) : ℝ≥0∞ :=
⨅ sigma : {sigma : State (Occupation A × Occupation B) //
IsSeparable sigma.coefficients ∧ IsGaussianDensity sigma}, operatorRelativeEntropy rho sigma.val
/-- PDF pp.4–6: separability border relative to physical Gaussian covariances.
Every positive covariance neighborhood meets inseparable Gaussian states.
Means are fixed because displacements are local; pure covariances are included. -/
def GaussianBorder {A B : Type} [Fintype A] [Fintype B]
(sigma : State (Occupation A × Occupation B)) : Prop :=
IsSeparable sigma.coefficients ∧ ∃ d alpha, HasGaussian sigma d alpha ∧
∀ epsilon : ℝ, 0 < epsilon →
∃ (tau : State (Occupation A × Occupation B)) (beta : ModeMatrix (A ⊕ B)),
HasGaussian tau d beta ∧ ¬ IsSeparable tau.coefficients ∧
∀ i j, |beta i j - alpha i j| < epsilon
/-- PDF p.2, (1),(4): centered Gaussianity on a single complete occupation space.
This generic interface also covers matrices before a bipartite regrouping. -/
def CenteredGaussianKernel {I : Type} [Fintype I]
(rho : Matrix (Occupation I) (Occupation I) ℂ) (alpha : ModeMatrix I) : Prop :=
QAlgorithms.Papers.Independent.Dependency50.P33.IsDensity rho ∧ IsPhysicalCovariance alpha ∧
∀ xi,
(∀ u, Summable (fun v => rho u v *
QAlgorithms.Papers.Independent.Claimed50.P47.weylKernel xi v u)) ∧
Summable (fun u => ∑' v, rho u v *
QAlgorithms.Papers.Independent.Claimed50.P47.weylKernel xi v u) ∧
QAlgorithms.Papers.Independent.Claimed50.P47.singleCharacteristic rho xi =
gaussianStateCharacteristic 0 (2 • alpha) xi
/-- PDF p.2, (1),(4): normalized thermal Gibbs density in the number basis.
For positive m its diagonal weights are the normalized exp(-m(k+1/2)) weights.
The half-quanta cancel against the reciprocal partition function. -/
def thermalGibbsKernel {I : Type} [Fintype I] (m : I → ℝ) :
Matrix (Occupation I) (Occupation I) ℂ :=
fun u v => if u = v then
((∏ j, (1 - Real.exp (-m j)) * Real.exp (-m j * (u j : ℝ)) : ℝ) : ℂ)
else 0
/-- PDF pp.2,8, (1),(2): actual finite Gibbs exponential, independently of
covariance identities. A bounded metaplectic unitary conjugates the normalized
thermal Gibbs density; its action is tested on EVERY bounded Weyl operator.
Thus the quadratic exponential is specified spectrally on the completed space,
without treating unbounded quadratures as bounded matrices or assuming an
entropy formula. The source's EM is S^(-T) diag(m,m) S^(-1). -/
def HasFiniteEM {I : Type} [Fintype I]
(rho : Matrix (Occupation I) (Occupation I) ℂ) (M : ModeMatrix I) : Prop :=
QAlgorithms.Papers.Independent.Dependency50.P33.IsDensity rho ∧
∃ (S : ModeMatrix I) (m : I → ℝ)
(U : Hilbert (Occupation I) ≃ₗᵢ[ℂ] Hilbert (Occupation I)),
IsSymplecticMatrix S ∧ (∀ j, 0 < m j) ∧
(∀ xi,
QAlgorithms.Papers.Independent.Frontier30.P14.boundedUnitaryConjugation U.symm
(QAlgorithms.Papers.Independent.Claimed50.P47.weylKernel xi) =
QAlgorithms.Papers.Independent.Claimed50.P47.weylKernel
(QAlgorithms.Papers.Independent.Claimed50.P47.weylPullback S xi)) ∧
rho = QAlgorithms.Papers.Independent.Frontier30.P14.boundedUnitaryConjugation U
(thermalGibbsKernel m) ∧
M = S.transpose⁻¹ * normalDiagonal m * S⁻¹
/-- PDF pp.2–3: the finite covariance chart AND its actual Gibbs meaning.
The operator bridge is a conclusion of the conversion theorems, never an
additional hypothesis on a supplied Gaussian density. CMEM retains the
coordinate relation; this predicate adds its independently specified meaning. -/
def GaussianEM {I : Type} [Fintype I] (alpha M : ModeMatrix I) : Prop :=
CMEM alpha M ∧ ∀ rho : Matrix (Occupation I) (Occupation I) ℂ,
CenteredGaussianKernel rho alpha → HasFiniteEM rho M
/-- PDF p.2: regroup the SAME full bipartite density into one occupation space.
No marginal, truncation or new state is chosen. -/
def joinedCoefficients {A B : Type}
(rho : Matrix (Occupation A × Occupation B) (Occupation A × Occupation B) ℂ) :
Matrix (Occupation (A ⊕ B)) (Occupation (A ⊕ B)) ℂ :=
fun u v => rho (u ∘ Sum.inl, u ∘ Sum.inr) (v ∘ Sum.inl, v ∘ Sum.inr)
example {I : Type} [Fintype I] (m : I → ℝ) (u v : Occupation I) (h : u ≠ v) :
thermalGibbsKernel m u v = 0 := by simp [thermalGibbsKernel, h]
example {I : Type} [Fintype I] (m : I → ℝ) :
thermalGibbsKernel m (fun _ => 0) (fun _ => 0) =
((∏ j, (1 - Real.exp (-m j)) : ℝ) : ℂ) := by
simp [thermalGibbsKernel]
example {I : Type} : operatorCoeff (0 : Hilbert I →L[ℂ] Hilbert I) = 0 := by
ext i j
simp [operatorCoeff]
example : entropyWeight 0 = 0 := by simp [entropyWeight]
example {I : Type} [Fintype I] (g : I → ℝ) (i : I) :
normalDiagonal g (Sum.inl i) (Sum.inr i) = 0 := by
simp [normalDiagonal]
example {I : Type} [Fintype I] (i : I) : groupedCCR I (Sum.inl i) (Sum.inr i) = 1 := by
simp [groupedCCR]
/-- PDF pp.3,8: one oscillator per party, retaining the named A|B cut. -/
abbrev Two := Fin 1 ⊕ Fin 1
/-- PDF p.3: two mode values in party order. -/
def pairValues (a b : ℝ) : Two → ℝ := Sum.elim (fun _ => a) (fun _ => b)
/-- PDF pp.3,8: symmetric real two-by-two block [[a,c],[c,b]]. -/
def symmetricModeBlock (a c b : ℝ) : Matrix Two Two ℝ
| Sum.inl _, Sum.inl _ => a
| Sum.inl _, Sum.inr _ => c
| Sum.inr _, Sum.inl _ => c
| Sum.inr _, Sum.inr _ => b
/-- PDF p.8, (36): ordinary covariance convention, without a factor 1/2. -/
def standardCM (a b c1 c2 : ℝ) : ModeMatrix Two :=
Matrix.fromBlocks (symmetricModeBlock a c1 b) 0 0 (symmetricModeBlock a (-c2) b)
/-- PDF p.3, (12): half-covariance convention specific to m,kq,kp. -/
def symmetricCM (m kq kp : ℝ) : ModeMatrix Two :=
standardCM (m / 2) (m / 2) (kq / 2) (kp / 2)
/-- PDF p.3, (13): the symmetric-state block Sq. -/
def symmetricSq (m kq kp : ℝ) : Matrix Two Two ℝ :=
(Real.sqrt 2)⁻¹ • (symmetricModeBlock 1 1 (-1) * Matrix.diagonal
(pairValues (Real.rpow ((m + kq) / (m - kp)) (1 / 4))
(Real.rpow ((m - kq) / (m + kp)) (1 / 4))))
/-- PDF p.3: a block symplectic candidate; invertibility is proved in the results. -/
def symplecticLift (Sq : Matrix Two Two ℝ) : ModeMatrix Two :=
Matrix.fromBlocks Sq 0 0 Sq.transpose⁻¹
/-- PDF p.3, following (14): symplectic eigenvalues, including the pure endpoint. -/
def symmetricGammas (m kq kp : ℝ) : Two → ℝ :=
pairValues (Real.sqrt ((m + kq) * (m - kp)) / 2)
(Real.sqrt ((m - kq) * (m + kp)) / 2)
/-- PDF p.3, (14): the finite EM constructed from a specified normal chart. -/
def emFrom {I : Type} [Fintype I] (S : ModeMatrix I) (g : I → ℝ) : ModeMatrix I :=
S.transpose⁻¹ * normalDiagonal (modeEM ∘ g) * S⁻¹
example : symmetricModeBlock 1 0 1 = (1 : Matrix Two Two ℝ) := by
ext i j
rcases i with i | i <;> rcases j with j | j <;>
fin_cases i <;> fin_cases j <;> simp [symmetricModeBlock]
example (m kq kp : ℝ) :
symmetricCM m kq kp (Sum.inl (Sum.inl 0)) (Sum.inl (Sum.inr 0)) = kq / 2 := rfl
/-- PDF p.4, (17): reciprocal partition function, not the partition function. -/
def normalization {I : Type} [Fintype I] (g : I → ℝ) : ℝ :=
∏ j, 2 * Real.sinh (modeEM (g j) / 2)
/-- PDF p.5: bosonic entropy in nats, with 0 log 0=0. -/
def bosonic (x : ℝ) : ℝ := (x + 1) * Real.log (x + 1) - x * Real.log x
/-- PDF p.4, (18): the finite covariance expression, not the definition of D. -/
def covarianceObjective {I : Type} [Fintype I]
(alpha M : ModeMatrix I) (c : ℝ) : ℝ := -Real.log c + (alpha * M).trace / 2
example : bosonic 0 = 0 := by simp [bosonic]
/-- PDF p.6, (28): the displacement correction with z in the source Weyl
convention W(z)=exp(i F^T z). The displaced density mean is -Delta z. -/
def displacementPenalty {I : Type} [Fintype I]
(M : ModeMatrix I) (z : GroupedPhase I → ℝ) : ℝ :=
(∑ i, ∑ j, (groupedCCR I).mulVec z i * M i j * (groupedCCR I).mulVec z j) / 2
example {I : Type} [Fintype I] (M : ModeMatrix I) : displacementPenalty M 0 = 0 := by
simp [displacementPenalty]
/-- PDF p.6, (27): the actual W(z) sigma W(z)^* coefficients. The accepted
Weyl argument is xi=Delta*z, since W_xi=exp(i xi^T Delta F)=exp(i F^T z). -/
def weylDisplacedDensity {A B : Type} [Fintype A] [Fintype B]
(sigma : State (Occupation A × Occupation B)) (z : GroupedPhase (A ⊕ B) → ℝ) :
Matrix (Occupation A × Occupation B) (Occupation A × Occupation B) ℂ :=
QAlgorithms.Papers.Independent.Frontier30.P14.conjugateKernel
(bipartiteWeyl ((groupedCCR (A ⊕ B)).mulVec z)) sigma.coefficients
/-- PDF pp.5,8: two-mode squeezing R(r). -/
def hyperbolicMixing (r : ℝ) : Matrix Two Two ℝ :=
symmetricModeBlock (Real.cosh r) (Real.sinh r) (Real.cosh r)
/-- PDF p.5, (25): passive rotation, with the source's signs. -/
def modeRotation (t : ℝ) : Matrix Two Two ℝ
| Sum.inl _, Sum.inl _ => Real.cos t
| Sum.inl _, Sum.inr _ => Real.sin t
| Sum.inr _, Sum.inl _ => -Real.sin t
| Sum.inr _, Sum.inr _ => Real.cos t
/-- PDF pp.7–9: the actual symplectic X(x), with inverse p scalings. -/
def xSqueeze (x : ℝ) : ModeMatrix Two :=
Matrix.fromBlocks (Matrix.diagonal (pairValues (Real.sqrt x) ((Real.sqrt x)⁻¹))) 0 0
(Matrix.diagonal (pairValues ((Real.sqrt x)⁻¹) (Real.sqrt x)))
/-- PDF p.8: a two-mode squeeze acting with opposite r on p. -/
def squeezeBoth (r : ℝ) : ModeMatrix Two := Matrix.fromBlocks (hyperbolicMixing r) 0 0 (hyperbolicMixing (-r))
/-- PDF p.8: the same passive rotation on q and p. -/
def rotateBoth (t : ℝ) : ModeMatrix Two := Matrix.fromBlocks (modeRotation t) 0 0 (modeRotation t)
/-- PDF p.7: equal local squeezes Y(y), with y>0 at every use. -/
def ySqueeze (y : ℝ) : ModeMatrix Two :=
Matrix.fromBlocks ((Real.sqrt y) • (1 : Matrix Two Two ℝ)) 0 0
((Real.sqrt y)⁻¹ • (1 : Matrix Two Two ℝ))
/-- PDF p.8: covariance congruence, with its transpose explicit. -/
def congruence (S alpha : ModeMatrix Two) : ModeMatrix Two := S * alpha * S.transpose
/-- PDF p.8: the symmetric chart takes precedence over overlapping raw ratios. -/
def covarianceType (a b c1 c2 : ℝ) : ℕ :=
if a = b then 4 else if c1 / c2 + c2 / c1 < a / b + b / a then 1
else if a / b + b / a < c1 / c2 + c2 / c1 then 2 else 3
example (a c1 c2 : ℝ) : covarianceType a a c1 c2 = 4 := by
simp [covarianceType]
example : modeRotation 0 = (1 : Matrix Two Two ℝ) := by
ext i j
rcases i with i | i <;> rcases j with j | j <;>
fin_cases i <;> fin_cases j <;> simp [modeRotation]
/-- PDF pp.8–9: physical Gaussian covariance separability on the actual 1|1 cut. -/
def CovSeparable (alpha : ModeMatrix Two) : Prop :=
∃ sigma : State (Occupation (Fin 1) × Occupation (Fin 1)),
HasGaussian sigma 0 alpha ∧ IsSeparable sigma.coefficients
/-- PDF pp.8–9: physical border adjacent to entangled Gaussian states. -/
def CovBorder (alpha : ModeMatrix Two) : Prop :=
∃ sigma : State (Occupation (Fin 1) × Occupation (Fin 1)),
HasGaussian sigma 0 alpha ∧ GaussianBorder sigma
/-- PDF p.8: reverse the type-I diagonalization to construct the covariance. -/
def typeICM (gA gB r x : ℝ) : ModeMatrix Two :=
congruence (squeezeBoth (-r) * xSqueeze x⁻¹) (normalDiagonal (pairValues gA gB))
/-- PDF pp.8–9: reverse the type-II diagonalization. -/
def typeIICM (gA gB t x : ℝ) : ModeMatrix Two :=
congruence (rotateBoth (-t) * xSqueeze x⁻¹) (normalDiagonal (pairValues gA gB))
/-- PDF p.9, following (38): nontrivial type-II parameter chart. -/
def TypeIIDomain (gA gB x : ℝ) : Prop :=
0 < x ∧ (max (Real.sqrt (gA / gB)) (Real.sqrt (gB / gA)) < x ∨
x < min (Real.sqrt (gA / gB)) (Real.sqrt (gB / gA)))
/-- PDF pp.8–9, (37),(38): common left-hand side, with unsquared factor 1/2. -/
def borderLeft (gA gB : ℝ) : ℝ := (2 * gA ^ 2 - 1 / 2) * (2 * gB ^ 2 - 1 / 2)
/-- PDF p.8, (37): plus sign on the squared-eigenvalue sum. -/
def borderRightI (gA gB r x : ℝ) : ℝ :=
Real.sinh (2 * r) ^ 2 * ((x ^ 2 + (x⁻¹) ^ 2) * gA * gB + (gA ^ 2 + gB ^ 2))
/-- PDF p.9, (38): minus sign on the squared-eigenvalue sum. -/
def borderRightII (gA gB t x : ℝ) : ℝ :=
Real.sin (2 * t) ^ 2 * ((x ^ 2 + (x⁻¹) ^ 2) * gA * gB - (gA ^ 2 + gB ^ 2))
/-- PDF p.9: solve x^2+x^(-2)=K in its positive domain. -/
def PositiveRoots (K x : ℝ) : Prop :=
2 ≤ K ∧ (x = Real.sqrt ((K + Real.sqrt (K ^ 2 - 4)) / 2) ∨
x = Real.sqrt ((K - Real.sqrt (K ^ 2 - 4)) / 2))
example (gA gB x : ℝ) : borderRightI gA gB 0 x = 0 := by
simp [borderRightI]
/-- PDF p.9: delta=(gamma_A^2-1/4)(gamma_B^2-1/4), not a symplectic form. -/
def exceptionalDelta (gA gB : ℝ) : ℝ := (gA ^ 2 - 1 / 4) * (gB ^ 2 - 1 / 4)
/-- PDF p.9: first triangular type-III border Sq. -/
def exceptionalLower (gA gB : ℝ) : Matrix Two Two ℝ :=
let d := exceptionalDelta gA gB
fun i j => match i, j with
| Sum.inl _, Sum.inl _ => Real.rpow (1 + d / gA ^ 2) (1 / 4)
| Sum.inl _, Sum.inr _ => 0
| Sum.inr _, Sum.inl _ => Real.rpow (d ^ 2 / (gA ^ 2 * (gB ^ 2 + d))) (1 / 4)
| Sum.inr _, Sum.inr _ => Real.rpow (gB ^ 2 / (gB ^ 2 + d)) (1 / 4)
/-- PDF p.9: second triangular type-III border Sq. -/
def exceptionalUpper (gA gB : ℝ) : Matrix Two Two ℝ :=
let d := exceptionalDelta gA gB
fun i j => match i, j with
| Sum.inl _, Sum.inl _ => Real.rpow (gA ^ 2 / (gA ^ 2 + d)) (1 / 4)
| Sum.inl _, Sum.inr _ => Real.rpow (d ^ 2 / (gB ^ 2 * (gA ^ 2 + d))) (1 / 4)
| Sum.inr _, Sum.inl _ => 0
| Sum.inr _, Sum.inr _ => Real.rpow (1 + d / gB ^ 2) (1 / 4)
/-- PDF p.9, (39): symmetric border Sq in the p.3 normalization. -/
def symmetricBorderQ (gA gB : ℝ) : Matrix Two Two ℝ :=
(Real.sqrt 2)⁻¹ • (symmetricModeBlock 1 1 (-1) * Matrix.diagonal (pairValues
(Real.rpow (4 * gA ^ 2 * (4 * gB ^ 2 + 1) / (4 * gA ^ 2 + 1)) (1 / 4))
(Real.rpow ((4 * gB ^ 2 + 1) / (4 * gB ^ 2 * (4 * gA ^ 2 + 1))) (1 / 4))))
/-- PDF p.9: construct a covariance from the displayed Sq and symplectic spectrum. -/
def borderCMFrom (Sq : Matrix Two Two ℝ) (gA gB : ℝ) : ModeMatrix Two :=
congruence (symplecticLift Sq) (normalDiagonal (pairValues gA gB))
example : exceptionalDelta (1 / 2) (1 / 2) = 0 := by
norm_num [exceptionalDelta]
/-- PDF pp.9,11, (39),(41): a symmetric border candidate, after the remaining
common local squeezing. This is a covariance construction even at pure modes. -/
def symmetricCandidateCM (gA gB y : ℝ) : ModeMatrix Two :=
congruence (ySqueeze y⁻¹) (borderCMFrom (symmetricBorderQ gA gB) gA gB)
/-- PDF p.11, (41): two-variable operator-defined objective, including endpoints.
For fixed normal covariances, eliminate y>0 and evaluate actual Umegaki entropy
of the explicitly constructed density. Uniqueness of Gaussian characteristic
functions means the state variable introduces no extra variational freedom.
At gamma=1/2 this definition uses the actual singular density, not Real.log 0,
not an assigned scalar limit, and not GREE itself. -/
def symmetricValue
(rho : State (Occupation (Fin 1) × Occupation (Fin 1))) (gA gB : ℝ) : ℝ≥0∞ :=
⨅ candidate : {p : ℝ × State (Occupation (Fin 1) × Occupation (Fin 1)) //
0 < p.1 ∧ HasGaussian p.2 0 (symmetricCandidateCM gA gB p.1)},
operatorRelativeEntropy rho candidate.val.2
/-- PDF p.11, (41): finite scalar chart of the independent operator objective.
The factor 1/2 multiplies the entire square root; coth and tanh each occur as
products at half arguments. The state entropy is added separately. -/
def symmetricObjective (m kq kp u v : ℝ) : ℝ :=
-Real.log (2 * Real.sinh (u / 2)) - Real.log (2 * Real.sinh (v / 2)) +
Real.sqrt ((m + kq) * (m - kp) * u ^ 2 +
(m - kq) * (m + kp) * v ^ 2 +
(m - kq) * (m - kp) * u * v * coth (u / 2) * coth (v / 2) +
(m + kq) * (m + kp) * u * v * Real.tanh (u / 2) * Real.tanh (v / 2)) / 2
example : ySqueeze 1 = (1 : ModeMatrix Two) := by
simpa only [ySqueeze, Real.sqrt_one, inv_one, one_smul] using
(Matrix.fromBlocks_one :
Matrix.fromBlocks (1 : Matrix Two Two ℝ) 0 0 (1 : Matrix Two Two ℝ) = 1)
/-- PDF p.11, (42): one-variable objective, with u the positive finite EM
normal parameter. This is not used to define the operator divergence or GREE. -/
def tmstObjective (m k u : ℝ) : ℝ :=
-2 * Real.log (2 * Real.sinh (u / 2)) +
u / 2 * ((m - k) * coth (u / 2) + (m + k) * Real.tanh (u / 2))
/-- PDF pp.9,11: a symmetric TMST border with equal normal eigenvalues. -/
def tmstBorderCM (u : ℝ) : ModeMatrix Two :=
let g := coth (u / 2) / 2
symmetricCM (2 * g ^ 2 + 1 / 2) (2 * g ^ 2 - 1 / 2) (2 * g ^ 2 - 1 / 2)
end QAlgorithms.Papers.Independent.Intakenext100.P46
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P46.CMEM
For any finite type , including the empty type, and real matrices indexed by , this property holds exactly when there exist a real matrix on and numbers for all such that, writing with identity blocks indexed by , the matrix is invertible, , and
Here has the entries on both diagonal blocks and zero elsewhere. If is empty, the conditions on the are vacuous and all matrices are empty matrices.
QAlgorithms.Papers.Independent.Intakenext100.P46.CenteredGaussianKernel
For any finite type , including the empty type, let , let be an arbitrary kernel, and let be a real matrix indexed by . This property requires that admit an expansion with and , that every finite quadratic form be real and nonnegative, and that be summable with sum . It also requires and positive semidefinite, with . For every real vector on , define
Then must be summable for every , its sums must be summable over , and
For empty , the occupation space has one element and the product defining is .
QAlgorithms.Papers.Independent.Intakenext100.P46.CovBorder
For an arbitrary real matrix , indexed in the order , this defines the existence of a state kernel on satisfying , which is separable and for which there exist and a real matrix satisfying , such that for every real there exist a state kernel on and a real matrix with
Here a state kernel on has an expansion with and , has real nonnegative finite quadratic forms, and has summable real diagonal with sum . With J=\begin{psmallmatrix}0&I_2\\-I_2&0\end{psmallmatrix}, means that , is positive semidefinite, and for every the inner series and resulting outer series below are summable and satisfy
The entries of are , where and
A kernel is separable precisely when, for every positive , it differs by trace size less than from some finite convex combination of products of state kernels on , with entries . Trace size is the infimum in of the nuclear sums for expansions of the difference, and is if no expansion exists. The singleton occupation registers are identified with ; the existential witnesses occur separately from the initial centered representation with parameter .
QAlgorithms.Papers.Independent.Intakenext100.P46.CovSeparable
For an arbitrary real matrix , indexed in the order , this defines the assertion that there exists a state coefficient kernel , indexed by , which is centered Gaussian with covariance parameter and is separable, with the following literal meanings. A state kernel on a label set admits sequences such that and ; every finite quadratic form is real and nonnegative; and its real diagonal is summable with sum . Write J=\begin{psmallmatrix}0&I_2\\-I_2&0\end{psmallmatrix}. The Gaussian condition requires , positive semidefinite, and, for every , summability of each inner series and of the resulting outer series in
Here , , , and
Separability means that, for every , there is a finite convex combination , where , , and are state kernels on , whose difference from has trace size less than . The tensor product has entries ; trace size is the infimum, in , of over all nuclear expansions of the difference of the form just specified, with infimum if there is none. The two occupation labels here identify functions from a singleton to with their unique values; no separate physicality hypothesis on is imposed outside the existential condition.
QAlgorithms.Papers.Independent.Intakenext100.P46.GaussianBorder
Let be arbitrary finite types, possibly empty, and . States on a label set mean kernels with expansions , where and , with real nonnegative finite quadratic forms and a summable real diagonal of sum ; write for the extended nonnegative infimum of these expansion sums for , taking when no expansion exists. For a state on , the property first requires that, for every , its coefficients have -distance less than from some finite convex combination of product kernels of states on the two occupation spaces. It then requires the existence of one real quadrature vector and one real matrix such that satisfies the Gaussian conditions below, and for every real there exist another state on and a real matrix satisfying those same Gaussian conditions with the same , such that does not have the stated approximation property and for every pair of quadrature indices . The Gaussian conditions for a kernel , vector , and matrix are , positive semidefinite, and, for every real quadrature vector ,
with summability over for each and summability of those sums over . Here is the product over the and modes of , where
All products over empty mode sets equal ; the required nearby nonseparable states remain part of the property even in such cases.
QAlgorithms.Papers.Independent.Intakenext100.P46.GaussianEM
For any finite type , including the empty type, and real matrices on , put and . This property requires, first, the existence of an invertible real matrix and numbers such that
Second, it requires the following implication for every complex kernel on . Suppose for sequences in with , every finite quadratic form of is real and nonnegative, its real diagonal is summable with sum , , and is positive semidefinite. Suppose also that for every real quadrature vector , each family and the family of its sums over are summable, with
Then there must exist an invertible real matrix , numbers , and a surjective complex-linear isometry of such that
Here for and ; writing , the conjugation is the nested total sum . The kernels in these conditions are , where
The witnesses may depend on and need not coincide with the first witnesses ; the universal implication does not itself assert that any kernel satisfying its antecedent exists. Empty products are .
QAlgorithms.Papers.Independent.Intakenext100.P46.GroupedPhase
For any type , this abbreviates the disjoint union : each element consists of an element of together with a tag identifying the first or second copy. The two copies remain distinct even when their underlying elements agree. If is empty, this type is empty.
QAlgorithms.Papers.Independent.Intakenext100.P46.HasFiniteEM
For any finite type , possibly empty, put , let be a complex kernel on , and let be a real matrix on . This property first requires that have an expansion with and , that all its finite quadratic forms be real and nonnegative, and that its real diagonal be summable with sum . It then requires a real matrix on , numbers for every , and a surjective complex-linear isometry . They must satisfy invertibility of , for , and
Here is zero off the diagonal and equals on the diagonal. To specify the conjugations literally, let for the coordinate vector , and set
Also , where and
The nested sums defining are the total infinite-sum operations; no separate summability clauses for them occur in this property. Empty products are , and conditions indexed by empty are vacuous.
QAlgorithms.Papers.Independent.Intakenext100.P46.HasGaussian
Let be arbitrary finite types, possibly empty, put , and let be a state with coefficient kernel . Being a state means that there exist , indexed by , with and ; every finite quadratic form is real and nonnegative; and the real diagonal entries form a summable family with sum . For a real vector on and a real matrix on that same index set, the property requires and positive semidefinite, where on the two copies of . To describe its remaining requirements, for and define
For every real quadrature vector , set and
Then, for every and every , the family must be summable, the family of its sums indexed by must also be summable, and
Products over empty mode sets equal ; no nonempty-mode hypothesis is imposed.
QAlgorithms.Papers.Independent.Intakenext100.P46.IsGaussianDensity
For arbitrary finite types , including empty ones, let and let be a state with coefficients . Explicitly, admits an expansion with and , all its finite quadratic forms are real and nonnegative, and its real diagonal is summable with sum . This property says that there exist a real vector and a real matrix , both indexed by the two quadrature copies of , such that , is positive semidefinite for , and the following holds for every real quadrature vector . Define
and . Each inner family is summable, the family of inner sums is summable over , and
The witnesses are existential and are not asserted to be unique; empty products are .
QAlgorithms.Papers.Independent.Intakenext100.P46.IsPhysicalCovariance
For every finite type and every real matrix indexed by , this predicate means exactly that and
is positive semidefinite, where is obtained by viewing each real entry as complex. Positive semidefiniteness requires a Hermitian matrix with nonnegative quadratic form on every complex vector. Empty is included; both conditions then hold for its unique empty matrix.
QAlgorithms.Papers.Independent.Intakenext100.P46.IsSymplecticMatrix
For every finite type and real matrix indexed by , this predicate requires both that be a unit in the matrix ring—there exists a matrix with —and that
The definition includes empty ; its unique empty matrix satisfies both requirements.
QAlgorithms.Papers.Independent.Intakenext100.P46.ModeMatrix
For any type , this abbreviates the type of real matrices whose rows and columns are indexed by , the disjoint union of two tagged copies of . Equivalently, such a matrix is an arbitrary function . No finiteness, symmetry, or positivity condition is included; for empty , there is a unique empty matrix.
QAlgorithms.Papers.Independent.Intakenext100.P46.PositiveRoots
For real numbers , this predicate holds exactly when and
The square roots are nonnegative real square roots. The disjunction permits either value and does not require them to be distinct; when , both displayed values equal . For , the predicate is false.
QAlgorithms.Papers.Independent.Intakenext100.P46.StateBorder
For arbitrary types and a state on , this predicate says that lies in the topological boundary of the set of separable states: every open neighborhood of meets both that set and its complement within the state space. A state on a label type is a matrix admitting a countable expansion with and , having real nonnegative finite quadratic forms and a summable real diagonal of sum one. Define as the extended nonnegative infimum of over all such expansions of , with value when there are none. The state-space topology is generated by all sets , where is a state and . A state is separable when, for every , its coefficient matrix is within -distance strictly less than of a finite convex combination of product state matrices , whose entries are . The boundary predicate itself does not additionally require to be separable. No countability or finiteness assumptions on are imposed.
QAlgorithms.Papers.Independent.Intakenext100.P46.StrictPhysical
For every finite type and every real matrix indexed by , this predicate means exactly that and
is positive definite, where real entries are embedded into . Positive definiteness requires a Hermitian matrix whose quadratic form is strictly positive on every nonzero complex vector. Empty is allowed; there are then no nonzero vectors, so the strict-positivity requirement is vacuous and the predicate holds for the empty matrix.
QAlgorithms.Papers.Independent.Intakenext100.P46.Two
This abbreviation denotes the disjoint union of two copies of the singleton set , hence a two-element type whose distinct elements may be written and , corresponding respectively to in the left and right copies.
QAlgorithms.Papers.Independent.Intakenext100.P46.TypeIIDomain
For arbitrary real numbers , this defines the proposition
Both comparisons are strict. No positivity or nonzero assumption is imposed on or ; division by zero equals zero and the real square root of a nonpositive number equals zero.
QAlgorithms.Papers.Independent.Intakenext100.P46.borderCMFrom
For any real matrix , indexed by the disjoint union of two singleton sets, and any real numbers , this defines the real matrix
The quadrature blocks follow the order of those two singletons. The definition assumes neither that is invertible nor that the result is a physical covariance; the matrix inverse is total and is the zero matrix when its argument is singular.
QAlgorithms.Papers.Independent.Intakenext100.P46.borderLeft
For all real numbers , with no additional restrictions, this defines
QAlgorithms.Papers.Independent.Intakenext100.P46.borderRightI
For arbitrary real numbers , this defines the real-valued function
There are no positivity or nonzero assumptions on the arguments; in particular, is allowed, with the convention .
QAlgorithms.Papers.Independent.Intakenext100.P46.borderRightII
For arbitrary real numbers , this defines the real-valued function
There are no positivity or nonzero assumptions on the arguments; is included, with .
QAlgorithms.Papers.Independent.Intakenext100.P46.bosonic
For every real number , the declaration defines
The domain is all of , with no nonnegativity assumption. The real logarithm is total, taking value at zero and at negative ; consequently the formula is defined at , , and negative arguments as well.
QAlgorithms.Papers.Independent.Intakenext100.P46.congruence
For arbitrary real matrices and , indexed by two position labels followed by two momentum labels, this defines
There is no assumption that is invertible or that is symmetric or positive.
QAlgorithms.Papers.Independent.Intakenext100.P46.coth
For every real number , this defines . The quotient uses total real division, so its value at is .
QAlgorithms.Papers.Independent.Intakenext100.P46.covarianceObjective
For every finite type , every pair of real matrices indexed by , and every , the declaration defines
No symmetry, positivity, covariance, or normalization condition is imposed on these arguments. The real logarithm is defined at every real , with and when . If is empty, the trace term is zero.
QAlgorithms.Papers.Independent.Intakenext100.P46.covarianceType
For arbitrary real numbers , this defines a natural number by the ordered cases
All four inputs are unrestricted; every quotient uses the convention that division by zero equals zero. In particular, the first case takes precedence regardless of the quotient values.
QAlgorithms.Papers.Independent.Intakenext100.P46.densityEntropy
For any type , put and let be its coordinate unit vectors. Let be a state matrix: its entries admit a countable expansion with and ; all its finite quadratic forms are real and nonnegative; and its real diagonal is summable with sum one. Let be the chosen bounded complex-linear operator satisfying , with zero used if no such operator exists. The definition assigns
where is formed using the real continuous functional calculus for self-adjoint operators. This is an extended nonnegative sum and may be infinite. The logarithm is natural, and the scalar function has under the total real-logarithm convention. No countability assumption on is required; if is empty, there is no state satisfying the diagonal-sum condition.
QAlgorithms.Papers.Independent.Intakenext100.P46.displacementPenalty
For every finite type , every real matrix indexed by , and every real vector on , put
The declaration defines
Thus and . No symmetry or positivity assumption on , and no condition on , is imposed; the definition itself does not assert that its value is nonnegative. If is empty, the sum is zero.
QAlgorithms.Papers.Independent.Intakenext100.P46.emFrom
For every finite type , every real matrix indexed by , and every function , define
The declaration defines the real matrix
There are no invertibility, symplecticity, or positivity assumptions on or . Matrix inversion and real division are total operations: a singular square matrix has inverse zero, and division by zero gives zero. The real logarithm is also total, with and for negative ; in particular, the formula remains defined when . The finite type may be empty, in which case this is the unique matrix with empty index set.
QAlgorithms.Papers.Independent.Intakenext100.P46.exceptionalDelta
For arbitrary real numbers , this defines
No lower bounds on , and no sign condition on the resulting value, are imposed.
QAlgorithms.Papers.Independent.Intakenext100.P46.exceptionalLower
For arbitrary real numbers , let . This defines a real matrix indexed by the disjoint union of two singleton sets; ordering the left singleton before the right singleton, it is
Here is the total real-power function used in the declaration. No positivity or invertibility hypotheses are part of the definition, and division by zero is assigned the value .
QAlgorithms.Papers.Independent.Intakenext100.P46.exceptionalUpper
For arbitrary real numbers , let . This defines a real matrix indexed by the disjoint union of two singleton sets; ordering the left singleton before the right singleton, it is
Here is the total real-power function used in the declaration. The arguments are unrestricted, including cases with zero denominators, for which division has value .
QAlgorithms.Papers.Independent.Intakenext100.P46.gree
For arbitrary finite types , possibly empty, put and let be a state on . For any label set , a state here is a coefficient kernel admitting an expansion with and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . Define to be the infimum, in , of over all such expansions of a kernel , with value if there is none. A state on is admitted in the infimum defining this quantity exactly when both of the following hold: its coefficients can, for every , be approximated within -distance strictly less than by a finite convex combination of kernels , where are states on and , respectively, and ; and there exist a real quadrature vector and a symmetric real matrix with positive semidefinite, where on the two copies of , such that the explicitly summable characteristic series satisfies
Here summability is required first over for each , then over ; is the product over all modes of , with and
The value assigned is
where is a chosen bounded operator with coefficient kernel if one exists, and is otherwise. For finite matrices , unless ; otherwise
using continuous functional calculus, , and in . The supremum includes , and an empty outer infimum is ; this definition does not assert attainment or finiteness.
QAlgorithms.Papers.Independent.Intakenext100.P46.groupedCCR
For every finite type , this defines the real matrix indexed by with block form
Thus entries within either tagged copy are zero, the entry from the first copy at to the second copy at is , and the reverse-block entry is . Empty is allowed and produces the empty matrix.
QAlgorithms.Papers.Independent.Intakenext100.P46.hyperbolicMixing
For every , with rows and columns indexed by the two elements of in left-then-right order, the declaration defines
There is no restriction on , including .
QAlgorithms.Papers.Independent.Intakenext100.P46.joinedCoefficients
For arbitrary types , with no finiteness assumptions, and any complex kernel indexed by pairs of occupation functions , this defines a kernel indexed by occupation functions on the disjoint union . For all ,
The restrictions use the two injections into the disjoint union. No positivity, normalization, or summability assumption on is required.
QAlgorithms.Papers.Independent.Intakenext100.P46.modeEM
For every real number , this defines the real value
There is no restriction on . Division and logarithm are total real operations: division by zero gives zero, , and the real logarithm of a negative nonzero argument equals the logarithm of its absolute value. In particular, the defined value is zero at both and .
QAlgorithms.Papers.Independent.Intakenext100.P46.modeRotation
For every , with rows and columns indexed by the two elements of in left-then-right order, the declaration defines
The definition applies to every real , with no interval or sign restriction.
QAlgorithms.Papers.Independent.Intakenext100.P46.normalDiagonal
For every finite type and arbitrary function , this defines the real matrix indexed by
Each tagged copy has diagonal entry at , and all other entries are zero. No sign or lower-bound condition on is imposed. Empty gives the empty matrix.
QAlgorithms.Papers.Independent.Intakenext100.P46.normalization
For every finite type and every function , the declaration defines
No lower bound on is assumed. Division by zero gives zero, and the total real logarithm satisfies and for negative ; thus all real inputs are included, and a factor with is zero. If is empty, the product is .
QAlgorithms.Papers.Independent.Intakenext100.P46.operatorRelativeEntropy
For any type , let , with coordinate unit vectors . A state on is a matrix admitting an expansion , where and , such that every finite quadratic form is real and nonnegative, the real diagonal entries are summable, and . Given two such states , choose bounded complex-linear operators having their respective coordinate matrices; the construction assigns the zero operator if no such operator exists. The defined value is
where unless ; when that inclusion holds, it equals
with matrix functions interpreted by continuous functional calculus and the real natural logarithm. The supremum includes , whose contribution is zero; dimensions admitting no orthonormal family contribute no values. No countability or finiteness assumption on is imposed.
QAlgorithms.Papers.Independent.Intakenext100.P46.pairValues
For arbitrary real numbers , this defines a real-valued function on the disjoint union of two singleton sets by assigning to the left element and to the right element .
QAlgorithms.Papers.Independent.Intakenext100.P46.ree
For arbitrary types and a state on , the definition assigns , where ranges over separable states on . Here a state on a label type is a matrix with an expansion , where and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum one. To specify separability, define
an extended nonnegative infimum, equal to if there is no such expansion. A state is separable precisely when, for every , there is a finite convex combination of product state matrices , with , such that . The quantity is the supremum over every and every orthonormal family in of the following value: compress the chosen bounded operators representing to matrices , ; return if , and otherwise return , where and matrix functions use continuous functional calculus. A representing operator is assigned zero if none exists. The supremum includes the empty orthonormal family, and an empty set of separable comparison states gives infimum . No minimizing state is asserted to exist.
QAlgorithms.Papers.Independent.Intakenext100.P46.rotateBoth
For every real number , this defines the real matrix indexed by two position labels followed by two momentum labels as
QAlgorithms.Papers.Independent.Intakenext100.P46.squeezeBoth
For every real number , this defines the real matrix indexed by two position labels followed by two momentum labels as
QAlgorithms.Papers.Independent.Intakenext100.P46.standardCM
For arbitrary real numbers , this defines a real matrix indexed by two grouped copies of a two-element type. Ordering its indices as , where distinguish the two singleton summands, the matrix is
No positivity or physical-covariance hypothesis is imposed on its parameters.
QAlgorithms.Papers.Independent.Intakenext100.P46.symmetricBorderQ
For arbitrary real numbers , this defines a real matrix on the disjoint union of two singleton sets. In the order left singleton, right singleton, put
The matrix is
The powers use the total real-power function; no positivity or invertibility assumption is required. In particular is allowed, and the quotient defining then has value .
QAlgorithms.Papers.Independent.Intakenext100.P46.symmetricCM
For arbitrary real numbers , this defines the real matrix on the grouped indices , with the elements of a disjoint union of two singleton sets, given by
There are no restrictions on the three real parameters.
QAlgorithms.Papers.Independent.Intakenext100.P46.symmetricCandidateCM
For arbitrary real numbers , order the two singleton mode labels as , and put
The definition returns the real matrix
There are no positivity or invertibility assumptions. Scalar division and inversion are total with , a singular matrix has zero matrix inverse, and the real square root of a nonpositive number is ; consequently gives the zero matrix. For , .
QAlgorithms.Papers.Independent.Intakenext100.P46.symmetricGammas
For arbitrary real numbers , this defines a real-valued function on the left and right elements of a disjoint union of two singleton sets by
No parameter restrictions are imposed; the real square-root function assigns zero to a negative argument.
QAlgorithms.Papers.Independent.Intakenext100.P46.symmetricModeBlock
For arbitrary real numbers , this defines a real matrix indexed by the disjoint union of two singleton sets. In the order consisting of the left element followed by the right element, it is
QAlgorithms.Papers.Independent.Intakenext100.P46.symmetricObjective
For arbitrary real numbers , this defines the real number
There are no positivity, nonzero-denominator, or nonnegative-radicand assumptions. The real operations are total: division by zero is zero, the square root of a negative number is zero, , and the real logarithm of a negative number is the logarithm of its absolute value.
QAlgorithms.Papers.Independent.Intakenext100.P46.symmetricSq
For arbitrary real numbers , this defines a real matrix indexed, in order, by the left and right elements of a disjoint union of two singleton sets:
Here is the total real-power function. No positivity or nonzero-denominator assumptions are imposed; the definition includes nonpositive bases and uses total real division, for which division by zero is zero.
QAlgorithms.Papers.Independent.Intakenext100.P46.symmetricValue
For any state on pairs of occupations of two singleton mode sets and arbitrary real numbers , this defines a value in by
Here a state on the occupation label set is a complex kernel admitting an expansion , with and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . To define the candidate covariance, put
The condition requires , positive semidefiniteness of , and, for every , summability of each inner series and of the outer series in
where
For a state kernel , let be a bounded operator on having that kernel if one exists, and the zero operator otherwise. The quantity is explicitly
where, for the finite matrices ,
The matrix functions in this formula use continuous functional calculus. The supremum includes , hence the empty orthonormal family. The infimum ranges over all qualifying pairs , without an additional separability requirement or any restriction on ; it equals if there are no qualifying pairs. Scalar quotients and matrix inverses in the candidate formula retain their total conventions, including zero scalar division and zero inverse for singular matrices.
QAlgorithms.Papers.Independent.Intakenext100.P46.symplecticLift
For every real matrix indexed by the two elements of a disjoint union of singleton sets, this defines the real matrix on the corresponding grouped four-element index set by
There is no invertibility hypothesis on ; the inverse is the total matrix inverse, which is the zero matrix when is singular.
QAlgorithms.Papers.Independent.Intakenext100.P46.thermalGibbsKernel
For any finite type , including the empty type, and any real-valued function , this defines a complex kernel on occupation functions by
The real product is regarded as a complex number. No positivity condition on is imposed. If is empty, there is one occupation function and its diagonal entry is the empty product ; if some , every diagonal entry is .
QAlgorithms.Papers.Independent.Intakenext100.P46.tmstBorderCM
For every real , put
This defines the real matrix on the four coordinates
There is no assumption that , that the matrix is a physical covariance, or that it has any separability property. Division by zero is zero, so at the definition uses , , and .
QAlgorithms.Papers.Independent.Intakenext100.P46.tmstObjective
For arbitrary real numbers , this defines
No restrictions are imposed on the three arguments. Division by zero is zero, , and the real logarithm of a negative argument means the logarithm of its absolute value; in particular, this definition gives .
QAlgorithms.Papers.Independent.Intakenext100.P46.typeICM
For arbitrary real numbers , define
This declaration defines the real matrix, in the order , by
There are no positivity or physicality assumptions on the parameters. Reciprocals of zero are zero and real square roots of nonpositive inputs are zero; consequently the defined matrix is zero when .
QAlgorithms.Papers.Independent.Intakenext100.P46.typeIICM
For arbitrary real numbers , define
This declaration defines the real matrix, in the order , by
There are no positivity or physicality assumptions on the parameters. Reciprocals of zero are zero and real square roots of nonpositive inputs are zero; consequently the defined matrix is zero when .
QAlgorithms.Papers.Independent.Intakenext100.P46.weylDisplacedDensity
Let be any finite types, possibly empty, and let be a state indexed by : its coefficients admit an expansion with and , every finite quadratic form is real and nonnegative, and its real diagonal entries are summable with sum . For any real vector indexed by , put , , and . Define
Let be the kernel on whose -entry is the product, over modes in and modes in , of , using the corresponding component of and on each subsystem. The declaration defines the matrix
The displayed nested order of the infinite sums is part of the definition. Its return type is a matrix; this declaration alone supplies no state or separability conclusion for that matrix. Products over empty mode sets are .
QAlgorithms.Papers.Independent.Intakenext100.P46.xSqueeze
For every , label the elements of by , and order the doubled index set as . The declaration defines the real matrix
No positivity assumption on is imposed. The real square root is zero for nonpositive inputs, and , so the matrix is zero whenever .
QAlgorithms.Papers.Independent.Intakenext100.P46.ySqueeze
For every real number , this defines the real matrix
with two position labels preceding two momentum labels. No positivity assumption is imposed on : the real square root is zero for , and the reciprocal of zero is defined as zero, so the resulting matrix is zero whenever .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.