Definitions for Finite-resource teleportation stretching for continuous-variable systems
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P69The objects the formalized statements of Finite-resource teleportation stretching for continuous-variable systems (arXiv:1706.06065) are stated in. Each was checked against the paper by a blind read-back and a moderator.
CenteredGaussianAt: PDF pp.2,8 [59]: centered normalized trace-class Gaussian density with physical covariance V, finite energy, convergent Weyl traces, and real symmetry. The accepted predicate uses doubled covariance (vacuum I), hence 2 times V.centeredTwoModeGaussianKernel: PDF pp.2,4: construct the unique centered Gaussian density from its full Weyl characteristic, using choice only when it exists. Vacuum is an explicit off-domain extension. The comparison theorem CONCLUDES validity at both constructed covariances, so the fallback cannot discharge a physical claim.resourceDenominator: PDF p.2, (10): D before the overall factor 2 in the denominator of b.resourceNoise: PDF p.2, (11), in physical vacuum variance 1/2 units.resourceB: PDF p.2, (10), restricted to D>0 in the theorem.resourceA: PDF p.2, (9), restricted to eta>0 in the theorem.resourceC: PDF p.2, (9): the positive square root of the intensity gain.resourceCovariance: PDF p.2, (8): (q_A,p_A,q_B,p_B), with off-diagonal c diag(1,-1).comparisonC: PDF p.4, (28): comparison correlation computed from this resource.comparisonCovariance: PDF p.4, (28): keep both diagonal blocks, replace only c by c_sep.resourceKernel: PDF p.2, (8)--(11): the actual centered resource density, not its CM.comparisonKernel: PDF p.4, (28): the actual centered comparison density, not a free candidate.twoModeSplit: PDF pp.2,4: relabel full two-mode Fock coordinates as Alice times Bob. Neither occupation number is truncated.normalStateRelativeEntropyBits: PDF p.3: Umegaki relative entropy in bits on actual normal densities. The accepted extended finite-compression definition retains support failures and divergence as infinity; no difference of infinite entropies is taken.relativeEntropyEntanglementBits: PDF pp.3--4, (23),(29): infimum over ALL normalized separable densities, using their full trace-norm closed convex-hull definition, not only Gaussians.gaussianComparisonBound: PDF p.4, (29): Psi is the divergence to the constructed Gaussian candidate.additiveComparisonBound: PDF pp.2,5, (11), eta=1: r=-ln(xi)/2. Used physically for 0<xi<=1.additiveChainComparisonBound: PDF p.6, (39): minimum of the constructed additive-noise comparison values on all N+1 links. The index type is nonempty even when N=0.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P19
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P01
/-!
Laurenza--Braunstein--Pirandola, arXiv:1706.06065v3, PDF pp.2--8.
The two statements below are the state comparison (28)--(29) and the algebraic
chain specialization on p.6. Operational capacity/stretching nodes are deferred
in HARD.md/GAPS.json: no finite-dimensional LOCC surrogate is used.
Covariance is in interleaved physical vacuum-I/2 units. Only the adapter to the
accepted characteristic doubles it. All densities have full oscillator support.
No defective Claimed50.P47.HasBipartiteMoments predicate is used.
Compilation and independent moderation are pending the batch handoff.
-/
noncomputable section
open scoped BigOperators ENNReal
namespace QAlgorithms.Papers.Independent.Intakenext100.P69
open QAlgorithms.Papers.Independent.Claimed50.P19
(Cov DensityKernel GaussianWithCovariance covarianceCharacteristicValue
multimodeWeylTrace standardFormCovariance vacuumKernel)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsSeparable)
open QAlgorithms.Papers.Independent.Frontier18.P01 (generalizedRelativeEntropy)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.2,8 [59]: centered normalized trace-class Gaussian density with
physical covariance V, finite energy, convergent Weyl traces, and real symmetry.
The accepted predicate uses doubled covariance (vacuum I), hence 2 times V. -/
def CenteredGaussianAt (V : Cov 2) (rho : DensityKernel 2) : Prop :=
V.transpose = V ∧ GaussianWithCovariance rho ((2 : ℝ) • V) ∧
∀ v, multimodeWeylTrace rho v =
covarianceCharacteristicValue ((2 : ℝ) • V) 0 v
/-- PDF pp.2,4: construct the unique centered Gaussian density from its full
Weyl characteristic, using choice only when it exists. Vacuum is an explicit
off-domain extension. The comparison theorem CONCLUDES validity at both
constructed covariances, so the fallback cannot discharge a physical claim. -/
def centeredTwoModeGaussianKernel (V : Cov 2) : DensityKernel 2 :=
if h : ∃ rho : DensityKernel 2, CenteredGaussianAt V rho then
Classical.choose h
else vacuumKernel 2
/-- PDF p.2, (10): D before the overall factor 2 in the denominator of b. -/
def resourceDenominator (eta r : ℝ) : ℝ :=
eta + 1 - Real.exp (2 * r) * |eta - 1|
/-- PDF p.2, (11), in physical vacuum variance 1/2 units. -/
def resourceNoise (eta r : ℝ) : ℝ :=
Real.exp (-2 * r) * (eta + 1) / 2
/-- PDF p.2, (10), restricted to D>0 in the theorem. -/
def resourceB (eta r : ℝ) : ℝ :=
(-|eta - 1| + eta * Real.exp (2 * r) + Real.exp (-2 * r)) /
(2 * resourceDenominator eta r)
/-- PDF p.2, (9), restricted to eta>0 in the theorem. -/
def resourceA (eta r : ℝ) : ℝ :=
(2 * resourceB eta r + (eta - 1) * Real.exp (-2 * r)) / (2 * eta)
/-- PDF p.2, (9): the positive square root of the intensity gain. -/
def resourceC (eta r : ℝ) : ℝ :=
(2 * resourceB eta r - Real.exp (-2 * r)) / (2 * Real.sqrt eta)
/-- PDF p.2, (8): (q_A,p_A,q_B,p_B), with off-diagonal c diag(1,-1). -/
def resourceCovariance (eta r : ℝ) : Cov 2 :=
standardFormCovariance (resourceA eta r) (resourceB eta r)
(resourceC eta r) (-resourceC eta r)
/-- PDF p.4, (28): comparison correlation computed from this resource. -/
def comparisonC (eta r : ℝ) : ℝ :=
Real.sqrt ((resourceA eta r - 1 / 2) * (resourceB eta r - 1 / 2))
/-- PDF p.4, (28): keep both diagonal blocks, replace only c by c_sep. -/
def comparisonCovariance (eta r : ℝ) : Cov 2 :=
standardFormCovariance (resourceA eta r) (resourceB eta r)
(comparisonC eta r) (-comparisonC eta r)
/-- PDF p.2, (8)--(11): the actual centered resource density, not its CM. -/
def resourceKernel (eta r : ℝ) : DensityKernel 2 :=
centeredTwoModeGaussianKernel (resourceCovariance eta r)
/-- PDF p.4, (28): the actual centered comparison density, not a free candidate. -/
def comparisonKernel (eta r : ℝ) : DensityKernel 2 :=
centeredTwoModeGaussianKernel (comparisonCovariance eta r)
/-- PDF pp.2,4: relabel full two-mode Fock coordinates as Alice times Bob.
Neither occupation number is truncated. -/
def twoModeSplit (rho : DensityKernel 2) : Matrix (ℕ × ℕ) (ℕ × ℕ) ℂ :=
fun p q => rho (fun i => if i = 0 then p.1 else p.2)
(fun i => if i = 0 then q.1 else q.2)
/-- PDF p.3: Umegaki relative entropy in bits on actual normal densities.
The accepted extended finite-compression definition retains support failures
and divergence as infinity; no difference of infinite entropies is taken. -/
def normalStateRelativeEntropyBits {I : Type} (rho sigma : Matrix I I ℂ) : ℝ≥0∞ :=
generalizedRelativeEntropy rho sigma / ENNReal.ofReal (Real.log 2)
/-- PDF pp.3--4, (23),(29): infimum over ALL normalized separable densities,
using their full trace-norm closed convex-hull definition, not only Gaussians. -/
def relativeEntropyEntanglementBits (rho : Matrix (ℕ × ℕ) (ℕ × ℕ) ℂ) : ℝ≥0∞ :=
⨅ sigma : {sigma : State (ℕ × ℕ) // IsSeparable sigma.coefficients},
normalStateRelativeEntropyBits rho sigma.val.coefficients
/-- PDF p.4, (29): Psi is the divergence to the constructed Gaussian candidate. -/
def gaussianComparisonBound (eta r : ℝ) : ℝ≥0∞ :=
normalStateRelativeEntropyBits (twoModeSplit (resourceKernel eta r))
(twoModeSplit (comparisonKernel eta r))
/-- PDF pp.2,5, (11), eta=1: r=-ln(xi)/2. Used physically for 0<xi<=1. -/
def additiveComparisonBound (xi : ℝ) : ℝ≥0∞ :=
gaussianComparisonBound 1 (-Real.log xi / 2)
/-- PDF p.6, (39): minimum of the constructed additive-noise comparison values
on all N+1 links. The index type is nonempty even when N=0. -/
def additiveChainComparisonBound (N : ℕ) (noise : Fin (N + 1) → ℝ) : ℝ≥0∞ :=
⨅ i : Fin (N + 1), additiveComparisonBound (noise i)
/-- Sanity check for p.2, (8): q_A--q_B has sign +c. -/
example (eta r : ℝ) :
resourceCovariance eta r (0, 0) (1, 0) = resourceC eta r := by
simp [resourceCovariance, standardFormCovariance]
/-- Sanity check for p.2, (8): p_A--p_B has sign -c. -/
example (eta r : ℝ) :
resourceCovariance eta r (0, 1) (1, 1) = -resourceC eta r := by
simp [resourceCovariance, standardFormCovariance]
/-- Sanity check: the fallback is explicit and confined to absent Gaussians. -/
example (V : Cov 2) (h : ¬ ∃ rho, CenteredGaussianAt V rho) :
centeredTwoModeGaussianKernel V = vacuumKernel 2 := by
simp [centeredTwoModeGaussianKernel, h]
/-- Sanity check: at eta=1,r=0, the resource is prescribed the vacuum CM I/2. -/
example : resourceA 1 0 = 1 / 2 ∧ resourceB 1 0 = 1 / 2 ∧
resourceC 1 0 = 0 := by
norm_num [resourceA, resourceB, resourceC, resourceDenominator]
/-- Sanity check: at xi=1 the additive parametrization has r=0. -/
example : additiveComparisonBound 1 = gaussianComparisonBound 1 0 := by
simp [additiveComparisonBound]
end QAlgorithms.Papers.Independent.Intakenext100.P69
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P69.CenteredGaussianAt
For any real matrix indexed by and any complex kernel , this predicate requires the following conjunction. First, . Second, has a representation , where and is summable; for every finite and every , the number has zero imaginary part and nonnegative real part; the real diagonal entries are summable with ; is positive definite; is positive semidefinite, where in the order , with ; and the real family is summable. To state the remaining requirements, for every real vector , put and
There must exist a real vector indexed by such that, for every , each family is summable, the family is summable, and
Finally, independently of that existential choice of , the same iterated sum must satisfy, for every ,
QAlgorithms.Papers.Independent.Intakenext100.P69.additiveChainComparisonBound
For every natural number , including , and every function , this defines
an infimum in over indices, equivalently their minimum. To specify each value fully, put and
and form, in coordinate order ,
Then . With functions identified with , is the definition’s chosen kernel satisfying all of these requirements, if one exists, and otherwise is the kernel supported at with value : is symmetric, is positive definite, and is positive semidefinite, where and ; with and summable; every finite quadratic form is real and nonnegative; the real diagonal is summable with sum ; and is summable. There must also exist such that for every ,
with each inner family over and the resulting family of inner sums over summable, where
Here
with , real continuous functional calculus for matrix functions, coordinate restrictions , and embedded in the extended nonnegative reals; the supremum includes . No positivity assumption is imposed on any : , the logarithm of a negative real equals that of its absolute value, and real square roots of negative arguments are zero. For , the defined infimum has just the single value .
QAlgorithms.Papers.Independent.Intakenext100.P69.additiveComparisonBound
For every real , this defines the extended nonnegative number obtained from the following construction with and :
where
Coordinates are ordered as . Identifying functions with pairs , is the definition’s chosen kernel satisfying the conditions below, if one exists, and otherwise is for and elsewhere. Those conditions are: is symmetric; is positive definite and is positive semidefinite, with , ; for sequences in with summable; every finite quadratic form of is real and nonnegative; its real diagonal is summable with sum ; and is summable. Moreover, there exists such that for every ,
each inner family over , and the family of resulting inner sums over , must be summable, and
Finally,
where are coordinate restrictions, including the empty one, , matrix functions use real continuous functional calculus, and is regarded as an extended nonnegative real. There is no assumption that is positive: the real logarithm used here has and for negative ; all quotients are total, and real square roots of negative arguments are zero.
QAlgorithms.Papers.Independent.Intakenext100.P69.centeredTwoModeGaussianKernel
For every real matrix indexed by , this definition selects an arbitrary complex kernel satisfying the conditions below if any such kernel exists; it specifies no uniqueness. The conditions are that ; for sequences with summable ; every finite quadratic form , for finite and arbitrary , is real and nonnegative; is summable with sum ; is positive definite and is positive semidefinite, where in interleaved mode order; and is summable. For a real vector , define and
There must exist a real four-component vector such that for every real , each inner family and the outer family are summable and
also, for every , this sum must equal . If no kernel satisfies all these conditions, the definition instead returns the kernel whose -entry is when both and , and is otherwise.
QAlgorithms.Papers.Independent.Intakenext100.P69.comparisonC
For arbitrary real numbers , put
This definition returns
Division by zero in the formulas for gives , and the returned square root is whenever its argument is nonpositive. No hypothesis requires either factor to be nonnegative.
QAlgorithms.Papers.Independent.Intakenext100.P69.comparisonCovariance
For arbitrary real numbers , define
This definition returns the real matrix, indexed in the order ,
There are no parameter restrictions; division by zero gives , and square roots of negative real numbers give . No positive definiteness or quantum covariance condition is asserted.
QAlgorithms.Papers.Independent.Intakenext100.P69.comparisonKernel
For arbitrary real numbers , form
using the order , totalized division with quotient at a zero denominator, and real square root equal to on negative arguments. The definition selects an arbitrary kernel satisfying all the following conditions if one exists. The matrix must be symmetric; must admit with and summable ; every finite quadratic form , for finite and arbitrary , must be real and nonnegative; the real diagonal must be summable with sum ; must be positive definite and positive semidefinite, where and ; and must be summable. For each real four-component vector , set and
There must exist a real four-component vector such that for every , each family and the family are summable and
additionally, for every , this sum must equal . No uniqueness is specified. If no kernel satisfies these conditions, the returned kernel is at and at every other pair of indices.
QAlgorithms.Papers.Independent.Intakenext100.P69.gaussianComparisonBound
For arbitrary real , this defines
using pair indices , which identify a pair with the function on having those two values. Set
The coordinate order is . For a real matrix , is the definition’s chosen kernel satisfying all of the following conditions, if such a kernel exists, and otherwise is the vacuum kernel when and otherwise: ; admits an expansion with and summable; every finite quadratic form is real and nonnegative; is summable and equals ; the family is summable; is positive definite; and is positive semidefinite, where and . In addition, there exists such that, for every ,
For each , the inner summand family over must be summable, and the resulting family of inner sums over must also be summable. The displacement entries used here are
The relative-entropy quantity in the definition is
where coordinate restrictions include the empty restriction, , matrix functions use real continuous functional calculus, and is embedded in . No parameter restrictions are imposed: zero denominators give zero quotients, and the real square root of a negative argument is zero.
QAlgorithms.Papers.Independent.Intakenext100.P69.normalStateRelativeEntropyBits
For every type , with no finiteness, countability, or nonemptiness assumption, and every two complex matrices indexed by , this defines an extended nonnegative real number
Here are the matrices restricted to rows and columns in ; the kernels are those of their finite-dimensional matrix multiplication maps; ; and use real continuous functional calculus; and , viewed as an extended nonnegative real. The supremum includes , and the division is in the extended nonnegative reals by the positive finite number . Neither matrix is assumed to be a density matrix, positive, or trace class; the definition also applies when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P69.relativeEntropyEntanglementBits
For every complex matrix indexed by , without any assumption on , this defines
where the infimum ranges over precisely the following matrices . First, is a density kernel: it has a nuclear expansion with and summable; for every finite and every , the number is real and nonnegative; and the real diagonal entries form a summable family with sum . Second, for every real , there is a finite convex combination of product kernels , where are density kernels on satisfying these same conditions and
Here
with an empty infimum equal to . Finally, the quantity minimized is
where are coordinate restrictions, , the matrix functions use real continuous functional calculus, and is embedded in the extended nonnegative reals. All these infima and suprema are taken in ; the finite-coordinate supremum includes the empty set.
QAlgorithms.Papers.Independent.Intakenext100.P69.resourceA
For arbitrary real numbers and , put
This definition returns
Both divisions are totalized: a zero denominator gives quotient . In particular, the returned value is when ; no positivity or denominator hypothesis is imposed.
QAlgorithms.Papers.Independent.Intakenext100.P69.resourceB
For arbitrary real numbers and , this defines
No condition excludes a zero denominator; real division is totalized, so the defined value is whenever that denominator is zero.
QAlgorithms.Papers.Independent.Intakenext100.P69.resourceC
For arbitrary real numbers and , put
This definition returns
Here the real square root is on negative arguments, and division by zero gives ; these conventions also apply to the definition of . Consequently, the returned value is for every , with no restriction on .
QAlgorithms.Papers.Independent.Intakenext100.P69.resourceCovariance
For arbitrary real numbers , define
This definition returns the real matrix, indexed in the order ,
All parameters are allowed, division by zero gives , and the real square root of a negative number is . The definition itself imposes no positive definiteness or quantum covariance condition.
QAlgorithms.Papers.Independent.Intakenext100.P69.resourceDenominator
For arbitrary real numbers and , this defines the real number
There are no restrictions on either parameter, and this value may be positive, zero, or negative.
QAlgorithms.Papers.Independent.Intakenext100.P69.resourceKernel
For arbitrary real numbers , form
using the order , totalized division with quotient at a zero denominator, and real square root equal to on negative arguments. The definition selects an arbitrary kernel satisfying all the following conditions if one exists. The matrix must be symmetric; must admit with and summable ; every finite quadratic form , for finite and arbitrary , must be real and nonnegative; the real diagonal must be summable with sum ; must be positive definite and positive semidefinite, where and ; and must be summable. For each real four-component vector , set and
There must exist a real four-component vector such that for every , each family and the family are summable and
additionally, for every , this sum must equal . No uniqueness is specified. If no kernel satisfies these conditions, the returned kernel is at and at every other pair of indices.
QAlgorithms.Papers.Independent.Intakenext100.P69.resourceNoise
For arbitrary real numbers and , this defines the real number
No nonnegativity condition is imposed: the value is zero for and negative for .
QAlgorithms.Papers.Independent.Intakenext100.P69.twoModeSplit
For every complex matrix whose rows and columns are indexed by functions , this defines a complex matrix indexed by by relabeling those functions as ordered pairs:
Thus the row function takes the value at and at , and the column function similarly takes the values . There is no positivity, normalization, summability, or Gaussianity assumption on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.