Definitions for Quantum Illumination with Gaussian States
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P85The objects the formalized statements of Quantum Illumination with Gaussian States (arXiv:0810.0534) are stated in. Each was checked against the paper by a blind read-back and a moderator.
Occ: Full occupation strings, source pp.2–3; n counts modes, not a cutoff.Array: Coefficient arrays on a complete number basis.IlluminationOperator: Generic bounded operators on that completed space.basis: The complete occupation basis, with conjugate-linear first inner argument.HasArray: All coefficients, not merely diagonal elements, pin an operator.realizeOccupationArray: Unique bounded realization when it exists. Every constructed-state target concludes HasArray and density, ruling out the zero fallback.JointDecisionEffect: A bounded binary effect decides H1. Both E and 1-E are positive, including self-adjointness. Source p.2, optimum joint quantum reception.optimumError: Equal-prior error, independently optimized over every joint binary effect. The extended nonnegative infimum never uses a real empty-infimum default.signalS: Eq.(2): S=2 NS+1.correlationQ: Eq.(2): Cq=2 sqrt(NS(NS+1)).correlationC: Classical positive-P correlation limit, p.2.bathB: Eq.(3): B=2 NB+1.returnA: Eq.(4): received variance A; the received background is NB.phaseSensitiveWignerCov: Standard-form interleaved covariance, with source vacuum variance 1/4.spdcCov: Eq.(2), constructed covariance matrix.returnCov: Eqs.(3)–(4), the two explicit returned covariance matrices.SourceGaussian: Actual Gaussian operator characteristic, in source normalization. The accepted predicate includes normalized positive trace class and symmetry.CenteredMoments: Symmetric, finite-energy second moments of arbitrary states, not just Gaussians. With accepted Weyl coordinates x=2(q,p), the directional second characteristic derivative is -4 xi^T Lambda xi. All trace sums converge. Symmetry is explicit, repairing the known defect of frozen P47 moments.spdcCoefficient: Eq.(1), all SPDC number coefficients, with NS=0 giving |0,0>.spdcVector: The constructed full SPDC vector. Its realization and unit norm are conclusions, rather than Gaussianity or covariance fields.spdcArray: Pure density from the constructed vector (1).marginalPhotonNumber: Marginal mean photon number; every use concludes summability.coherentVector: Full coherent vector, with coefficient and norm conclusions below.coherentArray: Exact coherent projector coefficients, independent of a fallback vector.PositiveP: Genuine positive P probability measure, including singular distributions at the classicality threshold. It is stronger than separability.twoOcc: Relabel the two occupation numbers without changing the Hilbert space.pairArray: Signal/idler pair arrays for invoking accepted complete separability.signalChannel: The actual single signal channel. H0 discards input and inserts theta(NB); H1 uses the thermal beam splitter with bath occupation NB/(1-k). No characteristic-function or output-moment law is assumed here.coordinateChannel: One named signal coordinate is sent through the channel; off-diagonal matrix slices are retained. Idler registers are never sent through this map.signalBlock: Independent channel uses on every signal mode, with no IID assumption on the input. The empty list is the identity; result nodes require M>=1.targetBlock: The signal block is transmitted and the entire idler is perfectly retained.onePair: Explicit relabeling of a two-mode density as a one-signal/one-idler pair.fromOnePair: Inverse relabeling; no physical operation is involved.qiReturn: Actual returned SPDC pair, applying the physical channel to (1).coherentReturn: Exact returned coherent states for any multimode amplitude vector.constantAmplitude: Source coherent energy NS in each transmitted mode.coherentExponent: Eq.(11): exact Chernoff exponent coefficient, not an optimal error definition.coherentLower: Eq.(13) at total transmitted energy E, exact at every finite parameter.returnDiscriminant: Eq.(16): positive square-root discriminant on the physical domain.williamsonX: Eq.(16): x+ and x-, with positive and negative choices respectively.williamsonT: Eq.(15): X+=diag(x+,x+), X-=diag(x-,-x-).returnSpectrum: Eq.(17), k_source=1,2 corresponding to Fin 2 values 0,1.ClassicalDensity: Eq.(19): genuine Lebesgue P density with ensemble average signal energy. There is no IID, peak-energy, per-realization, or idler-energy constraint.classicalArray: The actual correlated coherent-state mixture in (19). Coefficient integrability and density are conclusions of its target, not hypotheses.genieIntegrand: Genie error when the complete signal amplitude is revealed; this is independent all-effect optimal reception conditioned on that classical datum.genieError: Ensemble mean of the genie experiment, p.4.BlockRealized: Guard all single-mode bounded realizations used by the physical block, including off-diagonal slices and intermediate arrays. These are conclusions.TargetRealized: Every retained-idler matrix block has its actual channel realization.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P30
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P39
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P19
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P41
/-!
Statements from Tan et al., arXiv:0810.0534v1, PDF pp.1–4.
All oscillator number spaces are completed, without photon cutoff. Source
quadratures are half the accepted P30 quadratures: means and covariances are
converted by u=2d and V=4 Lambda. No defective P47 moment predicate is used.
All local definitions have bodies. Five source-ambiguity nodes are in HARD.md.
Compilation and independent moderation are pending the batch handoff.
-/
noncomputable section
open MeasureTheory Filter
open scoped BigOperators ENNReal Topology
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Intakenext100.P85
open QAlgorithms.Papers.Independent.Claimed50.P19 (Cov)
open QAlgorithms.Papers.Independent.Renew46.P41 (coherentProductCoefficient)
namespace G
export QAlgorithms.Papers.Independent.Claimed50.P30
(ModeHilbert ModeOperator Quadrature PhaseVector numberKet numberBasis
IsModeDensity GaussianMoments FockWeylSystem TraceSummable modeWeylTrace
canonicalOmega Symplectic repeatedDiagonal chernoffTrace quantumChernoff)
end G
namespace B
export QAlgorithms.Papers.Independent.Dependency50.P39
(coherentCoefficient fockKet HasFockMatrix operatorOfMatrix thermalMatrix)
export QAlgorithms.Papers.Independent.Claimed50.P39
(thermalOutputMatrix thermalProbability beamAmplitude)
end B
namespace T
export QAlgorithms.Papers.Independent.Dependency50.P33
(IsDensity IsSeparable IsBarycenter rankOne tensorApply)
end T
/-- Full occupation strings, source pp.2–3; n counts modes, not a cutoff. -/
abbrev Occ (n : ℕ) := Fin n → ℕ
/-- Coefficient arrays on a complete number basis. -/
abbrev Array (I : Type) := Matrix I I ℂ
/-- Generic bounded operators on that completed space. -/
abbrev IlluminationOperator (I : Type) := QAlgorithms.RealRegisters.Hilbert I →L[ℂ] QAlgorithms.RealRegisters.Hilbert I
/-- The complete occupation basis, with conjugate-linear first inner argument. -/
def basis (I : Type) : HilbertBasis I ℂ (QAlgorithms.RealRegisters.Hilbert I) :=
⟨LinearIsometryEquiv.refl ℂ (QAlgorithms.RealRegisters.Hilbert I)⟩
/-- All coefficients, not merely diagonal elements, pin an operator. -/
def HasArray {I : Type} (A : IlluminationOperator I) (X : Array I) : Prop :=
∀ i j, A (basis I j) i = X i j
/-- Unique bounded realization when it exists. Every constructed-state target
concludes HasArray and density, ruling out the zero fallback. -/
def realizeOccupationArray {I : Type} (X : Array I) : IlluminationOperator I :=
if h : ∃ A : IlluminationOperator I, HasArray A X then Classical.choose h else 0
/-- A bounded binary effect decides H1. Both E and 1-E are positive,
including self-adjointness. Source p.2, optimum joint quantum reception. -/
def JointDecisionEffect {I : Type} (E : IlluminationOperator I) : Prop :=
QAlgorithms.Papers.Independent.Dependency50.P13.IsPositive E ∧
QAlgorithms.Papers.Independent.Dependency50.P13.IsPositive (1 - E)
/-- Equal-prior error, independently optimized over every joint binary effect.
The extended nonnegative infimum never uses a real empty-infimum default. -/
def optimumError {I : Type} (X0 X1 : Array I) : ℝ≥0∞ :=
⨅ E : {E : IlluminationOperator I // JointDecisionEffect E}, ENNReal.ofReal
(((QAlgorithms.Papers.Independent.Dependency50.P13.operatorTrace (basis I) (E.val.comp (realizeOccupationArray X0))).re +
(QAlgorithms.Papers.Independent.Dependency50.P13.operatorTrace (basis I) ((1 - E.val).comp (realizeOccupationArray X1))).re) / 2)
/-- Eq.(2): S=2 NS+1. -/
def signalS (NS : ℝ) : ℝ := 2 * NS + 1
/-- Eq.(2): Cq=2 sqrt(NS(NS+1)). -/
def correlationQ (NS : ℝ) : ℝ := 2 * Real.sqrt (NS * (NS + 1))
/-- Classical positive-P correlation limit, p.2. -/
def correlationC (NS : ℝ) : ℝ := 2 * NS
/-- Eq.(3): B=2 NB+1. -/
def bathB (NB : ℝ) : ℝ := 2 * NB + 1
/-- Eq.(4): received variance A; the received background is NB. -/
def returnA (k NS NB : ℝ) : ℝ := 2 * k * NS + bathB NB
/-- Standard-form interleaved covariance, with source vacuum variance 1/4. -/
def phaseSensitiveWignerCov (a b c : ℝ) : Cov 2 := fun i j =>
(if i = j then (if i.1 = 0 then a else b)
else if i.1 ≠ j.1 ∧ i.2 = j.2 then (if i.2 = 0 then c else -c)
else 0) / 4
/-- Eq.(2), constructed covariance matrix. -/
def spdcCov (NS : ℝ) : Cov 2 :=
phaseSensitiveWignerCov (signalS NS) (signalS NS) (correlationQ NS)
/-- Eqs.(3)–(4), the two explicit returned covariance matrices. -/
def returnCov (present : Bool) (k NS NB : ℝ) : Cov 2 :=
if present then phaseSensitiveWignerCov (returnA k NS NB) (signalS NS)
(Real.sqrt k * correlationQ NS)
else phaseSensitiveWignerCov (bathB NB) (signalS NS) 0
/-- Actual Gaussian operator characteristic, in source normalization.
The accepted predicate includes normalized positive trace class and symmetry. -/
def SourceGaussian {n : ℕ} (W : G.FockWeylSystem n) (X : Array (Occ n))
(d : G.PhaseVector n) (V : Cov n) : Prop :=
HasArray (realizeOccupationArray X) X ∧ G.GaussianMoments W (realizeOccupationArray X) (2 • d) (4 • V)
/-- Symmetric, finite-energy second moments of arbitrary states, not just
Gaussians. With accepted Weyl coordinates x=2(q,p), the directional second
characteristic derivative is -4 xi^T Lambda xi. All trace sums converge.
Symmetry is explicit, repairing the known defect of frozen P47 moments. -/
def CenteredMoments {n : ℕ} (W : G.FockWeylSystem n) (X : Array (Occ n))
(V : Cov n) : Prop :=
HasArray (realizeOccupationArray X) X ∧ G.IsModeDensity (realizeOccupationArray X) ∧ V.transpose = V ∧
Summable (fun j : Occ n => (∑ k, (j k : ℝ)) * (X j j).re) ∧
(∀ xi, G.TraceSummable ((realizeOccupationArray X).comp (W.operator xi))) ∧
∀ xi : G.PhaseVector n,
HasDerivAt (fun t : ℝ => G.modeWeylTrace W (realizeOccupationArray X) (t • xi)) 0 0 ∧
HasDerivAt (deriv (fun t : ℝ => G.modeWeylTrace W (realizeOccupationArray X) (t • xi)))
(((-4 * ∑ i, ∑ j, xi i * V i j * xi j : ℝ) : ℂ)) 0
/-- Eq.(1), all SPDC number coefficients, with NS=0 giving |0,0>. -/
def spdcCoefficient (NS : ℝ) (j : Occ 2) : ℂ :=
if j 0 = j 1 then (Real.sqrt (NS ^ (j 0) / (NS + 1) ^ (j 0 + 1)) : ℂ)
else 0
/-- The constructed full SPDC vector. Its realization and unit norm are
conclusions, rather than Gaussianity or covariance fields. -/
def spdcVector (NS : ℝ) : G.ModeHilbert 2 :=
if h : ∃ v : G.ModeHilbert 2, ∀ j, v j = spdcCoefficient NS j then
Classical.choose h else 0
/-- Pure density from the constructed vector (1). -/
def spdcArray (NS : ℝ) : Array (Occ 2) := T.rankOne (spdcVector NS)
/-- Marginal mean photon number; every use concludes summability. -/
def marginalPhotonNumber {n : ℕ} (X : Array (Occ n)) (k : Fin n) : ℝ :=
∑' j : Occ n, (j k : ℝ) * (X j j).re
/-- Full coherent vector, with coefficient and norm conclusions below. -/
def coherentVector {n : ℕ} (alpha : Fin n → ℂ) : G.ModeHilbert n :=
if h : ∃ v : G.ModeHilbert n, ∀ j, v j = coherentProductCoefficient alpha j then
Classical.choose h else 0
/-- Exact coherent projector coefficients, independent of a fallback vector. -/
def coherentArray {n : ℕ} (alpha : Fin n → ℂ) : Array (Occ n) :=
fun i j => coherentProductCoefficient alpha i * star (coherentProductCoefficient alpha j)
/-- Genuine positive P probability measure, including singular distributions
at the classicality threshold. It is stronger than separability. -/
def PositiveP {n : ℕ} (X : Array (Occ n)) : Prop :=
T.IsDensity X ∧ ∃ mu : Measure (Fin n → ℂ), IsProbabilityMeasure mu ∧
T.IsBarycenter mu (fun alpha => coherentArray alpha) X
/-- Relabel the two occupation numbers without changing the Hilbert space. -/
def twoOcc (a b : ℕ) : Occ 2 := fun k => if k = 0 then a else b
/-- Signal/idler pair arrays for invoking accepted complete separability. -/
def pairArray (X : Array (Occ 2)) : Array (ℕ × ℕ) :=
fun p q => X (twoOcc p.1 p.2) (twoOcc q.1 q.2)
/-- The actual single signal channel. H0 discards input and inserts theta(NB);
H1 uses the thermal beam splitter with bath occupation NB/(1-k).
No characteristic-function or output-moment law is assumed here. -/
def signalChannel (present : Bool) (k NB : ℝ) (X : Array ℕ) : Array ℕ :=
if present then B.thermalOutputMatrix k (NB / (1 - k)) (B.operatorOfMatrix X)
else fun i j => B.thermalMatrix (bathB NB) i j * (∑' m : ℕ, X m m)
/-- One named signal coordinate is sent through the channel; off-diagonal
matrix slices are retained. Idler registers are never sent through this map. -/
def coordinateChannel {M : ℕ} (present : Bool) (k NB : ℝ) (r : Fin M)
(X : Array (Occ M)) : Array (Occ M) := fun i j =>
signalChannel present k NB
(fun a b => X (Function.update i r a) (Function.update j r b)) (i r) (j r)
/-- Independent channel uses on every signal mode, with no IID assumption
on the input. The empty list is the identity; result nodes require M>=1. -/
def signalBlock (M : ℕ) (present : Bool) (k NB : ℝ)
(X : Array (Occ M)) : Array (Occ M) :=
(List.ofFn (fun r : Fin M => r)).foldl
(fun Y r => coordinateChannel present k NB r Y) X
/-- The signal block is transmitted and the entire idler is perfectly retained. -/
def targetBlock (M : ℕ) (present : Bool) (k NB : ℝ)
(X : Array (Occ M × Occ M)) : Array (Occ M × Occ M) :=
T.tensorApply (signalBlock M present k NB) X
/-- Explicit relabeling of a two-mode density as a one-signal/one-idler pair. -/
def onePair (X : Array (Occ 2)) : Array (Occ 1 × Occ 1) :=
fun p q => X (twoOcc (p.1 0) (p.2 0)) (twoOcc (q.1 0) (q.2 0))
/-- Inverse relabeling; no physical operation is involved. -/
def fromOnePair (X : Array (Occ 1 × Occ 1)) : Array (Occ 2) :=
fun p q => X ((fun _ => p 0), (fun _ => p 1))
((fun _ => q 0), (fun _ => q 1))
/-- Actual returned SPDC pair, applying the physical channel to (1). -/
def qiReturn (present : Bool) (k NS NB : ℝ) : Array (Occ 2) :=
fromOnePair (targetBlock 1 present k NB (onePair (spdcArray NS)))
/-- Exact returned coherent states for any multimode amplitude vector. -/
def coherentReturn {M : ℕ} (present : Bool) (k NB : ℝ)
(alpha : Fin M → ℂ) : Array (Occ M) :=
signalBlock M present k NB (coherentArray alpha)
/-- Source coherent energy NS in each transmitted mode. -/
def constantAmplitude (M : ℕ) (NS : ℝ) : Fin M → ℂ :=
fun _ => (Real.sqrt NS : ℂ)
/-- Eq.(11): exact Chernoff exponent coefficient, not an optimal error definition. -/
def coherentExponent (k NS NB : ℝ) : ℝ :=
k * NS * (Real.sqrt (NB + 1) - Real.sqrt NB) ^ 2
/-- Eq.(13) at total transmitted energy E, exact at every finite parameter. -/
def coherentLower (k E NB : ℝ) : ℝ :=
(1 - Real.sqrt (1 - Real.exp (-2 * coherentExponent k E NB))) / 2
/-- Eq.(16): positive square-root discriminant on the physical domain. -/
def returnDiscriminant (k NS NB : ℝ) : ℝ :=
Real.sqrt ((returnA k NS NB + signalS NS) ^ 2 - 4 * k * correlationQ NS ^ 2)
/-- Eq.(16): x+ and x-, with positive and negative choices respectively. -/
def williamsonX (plus : Bool) (k NS NB : ℝ) : ℝ :=
Real.sqrt ((returnA k NS NB + signalS NS +
(if plus then returnDiscriminant k NS NB else -returnDiscriminant k NS NB)) / (2 * returnDiscriminant k NS NB))
/-- Eq.(15): X+=diag(x+,x+), X-=diag(x-,-x-). -/
def williamsonT (k NS NB : ℝ) : Cov 2 := fun i j =>
if i.2 ≠ j.2 then 0 else if i.1 = j.1 then williamsonX true k NS NB
else if i.2 = 0 then williamsonX false k NS NB else -williamsonX false k NS NB
/-- Eq.(17), k_source=1,2 corresponding to Fin 2 values 0,1. -/
def returnSpectrum (present : Bool) (k NS NB : ℝ) : Fin 2 → ℝ := fun r =>
if present then (((-1 : ℝ) ^ (r.val + 1)) * (signalS NS - returnA k NS NB) +
returnDiscriminant k NS NB) / 8
else if r = 0 then bathB NB / 4 else signalS NS / 4
/-- Eq.(19): genuine Lebesgue P density with ensemble average signal energy.
There is no IID, peak-energy, per-realization, or idler-energy constraint. -/
def ClassicalDensity (M : ℕ) (NS : ℝ) (P : ((Fin M → ℂ) × (Fin M → ℂ)) → ℝ) : Prop :=
Measurable P ∧ (∀ a, 0 ≤ P a) ∧ Integrable P ∧ (∫ a, P a) = 1 ∧
Integrable (fun a => P a * ∑ r, Complex.normSq (a.1 r)) ∧
(∫ a, P a * ∑ r, Complex.normSq (a.1 r)) = (M : ℝ) * NS
/-- The actual correlated coherent-state mixture in (19). Coefficient
integrability and density are conclusions of its target, not hypotheses. -/
def classicalArray (M : ℕ) (P : ((Fin M → ℂ) × (Fin M → ℂ)) → ℝ) :
Array (Occ M × Occ M) := fun i j => ∫ a,
(P a : ℂ) * coherentArray a.1 i.1 j.1 * coherentArray a.2 i.2 j.2
/-- Genie error when the complete signal amplitude is revealed; this is
independent all-effect optimal reception conditioned on that classical datum. -/
def genieIntegrand (M : ℕ) (k NB : ℝ)
(P : ((Fin M → ℂ) × (Fin M → ℂ)) → ℝ)
(a : (Fin M → ℂ) × (Fin M → ℂ)) : ℝ :=
P a * (optimumError (coherentReturn false k NB a.1)
(coherentReturn true k NB a.1)).toReal
/-- Ensemble mean of the genie experiment, p.4. -/
def genieError (M : ℕ) (k NB : ℝ)
(P : ((Fin M → ℂ) × (Fin M → ℂ)) → ℝ) : ℝ :=
∫ a, genieIntegrand M k NB P a
/-! Sanity examples pinning normalization, signs, endpoints and register maps. -/
example : signalS 0 = 1 ∧ correlationQ 0 = 0 ∧ correlationC 0 = 0 := by
norm_num [signalS, correlationQ, correlationC]
example (NS : ℝ) : spdcCoefficient NS (twoOcc 0 1) = 0 := by
simp [spdcCoefficient, twoOcc]
example (a b : ℕ) : twoOcc a b 0 = a ∧ twoOcc a b 1 = b := by
simp [twoOcc]
example (NS : ℝ) : spdcCov NS (0, 0) (1, 0) = correlationQ NS / 4 := by
simp [spdcCov, phaseSensitiveWignerCov]
example (NS : ℝ) : spdcCov NS (0, 1) (1, 1) = -correlationQ NS / 4 := by
simp [spdcCov, phaseSensitiveWignerCov]
example {n : ℕ} (alpha : Fin n → ℂ) (i j : Occ n) :
coherentArray alpha i j = coherentProductCoefficient alpha i * star (coherentProductCoefficient alpha j) := rfl
example (k NB : ℝ) (X : Array (Occ 0)) : signalBlock 0 true k NB X = X := by
simp [signalBlock]
example (k NB : ℝ) : coherentExponent k 0 NB = 0 := by
simp [coherentExponent]
example (k NB : ℝ) : coherentLower k 0 NB = 1 / 2 := by
norm_num [coherentLower, coherentExponent]
example (k NS NB : ℝ) : returnSpectrum false k NS NB 0 = bathB NB / 4 := by
simp [returnSpectrum]
example (k NS NB : ℝ) : williamsonT k NS NB (0, 1) (1, 1) =
-williamsonX false k NS NB := by simp [williamsonT]
/-- Guard all single-mode bounded realizations used by the physical block,
including off-diagonal slices and intermediate arrays. These are conclusions. -/
def BlockRealized (M : ℕ) (present : Bool) (k NB : ℝ) (X : Array (Occ M)) : Prop :=
∀ t : Fin (M + 1),
let Y := ((List.ofFn (fun r : Fin M => r)).take t.val).foldl
(fun Z r => coordinateChannel present k NB r Z) X
∀ (r : Fin M) (i j : Occ M),
let slice := fun a b => Y (Function.update i r a) (Function.update j r b)
B.HasFockMatrix (B.operatorOfMatrix slice) slice
/-- Every retained-idler matrix block has its actual channel realization. -/
def TargetRealized (M : ℕ) (present : Bool) (k NB : ℝ)
(X : Array (Occ M × Occ M)) : Prop :=
∀ a b : Occ M, BlockRealized M present k NB (fun i j => X (i, a) (j, b))
end QAlgorithms.Papers.Independent.Intakenext100.P85
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P85.Array
For every type , is the type of complex matrices indexed by in both coordinates, equivalently all functions . The index type may be empty or infinite; no boundedness, summability, positivity, or normalization is required.
QAlgorithms.Papers.Independent.Intakenext100.P85.BlockRealized
For every natural number , Boolean , real numbers , and arbitrary complex array indexed by , this predicate imposes the following condition. Define a coordinate update by
and set and for . For every , every , every , and all , the selected realization of the slice
must have exactly those matrix entries. More explicitly, for any array on , its selected realization is a chosen bounded operator on satisfying whenever such an operator exists, and is zero otherwise; the required condition is for every . The transformations used to form the intermediate arrays are
and, writing ,
where
The condition includes slices of the initial array and of the array after all updates. It requires no density, positivity, trace, or parameter-range assumptions. Natural-number subtraction is truncated at zero, division by zero and square roots of negative real numbers give zero, and nonsummable infinite sums give zero. When , there is no coordinate , so the predicate holds vacuously for every .
QAlgorithms.Papers.Independent.Intakenext100.P85.CenteredMoments
For every natural number , including zero, let , , and , with coordinate basis . The arguments are a supplied family of bounded complex-linear unitary operators on , a complex array indexed by , and a real matrix indexed by . The supplied family has coefficients , where
Let be a chosen bounded complex-linear operator with coefficients , if one exists, and zero otherwise, and write . This predicate requires for all ; sequences with and for every ; self-adjointness of and for every ; summability of its diagonal trace series and ; symmetry ; summability of
and summability of the diagonal trace series of for every . Finally, for each such , the complex-valued real function must have derivative zero at , and its derivative function must have derivative
at , viewed as a complex number. Here the derivative function is the total derivative operation, which returns zero at points where a derivative does not exist; the two stated derivative-existence conditions are nevertheless required. For , the finite sums are empty.
QAlgorithms.Papers.Independent.Intakenext100.P85.ClassicalDensity
For every natural number , real number , and real-valued function on , this predicate means that is measurable, is nonnegative at every point, is integrable with respect to Lebesgue measure on that product space, has integral one, and has the following integrable weighted first-register energy with the specified integral:
The weighted function in the second integral must itself be integrable. No analogous energy condition is imposed on . The definition permits : then the domain is a singleton, both energy sums are zero, and the predicate reduces to having value one at that point, with no restriction on . For , a negative cannot satisfy the stated nonnegative-energy equality.
QAlgorithms.Papers.Independent.Intakenext100.P85.HasArray
For any type , continuous complex-linear operator on , and complex array , this predicate means that for every , where is the coordinate vector supported at with value . For empty , the condition is vacuous.
QAlgorithms.Papers.Independent.Intakenext100.P85.IlluminationOperator
For every type , an illumination operator is a continuous complex-linear map from to itself, where is the Hilbert space of square-summable complex families indexed by . Empty and infinite index types are allowed.
QAlgorithms.Papers.Independent.Intakenext100.P85.JointDecisionEffect
For any type and continuous complex-linear operator on , this predicate means that both and , with the identity operator, are self-adjoint and have nonnegative real quadratic forms: , , and for every vector , and .
QAlgorithms.Papers.Independent.Intakenext100.P85.Occ
For every natural number , is the type of functions , assigning a natural number to each of positions. The case is included and has exactly one such function, the empty function.
QAlgorithms.Papers.Independent.Intakenext100.P85.PositiveP
For every natural number , including , and complex array indexed by occupation vectors , this predicate requires that be a density array and that there exist a probability measure on representing entry by entry as a mixture of coherent arrays. Here being a density array means that there are sequences with and ; every finite quadratic form , for every finite set of occupation vectors and every complex function , is real and nonnegative; and the real diagonal entries form a summable family with sum . The required probability measure satisfies, for every , integrability of the following integrand and the equality
When , the occupation index and amplitude spaces each have one element, and the empty product defining equals .
QAlgorithms.Papers.Independent.Intakenext100.P85.SourceGaussian
For every natural number , including zero, put , , and , with coordinate basis vectors . The arguments are a supplied family of bounded complex-linear unitary operators on , a complex array , a real vector , and a real matrix indexed by . The family comes equipped with the coefficient identities , where
Let be a chosen bounded complex-linear operator satisfying , if one exists, and the zero operator otherwise; define . This predicate means that actually satisfies all these coefficient identities; that there exist sequences with and for every ; that , for every , its diagonal trace series is summable, and ; that is symmetric and positive definite and its complexification plus is positive semidefinite, where , , and all other entries are zero; and that, for every , the diagonal trace series of is summable and
All conditions remain part of the definition when , with empty finite sums and products interpreted as zero and one.
QAlgorithms.Papers.Independent.Intakenext100.P85.TargetRealized
For every natural number , Boolean , real numbers , and complex array indexed by , this predicate requires the following for every pair of fixed occupation vectors . Begin with the array , and for define
For every , every coordinate , and every , the slice must satisfy for all . Here is a chosen bounded operator on having all matrix entries if such an operator exists, and otherwise is zero. The transformations in the recursion are
and, setting ,
with
Thus the requirement ranges over every fixed second-register row and column, including unequal , and every indicated first-register slice before, during, and after the updates. No density, positivity, summability, or parameter-range assumptions are imposed separately. Natural-number subtraction is truncated at zero; division by zero, square roots of negative real numbers, and nonsummable infinite sums use the total conventions giving zero. For , the absence of a coordinate makes the predicate vacuously true for every array .
QAlgorithms.Papers.Independent.Intakenext100.P85.basis
For every type , this defines the canonical Hilbert basis of , whose coordinate representation is the identity: when and otherwise. For empty , this is the empty Hilbert basis of the zero space.
QAlgorithms.Papers.Independent.Intakenext100.P85.bathB
For every real number , this defines , with no nonnegativity restriction on .
QAlgorithms.Papers.Independent.Intakenext100.P85.classicalArray
For every natural number and arbitrary real-valued function on , this defines a complex matrix whose row and column indices are pairs of occupation vectors in . For and , write
The entry at row and column is
The integral is the complex Bochner integral with respect to Lebesgue measure. No measurability, integrability, nonnegativity, normalization, or energy condition on is assumed; a nonintegrable entry integrand has integral zero under the total integral convention. When , all products are empty products equal to one, and the matrix has a single entry, namely .
QAlgorithms.Papers.Independent.Intakenext100.P85.coherentArray
For every natural number , including zero, and every function , this defines a complex array indexed by occupation functions through
The definition imposes no additional hypotheses and makes no normalization assertion. When , both products are empty and the array has its sole entry equal to one.
QAlgorithms.Papers.Independent.Intakenext100.P85.coherentExponent
For arbitrary real numbers , this defines the real number
There are no sign or range restrictions on these arguments. Every real square root here is defined to be zero when its argument is negative; in particular, this expression is zero whenever , or whenever .
QAlgorithms.Papers.Independent.Intakenext100.P85.coherentLower
For arbitrary real numbers , this defines
No positivity, normalization, or parameter-range hypotheses are imposed. Real square roots of negative numbers are zero, so the definition remains meaningful even when the argument of the outer square root is negative; in that case its value is .
QAlgorithms.Papers.Independent.Intakenext100.P85.coherentReturn
For every natural number , Boolean , real numbers , and amplitude vector , start with the complex array
This definition successively transforms coordinates : for each , form , and set ; the result is . Explicitly, let , let if it admits a bounded complex-linear operator realization on and zero otherwise, and define
For true ,
for false , . No bounds on are assumed; division by zero, negative-argument real square roots, and nonsummable complex sums give zero. When , there are no transformations and the resulting one-entry array has entry .
QAlgorithms.Papers.Independent.Intakenext100.P85.coherentVector
For every natural number , including zero, and every function , this defines a vector in by choosing a vector with coefficients
for every occupation function , if such a square-summable vector exists, and returning zero otherwise. This definition itself asserts neither existence nor normalization. When , there is one occupation function and its prescribed coefficient is the empty product, one.
QAlgorithms.Papers.Independent.Intakenext100.P85.constantAmplitude
For every natural number and every real number , this defines the complex amplitude vector of length with every coordinate equal to the real square root of , regarded as a complex number:
When , this is the unique empty vector; when , every coordinate is zero under the total real-square-root convention.
QAlgorithms.Papers.Independent.Intakenext100.P85.coordinateChannel
For every natural number , Boolean , real numbers , coordinate , and complex array indexed by -coordinate occupation vectors, the output entry at is obtained by forming the one-coordinate slice , applying the following rule to , and selecting entry . Let if is the matrix of some bounded complex-linear operator on , and otherwise; set , and define
For true , the rule gives
for false , it gives . Thus the defined entry is . There are no assumptions on ; zero denominators and nonsummable complex sums are assigned zero, and negative real square-root arguments give zero. The coordinate argument cannot be supplied when .
QAlgorithms.Papers.Independent.Intakenext100.P85.correlationC
For every real number , this defines , with no nonnegativity restriction on .
QAlgorithms.Papers.Independent.Intakenext100.P85.correlationQ
For every real number , this defines , using the real square root, which equals for negative arguments. In particular, the value is for ; no restriction on is assumed.
QAlgorithms.Papers.Independent.Intakenext100.P85.fromOnePair
For any complex array indexed by pairs of one-coordinate occupation vectors, this defines an array indexed by two-coordinate occupation vectors by
where denotes the one-coordinate vector whose sole value is . No condition is imposed on .
QAlgorithms.Papers.Independent.Intakenext100.P85.genieError
For every natural number , arbitrary real numbers , and arbitrary real-valued function on , this defines the Lebesgue integral
with the following explicit construction. For a countable index set , let be a chosen bounded operator on with matrix entries , if one exists, and zero otherwise, and put . Define by taking the infimum, in the extended nonnegative reals, over bounded operators for which both and are self-adjoint and have nonnegative real quadratic forms, of
and then converting that infimum to a real number, with converted to zero. Here . Start both arrays with
and, successively for , replace an array by the array with entry , where . These one-coordinate transformations are
and, with and ,
where
Natural-number subtraction is truncated at zero, division by zero is zero, and real square roots of negative arguments are zero. Infinite sums use their total convention, giving zero for nonsummable families. No assumptions on , the parameters, or the arrays are required, and the outer real Bochner integral is zero if its integrand is not integrable. The vector affects the integrand only through . When , no coordinate updates occur.
QAlgorithms.Papers.Independent.Intakenext100.P85.genieIntegrand
For every natural number , arbitrary real numbers , arbitrary real-valued function on , and point of that space, this defines , with the following meaning of every quantity. For any countable index set , let be a chosen bounded complex-linear operator on satisfying for every standard basis vector , if such an operator exists, and otherwise let it be zero. For operators on this space put , using the total infinite-sum convention, which gives zero if the family is not summable, and define
where is regarded as an extended nonnegative real, the infimum is taken there, and the final conversion to a real number sends to zero. Here , and , for , is obtained by starting with
and updating coordinates in that order: an array is replaced by the array whose -entry is , where . The one-coordinate transformations are
and, writing and ,
The real coefficient used here is
All subtractions between natural-number indices are truncated at zero; real square roots of negative arguments and division by zero return zero, so these definitions also cover and unrestricted signed parameters. No density or integrability hypotheses are imposed. The second amplitude vector enters only through ; for , the coordinate-update list is empty.
QAlgorithms.Papers.Independent.Intakenext100.P85.marginalPhotonNumber
For every natural number , every complex array indexed by occupation functions , and every index , this defines the real number
No positivity, normalization, or summability assumption is imposed on ; the total infinite-sum operation returns zero if this family is not summable. When , there is no possible argument .
QAlgorithms.Papers.Independent.Intakenext100.P85.onePair
For any complex array indexed by two-coordinate occupation vectors, this defines an array indexed by pairs of one-coordinate occupation vectors. For row index and column index , its entry is
where each pair on the right denotes the two-coordinate occupation vector with the displayed coordinates. No condition is imposed on .
QAlgorithms.Papers.Independent.Intakenext100.P85.optimumError
For any type and arbitrary complex arrays , let , for , be a chosen continuous complex-linear operator on whose matrix in the canonical coordinate basis is , if such an operator exists, and the zero operator otherwise. This defines the following value in :
where ranges over continuous complex-linear operators and is the identity. Each sum is the total Hilbert-space-indexed sum used in the definition, taking value if its complex summands are not summable. No density, trace-class, realization, or trace-summability assumptions are imposed on the arrays. The effect set includes the zero operator, and empty is allowed, in which case the value is .
QAlgorithms.Papers.Independent.Intakenext100.P85.pairArray
For any complex array whose row and column indices are two-coordinate occupation vectors, this defines an array indexed by pairs of natural numbers by
where each pair on the right is understood as the occupation vector taking those values at coordinates and , respectively. No positivity, normalization, boundedness, or summability condition is imposed on .
QAlgorithms.Papers.Independent.Intakenext100.P85.phaseSensitiveWignerCov
For arbitrary real numbers , this defines a real matrix indexed by pairs . In the index order , it is
No positivity or other restrictions on the matrix are imposed.
QAlgorithms.Papers.Independent.Intakenext100.P85.qiReturn
For a Boolean and arbitrary real numbers , this defines a complex array on two-coordinate occupation vectors as follows. Let have coefficients
if a vector with exactly these coefficients exists, and let otherwise. For output indices , form ; the defined entry is . Here , if it is the matrix of a bounded complex-linear operator on and zero otherwise, and
For true ,
for false , . No positivity or normalization conclusion is part of this definition. Division by zero and nonsummable complex sums give zero, and real square roots of negative arguments give zero.
QAlgorithms.Papers.Independent.Intakenext100.P85.realizeOccupationArray
For any type and complex array , this defines a continuous complex-linear operator on by choosing an operator satisfying for all , if such an operator exists, where is the canonical coordinate vector. If no such operator exists, the value is the zero operator. No hypothesis guarantees that the supplied array has an operator realization.
QAlgorithms.Papers.Independent.Intakenext100.P85.returnA
For arbitrary real numbers , this defines the real number
There are no sign or range restrictions on these parameters.
QAlgorithms.Papers.Independent.Intakenext100.P85.returnCov
For any Boolean and arbitrary real numbers , this defines a real matrix indexed by . In the order , its value is
No parameter restrictions are imposed, and each real square root of a negative argument is zero.
QAlgorithms.Papers.Independent.Intakenext100.P85.returnDiscriminant
For arbitrary real numbers , this defines
There are no restrictions on the parameters. Both square roots are the total real square-root function, which returns zero on negative arguments; thus whenever the outer radicand is nonpositive.
QAlgorithms.Papers.Independent.Intakenext100.P85.returnSpectrum
For a Boolean value and arbitrary real numbers , put
This defines a real-valued function on whose ordered pair of values is
There are no sign, ordering, or physicality hypotheses on these values. Each real square root is zero on negative arguments.
QAlgorithms.Papers.Independent.Intakenext100.P85.signalBlock
For every natural number , Boolean , arbitrary real numbers , and arbitrary complex array indexed by -coordinate occupation vectors, this defines a successive transformation of coordinates , in that order. Start with ; at coordinate , for each output index pair , form and set . Here, writing , the false- rule is , while the true- rule is
where equals when it has a bounded complex-linear realization on , and is zero otherwise, and
The result is ; when , it is . All divisions and infinite sums are totalized: division by zero and nonsummable complex sums give zero, and real square roots of negative numbers give zero.
QAlgorithms.Papers.Independent.Intakenext100.P85.signalChannel
For a Boolean , arbitrary real numbers , and an arbitrary complex array indexed by , this defines another such array as follows. Write , and let if there exists a bounded complex-linear operator on with for every , and otherwise. Define
If is true, put and define the entry to be
If is false, the entry is
The restricted sum denotes a sum over all pairs, with excluded terms set to zero. No parameter bounds or convergence hypotheses are required: division by zero is zero, real square roots of nonpositive arguments are zero, and a nonsummable complex family has totalized sum zero. In particular, the true branch at uses .
QAlgorithms.Papers.Independent.Intakenext100.P85.signalS
For every real number , this defines , with no nonnegativity restriction on .
QAlgorithms.Papers.Independent.Intakenext100.P85.spdcArray
For every real , this defines the complex array indexed by occupations as , where is the square-summable vector with coefficients when , and zero otherwise, if such a vector exists; if no such vector exists, is zero and the entire array is zero. Real division by zero and square roots of negative arguments return zero. The definition imposes no restriction on and asserts no normalization of this array.
QAlgorithms.Papers.Independent.Intakenext100.P85.spdcCoefficient
For any real and any occupation function , this defines the complex coefficient
where the displayed real value is embedded into . There is no restriction on ; division by zero returns zero, a real square root of a negative number returns zero, and a zeroth power is one even when its base is zero.
QAlgorithms.Papers.Independent.Intakenext100.P85.spdcCov
For any real number , this defines the real matrix indexed by which, in the order , is
The parameter need not be nonnegative; the real square root is defined to be zero when its argument is negative.
QAlgorithms.Papers.Independent.Intakenext100.P85.spdcVector
For every real , this defines a vector in by choosing a vector whose coefficient at every occupation is
if such a square-summable vector exists, and returning the zero vector otherwise. The real coefficient is embedded into , with division by zero and square roots of negative arguments returning zero. No parameter restriction, existence assertion, or normalization condition is included.
QAlgorithms.Papers.Independent.Intakenext100.P85.targetBlock
For every natural number , Boolean , real numbers , and arbitrary complex array indexed by pairs of -coordinate occupation vectors, this acts separately on each slice with the second row and column components fixed: for fixed , begin with , and successively transform coordinates by , where ; the output at is . To specify this rule completely, set , let if is the matrix of a bounded complex-linear operator on and zero otherwise, and put
For true ,
for false , . No parameter or array hypotheses are imposed; division by zero, negative-argument real square roots, and nonsummable complex sums give zero. At , the result is .
QAlgorithms.Papers.Independent.Intakenext100.P85.twoOcc
For any natural numbers , this defines the two-coordinate occupation vector whose coordinate is and whose coordinate is :
Zero occupations are allowed in either coordinate.
QAlgorithms.Papers.Independent.Intakenext100.P85.williamsonT
For arbitrary real numbers , define
This defines a real matrix indexed by pairs , where , through
No parameter restrictions or matrix properties are required by this definition. Real square roots of negative arguments and division by zero both give zero; in particular, makes the entire matrix zero.
QAlgorithms.Papers.Independent.Intakenext100.P85.williamsonX
For a Boolean value and arbitrary real numbers , set
This defines
No parameter restrictions or nonzero-denominator hypotheses are imposed. Division by zero is defined to be zero, and a real square root of a negative number is zero; consequently, both branches are zero when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.