Definitions for Optimal continuous variable quantum teleportation with limited resources
DefinitionQAlgorithms_Papers_Independent_Intakethird100_P89The objects the formalized statements of Optimal continuous variable quantum teleportation with limited resources (arXiv:1705.03017) are stated in. Each was checked against the paper by a blind read-back and a moderator.
OscillatorChannel: PDF p.2: an operation on complete single-oscillator coefficient arrays.pairKernel: PDF p.2: basis relabeling of the actual two-mode density, without a cutoff.CenteredResource: PDF p.2: the specified, symmetric, centered Gaussian covariance of an actual normalized trace-class resource. All characteristic series converge. The accepted physicality uses V+iOmega; complex conjugation makes this identical to the source's V-iOmega condition for real V.twoModeMeanPhotonEnergy: PDF p.2: actual per-mode mean photon number, in extended nonnegative reals; infinite energy is retained as infinity, rather than converted to zero.bkTest: PDF pp.2--3: source BK signs, in the argument of exp(i v^T R). D(z) at the output tests D(-g conjugate(z)) on A and D(z) on B. This encodes q_out=q_B+g q_A+g q_in, p_out=p_B-g p_A+g p_in.IsBK: PDF pp.2--3, deterministic BK protocol: exact characteristic-function representation on EVERY input density, including non-Gaussian inputs. The resource, gain and single CPTP map are fixed before the input. This is independent of any asserted Gaussian noise formula.FiniteBKRealization: PDF pp.3--4: a finite-energy Gaussian-resource BK realization with EXACT logarithmic negativity 2r. No photon-energy budget is imposed.FiniteBKSimulates: PDF p.3: finite-energy realizability, distinguished from the closed region.priorDensity: PDF p.4, (11): density of the NORMALIZED Gaussian prior for lambda>0, against planar Lebesgue measure. It is never used as a flat prior at lambda=0.teleportedCoherentOverlap: PDF pp.3--4: squared pure-state overlap. The accepted husimiQ has no 1/pi factor, so it is precisely the overlap, not this paper's Q function. All uses are on trace-class channel outputs; realization is concluded below.gaussianPriorFidelity: PDF p.4, (11): actual prior-averaged overlap, independently of (12).phaseInsensitiveFidelityFormula: PDF p.4, (12): the scalar expression, separate from the actual integral.entanglementAccessibleRegion: PDF pp.3--4, (3),(8): CLOSED scalar region, including limiting channels.scalarValues: PDF p.4: independent scalar objective set over the closed region.scalarOptimum: PDF p.4: the optimum is defined independently of the claimed answer.finiteBKValues: PDF pp.3--4: actually attainable fidelities of finite-energy protocols. A resource and channel precede every input in IsBK.finiteBKOptimum: PDF p.4: operational supremum, independently of the scalar formula.stationaryTau: PDF p.4, immediately before (13): unconstrained stationary transmissivity.optimalTau: PDF p.4: maximizing closed-region channel transmissivity.optimalNoise: PDF p.4: maximizing channel noise.optimumClosedForm: PDF p.4, (13): CLAIMED closed form, not the definition of an optimum.familyDenominator: PDF p.3, (9): denominator, used only where strictly positive.familyMinB: PDF p.3, (9): the lower b coefficient on the nonsingular domain.familyA: PDF p.3, (9): a computed from b, not an independent state hypothesis.familyC: PDF p.3, (9): c computed from b, with source block C=-c sigma_z.familyEnergy: PDF p.3: energy within the displayed family; no global energy minimization.familyMinA: PDF p.3: a on the minimum-energy member of (9).familyMinC: PDF p.3: c on the minimum-energy member of (9).familyMinEnergy: PDF p.3: minimum energy WITHIN family (9).tmssCoefficient: PDF p.3: actual pure TMSS coefficients with the source correlation sign. The alternating sign yields C=-sinh(2r) sigma_z; r is finite.tmssKernel: PDF p.3: full TMSS rank-one coefficient array; normalization is concluded.tmssNoise: PDF p.3, (7): independently defined TMSS noise at gain g and squeezing s.minimumSqueezing: PDF p.3, (10): minimum is defined by the noise equation, NOT its answer. The theorem concludes a least element; no empty real-infimum default is used.squeezingClosedForm: PDF p.3, (10): real arcosh written as log(x+sqrt(x^2-1)). The stated domain ensures its argument is at least one. tau=1 uses (7) directly.heterodynePrepare: PDF p.4: heterodyne POVM d^2beta |beta><beta|/pi followed by coherent preparation |g beta>. The complex overlap retains linearity on trace class.tmssOptimalGain: PDF p.4, (16): optimized positive displacement gain for a fixed TMSS.tmssClosedForm: PDF p.4, (16): claimed fixed-TMSS optimum, distinct from its supremum.tmssValues: PDF p.4: actual fidelities with this fixed TMSS, optimized only over g>0.tmssOptimum: PDF p.4: fixed-TMSS optimum, defined independently of (16).
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P19
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P26
import Definitions.Def_QAlgorithms_Defs_BipartiteSeparability
/-!
Liuzzo-Scorpo et al., arXiv:1705.03017v5, PDF pp.1--4.
Full completed oscillator spaces, hbar=1, interleaved coordinates, doubled
covariance with vacuum I, squared overlap fidelity, and natural logarithms.
Accepted paper definitions are imported under the independent-paper override.
No finite photon cutoff and no infinite-energy density are introduced.
The BK map is specified by its exact all-input Weyl characteristic, the
phase-space representation of the balanced homodyne/feed-forward protocol.
It is defined from the actual resource characteristic, independently of the
Gaussian-channel simulation assertions. It tests every normalized input.
The local centered-Gaussian adapter explicitly requires covariance symmetry;
it never uses Claimed50.P47.HasBipartiteMoments.
Corrections needing independent moderation: (14)'s tau is gain squared;
(10) is extended at tau=1 and its strict comparison has equality exceptions.
The abstract's all-channel assertion is deferred, not silently restricted.
Compilation and independent moderation are pending the batch handoff.
-/
noncomputable section
open MeasureTheory Filter
open scoped BigOperators ENNReal Topology ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Intakethird100.P89
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsDensity IsTraceClassChannel tensorApply traceSize)
open QAlgorithms.Papers.Independent.Dependency50.P39
(coherentKet coherentCoefficient operatorOfMatrix husimiQ HasFockMatrix CoherentRealized)
open QAlgorithms.Papers.Independent.Frontier30.P14 (weylCharacteristic)
open QAlgorithms.Papers.Independent.Claimed50.P19
(Cov FockIndex DensityKernel PhysicalCovariance CharacteristicSummable
multimodeWeylTrace covarianceCharacteristicValue standardFormCovariance)
open QAlgorithms.Papers.Independent.Frontier30.P08 (QuadratureIndex)
open QAlgorithms.Papers.Independent.Gap48.P26 (PhaseInsensitive coherentKernel)
open QAlgorithms.Entanglement (partialTransposeFirst)
/-!
Repair reuse audit: these paper-specific objects have descriptive names because
accepted short-name matches are different concepts, not reusable equivalents.
Support50.P14.photonEnergy sums all modes on occupation-function indices;
twoModeMeanPhotonEnergy averages two modes on pair indices. Claimed50.P36's
coherentOverlap is a complex overlap of two coherent kets; the present output
fidelity uses the already imported Dependency50.P39.husimiQ. QuditFidelity's
averageFidelity is a finite-dimensional Haar average. Support50.P11's
channelFidelity is finite-dimensional entanglement fidelity. Frontier30.P06's
FeedbackExecution.accessible is accessible information of an executed protocol.
None replaces a Gaussian-prior oscillator integral or the closed (tau,y) region.
The five local bodies and all theorem propositions are otherwise unchanged.
-/
/-- PDF p.2: an operation on complete single-oscillator coefficient arrays. -/
abbrev OscillatorChannel := Matrix ℕ ℕ ℂ → Matrix ℕ ℕ ℂ
/-- PDF p.2: basis relabeling of the actual two-mode density, without a cutoff. -/
def pairKernel (X : Matrix (ℕ × ℕ) (ℕ × ℕ) ℂ) : DensityKernel 2 :=
fun u v => X (u 0, u 1) (v 0, v 1)
/-- PDF p.2: the specified, symmetric, centered Gaussian covariance of an
actual normalized trace-class resource. All characteristic series converge.
The accepted physicality uses V+iOmega; complex conjugation makes this
identical to the source's V-iOmega condition for real V. -/
def CenteredResource (rho : State (ℕ × ℕ)) (V : Cov 2) : Prop :=
V.transpose = V ∧ PhysicalCovariance V ∧
∀ v : QuadratureIndex 2 → ℝ,
CharacteristicSummable (pairKernel rho.coefficients) v ∧
multimodeWeylTrace (pairKernel rho.coefficients) v =
covarianceCharacteristicValue V 0 v
/-- PDF p.2: actual per-mode mean photon number, in extended nonnegative
reals; infinite energy is retained as infinity, rather than converted to zero. -/
def twoModeMeanPhotonEnergy (rho : State (ℕ × ℕ)) : ℝ≥0∞ :=
∑' u : ℕ × ℕ,
ENNReal.ofReal ((((u.1 : ℝ) + (u.2 : ℝ)) / 2) *
(rho.coefficients u u).re)
/-- PDF pp.2--3: source BK signs, in the argument of exp(i v^T R).
D(z) at the output tests D(-g conjugate(z)) on A and D(z) on B.
This encodes q_out=q_B+g q_A+g q_in, p_out=p_B-g p_A+g p_in. -/
def bkTest (g : ℝ) (z : ℂ) : QuadratureIndex 2 → ℝ :=
fun i => if i.1 = 0 then
(if i.2 = 0 then Real.sqrt 2 * g * z.im else Real.sqrt 2 * g * z.re)
else (if i.2 = 0 then Real.sqrt 2 * z.im else -Real.sqrt 2 * z.re)
/-- PDF pp.2--3, deterministic BK protocol: exact characteristic-function
representation on EVERY input density, including non-Gaussian inputs.
The resource, gain and single CPTP map are fixed before the input.
This is independent of any asserted Gaussian noise formula. -/
def IsBK (rho : State (ℕ × ℕ)) (g : ℝ) (Phi : OscillatorChannel) : Prop :=
0 < g ∧ IsTraceClassChannel Phi ∧
∀ (sigma : State ℕ) (z : ℂ),
weylCharacteristic (Phi sigma.coefficients) z =
weylCharacteristic sigma.coefficients ((g : ℂ) * z) *
multimodeWeylTrace (pairKernel rho.coefficients) (bkTest g z)
/-- PDF pp.3--4: a finite-energy Gaussian-resource BK realization with EXACT
logarithmic negativity 2r. No photon-energy budget is imposed. -/
def FiniteBKRealization (r tau y : ℝ) (Phi : OscillatorChannel) : Prop :=
∃ (rho : State (ℕ × ℕ)) (V : Cov 2) (g : ℝ),
CenteredResource rho V ∧ twoModeMeanPhotonEnergy rho < ⊤ ∧
traceSize (partialTransposeFirst rho.coefficients) = ENNReal.ofReal (Real.exp (2 * r)) ∧
IsBK rho g Phi ∧ g ^ 2 = tau ∧ 0 ≤ tau ∧ PhaseInsensitive Phi tau y
/-- PDF p.3: finite-energy realizability, distinguished from the closed region. -/
def FiniteBKSimulates (r tau y : ℝ) : Prop :=
∃ Phi : OscillatorChannel, FiniteBKRealization r tau y Phi
/-- PDF p.4, (11): density of the NORMALIZED Gaussian prior for lambda>0,
against planar Lebesgue measure. It is never used as a flat prior at lambda=0. -/
def priorDensity (lambda : ℝ) (alpha : ℂ) : ℝ :=
(lambda / Real.pi) * Real.exp (-lambda * Complex.normSq alpha)
/-- PDF pp.3--4: squared pure-state overlap. The accepted husimiQ has no
1/pi factor, so it is precisely the overlap, not this paper's Q function.
All uses are on trace-class channel outputs; realization is concluded below. -/
def teleportedCoherentOverlap (Phi : OscillatorChannel) (alpha : ℂ) : ℝ :=
husimiQ (operatorOfMatrix (Phi (coherentKernel alpha))) alpha
/-- PDF p.4, (11): actual prior-averaged overlap, independently of (12). -/
def gaussianPriorFidelity (lambda : ℝ) (Phi : OscillatorChannel) : ℝ :=
∫ alpha : ℂ, priorDensity lambda alpha * teleportedCoherentOverlap Phi alpha
/-- PDF p.4, (12): the scalar expression, separate from the actual integral. -/
def phaseInsensitiveFidelityFormula (lambda tau y : ℝ) : ℝ :=
2 * lambda / (2 * (1 - Real.sqrt tau) ^ 2 + lambda * (1 + y + tau))
/-- PDF pp.3--4, (3),(8): CLOSED scalar region, including limiting channels. -/
def entanglementAccessibleRegion (r : ℝ) : Set (ℝ × ℝ) :=
{p | 0 ≤ p.1 ∧ |1 - p.1| ≤ p.2 ∧ Real.exp (-2 * r) * (1 + p.1) ≤ p.2}
/-- PDF p.4: independent scalar objective set over the closed region. -/
def scalarValues (lambda r : ℝ) : Set ℝ :=
(fun p : ℝ × ℝ => phaseInsensitiveFidelityFormula lambda p.1 p.2) '' entanglementAccessibleRegion r
/-- PDF p.4: the optimum is defined independently of the claimed answer. -/
def scalarOptimum (lambda r : ℝ) : ℝ := sSup (scalarValues lambda r)
/-- PDF pp.3--4: actually attainable fidelities of finite-energy protocols.
A resource and channel precede every input in IsBK. -/
def finiteBKValues (lambda r : ℝ) : Set ℝ :=
{f | ∃ (tau y : ℝ) (Phi : OscillatorChannel),
FiniteBKRealization r tau y Phi ∧ f = gaussianPriorFidelity lambda Phi}
/-- PDF p.4: operational supremum, independently of the scalar formula. -/
def finiteBKOptimum (lambda r : ℝ) : ℝ := sSup (finiteBKValues lambda r)
/-- PDF p.4, immediately before (13): unconstrained stationary transmissivity. -/
def stationaryTau (lambda r : ℝ) : ℝ :=
Real.exp (2 * r) / (Real.exp r + lambda * Real.cosh r) ^ 2
/-- PDF p.4: maximizing closed-region channel transmissivity. -/
def optimalTau (lambda r : ℝ) : ℝ := max (Real.tanh r) (stationaryTau lambda r)
/-- PDF p.4: maximizing channel noise. -/
def optimalNoise (lambda r : ℝ) : ℝ := Real.exp (-2 * r) * (1 + optimalTau lambda r)
/-- PDF p.4, (13): CLAIMED closed form, not the definition of an optimum. -/
def optimumClosedForm (lambda r : ℝ) : ℝ :=
if stationaryTau lambda r ≤ Real.tanh r then
lambda / (lambda + (1 - Real.sqrt (Real.tanh r)) ^ 2)
else Real.exp r * (1 + lambda + Real.tanh r) /
(2 * Real.exp r + lambda * Real.cosh r)
/-- PDF p.3, (9): denominator, used only where strictly positive. -/
def familyDenominator (r tau : ℝ) : ℝ := tau + 1 - Real.exp (2 * r) * |tau - 1|
/-- PDF p.3, (9): the lower b coefficient on the nonsingular domain. -/
def familyMinB (r tau : ℝ) : ℝ :=
(Real.exp (2 * r) * tau + Real.exp (-2 * r) - |tau - 1|) /
familyDenominator r tau
/-- PDF p.3, (9): a computed from b, not an independent state hypothesis. -/
def familyA (r tau b : ℝ) : ℝ := (b + Real.exp (-2 * r) * (tau - 1)) / tau
/-- PDF p.3, (9): c computed from b, with source block C=-c sigma_z. -/
def familyC (r tau b : ℝ) : ℝ := (b - Real.exp (-2 * r)) / Real.sqrt tau
/-- PDF p.3: energy within the displayed family; no global energy minimization. -/
def familyEnergy (r tau b : ℝ) : ℝ := (familyA r tau b + b - 2) / 4
/-- PDF p.3: a on the minimum-energy member of (9). -/
def familyMinA (r tau : ℝ) : ℝ := familyA r tau (familyMinB r tau)
/-- PDF p.3: c on the minimum-energy member of (9). -/
def familyMinC (r tau : ℝ) : ℝ := familyC r tau (familyMinB r tau)
/-- PDF p.3: minimum energy WITHIN family (9). -/
def familyMinEnergy (r tau : ℝ) : ℝ := familyEnergy r tau (familyMinB r tau)
/-- PDF p.3: actual pure TMSS coefficients with the source correlation sign.
The alternating sign yields C=-sinh(2r) sigma_z; r is finite. -/
def tmssCoefficient (r : ℝ) (u : ℕ × ℕ) : ℂ :=
if u.1 = u.2 then (((-Real.tanh r) ^ u.1 / Real.cosh r : ℝ) : ℂ) else 0
/-- PDF p.3: full TMSS rank-one coefficient array; normalization is concluded. -/
def tmssKernel (r : ℝ) : Matrix (ℕ × ℕ) (ℕ × ℕ) ℂ :=
fun u v => tmssCoefficient r u * star (tmssCoefficient r v)
/-- PDF p.3, (7): independently defined TMSS noise at gain g and squeezing s. -/
def tmssNoise (g s : ℝ) : ℝ :=
(1 + g ^ 2) * Real.cosh (2 * s) - 2 * g * Real.sinh (2 * s)
/-- PDF p.3, (10): minimum is defined by the noise equation, NOT its answer.
The theorem concludes a least element; no empty real-infimum default is used. -/
def minimumSqueezing (tau y : ℝ) : ℝ :=
sInf {s : ℝ | 0 ≤ s ∧ tmssNoise (Real.sqrt tau) s = y}
/-- PDF p.3, (10): real arcosh written as log(x+sqrt(x^2-1)). The stated
domain ensures its argument is at least one. tau=1 uses (7) directly. -/
def squeezingClosedForm (tau y : ℝ) : ℝ :=
if tau = 1 then Real.log (2 / y) / 2 else
let x := (y * (1 + tau) - 2 * Real.sqrt (tau * (y ^ 2 - (1 - tau) ^ 2))) /
(1 - tau) ^ 2
Real.log (x + Real.sqrt (x ^ 2 - 1)) / 2
/-- PDF p.4: heterodyne POVM d^2beta |beta><beta|/pi followed by coherent
preparation |g beta>. The complex overlap retains linearity on trace class. -/
def heterodynePrepare (g : ℝ) : OscillatorChannel :=
fun X m n => ∫ beta : ℂ,
(inner (𝕜 := ℂ) (coherentKet beta) ((operatorOfMatrix X) (coherentKet beta)) /
(Real.pi : ℂ)) * coherentKernel ((g : ℂ) * beta) m n
/-- PDF p.4, (16): optimized positive displacement gain for a fixed TMSS. -/
def tmssOptimalGain (lambda r : ℝ) : ℝ :=
(2 + lambda * Real.sinh (2 * r)) / (2 + lambda + lambda * Real.cosh (2 * r))
/-- PDF p.4, (16): claimed fixed-TMSS optimum, distinct from its supremum. -/
def tmssClosedForm (lambda r : ℝ) : ℝ :=
((1 / Real.cosh r) ^ 2 + lambda) / (2 + lambda - 2 * Real.tanh r)
/-- PDF p.4: actual fidelities with this fixed TMSS, optimized only over g>0. -/
def tmssValues (lambda r : ℝ) : Set ℝ :=
{f | ∃ (rho : State (ℕ × ℕ)) (g : ℝ) (Phi : OscillatorChannel),
rho.coefficients = tmssKernel r ∧ IsBK rho g Phi ∧ f = gaussianPriorFidelity lambda Phi}
/-- PDF p.4: fixed-TMSS optimum, defined independently of (16). -/
def tmssOptimum (lambda r : ℝ) : ℝ := sSup (tmssValues lambda r)
/-! Sanity checks pin coordinate order, signs, normalization conventions,
independent optimization domains and the nonsingular vacuum case. -/
example (X : Matrix (ℕ × ℕ) (ℕ × ℕ) ℂ) :
pairKernel X ![2, 3] ![4, 5] = X (2, 3) (4, 5) := rfl
example (g : ℝ) (z : ℂ) : bkTest g z (0, 1) = Real.sqrt 2 * g * z.re := by
simp [bkTest]
example (g : ℝ) (z : ℂ) : bkTest g z (1, 1) = -Real.sqrt 2 * z.re := by
simp [bkTest]
example (rho : State (ℕ × ℕ)) (g : ℝ) (Phi : OscillatorChannel)
(h : IsBK rho g Phi) : 0 < g := h.1
example (rho : State (ℕ × ℕ)) (V : Cov 2) (h : CenteredResource rho V) :
V.transpose = V := h.1
example (lambda : ℝ) : priorDensity lambda 0 = lambda / Real.pi := by
simp [priorDensity]
example : phaseInsensitiveFidelityFormula 1 1 0 = 1 := by norm_num [phaseInsensitiveFidelityFormula]
example (lambda r f : ℝ) : f ∈ scalarValues lambda r ↔
∃ p ∈ entanglementAccessibleRegion r, phaseInsensitiveFidelityFormula lambda p.1 p.2 = f := Iff.rfl
example (lambda r : ℝ) : scalarOptimum lambda r = sSup (scalarValues lambda r) := rfl
example : familyDenominator 0 1 = 2 := by norm_num [familyDenominator]
example : familyMinB 0 1 = 1 := by norm_num [familyMinB, familyDenominator]
example : familyMinA 0 1 = 1 := by norm_num [familyMinA, familyA, familyMinB, familyDenominator]
example : familyMinC 0 1 = 0 := by norm_num [familyMinC, familyC, familyMinB, familyDenominator]
example : familyMinEnergy 0 1 = 0 := by
norm_num [familyMinEnergy, familyEnergy, familyA, familyMinB, familyDenominator]
example : tmssKernel 0 (0, 0) (0, 0) = 1 := by
simp [tmssKernel, tmssCoefficient]
example (g : ℝ) : tmssNoise g 0 = 1 + g ^ 2 := by simp [tmssNoise]
example (y : ℝ) : squeezingClosedForm 1 y = Real.log (2 / y) / 2 := by
simp [squeezingClosedForm]
end QAlgorithms.Papers.Independent.Intakethird100.P89
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakethird100.P89.CenteredResource
Let be a state indexed by , with coefficient matrix : explicitly, admits sequences such that and ; every finite quadratic form is real and nonnegative; and the real diagonal entries are summable with sum . Let be a real matrix indexed by . The predicate says that , is positive definite, and is positive semidefinite, where , , and all other entries vanish. It further requires the following for every . Put , and define
For every , the sum over below must be summable; the resulting function of must also be summable; and
No finite photon-energy condition is included in this predicate.
QAlgorithms.Papers.Independent.Intakethird100.P89.FiniteBKRealization
For arbitrary real and an arbitrary function on complex matrices indexed by , this predicate asserts the existence of a state indexed by , a real matrix indexed by , and a real , with the following conditions. To specify them explicitly, a matrix on a countable index set is trace class if it has an expansion , where and ; it is a density matrix if additionally every finite quadratic form is real and nonnegative and its real diagonal is summable with sum . A state consists of such a density matrix. Set
as an extended nonnegative real number, with empty infimum , and define
The matrix must be symmetric and positive definite, and must be positive semidefinite, where has the two diagonal blocks . For every , putting , each inner sum and the outer sum defining must be summable, and
The resource must satisfy
Furthermore, , , and . The function must preserve trace class and be complex linear on trace-class inputs, and for every its blockwise extension
must send every density matrix on to a density matrix. Finally, , and for every one-mode state with coefficient matrix and every , both identities must hold:
The second identity uses the nonnegative- branch of the defining phase-insensitive condition; the other conditions in fact force . No sign assumption on or is supplied separately. The ancillary clause for is vacuous. Apart from the explicitly required summability for the resource characteristic, complex infinite sums are totalized and are zero when not summable.
QAlgorithms.Papers.Independent.Intakethird100.P89.FiniteBKSimulates
For arbitrary , this predicate asserts that there exist a function , a two-mode state , a real symmetric matrix indexed by , and satisfying the conditions below. Here a matrix on a countable index set is trace class when for sequences with ; a state has a trace-class coefficient matrix whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum . Define to be the infimum of over all such expansions of , with empty infimum . Define
The matrix must be positive definite and positive semidefinite, where has diagonal blocks . For every , with , each inner sum and the outer sum defining must be summable and their value must be . The further resource requirements are
One must have , , , and . The function must preserve trace class and be complex linear on trace-class matrices; for every , applying to each matrix block of any density matrix on must produce a density matrix on that same index set. For every one-mode state with coefficient matrix and every , it must satisfy
In particular, these requirements force ; there is no separate sign assumption on . The ancillary requirement at is vacuous. Complex infinite sums without an explicit summability requirement are totalized, with value zero when not summable.
QAlgorithms.Papers.Independent.Intakethird100.P89.IsBK
Let be a state indexed by , let , and let be an arbitrary function on complex matrices indexed by . For clarity, call a matrix on a countable index set trace class when there are with and ; call it a density matrix when it is trace class, every finite quadratic form is real and nonnegative, and its real diagonal is summable with sum . A state consists of such a density matrix. Define
The predicate requires ; requires that preserve trace-class matrices, addition of trace-class matrices, and multiplication of trace-class matrices by every complex scalar; and requires that, for every natural number and every density matrix on , the matrix
be a density matrix. Finally, for every state indexed by , with coefficient matrix , and every , it requires
where denotes the coefficients of . No summability hypothesis is separately imposed on these characteristic sums; each complex infinite sum is the totalized sum, equal to zero if its summand is not summable. The ancillary quantifier includes , when there are no density matrices on the empty index set and that clause is vacuous.
QAlgorithms.Papers.Independent.Intakethird100.P89.OscillatorChannel
An oscillator channel, in this abbreviation, is an arbitrary function from complex matrices indexed by to complex matrices indexed by . No linearity, positivity, continuity, normalization, or summability condition is imposed.
QAlgorithms.Papers.Independent.Intakethird100.P89.bkTest
For every real and complex , this defines the real vector indexed by with entries
There is no restriction on , including its sign or whether it is zero.
QAlgorithms.Papers.Independent.Intakethird100.P89.entanglementAccessibleRegion
For every real number , this defines the set of real pairs satisfying
There is no restriction on , no upper bound on either coordinate, and is included when the two bounds on hold.
QAlgorithms.Papers.Independent.Intakethird100.P89.familyA
For arbitrary real numbers , this defines
In particular, is allowed and gives the value , regardless of and .
QAlgorithms.Papers.Independent.Intakethird100.P89.familyC
For arbitrary real numbers , this defines the real number
The real square root is zero when , and division by zero is defined to give zero, so this value is zero for every .
QAlgorithms.Papers.Independent.Intakethird100.P89.familyDenominator
For arbitrary real numbers , this defines
No sign or nonvanishing condition is imposed on this expression.
QAlgorithms.Papers.Independent.Intakethird100.P89.familyEnergy
For arbitrary real numbers , this defines the real number
No sign restrictions are imposed. Division by zero gives zero; in particular, at the value is .
QAlgorithms.Papers.Independent.Intakethird100.P89.familyMinA
For arbitrary real numbers , put
This defines the real number
Every division by zero gives zero, including the division defining if its denominator vanishes; at , the defined value is zero.
QAlgorithms.Papers.Independent.Intakethird100.P89.familyMinB
For arbitrary real numbers , this defines
There are no parameter restrictions, and the value is when the denominator vanishes. The definition does not assert a minimum property.
QAlgorithms.Papers.Independent.Intakethird100.P89.familyMinC
For arbitrary real numbers , this defines the real number
Every division by zero gives zero. Since the real square root is zero for , the defined value is zero throughout that range.
QAlgorithms.Papers.Independent.Intakethird100.P89.familyMinEnergy
For arbitrary real numbers , put
This defines the real number
There are no sign or nonvanishing assumptions, and every division by zero gives zero.
QAlgorithms.Papers.Independent.Intakethird100.P89.finiteBKOptimum
For arbitrary real numbers , this defines the real supremum of the following set of values . Write . For each index set used here, call trace class when it has an expansion with and summable costs ; let be the infimum of the sums of those costs over all such expansions, with empty infimum . Call a density matrix when it is trace class, every finite quadratic form , for finite and arbitrary , is real and nonnegative, and its real diagonal is summable with sum . A value belongs to the set precisely when there exist , a map on all complex matrices indexed by , a density matrix indexed by , a real matrix , and , with these properties: preserves trace class and is additive and complex homogeneous on trace-class inputs; for every natural and every density matrix indexed by , the matrix with entries , indexed by , is a density matrix. Define
With coordinates ordered as , require , positive definiteness of , and positive semidefiniteness of , where . For every real coordinate vector , putting , require every inner series and the outer series in
to be summable and require . Also require
For every density matrix indexed by and every , require
the definition's alternative argument applies only when , which these requirements exclude. Let , , let be the chosen vector in with these coordinates if one exists and otherwise, and let be a chosen bounded complex-linear operator with coordinate matrix if one exists and otherwise. The value associated with these witnesses is
with Lebesgue measure. Neither nor is restricted, and this last integral is not assumed integrable. Infinite sums and integrals are total, giving on nonsummable or nonintegrable inputs unless the relevant property is explicitly required. The finite amplification condition includes , where there are no density matrices to test; excludes . The real supremum defining the result is if this set is empty or unbounded above, and no attainment is asserted.
QAlgorithms.Papers.Independent.Intakethird100.P89.finiteBKValues
For arbitrary real numbers and , this defines the set of real numbers for which there exist real numbers , a map from all complex matrices indexed by to such matrices, a density matrix indexed by , a real matrix , and a real , satisfying the conditions below. Here, for any index set occurring in these conditions, write ; a matrix is called trace class precisely when there are sequences such that is summable and for every . Write for the infimum, over all such expansions, of their costs , viewed in ; an empty infimum is . A density matrix means a trace-class matrix such that, for every finite and every , is real and nonnegative, and the real diagonal is summable with . The map must preserve trace class, preserve sums of trace-class matrices and complex scalar multiples of trace-class matrices, and, for every natural number and every density matrix on , the matrix
must be a density matrix; the condition has no density matrices to test. To specify the remaining conditions, let
Index the coordinates of by , put with , and, for , put . The matrix must be symmetric and positive definite, must be positive semidefinite, and
must hold for every , with every inner series and then the outer series summable. In addition,
One must have , , and . For every density matrix indexed by and every , both identities
are required, where in the stated coordinate order; the negative- branch is excluded by the preceding requirements. Finally, set , , let be the chosen vector with coordinates when such a vector exists and otherwise, and let be a chosen bounded complex-linear operator on whose matrix in the coordinate unit vectors is , or if none exists. The required value of is
using Lebesgue measure. There is no positivity assumption on or , no integrability hypothesis on this last integrand, and no assertion that witnesses exist; in particular, excludes . The integrals and infinite sums use their total definitions, giving when the corresponding integrability or summability fails, except where those properties are explicitly required.
QAlgorithms.Papers.Independent.Intakethird100.P89.gaussianPriorFidelity
For any real and any function on complex matrices indexed by , this defines
where is Lebesgue measure on , , and is a chosen vector in with these coordinates if one exists, otherwise zero. Here is a chosen bounded complex-linear operator on that space with matrix entries , where , if such an operator exists, otherwise zero. No positivity assumption on , channel condition on , or integrability hypothesis is imposed. The integral is the totalized real Bochner integral, equal to zero when the integrand is not integrable; it is also zero at .
QAlgorithms.Papers.Independent.Intakethird100.P89.heterodynePrepare
For every real number , this defines a function from arbitrary complex matrices to complex matrices indexed by . Let , let be its coordinate unit vectors, and let be a chosen bounded complex-linear operator on satisfying for all , if such an operator exists, and the zero operator otherwise. For each , let be a chosen vector in with coordinates for every , if such a vector exists, and the zero vector otherwise. The output entry at any is the complex Bochner integral
with respect to Lebesgue volume on . No density, positivity, or trace-class assumption is imposed on , and is unrestricted, including zero; the integral is defined to be zero if its integrand is not integrable.
QAlgorithms.Papers.Independent.Intakethird100.P89.minimumSqueezing
For arbitrary real numbers , this defines the real infimum
Here when . The set of admissible may be empty, in which case the real infimum used here is defined to be zero; the definition does not assert that an admissible exists or attains the infimum.
QAlgorithms.Papers.Independent.Intakethird100.P89.optimalNoise
For arbitrary real numbers , this defines
with the fraction interpreted as when its denominator is zero. There are no hypotheses restricting or .
QAlgorithms.Papers.Independent.Intakethird100.P89.optimalTau
For arbitrary real numbers , this defines
where a zero denominator makes the fraction . The definition imposes no parameter restrictions and asserts no optimization property.
QAlgorithms.Papers.Independent.Intakethird100.P89.optimumClosedForm
For arbitrary real numbers , this defines the real number
Equality in the comparison selects the first branch. All fractions, including the fraction used in that comparison, are when their denominator is zero; the real square root is on negative arguments. No restrictions on , or equality with an independently defined optimum, are asserted.
QAlgorithms.Papers.Independent.Intakethird100.P89.pairKernel
For any complex matrix whose row and column indices are pairs of natural numbers, this defines a complex matrix indexed instead by functions from to , by
Thus it changes the indexing of the entries. The input is arbitrary; neither nor the resulting matrix is required to be a density matrix.
QAlgorithms.Papers.Independent.Intakethird100.P89.phaseInsensitiveFidelityFormula
For every three real numbers , this defines
No parameter restrictions are imposed. The real square root is zero for , and division by a zero denominator has value zero.
QAlgorithms.Papers.Independent.Intakethird100.P89.priorDensity
For every real and complex , this defines the real number
There is no positivity assumption on . At this function is identically zero; for it is negative everywhere.
QAlgorithms.Papers.Independent.Intakethird100.P89.scalarOptimum
For arbitrary real numbers and , this defines the real supremum of
where division by zero gives . This set is nonempty, since one may take and . The real supremum operation returns if the set is unbounded above; this definition does not assert that a largest value is attained.
QAlgorithms.Papers.Independent.Intakethird100.P89.scalarValues
For arbitrary real numbers and , this defines the set
Neither nor is assumed positive. Division is total: a value with zero denominator is .
QAlgorithms.Papers.Independent.Intakethird100.P89.squeezingClosedForm
For arbitrary real numbers , this defines
No domain restrictions on are assumed. Real square roots of negative numbers give zero, division by zero gives zero, and the real logarithm satisfies and for nonzero negative ; in particular, the first branch gives zero when .
QAlgorithms.Papers.Independent.Intakethird100.P89.stationaryTau
For arbitrary real numbers , this defines
No positivity assumptions are imposed on either parameter. If , the value is by total division.
QAlgorithms.Papers.Independent.Intakethird100.P89.teleportedCoherentOverlap
For any function on complex matrices indexed by and any , put
Let be a chosen vector with coordinates , if such a vector exists, and otherwise let . Let be a chosen bounded complex-linear operator on satisfying for all , if such an operator exists, and otherwise let ; here is the vector equal to at and zero elsewhere. The definition returns
No channel or density condition on is assumed, and in particular the operator-selection fallback can make the value zero.
QAlgorithms.Papers.Independent.Intakethird100.P89.tmssClosedForm
For arbitrary real numbers and , this defines the real number
There are no positivity assumptions on either argument. Division is total: if the denominator is zero, the defined value is zero.
QAlgorithms.Papers.Independent.Intakethird100.P89.tmssCoefficient
For every real number and every pair of natural numbers, this defines the complex number
where the displayed real quotient is embedded into . The indices may be zero, with the zeroth power equal to , including when its base is zero; is positive for every real .
QAlgorithms.Papers.Independent.Intakethird100.P89.tmssKernel
For every real number , this defines a complex matrix indexed by pairs of natural numbers. For and , its entry is
with the real value embedded into . This is the coefficient at multiplied by the complex conjugate of the coefficient at ; both coefficients are real. Zero indices are included, and zeroth powers equal .
QAlgorithms.Papers.Independent.Intakethird100.P89.tmssNoise
For arbitrary real numbers , this defines the real number
Neither argument is required to be positive or nonnegative.
QAlgorithms.Papers.Independent.Intakethird100.P89.tmssOptimalGain
For arbitrary real numbers , this defines the real number
No positivity assumptions are imposed on either argument. If the denominator vanishes, the defined value is zero.
QAlgorithms.Papers.Independent.Intakethird100.P89.tmssOptimum
For arbitrary real , this defines the real supremum of the following set of fidelities. Write ; a trace-class kernel means a kernel admitting with and , and a density kernel additionally has real nonnegative finite quadratic forms, a summable real diagonal, and real diagonal sum one. Range over density kernels on with
positive real gains , and functions on complex kernels on . Require to preserve trace-class kernels and to be additive and complex homogeneous on them; also require every finite ampliation, including size zero, to preserve density kernels, where the ampliation acts by applying to the first-coordinate kernel with the ancillary coordinates fixed. The size-zero requirement has no density inputs. With
require for every one-mode density kernel and that
Set and ; let be a chosen square-summable vector with those coefficients, or zero if none exists, and let be a chosen bounded operator with basis matrix , or zero if none exists. The values whose supremum is taken are
All sums and integrals are total operations, so no convergence or integrability assumptions are added by this definition. This is a supremum in , not an extended-real supremum: its value is zero if the set is empty or is not bounded above.
QAlgorithms.Papers.Independent.Intakethird100.P89.tmssValues
For arbitrary real numbers , this defines the set of real numbers obtained as follows. Put . A kernel on an index set is called trace class here when it has an expansion , where and ; it is a density kernel when, additionally, every finite quadratic form is real and nonnegative, its real diagonal is summable, and . Choose a density kernel on , a real , and a function from complex kernels on to themselves. Require
Require to preserve trace-class kernels, to be additive and complex homogeneous on them, and, for every integer , to send every density kernel on to a density kernel under the entrywise ampliation
The condition has no density inputs. Define
Require, for every density kernel on and every ,
For , let , let , and let be a chosen vector with coefficients if one exists, and zero otherwise. For a kernel , let be a chosen bounded complex linear operator on whose basis matrix is , if such an operator exists, and zero otherwise. Finally require
The integral uses planar Lebesgue measure. No integrability hypothesis or restriction on is imposed in this definition; the integral is the total Bochner integral, which is zero for a nonintegrable integrand. The infinite sums likewise use the total sum operation, assigning zero to a nonsummable family.
QAlgorithms.Papers.Independent.Intakethird100.P89.twoModeMeanPhotonEnergy
For a state indexed by , with coefficient matrix , this defines the extended nonnegative real number
Here being a state means that has an expansion with and , all its finite quadratic forms are real and nonnegative, and its real diagonal is summable with sum . In particular its diagonal entries are nonnegative real numbers, so the displayed truncation does not change the terms. The value may be ; the term is zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.