Definitions for Capacity of the Bosonic Wiretap Channel and the Entropy Photon-Number Inequality
DefinitionQAlgorithms_Papers_Independent_Support50_P06The objects the formalized statements of Capacity of the Bosonic Wiretap Channel and the Entropy Photon-Number Inequality (arXiv:0801.0841) are stated in. Each was checked against the paper by a blind read-back and a moderator.
entropyParameter: PDF p.4, (20). The real thermal parameter is used only for finite entropy and positive n. It is not the physical mean photon number.entropyPhotonNumber: PDF p.4, (20),(22). Infinite output entropy gives infinity before toReal. All theorems constructing finite comparison states require finite input entropy.EpniAt: PDF p.4, (22): the pointwise conjectured inequality, with independent ports implemented by mixedOutput. No energy condition is imposed.EntropyPhotonNumberInequality: PDF p.4, (22). This is a conjectural predicate, universally quantified on the finite-input-entropy domain used for the source's thermal comparisons.CenteredPureInput: PDF p.4, Conjecture 1: every annihilation expectation converges and is zero. The pure vector's normalization is separately required. This does not require finite photon energy or replace a divergent series by its tsum default.MinimumOutputEntropyConjecture1: PDF pp.4–5, Conjecture 1 and its attained value. The optimized a port is pure and centered; b is the identical thermal product. Arbitrary correlations within the pure n-mode input are allowed.coherentMixture: PDF p.4, (18). The accepted complexNormal N 0 has exactly the printed Lebesgue density when N>0 and is delta_0 when N=0.totalEnergy: PDF pp.2–3: total photon expectation across all n modes, including infinity. Uses the accepted actual diagonal photon expectation, with no cutoff.BosonicPrivateCode: PDF p.2, (4)–(5): uniform secret messages, arbitrary normalized mixed block states, a normalized decoder POVM, and independent private discrete randomness. A finite random alphabet embeds in this countable one with zero weights.eveMessage: PDF p.2, message secrecy: first average all private randomization at Eve.eveAverage: PDF p.2: Eve's unconditional state, averaging uniform messages.messageLeakage: PDF p.2, corrected (5): Holevo information of the MESSAGE, in nats. Finite code energy implies all of these message entropies are finite; the extended nonnegative subtraction does not turn an infinite entropy into zero.randomizedPrivateCodePhotonBudget: PDF pp.2–3: unconditional TOTAL input energy, averaged over uniform messages and private randomness. There is no separate constraint on any mode or codeword.Decodes: PDF p.2, (4): the source's strict success bound for every m,k, including unused random branches, rather than an average probability of error.CoherentPrivateCode: PDF p.3: single-use coherent signal states, tensorized over the block. The decoder can be collective and the amplitudes can vary across uses.privateAchievable: PDF pp.2–3: actual asymptotic private rate in nats per width-mode channel use. width=1 is the source channel. Grouping width parallel identical modes expresses additivity with the SAME total average budget. The definition contains no capacity formula or entropy conjecture. All choices precede m,k.holevoMessagePrivacyCapacityNats: PDF pp.2–3: operational private capacity, an extended nonnegative supremum. Empty feasible sets give zero and unbounded sets infinity, never a real default. The arbitrary-state capacity uses coherentOnly=false.PrivateEnsemble: PDF p.2, (6)–(7): finite auxiliary ensemble of arbitrary mixed n-mode inputs. Random preparation is absorbed into each conditional density. This retains arbitrary auxiliary weights, not just a uniform codebook.finiteFockEnsembleBarycenter: PDF p.2: average input density for the auxiliary ensemble.ensembleEnergy: PDF pp.2–3: the unconditional photon budget of a block ensemble.ensemblePrivateInformation: PDF p.2, (6): chi(T;B)-chi(T;E), including mixed conditional inputs. Finite average energy makes all positive-weight entropies finite; zero-weight terms contribute zero. The two receivers use the same vacuum dilation.blockPrivateInformation: PDF pp.2–3, (6)–(11): n-letter private-information supremum over all finite auxiliaries and arbitrary, possibly entangled, conditional input states. No absent numerical auxiliary-cardinality bound is invented. The supremum includes the finite-ensemble approximations used in the source's footnote 3.vacuumLossCoherentInformationNats: PDF p.3, (12): actual coherent information for the fixed vacuum dilation. The finite-energy optimization guarantees both output entropies finite; this finiteness is a theorem conclusion below, not an extra optimizing restriction.coherentInformationMaximum: PDF p.3, (12): unrestricted input optimization with the TOTAL photon budget. EReal retains empty/unbounded supremum semantics; Gaussianity is not assumed. The one-mode instance is Q^(1), not an operational quantum capacity.gaussianPrivateInformation: PDF p.3: difference of the two Holevo informations for the printed isotropic Gaussian coherent ensemble. Its average state is computed, not postulated. The theorem asserts zero individual output entropies, so the integrals exist.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P32
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P11
/-!
Guha–Shapiro–Erkmen, arXiv:0801.0841v1. Full completed oscillator spaces,
natural logarithms, and extended nonnegative entropy. The imported paper modules
are pinned accepted libraries. No conjecture is asserted unconditionally.
The new private codes use message Holevo secrecy after private randomization;
this corrects the printed j=(m,k) in (5), as required by (6) and the capacity proof.
Compilation and independent moderation are pending the batch handoff.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P06
open MeasureTheory Filter
open scoped ENNReal BigOperators Topology
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsDensity rankOne)
open QAlgorithms.Papers.Independent.Next46.P32
(NumberString FockKernel identicalThermalKernel vacuum productCoherentKernel
jointMix bobMarginal charlieMarginal pureLoss broadcast mixedOutput
spectralEntropyNats FockPOVM realFockTracePair modeEnergy complexNormal
StrongConjecture2)
open QAlgorithms.Papers.Independent.Claimed50.P39 (g)
open QAlgorithms.Papers.Independent.Claimed50.P11 (thermalEntropyInverse)
attribute [local instance] Classical.propDecidable Classical.decEq
/-!
Frozen-name repair audit (exact accepted source signatures checked):
* Eve uses imported `charlieMarginal (broadcast n eta X)` directly, preserving
the common physical vacuum dilation. Gap48.P43.eveOutput instead requires a
`PureDilation` unitary; no such extra witness is assumed here.
* `randomizedPrivateCodePhotonBudget` averages a countable private random seed
with arbitrary weights. Next46.P32.codeEnergy takes a `BroadcastCode` and
averages two finite uniform public message alphabets.
* `holevoMessagePrivacyCapacityNats` is energy constrained, full-Fock, Holevo
message secrecy, with ENNReal extrema and strict branchwise decoding.
Information100.P67.privateCapacity is finite-dimensional, unconstrained,
fidelity based, in bits, with a real supremum. It cannot be substituted.
* `finiteFockEnsembleBarycenter` allows completed oscillator state spaces.
Information100.P08.ensembleAverage requires a finite-dimensional state basis.
* `vacuumLossCoherentInformationNats` uses this fixed physical complement and
extended spectral nats entropy on its finite-energy domain. Both frozen
Information100 coherentInformation declarations require finite registers;
P22 uses purification/bits and P39 also has a Renyi-order parameter.
The four distinct local bodies remain necessary; these are model distinctions,
not claims that same-named accepted definitions have been generalized by import.
-/
/-- PDF p.4, (20). The real thermal parameter is used only for finite entropy
and positive n. It is not the physical mean photon number. -/
def entropyParameter (n : ℕ) (S : ℝ≥0∞) : ℝ :=
thermalEntropyInverse (S.toReal / (n : ℝ))
/-- PDF p.4, (20),(22). Infinite output entropy gives infinity before toReal.
All theorems constructing finite comparison states require finite input entropy. -/
def entropyPhotonNumber (n : ℕ) (S : ℝ≥0∞) : ℝ≥0∞ :=
if S = ⊤ then ⊤ else ENNReal.ofReal (entropyParameter n S)
/-- PDF p.4, (22): the pointwise conjectured inequality, with independent
ports implemented by mixedOutput. No energy condition is imposed. -/
def EpniAt {n : ℕ} (eta : ℝ) (X Y : FockKernel n) : Prop :=
ENNReal.ofReal eta * entropyPhotonNumber n (spectralEntropyNats X) +
ENNReal.ofReal (1 - eta) * entropyPhotonNumber n (spectralEntropyNats Y) ≤
entropyPhotonNumber n (spectralEntropyNats (mixedOutput n eta X Y))
/-- PDF p.4, (22). This is a conjectural predicate, universally quantified on
the finite-input-entropy domain used for the source's thermal comparisons. -/
def EntropyPhotonNumberInequality : Prop :=
∀ (n : ℕ), 0 < n → ∀ eta : ℝ, 0 ≤ eta → eta ≤ 1 →
∀ rhoA rhoB : State (NumberString n),
spectralEntropyNats rhoA.coefficients ≠ ⊤ →
spectralEntropyNats rhoB.coefficients ≠ ⊤ →
EpniAt eta rhoA.coefficients rhoB.coefficients
/-- PDF p.4, Conjecture 1: every annihilation expectation converges and is
zero. The pure vector's normalization is separately required. This does not
require finite photon energy or replace a divergent series by its tsum default. -/
def CenteredPureInput {n : ℕ} (u : Hilbert (NumberString n)) : Prop :=
∀ i : Fin n, HasSum (fun a : NumberString n =>
(Real.sqrt (a i + 1 : ℝ) : ℂ) * star (u a) *
u (Function.update a i (a i + 1))) 0
/-- PDF pp.4–5, Conjecture 1 and its attained value. The optimized a port is
pure and centered; b is the identical thermal product. Arbitrary correlations
within the pure n-mode input are allowed. -/
def MinimumOutputEntropyConjecture1 : Prop :=
∀ (n : ℕ), 0 < n → ∀ eta : ℝ, 0 ≤ eta → eta ≤ 1 →
∀ K : ℝ, 0 ≤ K →
mixedOutput n eta (vacuum n) (identicalThermalKernel n K) =
identicalThermalKernel n ((1 - eta) * K) ∧
spectralEntropyNats (mixedOutput n eta (vacuum n) (identicalThermalKernel n K)) =
ENNReal.ofReal ((n : ℝ) * g ((1 - eta) * K)) ∧
∀ u : Hilbert (NumberString n), ‖u‖ = 1 → CenteredPureInput u →
ENNReal.ofReal ((n : ℝ) * g ((1 - eta) * K)) ≤
spectralEntropyNats (mixedOutput n eta (rankOne u) (identicalThermalKernel n K))
/-- PDF p.4, (18). The accepted complexNormal N 0 has exactly the printed
Lebesgue density when N>0 and is delta_0 when N=0. -/
def coherentMixture (N : ℝ) : FockKernel 1 :=
fun a b => ∫ alpha : ℂ, productCoherentKernel 1 (fun _ => alpha) a b
∂complexNormal N 0
/-- PDF pp.2–3: total photon expectation across all n modes, including infinity.
Uses the accepted actual diagonal photon expectation, with no cutoff. -/
def totalEnergy {n : ℕ} (X : FockKernel n) : ℝ≥0∞ :=
∑ i : Fin n, modeEnergy X i
/-- PDF p.2, (4)–(5): uniform secret messages, arbitrary normalized mixed block
states, a normalized decoder POVM, and independent private discrete randomness.
A finite random alphabet embeds in this countable one with zero weights. -/
structure BosonicPrivateCode (n M : ℕ) where
block_positive : 0 < n
messages_positive : 0 < M
randomWeight : ℕ → ℝ
random_nonnegative : ∀ k, 0 ≤ randomWeight k
random_summable : Summable randomWeight
random_total : (∑' k, randomWeight k) = 1
encoder : Fin M → ℕ → State (NumberString n)
decoder : FockPOVM (NumberString n) (Fin M)
/-- PDF p.2, message secrecy: first average all private randomization at Eve. -/
def eveMessage {n M : ℕ} (C : BosonicPrivateCode n M) (eta : ℝ)
(m : Fin M) : FockKernel n :=
fun a b => ∑' k : ℕ, (C.randomWeight k : ℂ) *
(charlieMarginal (broadcast n eta (C.encoder m k).coefficients)) a b
/-- PDF p.2: Eve's unconditional state, averaging uniform messages. -/
def eveAverage {n M : ℕ} (C : BosonicPrivateCode n M) (eta : ℝ) : FockKernel n :=
fun a b => (M : ℂ)⁻¹ * ∑ m : Fin M, eveMessage C eta m a b
/-- PDF p.2, corrected (5): Holevo information of the MESSAGE, in nats.
Finite code energy implies all of these message entropies are finite; the
extended nonnegative subtraction does not turn an infinite entropy into zero. -/
def messageLeakage {n M : ℕ} (C : BosonicPrivateCode n M) (eta : ℝ) : ℝ≥0∞ :=
spectralEntropyNats (eveAverage C eta) -
(M : ℝ≥0∞)⁻¹ * ∑ m : Fin M, spectralEntropyNats (eveMessage C eta m)
/-- PDF pp.2–3: unconditional TOTAL input energy, averaged over uniform messages
and private randomness. There is no separate constraint on any mode or codeword. -/
def randomizedPrivateCodePhotonBudget {n M : ℕ} (C : BosonicPrivateCode n M) : ℝ≥0∞ :=
(M : ℝ≥0∞)⁻¹ * ∑ m : Fin M, ∑' k : ℕ,
ENNReal.ofReal (C.randomWeight k) * totalEnergy (C.encoder m k).coefficients
/-- PDF p.2, (4): the source's strict success bound for every m,k, including
unused random branches, rather than an average probability of error. -/
def Decodes {n M : ℕ} (C : BosonicPrivateCode n M) (eta epsilon : ℝ) : Prop :=
∀ (m : Fin M) (k : ℕ), 1 - epsilon <
realFockTracePair (pureLoss n eta (C.encoder m k).coefficients) (C.decoder.effect m)
/-- PDF p.3: single-use coherent signal states, tensorized over the block.
The decoder can be collective and the amplitudes can vary across uses. -/
def CoherentPrivateCode {n M : ℕ} (C : BosonicPrivateCode n M) : Prop :=
∃ alpha : Fin M → ℕ → Fin n → ℂ, ∀ m k,
(C.encoder m k).coefficients = productCoherentKernel n (alpha m k)
/-- PDF pp.2–3: actual asymptotic private rate in nats per width-mode channel
use. width=1 is the source channel. Grouping width parallel identical modes
expresses additivity with the SAME total average budget. The definition contains
no capacity formula or entropy conjecture. All choices precede m,k. -/
def privateAchievable (width : ℕ) (eta Nbar : ℝ) (coherentOnly : Bool) (R : ℝ) : Prop :=
0 ≤ R ∧ ∀ epsilon : ℝ, 0 < epsilon → epsilon < 1 →
∀ delta : ℝ, 0 < delta → ∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ M : ℕ, ∃ C : BosonicPrivateCode (n * width) M,
randomizedPrivateCodePhotonBudget C ≤ ENNReal.ofReal (((n * width : ℕ) : ℝ) * Nbar) ∧
Decodes C eta epsilon ∧ messageLeakage C eta ≤ ENNReal.ofReal epsilon ∧
(coherentOnly = true → CoherentPrivateCode C) ∧
R - delta ≤ Real.log (M : ℝ) / (n : ℝ)
/-- PDF pp.2–3: operational private capacity, an extended nonnegative supremum.
Empty feasible sets give zero and unbounded sets infinity, never a real default.
The arbitrary-state capacity uses coherentOnly=false. -/
def holevoMessagePrivacyCapacityNats (width : ℕ) (eta Nbar : ℝ) (coherentOnly : Bool := false) : ℝ≥0∞ :=
sSup {r : ℝ≥0∞ | ∃ R : ℝ, privateAchievable width eta Nbar coherentOnly R ∧
r = ENNReal.ofReal R}
/-- PDF p.2, (6)–(7): finite auxiliary ensemble of arbitrary mixed n-mode
inputs. Random preparation is absorbed into each conditional density. This
retains arbitrary auxiliary weights, not just a uniform codebook. -/
structure PrivateEnsemble (n L : ℕ) where
alphabet_positive : 0 < L
weight : Fin L → ℝ
weight_nonnegative : ∀ j, 0 ≤ weight j
weight_total : (∑ j, weight j) = 1
input : Fin L → State (NumberString n)
/-- PDF p.2: average input density for the auxiliary ensemble. -/
def finiteFockEnsembleBarycenter {n L : ℕ} (A : PrivateEnsemble n L) : FockKernel n :=
fun a b => ∑ j : Fin L, (A.weight j : ℂ) * (A.input j).coefficients a b
/-- PDF pp.2–3: the unconditional photon budget of a block ensemble. -/
def ensembleEnergy {n L : ℕ} (A : PrivateEnsemble n L) : ℝ≥0∞ :=
∑ j : Fin L, ENNReal.ofReal (A.weight j) * totalEnergy (A.input j).coefficients
/-- PDF p.2, (6): chi(T;B)-chi(T;E), including mixed conditional inputs.
Finite average energy makes all positive-weight entropies finite; zero-weight
terms contribute zero. The two receivers use the same vacuum dilation. -/
def ensemblePrivateInformation {n L : ℕ} (A : PrivateEnsemble n L) (eta : ℝ) : ℝ :=
(spectralEntropyNats (pureLoss n eta (finiteFockEnsembleBarycenter A))).toReal -
(spectralEntropyNats ((charlieMarginal (broadcast n eta (finiteFockEnsembleBarycenter A))))).toReal -
∑ j : Fin L, A.weight j *
((spectralEntropyNats (pureLoss n eta (A.input j).coefficients)).toReal -
(spectralEntropyNats ((charlieMarginal (broadcast n eta (A.input j).coefficients)))).toReal)
/-- PDF pp.2–3, (6)–(11): n-letter private-information supremum over all
finite auxiliaries and arbitrary, possibly entangled, conditional input states.
No absent numerical auxiliary-cardinality bound is invented. The supremum
includes the finite-ensemble approximations used in the source's footnote 3. -/
def blockPrivateInformation (n : ℕ) (eta Nbar : ℝ) : EReal :=
sSup {r : EReal | ∃ L : ℕ, ∃ A : PrivateEnsemble n L,
ensembleEnergy A ≤ ENNReal.ofReal ((n : ℝ) * Nbar) ∧
r = (ensemblePrivateInformation A eta : EReal)}
/-- PDF p.3, (12): actual coherent information for the fixed vacuum dilation.
The finite-energy optimization guarantees both output entropies finite; this
finiteness is a theorem conclusion below, not an extra optimizing restriction. -/
def vacuumLossCoherentInformationNats {n : ℕ} (eta : ℝ) (X : FockKernel n) : ℝ :=
(spectralEntropyNats (pureLoss n eta X)).toReal -
(spectralEntropyNats ((charlieMarginal (broadcast n eta X)))).toReal
/-- PDF p.3, (12): unrestricted input optimization with the TOTAL photon budget.
EReal retains empty/unbounded supremum semantics; Gaussianity is not assumed.
The one-mode instance is Q^(1), not an operational quantum capacity. -/
def coherentInformationMaximum (n : ℕ) (eta Nbar : ℝ) : EReal :=
sSup {r : EReal | ∃ rho : State (NumberString n),
totalEnergy rho.coefficients ≤ ENNReal.ofReal ((n : ℝ) * Nbar) ∧
r = (vacuumLossCoherentInformationNats eta rho.coefficients : EReal)}
/-- PDF p.3: difference of the two Holevo informations for the printed isotropic
Gaussian coherent ensemble. Its average state is computed, not postulated.
The theorem asserts zero individual output entropies, so the integrals exist. -/
def gaussianPrivateInformation (eta Nbar : ℝ) : ℝ :=
vacuumLossCoherentInformationNats eta (coherentMixture Nbar) -
∫ alpha : ℂ, vacuumLossCoherentInformationNats eta (productCoherentKernel 1 (fun _ => alpha))
∂complexNormal Nbar 0
example (n : ℕ) : entropyPhotonNumber n ⊤ = ⊤ := by
simp [entropyPhotonNumber]
example (n : ℕ) : entropyPhotonNumber n 0 = 0 := by
simp [entropyPhotonNumber, entropyParameter, thermalEntropyInverse]
example : g 0 = 0 := by simp [g]
example : complexNormal 0 (0 : ℂ) = Measure.dirac 0 := by simp [complexNormal]
example {n L : ℕ} (A : PrivateEnsemble n L) : (∑ j, A.weight j) = 1 :=
A.weight_total
example {n M : ℕ} (C : BosonicPrivateCode n M) :
(∑' k, C.randomWeight k) = 1 := C.random_total
example (X : FockKernel 0) : totalEnergy X = 0 := by
simp [totalEnergy]
end QAlgorithms.Papers.Independent.Support50.P06
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P06.BosonicPrivateCode
For natural numbers , this structure consists of proofs that and , a sequence of real weights indexed by that is summable and satisfies , an encoded state matrix on for every and every , and decoder matrices on . Each encoded state admits an expansion with and , has for every finite and every , and has summable real diagonal with . Each satisfies the same finite-quadratic-form nonnegativity condition, and the decoder satisfies
Zero random weights are allowed, but encoded states are still supplied for every random index, including those with zero weight. No such structure exists when or .
QAlgorithms.Papers.Independent.Support50.P06.CenteredPureInput
For every natural number , including , and every square-summable complex function on , this defines the condition that, for every coordinate , the family
has sum , where agrees with except that its -th coordinate is . Having sum means that the net of sums over finite subsets of , ordered by inclusion, converges to . No unit-norm assumption is part of this condition. For , there are no coordinates to check, so the condition holds for every .
QAlgorithms.Papers.Independent.Support50.P06.CoherentPrivateCode
For natural numbers and a code , this proposition says that there exists a complex amplitude for every message , randomization index , and mode , such that, for every and every , its input coefficients satisfy
The code itself requires , nonnegative summable randomization weights totaling , and decoder kernels whose finite principal quadratic forms are real and nonnegative and whose sum is the identity kernel. Each input kernel also carries a countable expansion , with and , real nonnegative finite principal quadratic forms, and a summable real diagonal totaling . The displayed coherent representation is required even for randomization indices with zero weight; its amplitudes need not be unique.
QAlgorithms.Papers.Independent.Support50.P06.Decodes
For natural numbers , a code , and arbitrary real numbers , this proposition requires a strict decoding inequality for every message and every randomization index. A code requires , nonnegative summable weights totaling , input kernels on , and decoder kernels . Each input admits an expansion with and , has real nonnegative finite principal quadratic forms, and has a summable real diagonal totaling . Each decoder has real nonnegative finite principal quadratic forms, and . To express the vacuum mixing and first marginal explicitly, put
Then the required condition is
In particular, the condition includes indices with . There is no restriction here that or ; real square roots of negative numbers are zero, and a nonsummable complex series in these formulas has the total-sum value zero.
QAlgorithms.Papers.Independent.Support50.P06.EntropyPhotonNumberInequality
This defines the proposition that, for every positive natural number , every real , and every two state matrices on having finite entropies as defined below,
A state matrix here has an expansion with and , satisfies for every finite and every , and has summable real diagonal with . The output is defined entrywise by the nested sums
where all indices lie in , and
For any matrix , is the infimum of over summable sequences of total and vectors such that positive-weight vectors are unit vectors, distinct positive-weight vectors are orthogonal, and ; the infimum is if there are no such resolutions. Here , , and for finite , with for and otherwise the totalized real infimum of . Both endpoint values are included; is excluded. The input entropy assumptions are exactly ; no finiteness assumption on is included, and the inequality uses extended nonnegative arithmetic.
QAlgorithms.Papers.Independent.Support50.P06.EpniAt
For an arbitrary natural number , real number , and complex matrices indexed by , this defines the proposition
where , interpreted in , and
These are nested, totalized infinite sums, and
with
For any matrix , is the infimum, over all sequences and satisfying with summable weights, whenever , for distinct indices with positive weights, and , of ; if no such resolution exists, . Furthermore, , and for finite , , where for and otherwise is the totalized real infimum of . No density, normalization, or finiteness assumptions are imposed on , and need not lie in ; real square roots of negative arguments and real division by zero are . The case uses the singleton set and empty products equal to . All arithmetic in the displayed inequality is extended nonnegative arithmetic, including .
QAlgorithms.Papers.Independent.Support50.P06.MinimumOutputEntropyConjecture1
This defines the proposition that, for every positive natural number , real , and real ,
and, for every of norm satisfying the centering condition below,
Here , , is interpreted in , and
The centering condition requires, for every , that the family , indexed by all , has sum , with obtained by increasing coordinate by . The mixing operation is
where these are nested totalized sums over and , and
For any matrix , is the infimum of over summable nonnegative weights of total and vectors satisfying , with unit norm for every positive-weight vector and orthogonality between distinct positive-weight vectors; if no such resolution exists, the infimum is . The cases and are included, with and ; is excluded.
QAlgorithms.Papers.Independent.Support50.P06.PrivateEnsemble
For natural numbers , this structure consists of a requirement , real weights for satisfying and , and one state kernel indexed by for each . Each must admit a representation
every finite principal quadratic form of must be real and nonnegative, and the real diagonal must be summable with . Zero weights and repeated input states are permitted. There is no positivity requirement on , so , with its single empty number string, is included; is excluded.
QAlgorithms.Papers.Independent.Support50.P06.blockPrivateInformation
For a natural number and arbitrary real numbers , this defines an extended real number as the supremum of the following real values, embedded in :
The supremum ranges over every natural , every choice of nonnegative real weights totaling , and every collection of state kernels on satisfying
in , with . A state kernel has a countable expansion , where and , real nonnegative finite principal quadratic forms, and a summable real diagonal totaling . The kernels occurring in the objective are
For any kernel , define as the infimum in of over all representations , with nonnegative summable totaling , unit vectors at positive weights, and orthogonality between distinct positive-weight vectors. The function equals when finite and zero when , including when no representation exists; . Thus each candidate objective is real even without any entropy-finiteness hypothesis. The supremum can in general take extended real values, and the extended-real supremum of an empty set is . No range restrictions are placed on ; square roots of negative reals are zero and nonsummable complex series have total-sum value zero. The case is included, with an empty energy sum.
QAlgorithms.Papers.Independent.Support50.P06.coherentInformationMaximum
For a natural number and arbitrary real numbers , this defines an extended real number as the supremum of the real values
embedded in , over all state kernels on satisfying
in . Such a state kernel has a representation , where and , every finite principal quadratic form is real and nonnegative, and its real diagonal is summable with total . The marginal kernels are
For any kernel , let be the infimum in of over all representations , where are summable and total , positive-weight are unit vectors, and distinct positive-weight vectors are orthogonal. Then when finite and when , including when no representation exists; . No entropy-finiteness condition is added to the energy constraint, and the two entropy values are converted separately to real numbers before subtraction. No range restrictions are imposed on ; negative real square-root arguments give zero, nonsummable complex series have total-sum value zero, and is allowed with empty energy sum. The supremum is taken in the extended reals, whose empty-set supremum is .
QAlgorithms.Papers.Independent.Support50.P06.coherentMixture
For every real , this defines a complex matrix on by
If , then is the Dirac measure at ; otherwise it is complex-plane Lebesgue measure with density
The definition imposes no positivity assumption on and no integrability hypothesis: each entry uses the totalized complex integral. At , the matrix is precisely when , and otherwise. For , the clipped density vanishes everywhere, so the resulting matrix is zero.
QAlgorithms.Papers.Independent.Support50.P06.ensembleEnergy
For natural numbers and an ensemble , this defines its energy in by
The ensemble requires , nonnegative real weights totaling , and state kernels . Each state kernel admits an expansion , with and , has real nonnegative finite principal quadratic forms, and has a summable real diagonal totaling . The weights and the nonnegative parts in the formula are embedded in , where all sums and products are evaluated. Infinite energy is permitted, and a zero weight times infinite energy is zero. When , the sum over modes is empty and the energy is zero.
QAlgorithms.Papers.Independent.Support50.P06.ensemblePrivateInformation
For natural numbers , an ensemble , and an arbitrary real , this defines a real number
Here , , , and the inputs are kernels on . Each input admits an expansion with and , has real nonnegative finite principal quadratic forms, and has a summable real diagonal totaling . The two marginal kernels are given explicitly by
To define , take to be the infimum of over all coefficient representations , where are summable with total , has norm whenever , and distinct positive-weight vectors are orthogonal. Then is the real value of when finite, and is zero when ; in particular, a kernel with no such representation has , since its infimum is . The convention is . No finite-energy, finite-entropy, or range condition on is required. Negative real square-root arguments give zero, nonsummable complex series have total-sum value zero, zero ensemble weights are permitted, and is included with empty products equal to .
QAlgorithms.Papers.Independent.Support50.P06.entropyParameter
For every natural number , including , and every extended nonnegative real , this defines a real number by first putting , where for finite and for , and then setting
The infimum is the totalized real infimum, with value on the empty set. Real division by zero has value ; consequently this parameter is whenever , , or .
QAlgorithms.Papers.Independent.Support50.P06.entropyPhotonNumber
For every , including , and , this defines an extended nonnegative real number
Here the maximum is regarded as an element of , the real infimum is totalized with empty-set value , and division by zero is . Thus for every finite , whereas ; also for every .
QAlgorithms.Papers.Independent.Support50.P06.eveAverage
For natural numbers , a code as specified below, and any real , this defines the matrix
on , where exactly when , and otherwise . The beam factors are
The code contains , summable nonnegative real weights of total , encoded state matrices , and decoder matrices . Each state admits with and , has nonnegative real finite quadratic forms , and has summable real diagonal of sum . Each decoder matrix has nonnegative real finite quadratic forms, and . Thus the divisor is positive for every code admitted by the definition. There is no restriction on ; real square roots of negative arguments are , and the nested complex infinite sums are totalized, taking value for nonsummable families.
QAlgorithms.Papers.Independent.Support50.P06.eveMessage
For natural numbers , a code as specified below, any real , and any message , this defines a complex matrix on by
where the parentheses specify the nested sums, when and is otherwise,
The code supplies , summable real weights of total , state matrices , and decoder matrices . Each state has an expansion with square-summable vectors and , all its finite quadratic forms lie in , and its real diagonal is summable with sum . The decoder matrices have nonnegative finite quadratic forms and satisfy . The definition uses every random index, including zero-weight indices, imposes no restriction on , and uses totalized complex infinite sums, whose value is when the relevant family is not summable; real square roots of negative arguments are .
QAlgorithms.Papers.Independent.Support50.P06.finiteFockEnsembleBarycenter
For natural numbers and an ensemble , this defines a complex kernel on by the entrywise finite weighted sum
Here the ensemble requires , real weights totaling , and input kernels . Each input has a countable expansion , where and , every finite principal quadratic form is real and nonnegative, and the real diagonal is summable with sum . The real weights in the displayed formula are regarded as complex scalars. Zero weights and repeated inputs are allowed, and is allowed.
QAlgorithms.Papers.Independent.Support50.P06.gaussianPrivateInformation
For arbitrary real numbers and , this defines the real number
Here one-mode number strings are identified with natural numbers,
The measure is the point mass at ; for , has density with respect to planar Lebesgue measure, where , regarded as an extended nonnegative real. In particular, this definition also includes negative , for which this density is zero. The real-valued quantity is
where is the real conversion of the extended nonnegative number , with converted to . To define the two output kernels, set if and otherwise, and set
The square roots here are the real square-root function, including its value on negative arguments. Finally, is the infimum of
over all sequences and such that is summable with sum , every with has norm , vectors with distinct positive-weight indices are orthogonal, and for every . Zero-weight vectors have no normalization or orthogonality requirement; an empty collection of such resolutions gives . The definition imposes no positivity, density, summability, or integrability hypotheses on its arguments; complex and real infinite sums and integrals retain their totalized meanings, including value for a nonsummable complex or real series or a nonintegrable Bochner integrand.
QAlgorithms.Papers.Independent.Support50.P06.holevoMessagePrivacyCapacityNats
For a natural width , arbitrary real numbers , and a Boolean defaulting to false, this defines an element of as the supremum of all nonnegative real rates satisfying the following condition. For every real and , there is a positive integer such that every natural admits positive integers and , nonnegative summable randomization weights totaling , input kernels on , and decoder kernels . Each input has a countable representation , with and , real nonnegative finite principal quadratic forms, and a summable real diagonal totaling . The decoders have real nonnegative finite principal quadratic forms and satisfy . Define
Let be the infimum in of over representations , where are summable and total , positive-weight are unit vectors, and distinct positive-weight vectors are orthogonal; this infimum is when no representation exists, and . With and , the code must satisfy
If is true, the inputs must also have, for some complex amplitudes , the coefficients
All energy and entropy arithmetic is in , with truncated subtraction , , and ; kernel sums are entrywise, and nonsummable complex series have total-sum value zero. Decoding includes every randomization index regardless of its weight. There is no restriction on , and negative real square-root arguments give zero. The supremum can be infinite; the supremum of an empty set is zero. In particular, at width zero no qualifying code exists, so the defined capacity is zero.
QAlgorithms.Papers.Independent.Support50.P06.messageLeakage
For natural numbers , a code as specified below, and any real , this defines the extended nonnegative number
where subtraction is truncated subtraction in , so negative finite differences become and . For , the message matrices are defined entrywise by the nested sums
with , , exactly when , and
For any matrix , is the infimum of over summable weights of total and vectors satisfying , unit norm whenever , and orthogonality between distinct positive-weight vectors; an empty collection of such resolutions gives , and . The code contains , summable real random weights of total , encoded state matrices , and decoder matrices . Each encoded state admits an expansion with square-summable vectors and , has nonnegative real finite quadratic forms , and has summable real diagonal of sum ; the decoder matrices have nonnegative real finite quadratic forms and satisfy . No entropy-finiteness or range restriction on is imposed. The complex infinite sums are totalized with value for nonsummable families, real square roots of negative arguments are , and all entropy averaging and subtraction use extended nonnegative arithmetic.
QAlgorithms.Papers.Independent.Support50.P06.privateAchievable
For a natural number , arbitrary real numbers , and a Boolean , this proposition requires and the following: for every real and every real , there is a positive integer such that for every natural , there exist a positive integer and a code with modes satisfying the conditions below. Write . The code has nonnegative summable weights totaling , inputs for and , and decoder kernels . Each input has a representation , with and , real nonnegative finite principal quadratic forms, and a summable real diagonal totaling ; each decoder has real nonnegative finite principal quadratic forms, and . Define its two vacuum-mixing marginals by
For any kernel , let be the infimum of over all representations , where the nonnegative real form a summable series totaling , the vectors have norm whenever , and distinct positive-weight vectors are orthogonal; the infimum is if no such representation exists, and . Put
with the kernel sums interpreted entrywise. The required inequalities are
Here energies, entropy sums, and the first inequality are in ; is truncated extended-nonnegative subtraction, including , and . If is true, there must additionally exist amplitudes such that
for every ; if the Boolean is false this adds no requirement. Decoding is required even at zero-weight randomization indices, the rate denominator is , and no range restriction is imposed on or . Real square roots of negative numbers are zero, and nonsummable complex series have total-sum value zero. In particular, makes this proposition impossible because the code requires a positive number of modes.
QAlgorithms.Papers.Independent.Support50.P06.randomizedPrivateCodePhotonBudget
For natural numbers and a code , this defines its photon budget as an element of . Such a code requires and , nonnegative real randomization weights with a summable series and , an input kernel for each and , and decoder kernels . The kernels are indexed by . Each input has a representation , where and ; every finite principal quadratic form of is real and nonnegative; and its real diagonal is summable with sum . Every finite principal quadratic form of each is real and nonnegative, and . The budget is
where all sums and products in this expression are taken in . Thus the budget can be infinite, and a zero randomization weight contributes zero even when the corresponding input energy is infinite.
QAlgorithms.Papers.Independent.Support50.P06.totalEnergy
For every natural number , including , and every complex matrix indexed by , this defines
The inner sum is an extended nonnegative infinite sum and may be infinite. No positivity, trace, normalization, or summability condition on is required; negative diagonal contributions are clipped to zero individually. For , the outer sum is empty, so .
QAlgorithms.Papers.Independent.Support50.P06.vacuumLossCoherentInformationNats
For a natural number , an arbitrary real , and any complex kernel on , this defines the real number
The two kernels are explicitly
For a kernel , is the infimum of over representations , where the nonnegative real are summable and total , has norm whenever , and distinct positive-weight vectors are orthogonal. Set when finite and when ; a kernel with no such representation has , and . Each entropy is converted separately to a real number before subtraction. No density, energy, entropy-finiteness, or summability hypothesis on is imposed, and need not lie in . Negative real square-root arguments give zero and nonsummable complex series have total-sum value zero. The case is included, with empty products equal to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.