Definitions for Conditions for the local manipulation of Gaussian states
DefinitionQAlgorithms_Papers_Independent_Gap48_P47The objects the formalized statements of Conditions for the local manipulation of Gaussian states (arXiv:quant-ph/0109126) are stated in. Each was checked against the paper by a blind read-back and a moderator.
TwoModeGaussianDensity: PDF pp.1--2 and note [12], p.4: actual normalized two-oscillator Gaussian state, specified finite covariance, arbitrary first moments and finite energy. The accepted characteristic uses W(v)=exp(i v^T O); the source's D(z) is W(Sigma^T z). The covariance normalization is unchanged by this reparametrization.NormalVector: PDF p.2: the four real coordinates of the local symplectic normal form.associatedVector: PDF p.2, below (1): compute the unique associated vector from the four determinants. For physical covariances the marginal determinants are positive and the discriminants are nonnegative. The larger correlation singular value is nonnegative, and the sign of the other is fixed by det B. At c=0 both correlations vanish, so the explicit zero branch avoids division by zero. No assertion about nonphysical matrices is used in any theorem.logCriterionPolynomial: PDF p.2: logCriterionPolynomial, transcribed from its explicit definition, not intermediate (8).f1: PDF p.2: f1 for the source and target covariances.f2: PDF p.2: f2. In the stated criteria w2>0 enforces x*y != 0; ordinary division is therefore used only on its nonzero domain.w1: PDF p.3, (9): upper admissible absolute correlation product.w2: PDF p.3, (9): lower admissible absolute correlation product.joinOccupation: PDF pp.1--2: a single retained oscillator followed by m ancillary oscillators. This is a basis relabeling, not a finite occupation cutoff.firstOccupation: PDF pp.1--2: retained occupation coordinate in a local dilation.restOccupation: PDF pp.1--2: all ancillary occupation coordinates, including m=0.appendProduct: PDF pp.1--2 and Fig.1: independent input and ancillary density product, transported to the completed (1+m)-mode space.localDilationOutput: PDF pp.1--2, Fig.1: actual bounded-unitary conjugation followed by the ancillary partial trace. The unitary and ancilla are fixed for every input.IsLocalGaussianDilation: PDF pp.1--2, Fig.1 and p.4 note [10]: one local LOG, with arbitrary finite ancilla count, actual normalized Gaussian environment, and a Gaussian unitary including translations. Its action on EVERY trace-class input is fixed; complete positivity and trace preservation are explicit.localProduct: PDF pp.1--2: tensor product of the two independent local maps, retaining off-diagonal blocks. The inner map acts on Bob and the outer map on Alice.LOGReachable: PDF pp.1--2: actual state convertibility by LOG. The operations may be chosen for this known input, but each is a lawful channel on all inputs. The two ancillas are independent; no shared randomness is introduced.LOGInSystemOne: Proposition 1, PDF pp.2--3: noisy LOG on Alice with reversible Gaussian unitary/translation on Bob, as the proof expressly permits. Independent normal-form changes are included by composition of the local operations.LocalCP: PDF p.2, (3): the EXACT source plus-i local CP constraint for the passive matrix M in Gamma -> M^T Gamma M+G. No invertibility of M or G is required.IsAffineLocalGaussian: PDF p.2, (2)--(3), and note [14], p.4: the affine Gaussian CPTP map, expressed on all actual density operators by its Weyl characteristic. For W(v)=exp(i v^T O), the source passive covariance convention pulls v back to M v. The noise multiplier has /4 because vacuum covariance is I. Summability excludes total-tsum defaults, including on non-Gaussian inputs.localSymplecticMatrix: PDF p.2 and p.4 note [13]: block diagonal local passive matrix S1 direct-sum S2.localCongruence: PDF p.2 and p.4 note [13]: local symplectic action in the source convention.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P19
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P39
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P10
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier30_P14
/-!
Eisert--Plenio, arXiv:quant-ph/0109126v2, PDF pp.1--4.
Interleaved (X1,P1,X2,P2), hbar=1, vacuum covariance I. All density
operators act on completed oscillator spaces. New definitions are paper-local.
The source's S acts by S^T Gamma S; the accepted Gaussian unitary stores
an active matrix S^T. No measurement, communication, or correlated ancilla
is part of LOG. Six defective source claims are documented in HARD.md.
Compilation is pending the required batch handoff.
-/
noncomputable section
open scoped BigOperators ComplexOrder
namespace QAlgorithms.Papers.Independent.Gap48.P47
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel)
open QAlgorithms.Papers.Independent.Claimed50.P19
(Cov FockIndex DensityKernel GaussianWithCovariance CharacteristicSummable
multimodeWeylTrace covarianceCharacteristicValue modeCovarianceBlock
standardFormCovariance)
open QAlgorithms.Papers.Independent.Renew46.P39 (AffineMultimodeGaussianUnitary)
open QAlgorithms.Papers.Independent.Frontier30.P08 (interleavedSymplecticForm)
open QAlgorithms.Papers.Independent.Dependency50.P10 (complexify)
open QAlgorithms.Papers.Independent.Frontier30.P14 (boundedUnitaryConjugation)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.1--2 and note [12], p.4: actual normalized two-oscillator Gaussian
state, specified finite covariance, arbitrary first moments and finite energy.
The accepted characteristic uses W(v)=exp(i v^T O); the source's D(z) is
W(Sigma^T z). The covariance normalization is unchanged by this reparametrization. -/
structure TwoModeGaussianDensity where
density : State (FockIndex 2)
covariance : Cov 2
gaussian : GaussianWithCovariance density.coefficients covariance
/-- PDF p.2: the four real coordinates of the local symplectic normal form. -/
structure NormalVector where
one : ℝ
two : ℝ
three : ℝ
four : ℝ
/-- PDF p.2, below (1): compute the unique associated vector from the four
determinants. For physical covariances the marginal determinants are positive
and the discriminants are nonnegative. The larger correlation singular value
is nonnegative, and the sign of the other is fixed by det B. At c=0 both
correlations vanish, so the explicit zero branch avoids division by zero.
No assertion about nonphysical matrices is used in any theorem. -/
def associatedVector (Gamma : Cov 2) : NormalVector :=
let a := (modeCovarianceBlock Gamma 0 0).det
let b := (modeCovarianceBlock Gamma 1 1).det
let p := (modeCovarianceBlock Gamma 0 1).det
let q := (p ^ 2 - Gamma.det + a * b) / Real.sqrt (a * b)
let c := Real.sqrt ((q + Real.sqrt (q ^ 2 - 4 * p ^ 2)) / 2)
⟨Real.sqrt a, Real.sqrt b, c, if c = 0 then 0 else p / c⟩
/-- PDF p.2: logCriterionPolynomial, transcribed from its explicit definition, not intermediate (8). -/
def logCriterionPolynomial (a b c d : ℝ) : ℝ :=
(a ^ 2 - 1) + (b ^ 2 - 1) * c ^ 2 * d ^ 2 + 2 * c * d -
a * b * (c ^ 2 + d ^ 2)
/-- PDF p.2: f1 for the source and target covariances. -/
def f1 (Gamma target : Cov 2) (x y : ℝ) : ℝ :=
let s := associatedVector Gamma
let t := associatedVector target
logCriterionPolynomial t.one s.one (x / s.three) (y / s.four)
/-- PDF p.2: f2. In the stated criteria w2>0 enforces x*y != 0;
ordinary division is therefore used only on its nonzero domain. -/
def f2 (Gamma target : Cov 2) (x y : ℝ) : ℝ :=
let s := associatedVector Gamma
let t := associatedVector target
logCriterionPolynomial t.two s.two (t.three / x) (t.four / y)
/-- PDF p.3, (9): upper admissible absolute correlation product. -/
def w1 (Gamma target : Cov 2) : ℝ :=
let s := associatedVector Gamma
let t := associatedVector target
|s.three * s.four| * t.one / s.one
/-- PDF p.3, (9): lower admissible absolute correlation product. -/
def w2 (Gamma target : Cov 2) : ℝ :=
let s := associatedVector Gamma
let t := associatedVector target
|t.three * t.four| * s.two / t.two
/-- PDF pp.1--2: a single retained oscillator followed by m ancillary oscillators.
This is a basis relabeling, not a finite occupation cutoff. -/
def joinOccupation {m : ℕ} (u : FockIndex 1) (e : FockIndex m) :
FockIndex (1 + m) :=
fun j => if h : j.val = 0 then u 0 else e ⟨j.val - 1, by omega⟩
/-- PDF pp.1--2: retained occupation coordinate in a local dilation. -/
def firstOccupation {m : ℕ} (u : FockIndex (1 + m)) : FockIndex 1 :=
fun _ => u ⟨0, by omega⟩
/-- PDF pp.1--2: all ancillary occupation coordinates, including m=0. -/
def restOccupation {m : ℕ} (u : FockIndex (1 + m)) : FockIndex m :=
fun j => u ⟨j.val + 1, by omega⟩
/-- PDF pp.1--2 and Fig.1: independent input and ancillary density product,
transported to the completed (1+m)-mode space. -/
def appendProduct {m : ℕ} (X : DensityKernel 1) (sigma : DensityKernel m) :
DensityKernel (1 + m) :=
fun u v => X (firstOccupation u) (firstOccupation v) *
sigma (restOccupation u) (restOccupation v)
/-- PDF pp.1--2, Fig.1: actual bounded-unitary conjugation followed by the
ancillary partial trace. The unitary and ancilla are fixed for every input. -/
def localDilationOutput {m : ℕ} (U : AffineMultimodeGaussianUnitary (1 + m))
(sigma : DensityKernel m) (X : DensityKernel 1) : DensityKernel 1 :=
fun u v => ∑' e : FockIndex m,
boundedUnitaryConjugation U.unitary (appendProduct X sigma)
(joinOccupation u e) (joinOccupation v e)
/-- PDF pp.1--2, Fig.1 and p.4 note [10]: one local LOG, with arbitrary finite
ancilla count, actual normalized Gaussian environment, and a Gaussian unitary
including translations. Its action on EVERY trace-class input is fixed;
complete positivity and trace preservation are explicit. -/
def IsLocalGaussianDilation (Phi : DensityKernel 1 → DensityKernel 1) : Prop :=
IsTraceClassChannel Phi ∧
∃ (m : ℕ) (sigma : State (FockIndex m)) (gamma : Cov m)
(U : AffineMultimodeGaussianUnitary (1 + m)),
GaussianWithCovariance sigma.coefficients gamma ∧
∀ X, IsTraceClass X → Phi X = localDilationOutput U sigma.coefficients X
/-- PDF pp.1--2: tensor product of the two independent local maps, retaining
off-diagonal blocks. The inner map acts on Bob and the outer map on Alice. -/
def localProduct (Phi Psi : DensityKernel 1 → DensityKernel 1)
(X : DensityKernel 2) : DensityKernel 2 :=
fun u v =>
Phi (fun a b =>
Psi (fun c d => X (joinOccupation a c) (joinOccupation b d))
(restOccupation (m := 1) u) (restOccupation (m := 1) v))
(firstOccupation (m := 1) u) (firstOccupation (m := 1) v)
/-- PDF pp.1--2: actual state convertibility by LOG. The operations may be
chosen for this known input, but each is a lawful channel on all inputs.
The two ancillas are independent; no shared randomness is introduced. -/
def LOGReachable (rho target : TwoModeGaussianDensity) : Prop :=
∃ Phi Psi, IsLocalGaussianDilation Phi ∧ IsLocalGaussianDilation Psi ∧
localProduct Phi Psi rho.density.coefficients = target.density.coefficients
/-- Proposition 1, PDF pp.2--3: noisy LOG on Alice with reversible Gaussian
unitary/translation on Bob, as the proof expressly permits. Independent
normal-form changes are included by composition of the local operations. -/
def LOGInSystemOne (rho target : TwoModeGaussianDensity) : Prop :=
∃ (Phi : DensityKernel 1 → DensityKernel 1)
(U : AffineMultimodeGaussianUnitary 1),
IsLocalGaussianDilation Phi ∧
localProduct Phi (boundedUnitaryConjugation U.unitary)
rho.density.coefficients = target.density.coefficients
/-- PDF p.2, (3): the EXACT source plus-i local CP constraint for the passive
matrix M in Gamma -> M^T Gamma M+G. No invertibility of M or G is required. -/
def LocalCP (M G : Cov 1) : Prop :=
G.transpose = G ∧
(complexify G + Complex.I • complexify (interleavedSymplecticForm 1) -
Complex.I • complexify
(M.transpose * interleavedSymplecticForm 1 * M)).PosSemidef
/-- PDF p.2, (2)--(3), and note [14], p.4: the affine Gaussian CPTP map,
expressed on all actual density operators by its Weyl characteristic.
For W(v)=exp(i v^T O), the source passive covariance convention pulls v back
to M v. The noise multiplier has /4 because vacuum covariance is I.
Summability excludes total-tsum defaults, including on non-Gaussian inputs. -/
def IsAffineLocalGaussian (Phi : DensityKernel 1 → DensityKernel 1)
(M G : Cov 1) : Prop :=
IsTraceClassChannel Phi ∧ LocalCP M G ∧
∃ d : (Fin 1 × Fin 2) → ℝ, ∀ (rho : State (FockIndex 1)) v,
CharacteristicSummable rho.coefficients (M.mulVec v) ∧
CharacteristicSummable (Phi rho.coefficients) v ∧
multimodeWeylTrace (Phi rho.coefficients) v =
multimodeWeylTrace rho.coefficients (M.mulVec v) *
covarianceCharacteristicValue G d v
/-- PDF p.2 and p.4 note [13]: block diagonal local passive matrix S1 direct-sum S2. -/
def localSymplecticMatrix (S1 S2 : Cov 1) : Cov 2 :=
fun i j => if i.1 = j.1 then
(if i.1 = 0 then S1 (0, i.2) (0, j.2) else S2 (0, i.2) (0, j.2)) else 0
/-- PDF p.2 and p.4 note [13]: local symplectic action in the source convention. -/
def localCongruence (Gamma : Cov 2) (S1 S2 : Cov 1) : Cov 2 :=
let S := localSymplecticMatrix S1 S2
S.transpose * Gamma * S
/-! Sanity examples pin the identity-channel polynomial, actual basis ordering,
empty ancilla, uncertainty sign, and block placement. Source proofs are omitted. -/
example (a : ℝ) : logCriterionPolynomial a a 1 1 = 0 := by
unfold logCriterionPolynomial
ring
example (Gamma : Cov 2)
(hthree : (associatedVector Gamma).three ≠ 0)
(hfour : (associatedVector Gamma).four ≠ 0) :
f1 Gamma Gamma (associatedVector Gamma).three
(associatedVector Gamma).four = 0 := by
dsimp [f1]
rw [div_self hthree, div_self hfour]
unfold logCriterionPolynomial
ring
example {m : ℕ} (u : FockIndex 1) (e : FockIndex m) :
firstOccupation (joinOccupation u e) = u := by
funext i
have hi : i = 0 := Subsingleton.elim _ _
subst i
simp [firstOccupation, joinOccupation]
example (u : FockIndex 1) (e : FockIndex 0) :
joinOccupation u e 0 = u 0 := by
simp [joinOccupation]
example : interleavedSymplecticForm 1 (0, 0) (0, 1) = 1 := by
simp [interleavedSymplecticForm]
example (S1 S2 : Cov 1) :
localSymplecticMatrix S1 S2 (1, 0) (1, 1) = S2 (0, 0) (0, 1) := by
simp [localSymplecticMatrix]
end QAlgorithms.Papers.Independent.Gap48.P47
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Gap48.P47.IsAffineLocalGaussian
For a map on one-mode complex kernels and arbitrary real matrices , this predicate requires a channel condition, the conditions and , and the existence of a single real two-component vector such that, for every one-mode density kernel and every real two-component vector ,
Here J=\begin{psmallmatrix}0&1\\-1&0\end{psmallmatrix}, real matrices are embedded entrywise in the complex positive-semidefinite condition, and
For both and , every inner series and the series of their sums must be summable. A kernel on an index set is nuclear here if it has entries for sequences with summable ; it is a density kernel if it is nuclear, every finite quadratic form is real and nonnegative, and its real diagonal is summable with sum . The channel condition says that preserves nuclear kernels, is additive on nuclear inputs and complex homogeneous on nuclear inputs, and, for every , sends every density kernel on to a density kernel under the amplification
The test includes , when no density kernel exists on the empty index set. The vector is independent of and ; no positive-definiteness condition on is separately imposed.
QAlgorithms.Papers.Independent.Gap48.P47.IsLocalGaussianDilation
For a map from one-mode complex coefficient kernels to one-mode complex coefficient kernels, this predicate requires the following channel condition and dilation representation. For any occupation index set , call a kernel nuclear if there are sequences such that is summable and ; call it a density kernel if it is nuclear, every finite quadratic form is real and nonnegative, and with summable real diagonal. The channel condition says that preserves nuclear kernels, is additive on pairs of nuclear kernels and homogeneous over on nuclear kernels, and, for every and every density kernel indexed by , the kernel
is a density kernel. Here . The dilation requirement is that there exist , an environment density kernel on , a real covariance matrix , and an affine Gaussian unitary on , such that has Gaussian covariance and, for every nuclear one-mode kernel ,
Gaussian covariance here means that is positive definite, is positive semidefinite, the series is summable, and there is a real mean vector such that, for every real quadrature vector , each inner series and the outer series in
are summable. The quadrature order is , has blocks \begin{psmallmatrix}0&1\\-1&0\end{psmallmatrix}, and , where
The affine Gaussian unitary comprises a real , real displacement , and unitary , with and coefficientwise ; coefficientwise conjugation means . Both and the channel test are included; is a singleton, whereas there is no density kernel on an empty index set. The representation is required only for nuclear .
QAlgorithms.Papers.Independent.Gap48.P47.LOGInSystemOne
For two supplied two-mode Gaussian density objects and , this predicate says that there exist a one-mode kernel map admitting a local Gaussian dilation and a one-mode affine Gaussian unitary such that applying unitary conjugation by to each second-mode slice and then to the resulting first-mode kernel gives exactly . In occupation coordinates this means
All displayed occupation coordinates range over . The Gaussian density and dilation requirements are as follows: for and , a nuclear kernel admits sequences with summable and entries ; a density kernel additionally has real nonnegative quadratic forms on every finite set and summable real diagonal of sum . A Gaussian density object pairs a density kernel with a real positive definite covariance satisfying , requires summability of , and has some real mean such that, for all real quadrature vectors ,
with each inner series and the outer series summable. Here has blocks \begin{psmallmatrix}0&1\\-1&0\end{psmallmatrix},
An affine Gaussian unitary on modes comprises a unitary , a real symplectic matrix satisfying , and real displacement , with coefficientwise . Coefficients mean , and conjugation means . The local dilation condition on requires preservation of nuclear kernels, complex linearity on nuclear kernels, and preservation of density kernels under the slice amplification to for every ; it further requires an , an environment Gaussian density kernel , and an affine Gaussian unitary on modes such that, for every nuclear ,
The case , with singleton , is allowed; the density test is vacuous.
QAlgorithms.Papers.Independent.Gap48.P47.LOGReachable
For two supplied two-mode Gaussian density objects and , this predicate says that there exist maps on one-mode complex kernels, each admitting the local Gaussian dilation described below, such that their successive slice action sends the coefficient kernel of exactly to that of :
All occupation coordinates range over . To specify the objects and dilation condition, put , , and let have the blocks \begin{psmallmatrix}0&1\\-1&0\end{psmallmatrix} in mode order. A nuclear kernel admits with summable and . A density kernel is nuclear, has real nonnegative quadratic forms on every finite set of indices, and has summable with sum . Each supplied Gaussian density object consists of such a density kernel , a real covariance with positive definite and positive semidefinite, summable , and some real mean for which
for every real , with each inner series and the outer series summable. Here
A map admitting a local Gaussian dilation must preserve nuclear kernels, be complex linear on them, and send every density kernel on , for every , to a density kernel when applied to its -indexed slices. It must also admit some , an environment density kernel with Gaussian covariance in the preceding sense, and a unitary , together with real satisfying and , such that for every nuclear ,
Unitary coefficients are , and unitary conjugations use the displayed nested-sum convention. The two maps may have different environments and unitaries. Zero environment modes are allowed, with a singleton; the channel test has no density inputs.
QAlgorithms.Papers.Independent.Gap48.P47.LocalCP
For arbitrary real matrices and , indexed in the one-mode quadrature order , this predicate means precisely
Each real matrix in the complex expression is embedded entrywise into . There is no separate invertibility or symplecticity hypothesis on .
QAlgorithms.Papers.Independent.Gap48.P47.NormalVector
A normal vector is an ordered collection of four arbitrary real numbers, with fields named , , , and ; no equations, inequalities, or other restrictions are imposed on them.
QAlgorithms.Papers.Independent.Gap48.P47.TwoModeGaussianDensity
A two-mode Gaussian density consists of a complex kernel indexed by occupation functions , a real matrix indexed by , and the following properties. There are sequences such that converges and ; for every finite set of occupation functions and every complex function on occupation functions, is real and nonnegative; the family is summable with sum ; and the family is summable. Moreover, is positive definite and is positive semidefinite, where has one block for each mode and zero entries between modes. There exists a real vector , indexed by the same four quadratures as , such that for every real quadrature vector , putting , each inner series below is summable, the series of their sums is summable, and
Here, for all and ,
QAlgorithms.Papers.Independent.Gap48.P47.appendProduct
For every natural number , every complex kernel indexed by pairs of functions , and every complex kernel indexed by pairs of functions , their appended product is the kernel indexed by occupation functions with entries
with the corresponding definitions for . No density, positivity, normalization, or summability conditions are imposed on either kernel. For , both remaining occupation functions are the unique empty function , so the result has entries .
QAlgorithms.Papers.Independent.Gap48.P47.associatedVector
For any real matrix indexed by mode–quadrature pairs , let denote its block with entries , and set
The associated vector has four real components
There are no symmetry, positivity, or physicality assumptions on . Every square root is the total real square-root function, which is on negative arguments, and division by has value .
QAlgorithms.Papers.Independent.Gap48.P47.f1
For arbitrary real matrices , indexed by , and arbitrary , write for the block of either matrix . Set
and put , , , and . Then
Neither matrix is assumed symmetric, positive, or physical; real square roots of negative arguments and quotients with zero denominator have value , so the definition includes and .
QAlgorithms.Papers.Independent.Gap48.P47.f2
For arbitrary real matrices , indexed by , and arbitrary , write for the block . Define
With , , , and , the function is
No symmetry, positivity, physicality, or nonzero-denominator assumptions are imposed. Real square roots of negative arguments are , and division by is ; in particular, and are included.
QAlgorithms.Papers.Independent.Gap48.P47.firstOccupation
For every natural number and every occupation function , the first occupation is the function on the singleton whose value is . This also applies when .
QAlgorithms.Papers.Independent.Gap48.P47.joinOccupation
For every natural number , every occupation function , and every occupation function , their joined occupation function is defined by and for . The case is included: is the unique function on the empty set, and the joined function has only the value .
QAlgorithms.Papers.Independent.Gap48.P47.localCongruence
For any real matrix indexed by two modes and their two quadratures, and any real one-mode matrices , this definition returns
using the order . No symmetry, positivity, or physical covariance condition on , and no symplecticity condition on , is required.
QAlgorithms.Papers.Independent.Gap48.P47.localDilationOutput
For every natural number , let be the set of -mode occupation indices and . The inputs are an affine Gaussian unitary on modes and arbitrary complex kernels on and on ; neither kernel is assumed to be a density kernel. An affine Gaussian unitary on modes comprises a real matrix , a real vector , and a complex linear isometric equivalence , satisfying and , where conjugation is interpreted coefficientwise by nested infinite sums, has the blocks \begin{psmallmatrix}0&1\\-1&0\end{psmallmatrix} in mode order, and
Writing , with the occupation basis vector, and writing , the defined output is the one-mode kernel
Here places 's occupation first and then the occupations of . The sums have exactly the displayed nesting; no summability condition is imposed, and a nonsummable complex series has the total infinite-sum value . The case is included: is a singleton, so the outer environment sum has one term.
QAlgorithms.Papers.Independent.Gap48.P47.localProduct
For arbitrary maps from one-mode complex kernels to one-mode complex kernels and an arbitrary two-mode complex kernel , the defined two-mode kernel is obtained by applying to each second-mode slice, then applying to the resulting first-mode kernel. Identifying one-mode occupation indices with and two-mode indices with pairs of natural numbers, its entries are exactly
The joining operation places the first occupation before the second; the first and remaining occupation operations extract those respective coordinates. No linearity, positivity, trace preservation, density, Gaussianity, or summability hypothesis is imposed on these inputs.
QAlgorithms.Papers.Independent.Gap48.P47.localSymplecticMatrix
For any two real matrices , indexed by the one-mode quadratures , this definition produces the real matrix
in the two-mode order : entries between different modes are , the mode- block is , and the mode- block is . No symplecticity condition on either input is assumed.
QAlgorithms.Papers.Independent.Gap48.P47.logCriterionPolynomial
For every four real numbers , the value of this real-valued function is
No restrictions are imposed on the four arguments.
QAlgorithms.Papers.Independent.Gap48.P47.restOccupation
For every natural number and every occupation function , the remaining occupation function has domain and value at . When , the result is the unique function on the empty set.
QAlgorithms.Papers.Independent.Gap48.P47.w1
For arbitrary real matrices , indexed by , write for the block . Set
Then
There are no symmetry, positivity, or physicality assumptions on the matrices. Negative arguments of real square roots give , and division by gives , including when the final denominator vanishes.
QAlgorithms.Papers.Independent.Gap48.P47.w2
For arbitrary real matrices , indexed by , write for the block . Set
Then
Neither matrix is required to be symmetric, positive, or physical. Real square roots of negative arguments and quotients with zero denominator have value , so a vanishing final denominator is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.