Definitions for Quantum trade-off coding for bosonic communication
DefinitionQAlgorithms_Papers_Independent_Gap48_P44The objects the formalized statements of Quantum trade-off coding for bosonic communication (arXiv:1105.0119) are stated in. Each was checked against the paper by a blind read-back and a moderator.
cqFamily: PDF pp.6,14, (40)-(41), (81)-(82): nonnegative CQ coding family. The three arguments are the unconditional receiver entropy and the conditional receiver/complement entropies in bits, as functions of photon sharing lambda. This is a scalar inner family, with no assertion of operational achievability in its definition.ceFamily: PDF pp.7,14, (42)-(43) and the CE display: positive entanglement consumption. The coordinates are classical bits and consumed ebits per use.cqTimeSharing: PDF pp.6-8, Figure 2(a): same-budget endpoint time sharing, with rate disposal. Coordinates are (classical, quantum); t is the quantum-code time fraction.ceTimeSharing: PDF pp.7-8, Figure 2(b): same-budget CE endpoint mixtures. Extra consumption is allowed, while generated classical bits can be discarded.lossCQ: PDF pp.6-8: the displayed pure-loss CQ family at the stated photon budget.lossCE: PDF pp.7-8: the displayed pure-loss CE family, with consumption positive.thermalD: PDF p.14, (80): D is the nonnegative square root, rather than an arbitrary root.thermalEnvironment: PDF p.14, (80): entropy in bits of the TRUE complementary output. Both symplectic modes, including the environment purifier, contribute.amplifierCQ: PDF pp.16-17, Figure 6(a): vacuum-amplifier CQ family, at N_S=200.amplifierCE: PDF pp.16-17, Figure 6(b): vacuum-amplifier CE family, at N_S=200.fockParity: PDF p.5, (27): parity implements the environmental output phase in the source beam splitter relative to the accepted opposite-sign output convention.lossComplement: PDF p.5, (26)-(27): the fixed pure-loss complement on arbitrary block inputs. The imported receiver has precisely (26). Its unused port has the opposite sign to (27); parity on both matrix indices fixes that sign without changing entropy.BlockEnsemble: PDF pp.2,11, (60)-(63): a discrete block ensemble, allowing countably many nonzero weights and arbitrary intra-block entanglement. PMF labels may have zero mass.BlockEnsemble.average: PDF pp.4,11: the ensemble's actual unconditional density coefficients. Absolute convergence follows from trace-one states and normalized probabilities.BlockEnsemble.energy: PDF pp.2,11-12: averaged TOTAL input photon number. Sum the imported modeEnergy over modes, then average over the ensemble. By positivity this is the energy of the unconditional density.blockEntropy: PDF pp.2,11, (60)-(63): bit entropy, keeping infinity until after weighting.BlockEnsemble.entropyAverage: PDF p.11: weighted entropy is formed in the extended nonnegative reals. In particular a zero-probability label with infinite entropy contributes zero.lossQuantumFamily: PDF p.5, (28)-(30): all three faces of the signed pure-loss inner family. This scalar set is not used as the definition of any operational capacity.BlockEnsemble.dynamicEntropyRegion: PDF pp.3-4,11: the computed block-ensemble entropy region, scaled per use. Only finite-energy ensembles at positive blocklength enter the optimization below. Each entropy average is weighted BEFORE conversion to real; zero times infinity is zero. Input energy bounds imply finiteness of every converted average and the unconditional output entropy. Signed net rates are allowed in all coordinates.gaussianDynamicOptimization: PDF pp.11-13: regularized dynamic ENTROPY optimization restricted to Gaussian conditional input states, not to Gaussian gates or operational codes. All finite label sets and all positive blocklengths are included, followed by closure. Conditional states may have arbitrary Gaussian correlations among the n modes; their unconditional mixture is not required to be Gaussian. Finite alphabets with closure retain the continuous displaced-thermal ensemble through discretization.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P39
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P54
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P32
/-!
Quantum trade-off coding for bosonic communication, arXiv:1105.0119v4.
Scalar coding-family comparisons and the common-parameter block entropy bounds.
Operational results lacking a full Fock-space code interface are recorded separately
in HARD.md and GAPS.json; no scalar family is defined to be an operational capacity.
Compilation and independent moderation are pending the separate batch stages.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P44
open Filter
open scoped ENNReal Topology
open QAlgorithms.Papers.Independent.Claimed50.P39 (g)
open QAlgorithms.Papers.Independent.Information100.P54 (thermalEntropy)
namespace Fock
export QAlgorithms.Papers.Independent.Next46.P32
(NumberString FockKernel pureLoss jointMix charlieMarginal vacuum
modeEnergy spectralEntropyNats StrongConjecture2 Gaussian)
export QAlgorithms.Papers.Independent.Dependency50.P33 (State)
end Fock
/-- PDF pp.6,14, (40)-(41), (81)-(82): nonnegative CQ coding family.
The three arguments are the unconditional receiver entropy and the conditional
receiver/complement entropies in bits, as functions of photon sharing lambda.
This is a scalar inner family, with no assertion of operational achievability in its definition. -/
def cqFamily (output : ℝ) (conditional environment : ℝ → ℝ) : Set (ℝ × ℝ) :=
{r | 0 ≤ r.1 ∧ 0 ≤ r.2 ∧ ∃ share ∈ Set.Icc (0 : ℝ) 1,
r.2 ≤ conditional share - environment share ∧
r.1 + r.2 ≤ output - environment share}
/-- PDF pp.7,14, (42)-(43) and the CE display: positive entanglement consumption.
The coordinates are classical bits and consumed ebits per use. -/
def ceFamily (budget output : ℝ) (environment : ℝ → ℝ) : Set (ℝ × ℝ) :=
{r | 0 ≤ r.1 ∧ 0 ≤ r.2 ∧ ∃ share ∈ Set.Icc (0 : ℝ) 1,
r.1 ≤ thermalEntropy (share * budget) + output - environment share ∧
r.1 ≤ output - environment share + r.2}
/-- PDF pp.6-8, Figure 2(a): same-budget endpoint time sharing, with rate disposal.
Coordinates are (classical, quantum); t is the quantum-code time fraction. -/
def cqTimeSharing (classical quantum : ℝ) : Set (ℝ × ℝ) :=
{r | 0 ≤ r.1 ∧ 0 ≤ r.2 ∧ ∃ t ∈ Set.Icc (0 : ℝ) 1,
r.1 ≤ (1 - t) * classical ∧ r.2 ≤ t * quantum}
/-- PDF pp.7-8, Figure 2(b): same-budget CE endpoint mixtures.
Extra consumption is allowed, while generated classical bits can be discarded. -/
def ceTimeSharing (unassisted assisted consumption : ℝ) : Set (ℝ × ℝ) :=
{r | 0 ≤ r.1 ∧ 0 ≤ r.2 ∧ ∃ t ∈ Set.Icc (0 : ℝ) 1,
r.1 ≤ (1 - t) * unassisted + t * assisted ∧ t * consumption ≤ r.2}
/-- PDF pp.6-8: the displayed pure-loss CQ family at the stated photon budget. -/
def lossCQ (eta budget : ℝ) : Set (ℝ × ℝ) :=
cqFamily (thermalEntropy (eta * budget))
(fun share => thermalEntropy (eta * share * budget))
(fun share => thermalEntropy ((1 - eta) * share * budget))
/-- PDF pp.7-8: the displayed pure-loss CE family, with consumption positive. -/
def lossCE (eta budget : ℝ) : Set (ℝ × ℝ) :=
ceFamily budget (thermalEntropy (eta * budget))
(fun share => thermalEntropy ((1 - eta) * share * budget))
/-- PDF p.14, (80): D is the nonnegative square root, rather than an arbitrary root. -/
def thermalD (eta share budget noise : ℝ) : ℝ :=
Real.sqrt ((share * (1 + eta) * budget + (1 - eta) * noise + 1) ^ 2 -
4 * eta * share * budget * (share * budget + 1))
/-- PDF p.14, (80): entropy in bits of the TRUE complementary output.
Both symplectic modes, including the environment purifier, contribute. -/
def thermalEnvironment (eta share budget noise : ℝ) : ℝ :=
thermalEntropy ((thermalD eta share budget noise +
share * (1 - eta) * budget - (1 - eta) * noise - 1) / 2) +
thermalEntropy ((thermalD eta share budget noise -
share * (1 - eta) * budget + (1 - eta) * noise - 1) / 2)
/-- PDF pp.16-17, Figure 6(a): vacuum-amplifier CQ family, at N_S=200. -/
def amplifierCQ (gain : ℝ) : Set (ℝ × ℝ) :=
cqFamily (thermalEntropy (gain * 200 + gain - 1))
(fun share => thermalEntropy (gain * share * 200 + gain - 1))
(fun share => thermalEntropy ((gain - 1) * (share * 200 + 1)))
/-- PDF pp.16-17, Figure 6(b): vacuum-amplifier CE family, at N_S=200. -/
def amplifierCE (gain : ℝ) : Set (ℝ × ℝ) :=
ceFamily 200 (thermalEntropy (gain * 200 + gain - 1))
(fun share => thermalEntropy ((gain - 1) * (share * 200 + 1)))
/-- PDF p.5, (27): parity implements the environmental output phase in the
source beam splitter relative to the accepted opposite-sign output convention. -/
def fockParity {n : ℕ} (a : Fock.NumberString n) : ℂ :=
(-1 : ℂ) ^ (∑ i, a i)
/-- PDF p.5, (26)-(27): the fixed pure-loss complement on arbitrary block inputs.
The imported receiver has precisely (26). Its unused port has the opposite sign
to (27); parity on both matrix indices fixes that sign without changing entropy. -/
def lossComplement (n : ℕ) (eta : ℝ) (rho : Fock.FockKernel n) :
Fock.FockKernel n :=
fun a b => fockParity a *
Fock.charlieMarginal (Fock.jointMix n eta rho (Fock.vacuum n)) a b * star (fockParity b)
/-- PDF pp.2,11, (60)-(63): a discrete block ensemble, allowing countably many
nonzero weights and arbitrary intra-block entanglement. PMF labels may have zero mass. -/
structure BlockEnsemble (X : Type*) (n : ℕ) where
probability : PMF X
state : X → Fock.State (Fock.NumberString n)
/-- PDF pp.4,11: the ensemble's actual unconditional density coefficients.
Absolute convergence follows from trace-one states and normalized probabilities. -/
def BlockEnsemble.average {X : Type*} {n : ℕ} (e : BlockEnsemble X n) :
Fock.FockKernel n :=
fun a b => ∑' x, ((e.probability x).toReal : ℂ) * (e.state x).coefficients a b
/-- PDF pp.2,11-12: averaged TOTAL input photon number.
Sum the imported modeEnergy over modes, then average over the ensemble.
By positivity this is the energy of the unconditional density. -/
def BlockEnsemble.energy {X : Type*} {n : ℕ} (e : BlockEnsemble X n) : ℝ≥0∞ :=
∑' x, e.probability x * (∑ i : Fin n, Fock.modeEnergy (e.state x).coefficients i)
/-- PDF pp.2,11, (60)-(63): bit entropy, keeping infinity until after weighting. -/
def blockEntropy {n : ℕ} (rho : Fock.FockKernel n) : ℝ≥0∞ :=
Fock.spectralEntropyNats rho / ENNReal.ofReal (Real.log 2)
/-- PDF p.11: weighted entropy is formed in the extended nonnegative reals.
In particular a zero-probability label with infinite entropy contributes zero. -/
def BlockEnsemble.entropyAverage {X : Type*} {n : ℕ} (e : BlockEnsemble X n)
(channel : Fock.FockKernel n → Fock.FockKernel n) : ℝ≥0∞ :=
∑' x, e.probability x * blockEntropy (channel (e.state x).coefficients)
/-- PDF p.5, (28)-(30): all three faces of the signed pure-loss inner family.
This scalar set is not used as the definition of any operational capacity. -/
def lossQuantumFamily (eta budget : ℝ) : Set (Fin 3 → ℝ) :=
{r | ∃ share ∈ Set.Icc (0 : ℝ) 1,
r 0 + 2 * r 1 ≤ thermalEntropy (share * budget) + thermalEntropy (eta * budget) -
thermalEntropy ((1 - eta) * share * budget) ∧
r 1 + r 2 ≤ thermalEntropy (eta * share * budget) -
thermalEntropy ((1 - eta) * share * budget) ∧
r 0 + r 1 + r 2 ≤ thermalEntropy (eta * budget) -
thermalEntropy ((1 - eta) * share * budget)}
/-- PDF pp.3-4,11: the computed block-ensemble entropy region, scaled per use.
Only finite-energy ensembles at positive blocklength enter the optimization below.
Each entropy average is weighted BEFORE conversion to real; zero times infinity
is zero. Input energy bounds imply finiteness of every converted average and the
unconditional output entropy. Signed net rates are allowed in all coordinates. -/
def BlockEnsemble.dynamicEntropyRegion {X : Type*} {n : ℕ}
(e : BlockEnsemble X n) (eta : ℝ) : Set (Fin 3 → ℝ) :=
let input := (e.entropyAverage id).toReal
let output := (blockEntropy (Fock.pureLoss n eta e.average)).toReal
let conditional := (e.entropyAverage (Fock.pureLoss n eta)).toReal
let environment := (e.entropyAverage (lossComplement n eta)).toReal
{r | (n : ℝ) * (r 0 + 2 * r 1) ≤ input + output - environment ∧
(n : ℝ) * (r 1 + r 2) ≤ conditional - environment ∧
(n : ℝ) * (r 0 + r 1 + r 2) ≤ output - environment}
/-- PDF pp.11-13: regularized dynamic ENTROPY optimization restricted to
Gaussian conditional input states, not to Gaussian gates or operational codes.
All finite label sets and all positive blocklengths are included, followed by closure.
Conditional states may have arbitrary Gaussian correlations among the n modes;
their unconditional mixture is not required to be Gaussian. Finite alphabets with
closure retain the continuous displaced-thermal ensemble through discretization. -/
def gaussianDynamicOptimization (eta budget : ℝ) : Set (Fin 3 → ℝ) :=
closure {r | ∃ n : ℕ, 0 < n ∧ ∃ k : ℕ, 0 < k ∧
∃ e : BlockEnsemble (Fin k) n,
(∀ x, Fock.Gaussian (e.state x).coefficients) ∧
e.energy ≤ ENNReal.ofReal ((n : ℝ) * budget) ∧
r ∈ e.dynamicEntropyRegion eta}
example : g 0 = 0 := by simp [g]
example : thermalEntropy 0 = 0 := by simp [thermalEntropy]
example (N : ℝ) :
(-1 : ℝ) ^ (0 + 2) / (((0 + 1 : ℕ) : ℝ) * ((0 + 2 : ℕ) : ℝ) * N ^ (0 + 1)) =
1 / (2 * N) := by simp
example : (0, 0) ∈ cqFamily 0 (fun _ => 0) (fun _ => 0) := by
refine ⟨le_rfl, le_rfl, 0, ⟨le_rfl, zero_le_one⟩, ?_, ?_⟩ <;> simp
example : (0, 0) ∈ ceFamily 0 0 (fun _ => 0) := by
refine ⟨le_rfl, le_rfl, 0, ⟨le_rfl, zero_le_one⟩, ?_, ?_⟩ <;>
simp [thermalEntropy]
example : (0, 0) ∈ cqTimeSharing 0 0 := by
exact ⟨le_rfl, le_rfl, 0, ⟨le_rfl, zero_le_one⟩, by simp, by simp⟩
example : (0, 3) ∈ ceTimeSharing 0 0 0 := by
refine ⟨le_rfl, by norm_num, 0, ⟨le_rfl, zero_le_one⟩, ?_, ?_⟩ <;> norm_num
example (eta share : ℝ) : thermalD eta share 0 0 = 1 := by simp [thermalD]
example (eta share : ℝ) : thermalEnvironment eta share 0 0 = 0 := by
simp [thermalEnvironment, thermalD, thermalEntropy]
example : fockParity (fun _ : Fin 1 => 1) = -1 := by simp [fockParity]
example (rho : Fock.FockKernel 0) : (∑ i : Fin 0, Fock.modeEnergy rho i) = 0 := by simp
example : (0 : ℝ≥0∞) * (⊤ : ℝ≥0∞) = 0 := by simp
example (eta : ℝ) : (0, 0) ∈ lossCQ eta 0 := by
refine ⟨le_rfl, le_rfl, 0, ⟨le_rfl, zero_le_one⟩, ?_, ?_⟩ <;>
simp [thermalEntropy]
example (eta : ℝ) : (0, 0) ∈ lossCE eta 0 := by
refine ⟨le_rfl, le_rfl, 0, ⟨le_rfl, zero_le_one⟩, ?_, ?_⟩ <;>
simp [thermalEntropy]
example : amplifierCQ 1 = lossCQ 1 200 := by
simp [amplifierCQ, lossCQ, thermalEntropy]
example : amplifierCE 1 = lossCE 1 200 := by
simp [amplifierCE, lossCE, thermalEntropy]
example (n : ℕ) (rho : Fock.State (Fock.NumberString n)) :
(BlockEnsemble.average
(⟨PMF.pure (), fun _ : Unit => rho⟩ : BlockEnsemble Unit n)) = rho.coefficients := by
classical
ext a b
simp [BlockEnsemble.average, PMF.pure_apply]
example (n : ℕ) (rho : Fock.State (Fock.NumberString n)) :
(BlockEnsemble.energy
(⟨PMF.pure (), fun _ : Unit => rho⟩ : BlockEnsemble Unit n)) =
(∑ i : Fin n, Fock.modeEnergy rho.coefficients i) := by
simp [BlockEnsemble.energy, PMF.pure_apply]
example (n : ℕ) (rho : Fock.State (Fock.NumberString n)) :
(BlockEnsemble.entropyAverage
(⟨PMF.pure (), fun _ : Unit => rho⟩ : BlockEnsemble Unit n) id) =
blockEntropy rho.coefficients := by
simp [BlockEnsemble.entropyAverage, PMF.pure_apply]
example (eta : ℝ) : (fun _ : Fin 3 => (0 : ℝ)) ∈ lossQuantumFamily eta 0 := by
refine ⟨0, ⟨le_rfl, zero_le_one⟩, ?_, ?_, ?_⟩ <;> simp [thermalEntropy]
end QAlgorithms.Papers.Independent.Gap48.P44
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Gap48.P44.BlockEnsemble.average
For any type , any natural number , including zero, and an ensemble with probability masses , , and density kernels on , its average is the complex kernel defined entrywise by
where is the real value of the probability mass, subsequently regarded as a complex scalar. Each density kernel here has a representation with and summable , has real nonnegative finite quadratic forms , and has summable real diagonal with total one. The displayed entrywise sum uses the total complex-series convention, which assigns zero to a nonsummable family; this definition itself supplies no separate summability or density assertion about the resulting kernel.
QAlgorithms.Papers.Independent.Gap48.P44.BlockEnsemble.dynamicEntropyRegion
For any type , natural number , ensemble on occupation labels , and real , this region consists of all real triples satisfying
where
Here keeps finite values and sends to zero, , and is a probability mass function. Each admits an expansion with and , has real nonnegative finite quadratic forms, and has summable real diagonal of total one. To specify the two maps literally, put if and otherwise, and define
The real beam coefficients are regarded as complex numbers in these kernel formulas. For any kernel , is times the infimum of over summable nonnegative weights totaling one and coefficient resolutions , with norm one and mutually orthogonal wherever the weights are positive; an empty infimum is . Here , , and in the extended nonnegative averages. Complex infinite sums use the total sum, equal to zero for a nonsummable family; natural-number subtractions in the beam coefficients are truncated at zero, and the real square root of a negative number is zero. There is no restriction on , no nonnegativity restriction on , and no finiteness assumption on the entropies; is included and makes all three left sides zero.
QAlgorithms.Papers.Independent.Gap48.P44.BlockEnsemble.energy
For any type , any natural number , including zero, and an ensemble with probability masses summing to one and density kernels on the occupation labels , its energy is the extended nonnegative number
where is regarded as an element of . A density kernel means a kernel admitting an expansion , with and , whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with total one. The energy is not divided by , may be infinite, and equals zero when ; extended nonnegative multiplication uses .
QAlgorithms.Papers.Independent.Gap48.P44.BlockEnsemble.entropyAverage
For any type , any natural number , including zero, an ensemble , and any function from complex kernels on to such kernels, the entropy average is
The masses satisfy , and every , including those of mass zero, admits a coefficient expansion with and summable , has real nonnegative finite quadratic forms, and has summable real diagonal of total one. For any kernel , is times the infimum of over summable nonnegative weights of total one and vectors satisfying , with norm-one, mutually orthogonal vectors at the positive weights; the infimum is if there is no such resolution, and . No linearity, positivity, continuity, or normalization condition is imposed on . The average may be infinite, and zero probability times infinite entropy is zero.
QAlgorithms.Papers.Independent.Gap48.P44.BlockEnsemble
For any type , with no finiteness or countability assumption, and any natural number , including , a block ensemble consists of a probability mass function , satisfying , together with a density kernel indexed by for every , including labels of probability zero. Here means the functions . Saying that is a density kernel means that there exist sequences with and ; for every finite and every , the number has zero imaginary part and nonnegative real part; and the real diagonal entries form a summable family with . No ensemble exists when is empty; when , the occupation-label set has one element.
QAlgorithms.Papers.Independent.Gap48.P44.amplifierCE
For any real number , this defines the set of pairs with for which some satisfies
where
using the total real logarithm with and for negative . The constant is fixed, are allowed, and is unrestricted.
QAlgorithms.Papers.Independent.Gap48.P44.amplifierCQ
For any real number , this defines the set of pairs with for which some satisfies
where
The real logarithm has value at and value at negative arguments. The constant is fixed, both endpoints for are included, and no lower bound or other restriction is imposed on .
QAlgorithms.Papers.Independent.Gap48.P44.blockEntropy
For any natural number , including zero, and any complex kernel on , with no density assumption, its block entropy is
Here ; the infimum ranges over sequences of nonnegative real weights and vectors such that the weights are summable with , every with has norm one, distinct vectors with positive weights are orthogonal, and for all . Vectors of weight zero have no normalization or orthogonality requirement. The convention is , and the infimum is if no such resolution exists; thus the definition remains meaningful for arbitrary kernels.
QAlgorithms.Papers.Independent.Gap48.P44.ceFamily
For any real numbers and arbitrary function , this defines the set of pairs with for which some satisfies
where
Here the real logarithm is total: , and its value at a negative argument is the logarithm of that argument’s absolute value. Both endpoints of the interval for are allowed, and there are no restrictions on .
QAlgorithms.Papers.Independent.Gap48.P44.ceTimeSharing
For arbitrary real numbers , this defines the set of pairs satisfying and admitting some such that
Both endpoints for are included; no sign restrictions are imposed on , and the second displayed inequality is a lower bound on .
QAlgorithms.Papers.Independent.Gap48.P44.cqFamily
For any real number and arbitrary functions , this defines the set of pairs satisfying , , and, for at least one ,
The endpoints are included; no sign, continuity, or other assumptions are imposed on , and the resulting set may be empty.
QAlgorithms.Papers.Independent.Gap48.P44.cqTimeSharing
For arbitrary real numbers , this defines the set of pairs satisfying and admitting some such that
The values are included, and are not assumed nonnegative.
QAlgorithms.Papers.Independent.Gap48.P44.fockParity
For every natural number and every function , this defines the complex number
Thus its value is when the sum is even and when it is odd. The case is included: the sum is empty and the value is .
QAlgorithms.Papers.Independent.Gap48.P44.gaussianDynamicOptimization
For arbitrary real and , this is the ordinary Euclidean closure in of the triples obtainable as follows: choose positive natural numbers and , a probability vector on , and Gaussian density kernels on , such that
and require
Every , even at , must be a density kernel: it has an expansion with and summable , all finite quadratic forms are real and nonnegative, and its real diagonal is summable with total one. The Gaussian requirement means that there exist , a symmetric positive-definite real matrix indexed by , and , possibly different for each , such that for every ,
where and . In the three inequalities, writing and letting preserve finite extended nonnegative values and send to zero,
For any kernel , is times the infimum of over nonnegative summable weights of total one and resolutions , with normalized and mutually orthogonal at positive weights; the infimum is when there is no resolution. The maps in these formulas are given by
Here is embedded in , , and ; complex sums are total sums, returning zero for nonsummable families. Natural subtractions are truncated at zero, and real square roots of negative numbers are zero. The parameters and the coordinates of have no additional sign restrictions; in particular, the energy bound uses zero on its right when . The closure includes limits of triples whose choices of may vary.
QAlgorithms.Papers.Independent.Gap48.P44.lossCE
For any real numbers , this defines the set of pairs with for which some satisfies
where
using the total real logarithm, with and for . Both endpoints for are included, and there are no restrictions on or .
QAlgorithms.Papers.Independent.Gap48.P44.lossCQ
For any real numbers , this defines the set of pairs with for which some satisfies
where
The real logarithm has value at and value at negative . The share may equal either endpoint; and are unrestricted real numbers, so in particular neither nor is required.
QAlgorithms.Papers.Independent.Gap48.P44.lossComplement
For every natural number , real number , and arbitrary complex kernel , where , this defines a kernel whose entry at is
where if both and are the zero function and otherwise, and
The real coefficient is unless ; when that equality holds, it is
The nested infinite sums are taken in the displayed order; each complex infinite sum is the total sum operation, which gives if its summand family is not summable. No positivity, normalization, trace-class, or convergence assumption is imposed on , and is unrestricted; real square roots of negative arguments equal , natural-number subtractions truncate at , and zeroth powers equal , including . For , the products are empty products equal to , and the resulting kernel equals .
QAlgorithms.Papers.Independent.Gap48.P44.lossQuantumFamily
For arbitrary real numbers and , the loss quantum family is the set of all real triples for which some real satisfies
There are no nonnegativity requirements on the three coordinates and no restrictions on or . Consequently the formula also includes negative arguments of : the real logarithm used here has and, for nonzero real , equals .
QAlgorithms.Papers.Independent.Gap48.P44.thermalD
For arbitrary real numbers , this defines the real number
The square root is the total real square root and equals when its argument is negative; no assumptions on the parameters or the radicand are required.
QAlgorithms.Papers.Independent.Gap48.P44.thermalEnvironment
For arbitrary real numbers , let
This defines the real number
There are no parameter restrictions: a negative radicand gives , and the real logarithm used in has and for negative .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.