Definitions for An Infinite Sequence of Additive Channels: the Classical Capacity of Cloning Channels
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P49The objects the formalized statements of An Infinite Sequence of Additive Channels: the Classical Capacity of Cloning Channels (arXiv:0903.1638) are stated in. Each was checked against the paper by a blind read-back and a moderator.
cloner: PDF p.3, Eqs.(9)--(11): all k+1 clones in their (k+2)-dimensional symmetric space, from the accepted occupation-basis dilation.clonerComplement: PDF p.3, Eq.(11): the actual complement of the same dilation, with environment dimension k+1, including the trace-map case k=0.StrongHolevoAdditive: PDF pp.1--2: additivity against every auxiliary finite-dimensional CPTP channel, with arbitrary entangled inputs included by the matrix-unit tensor map.WeakHolevoAdditive: PDF pp.1,5, Eqs.(18),(19): every positive identical tensor power; this predicate asserts CPTP as well as the stated Holevo equality.classicalCapacityBits: PDF p.1: classical capacity defined by regularization, independently of Eq.(16). All finite ensembles and entangled block inputs enter holevoCapacity.transposeOutput: PDF pp.4--5: the complex-linear extension of conjugation on Hermitian outputs is transpose, not the conjugate-linear operation on arbitrary operators.clonerDelta: PDF p.4, Eq.(16): Delta_ell with ell=k+2; its denominator is positive.clonerLogSum: PDF p.4, Eq.(16): the finite k log2 k sum, including the zero term.depolarizedCloner: PDF p.4, Fig.2 and Section III-A: lambda=(ell-1)/(ell+1). The accepted depolarizing map takes NOISE probability 1-lambda=2/(k+3).entropyHolevoValues: PDF pp.1,5: possible Holevo values from a specified output-entropy functional. Ensembles are finite, normalized, positive, and otherwise unrestricted.unruhAuxBlock: PDF p.5, Theorem 2: one exact subnormalized block of U_z^tensor n tensor T. Sector labels run over all Nat^n; coherences of the joint input are retained. Together these blocks specify the full countable direct-sum output.unruhAuxEntropy: PDF p.5: entropy of the full countable output, including flag entropy. Blocks are subnormalized, so no additional Shannon term is added. Summability for every normalized joint input is a conclusion of unruh_strongAdditivity.unruhHolevo: PDF pp.1,5: unrestricted finite-ensemble Holevo capacity of the exact n-use countable-output channel, before any single-letter identity is asserted.unruhAuxHolevo: PDF pp.1,5: unrestricted Holevo optimization on U_z^tensor n tensor T.unruhClassicalRates: PDF p.1: all positive regularized block rates of the full Unruh channel.unruhClassicalCapacity: PDF pp.1,5: regularized classical capacity; it is not defined by Eq.(23).UnruhRegular: PDF pp.2,5: analytic well-definedness of the exact infinite output. These conditions are conclusions, never assumptions replacing capacity content. The finite ensembles and all finite auxiliary references include mixed inputs entangled across every channel use.unruhFirstTerm: PDF p.5, Eq.(23): first infinite series, ell=k+2.unruhSecondTerm: PDF p.5, Eq.(23): second infinite series with its own p_ell/Delta_ell.highestCoupling: PDF pp.5--6, Eqs.(24)--(26): normalized occupation coefficient of Sym^(2k+1)(C^2) inside Sym^k(C^2) tensor Sym^(k+1)(C^2), with the ordinary SU(2) tensor action. This fixes the highest irrep, including its phases.highestProjector: PDF p.6: orthogonal highest-irrep projector, output factor first. Its irrep dimension is 2k+2, not the full (k+1)(k+2) tensor dimension.degradingChoi: PDF p.6: unnormalized Choi ansatz. Trace preservation forces the coefficient (k+2)/(2k+2)=ell/(2ell-2).highestDegradingMap: PDF p.6: Choi reconstruction Tr_in[(I tensor X^T)R], output first. There is no normalized-Choi dimension factor or extra input conjugation.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_QuditChannelFidelities
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P45
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P62
/-!
Bradler, arXiv:0903.1638v7. All page numbers are PDF pages; all entropies are bits.
The parameter k = ell - 2 ranges over Nat, so ell >= 2 holds without truncated
subtraction. The full Unruh output retains every countable sector. Lemma 3 is
explicitly deferred in HARD.md. Compilation is pending the batch handoff.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P49
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
open QAlgorithms.Papers.Independent.Support50.P01
(unruhSectorDilation unruhWeight unruhBlockDilation unruhBlockWeight
unruhReceiver unruhReceiverEntropy)
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel IsDegradable)
open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.QuditFidelity (depolarizingMap)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.3, Eqs.(9)--(11): all k+1 clones in their (k+2)-dimensional
symmetric space, from the accepted occupation-basis dilation. -/
def cloner (k : ℕ) : Superop (Fin 2) (Fin (k+2)) :=
receiverChannel (unruhSectorDilation k)
/-- PDF p.3, Eq.(11): the actual complement of the same dilation,
with environment dimension k+1, including the trace-map case k=0. -/
def clonerComplement (k : ℕ) : Superop (Fin 2) (Fin (k+1)) :=
complementaryChannel (unruhSectorDilation k)
/-- PDF pp.1--2: additivity against every auxiliary finite-dimensional CPTP
channel, with arbitrary entangled inputs included by the matrix-unit tensor map. -/
def StrongHolevoAdditive {I O : Type} [Fintype I] [Fintype O]
[DecidableEq I] [DecidableEq O] (N : Superop I O) : Prop :=
IsChannel N ∧ ∀ a b : ℕ, 0 < a → 0 < b →
∀ T : Superop (Fin a) (Fin b), IsChannel T →
holevoCapacity (tensorChannel N T) = holevoCapacity N + holevoCapacity T
/-- PDF pp.1,5, Eqs.(18),(19): every positive identical tensor power;
this predicate asserts CPTP as well as the stated Holevo equality. -/
def WeakHolevoAdditive {I O : Type} [Fintype I] [Fintype O]
[DecidableEq I] [DecidableEq O] (N : Superop I O) : Prop :=
IsChannel N ∧ ∀ n : ℕ, 1 ≤ n →
holevoCapacity (piSuperop (fun _ : Fin n => N)) = (n : ℝ) * holevoCapacity N
/-- PDF p.1: classical capacity defined by regularization, independently of
Eq.(16). All finite ensembles and entangled block inputs enter holevoCapacity. -/
def classicalCapacityBits {I O : Type} [Fintype I] [Fintype O]
[DecidableEq I] [DecidableEq O] (N : Superop I O) : ℝ :=
sSup (Set.range (fun m : ℕ =>
holevoCapacity (piSuperop (fun _ : Fin (m+1) => N)) / (m+1 : ℝ)))
/-- PDF pp.4--5: the complex-linear extension of conjugation on Hermitian
outputs is transpose, not the conjugate-linear operation on arbitrary operators. -/
def transposeOutput {I O : Type} (N : Superop I O) : Superop I O :=
fun X => (N X)ᵀ
/-- PDF p.4, Eq.(16): Delta_ell with ell=k+2; its denominator is positive. -/
def clonerDelta (k : ℕ) : ℝ := (k+2 : ℝ) * (k+1 : ℝ) / 2
/-- PDF p.4, Eq.(16): the finite k log2 k sum, including the zero term. -/
def clonerLogSum (k : ℕ) : ℝ :=
∑ j ∈ Finset.range (k+2), (j : ℝ) * Real.logb 2 j
/-- PDF p.4, Fig.2 and Section III-A: lambda=(ell-1)/(ell+1).
The accepted depolarizing map takes NOISE probability 1-lambda=2/(k+3). -/
def depolarizedCloner (k : ℕ) : Superop (Fin 2) (Fin (k+2)) :=
depolarizingMap (k+2) (by omega) (2 / (k+3 : ℝ)) ∘ cloner k
/-- PDF pp.1,5: possible Holevo values from a specified output-entropy
functional. Ensembles are finite, normalized, positive, and otherwise unrestricted. -/
def entropyHolevoValues {I : Type} [Fintype I] [DecidableEq I]
(H : Matrix I I ℂ → ℝ) : Set ℝ :=
{v | ∃ (m : ℕ) (q : Fin m → ℝ) (rho : Fin m → Matrix I I ℂ),
(∀ j, 0 ≤ q j) ∧ (∑ j, q j) = 1 ∧ (∀ j, IsDensityMatrix (rho j)) ∧
v = H (∑ j, (q j : ℂ) • rho j) - ∑ j, q j * H (rho j)}
/-- PDF p.5, Theorem 2: one exact subnormalized block of U_z^tensor n tensor T.
Sector labels run over all Nat^n; coherences of the joint input are retained.
Together these blocks specify the full countable direct-sum output. -/
def unruhAuxBlock {n a b : ℕ} (z : ℝ) (ks : Fin n → ℕ)
(T : Superop (Fin a) (Fin b)) :
Superop ((Fin n → Fin 2) × Fin a) (((i : Fin n) → Fin (ks i+2)) × Fin b) :=
fun X => (unruhBlockWeight z ks : ℂ) •
tensorChannel (receiverChannel (unruhBlockDilation ks)) T X
/-- PDF p.5: entropy of the full countable output, including flag entropy.
Blocks are subnormalized, so no additional Shannon term is added. Summability
for every normalized joint input is a conclusion of unruh_strongAdditivity. -/
def unruhAuxEntropy {a b : ℕ} (z : ℝ) (n : ℕ)
(T : Superop (Fin a) (Fin b))
(rho : Matrix ((Fin n → Fin 2) × Fin a) ((Fin n → Fin 2) × Fin a) ℂ) : ℝ :=
∑' ks : Fin n → ℕ, vnEntropy (unruhAuxBlock z ks T rho)
/-- PDF pp.1,5: unrestricted finite-ensemble Holevo capacity of the exact
n-use countable-output channel, before any single-letter identity is asserted. -/
def unruhHolevo (z : ℝ) (n : ℕ) : ℝ :=
sSup (entropyHolevoValues (unruhReceiverEntropy (n := n) z))
/-- PDF pp.1,5: unrestricted Holevo optimization on U_z^tensor n tensor T. -/
def unruhAuxHolevo {a b : ℕ} (z : ℝ) (n : ℕ)
(T : Superop (Fin a) (Fin b)) : ℝ :=
sSup (entropyHolevoValues (unruhAuxEntropy z n T))
/-- PDF p.1: all positive regularized block rates of the full Unruh channel. -/
def unruhClassicalRates (z : ℝ) : Set ℝ :=
Set.range (fun m : ℕ => unruhHolevo z (m+1) / (m+1 : ℝ))
/-- PDF pp.1,5: regularized classical capacity; it is not defined by Eq.(23). -/
def unruhClassicalCapacity (z : ℝ) : ℝ := sSup (unruhClassicalRates z)
/-- PDF pp.2,5: analytic well-definedness of the exact infinite output.
These conditions are conclusions, never assumptions replacing capacity content.
The finite ensembles and all finite auxiliary references include mixed inputs
entangled across every channel use. -/
def UnruhRegular (z : ℝ) : Prop :=
(∀ k, 0 ≤ unruhWeight z k) ∧ HasSum (unruhWeight z) 1 ∧
(∀ n : ℕ, 1 ≤ n →
(∀ rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ,
IsDensityMatrix rho → Summable (fun ks : Fin n → ℕ =>
vnEntropy (QAlgorithms.Papers.Independent.Support50.P01.unruhReceiverBlock z ks rho))) ∧
(entropyHolevoValues (unruhReceiverEntropy (n := n) z)).Nonempty ∧
BddAbove (entropyHolevoValues (unruhReceiverEntropy (n := n) z))) ∧
BddAbove (unruhClassicalRates z) ∧
(∀ a b : ℕ, 0 < a → 0 < b → ∀ T : Superop (Fin a) (Fin b), IsChannel T →
∀ n : ℕ, 1 ≤ n →
(∀ rho : Matrix ((Fin n → Fin 2) × Fin a) ((Fin n → Fin 2) × Fin a) ℂ,
IsDensityMatrix rho → Summable (fun ks : Fin n → ℕ =>
vnEntropy (unruhAuxBlock z ks T rho))) ∧
(entropyHolevoValues (unruhAuxEntropy z n T)).Nonempty ∧
BddAbove (entropyHolevoValues (unruhAuxEntropy z n T)))
/-- PDF p.5, Eq.(23): first infinite series, ell=k+2. -/
def unruhFirstTerm (z : ℝ) (k : ℕ) : ℝ :=
unruhWeight z k * Real.logb 2 (k+1 : ℝ)
/-- PDF p.5, Eq.(23): second infinite series with its own p_ell/Delta_ell. -/
def unruhSecondTerm (z : ℝ) (k : ℕ) : ℝ :=
unruhWeight z k / clonerDelta k * clonerLogSum k
/-- PDF pp.5--6, Eqs.(24)--(26): normalized occupation coefficient of
Sym^(2k+1)(C^2) inside Sym^k(C^2) tensor Sym^(k+1)(C^2), with the ordinary
SU(2) tensor action. This fixes the highest irrep, including its phases. -/
def highestCoupling (k : ℕ) (a : Fin (k+1)) (i : Fin (k+2)) : ℝ :=
Real.sqrt (((Nat.choose k a.val : ℝ) * Nat.choose (k+1) i.val) /
(Nat.choose (2*k+1) (a.val+i.val) : ℝ))
/-- PDF p.6: orthogonal highest-irrep projector, output factor first.
Its irrep dimension is 2k+2, not the full (k+1)(k+2) tensor dimension. -/
def highestProjector (k : ℕ) :
Matrix (Fin (k+1) × Fin (k+2)) (Fin (k+1) × Fin (k+2)) ℂ :=
fun ai bj => if ai.1.val + ai.2.val = bj.1.val + bj.2.val then
((highestCoupling k ai.1 ai.2 * highestCoupling k bj.1 bj.2 : ℝ) : ℂ) else 0
/-- PDF p.6: unnormalized Choi ansatz. Trace preservation forces the
coefficient (k+2)/(2k+2)=ell/(2ell-2). -/
def degradingChoi (k : ℕ) :
Matrix (Fin (k+1) × Fin (k+2)) (Fin (k+1) × Fin (k+2)) ℂ :=
(((k+2 : ℝ) / (2*k+2 : ℝ) : ℝ) : ℂ) • highestProjector k
/-- PDF p.6: Choi reconstruction Tr_in[(I tensor X^T)R], output first.
There is no normalized-Choi dimension factor or extra input conjugation. -/
def highestDegradingMap (k : ℕ) : Superop (Fin (k+2)) (Fin (k+1)) :=
fun X a b => ∑ i, ∑ j, X i j * degradingChoi k (a,i) (b,j)
/-- The complement and receiver are tied to exactly one dilation. -/
example : cloner 0 = receiverChannel (unruhSectorDilation 0) ∧
clonerComplement 0 = complementaryChannel (unruhSectorDilation 0) := ⟨rfl, rfl⟩
/-- Positive regularization lengths include one use. -/
example {I O : Type} [Fintype I] [Fintype O] [DecidableEq I] [DecidableEq O]
(N : Superop I O) :
holevoCapacity (piSuperop (fun _ : Fin 1 => N)) / (1 : ℝ) ∈ Set.range (fun m : ℕ =>
holevoCapacity (piSuperop (fun _ : Fin (m+1) => N)) / (m+1 : ℝ)) := by
refine ⟨0, ?_⟩
simp
/-- Transposing twice restores every operator, not just the Hermitian ones. -/
example {I O : Type} (N : Superop I O) : transposeOutput (transposeOutput N) = N := rfl
/-- Identity-sector normalization and zero-log-zero convention in Eq.(16). -/
example : clonerDelta 0 = 1 ∧ (0 : ℝ) * Real.logb 2 0 = 0 := by
norm_num [clonerDelta]
/-- Normalized singleton ensembles give zero Holevo information for any H. -/
example {I : Type} [Fintype I] [DecidableEq I] (H : Matrix I I ℂ → ℝ)
(rho : Matrix I I ℂ) (hrho : IsDensityMatrix rho) :
0 ∈ entropyHolevoValues H := by
refine ⟨1, (fun _ => 1), (fun _ => rho), ?_, ?_, ?_, ?_⟩
· intro j; norm_num
· simp
· intro j; exact hrho
· simp
/-- At zero acceleration only the identity sector survives. -/
example : unruhWeight 0 0 = 1 ∧ unruhWeight 0 1 = 0 := by
norm_num [unruhWeight]
/-- Highest-weight phase and the trace-map Choi normalization at ell=2. -/
example : highestCoupling 1 0 0 = 1 ∧ degradingChoi 0 (0,0) (0,0) = 1 := by
norm_num [highestCoupling, degradingChoi, highestProjector]
end QAlgorithms.Papers.Independent.Intakenext100.P49
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P49.StrongHolevoAdditive
For finite types , each equipped with decidable equality, and an arbitrary function from complex matrices indexed by to complex matrices indexed by , this predicate means that has a finite Kraus representation and that its Holevo quantity is additive with every channel having positive finite input and output dimensions. Explicitly, there must exist a natural number and matrices , , such that and for every ; and for every pair of natural numbers and every function admitting such a Kraus representation, one must have
Here, for a map with input index set ,
where , with evaluated by continuous functional calculus. The tensor map is defined on every matrix indexed by through
with denoting a matrix unit. The types are allowed to be empty, subject to the stated Kraus requirement; zero ensemble weights are allowed, while cannot satisfy .
QAlgorithms.Papers.Independent.Intakenext100.P49.UnruhRegular
For a real number , this predicate is the conjunction of the following requirements, with the notation specified here. Set
The input index of is , its output indices satisfy , , and its entries are products of factors that vanish unless ; when equality holds, the factor is for , and for . Let , using continuous functional calculus, and . For any function on matrices on a finite index set, let
The requirements are: for every , and the series converges with sum ; for every integer and every positive semidefinite trace-one on , the family is summable, and is nonempty and bounded above; the set is bounded above; and, for every pair of positive natural numbers , every function from to complex matrices admitting finitely many Kraus matrices with and for every , and every , the following auxiliary conditions hold. Define
where denotes a matrix unit. For every positive semidefinite trace-one on , the family must be summable, and must be nonempty and bounded above. The predicate states no additional restriction on ; its block conditions concern only , and its auxiliary conditions concern only positive .
QAlgorithms.Papers.Independent.Intakenext100.P49.WeakHolevoAdditive
For finite types with decidable equality and a function , this predicate requires a finite Kraus representation , valid for every , with , and requires
The map , from matrices indexed by to matrices indexed by , is defined by
For any map , is the real supremum, over all finite ensembles with , , , and positive semidefinite input matrices of trace , of
where , with evaluated by continuous functional calculus. No condition at is imposed. Empty are included subject to the Kraus requirement; ensemble weights may vanish, but an empty ensemble cannot have total weight .
QAlgorithms.Papers.Independent.Intakenext100.P49.classicalCapacityBits
For finite types with decidable equality and any function , this defines the real number
Here are -tuples from , are -tuples from , and is a matrix unit. The quantity is the real supremum over all natural numbers , nonnegative real weights summing to , and positive semidefinite input matrices of trace , of
where , with evaluated by continuous functional calculus. No assumption that is linear, positive, or a channel is made, and may be empty. All logarithms and functional-calculus expressions use their total definitions; in particular the real logarithm at is . These are suprema in , whose total supremum operation returns for an empty set or a set unbounded above. Only positive block lengths occur, so the displayed division never uses a zero denominator.
QAlgorithms.Papers.Independent.Intakenext100.P49.cloner
For every natural number , this defines a function from complex matrices to complex matrices by
where and
The square roots are real numbers regarded as complex numbers. The input is unrestricted; no positivity or normalization is required. The definition includes , for which .
QAlgorithms.Papers.Independent.Intakenext100.P49.clonerComplement
For every natural number , this defines a function from complex matrices to complex matrices by
where and
The square roots are real numbers regarded as complex numbers, and need not be positive or normalized. When , the output is the matrix whose sole entry is .
QAlgorithms.Papers.Independent.Intakenext100.P49.clonerDelta
For every natural number , this defines the real number
with the factors interpreted in . The definition includes , giving .
QAlgorithms.Papers.Independent.Intakenext100.P49.clonerLogSum
For every natural number , this defines the real number
The term is included and is , using the total real logarithm convention ; the term is also . Thus the value at is .
QAlgorithms.Papers.Independent.Intakenext100.P49.degradingChoi
For every natural number , this defines a complex matrix indexed by , with and , by
The entries are real numbers embedded in , and every denominator is positive. The definition includes , when it gives the identity; it asserts no channel or Choi normalization property.
QAlgorithms.Papers.Independent.Intakenext100.P49.depolarizedCloner
For every natural number , this defines a function from complex matrices to complex matrices by first forming
and then returning
where
All real coefficients are regarded as complex scalars, and need not be positive or normalized. The definition includes , when its value is ; all displayed denominators are positive for every permitted .
QAlgorithms.Papers.Independent.Intakenext100.P49.entropyHolevoValues
For a finite type with decidable equality and any real-valued function on complex matrices indexed by , this defines the set of all real numbers for which there exist a natural number , real weights , and matrices satisfying
and
No entropy, continuity, or other property of is assumed. Zero weights are allowed, but their associated matrices must still satisfy the density-matrix conditions. Although is quantified over, it cannot satisfy the total-weight equation. The type may be empty, in which case no trace-one matrix exists and the defined set is empty.
QAlgorithms.Papers.Independent.Intakenext100.P49.highestCoupling
For every natural number , every integer with , and every integer with , this defines the nonnegative real number
The index bounds ensure , so the denominator is positive. The case is included: , and the value is for both and .
QAlgorithms.Papers.Independent.Intakenext100.P49.highestDegradingMap
For every natural number , this defines a function from complex matrices to complex matrices by
The coefficients are embedded in , and all denominators are positive. No assumption is made on , and the declaration asserts no channel property. For , the output is the matrix with entry .
QAlgorithms.Papers.Independent.Intakenext100.P49.highestProjector
For every natural number , this defines a complex matrix indexed by pairs with and , whose entries are
The displayed real values are regarded as complex numbers. All binomial denominators are positive under the index bounds. This declaration defines the entries without asserting any projector property; at , the matrix is the identity.
QAlgorithms.Papers.Independent.Intakenext100.P49.transposeOutput
For arbitrary types and any function , this defines the function sending every input matrix to the transpose of :
No complex conjugation is applied, and no finiteness, decidable equality, linearity, positivity, or channel assumption is required. Empty index types are included.
QAlgorithms.Papers.Independent.Intakenext100.P49.unruhAuxBlock
For arbitrary natural numbers , a real number , a tuple of natural numbers, and any function , this defines a function from matrices indexed by , where , to matrices indexed by , where , through
where , is a matrix unit, and
with
No restriction on , channel or linearity assumption on , or positivity or normalization assumption on is imposed. Zero dimensions are allowed. At , all tuple sets above are singletons and both empty products equal .
QAlgorithms.Papers.Independent.Intakenext100.P49.unruhAuxEntropy
For arbitrary natural numbers , a real number , any function , and any complex matrix indexed by , this defines
where is evaluated by continuous functional calculus and
Here , , is a matrix unit,
and is when , while is when ; all other entries are . Neither nor is required to satisfy positivity, normalization, or channel conditions, and is unrestricted. The sum is the total real infinite-sum operation, which equals if the summand family is not summable. The definition includes zero dimensions and ; for , there is one empty tuple , and all empty products equal .
QAlgorithms.Papers.Independent.Intakenext100.P49.unruhAuxHolevo
For arbitrary natural numbers , real , and function from complex matrices to complex matrices, this defines
where the are indexed by . To specify , put , , and , where , , , and
Let . With denoting a matrix unit, define the auxiliary block by
where , using continuous functional calculus. No channel, linearity, positivity, or continuity assumption on is required, and zero dimensions and are included. Empty normalized ensembles do not exist; nonsummable real sums and empty or unbounded-above real suprema take the total-operation value .
QAlgorithms.Papers.Independent.Intakenext100.P49.unruhClassicalCapacity
For every real , this defines the real supremum
where is indexed by , and
Here uses continuous functional calculus, and is the product over of the following entries: for , , , the entry is zero unless , and otherwise equals when , or when . The partial trace sums over the indices. No hypothesis restricts or ensures convergence or boundedness. Nonsummable real sums and empty or unbounded-above real suprema have value ; the outer set is nonempty because it contains the value for .
QAlgorithms.Papers.Independent.Intakenext100.P49.unruhClassicalRates
For every real , this defines the set
Here is the real supremum, over all finite ensembles of positive semidefinite trace-one matrices on with real weights and , of
The function used here is
where uses continuous functional calculus. The entries of are products of entries , for , , : this entry is zero unless , and otherwise is for , or for ; traces out the indices. Thus only positive block lengths occur and every displayed division by has nonzero denominator. There is no restriction on or convergence: nonsummable real sums are assigned , and an empty or unbounded-above set has real supremum .
QAlgorithms.Papers.Independent.Intakenext100.P49.unruhFirstTerm
For every real and natural number , this defines
There are no restrictions on . The logarithm has positive argument for every permitted , and the value at is .
QAlgorithms.Papers.Independent.Intakenext100.P49.unruhHolevo
For every real and natural number , this defines the real number
where each is a complex matrix indexed by , and
Here , with applied by continuous functional calculus; sums over equal environment indices. The matrix has input , receiver index , and environment index , with entry
No restriction on , convergence, or boundedness is imposed. The infinite sum is the total real summation operation, which is zero for a nonsummable family; the real supremum is zero for an empty or unbounded-above set. The definition includes , with singleton empty-tuple registers and empty products equal to . An ensemble of size cannot satisfy .
QAlgorithms.Papers.Independent.Intakenext100.P49.unruhSecondTerm
For every real and natural number , this defines
The denominator is positive for every , and no restriction on is imposed. The term uses the total real logarithm convention , so that term is ; at , the entire expression is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.