Definitions for One-Shot Classical-Quantum Capacity and Hypothesis Testing
DefinitionQAlgorithms_Papers_Independent_Support50_P20The objects the formalized statements of One-Shot Classical-Quantum Capacity and Hypothesis Testing (arXiv:1007.5456) are stated in. Each was checked against the paper by a blind read-back and a moderator.
IsBinaryEffect: PDF p.2, (1): a bounded binary effect; singular effects are allowed.Effect: PDF p.2: all bounded binary effects on the output space.traceAcceptance: PDF p.2, (1): the actual trace pairing Tr(Q rho). The product of a bounded operator with a trace-class operator is trace class, so the basis trace converges.negativeLogTwo: PDF p.2, (1): extended negative logarithm, including -log2(0)=+infinity. The infinity branch is included for totality; testing beta is finite on states at the error parameters used by the statements.hilbertTestingBeta: PDF p.2, (1): infimum of type-II acceptance over all feasible bounded tests. The extended infimum of an empty set is infinity. For states and epsilon>=0, I is feasible and every objective lies in [0,1].hilbertTestingDivergence: PDF p.2, (1): unnormalized hypothesis-testing divergence in bits.closedSupportProjector: PDF p.2: support of a positive operator is the orthogonal complement of its kernel, a closed subspace. The projection is not an inverse or matrix power.orderZeroDivergence: PDF p.2: order-zero Renyi divergence with the actual closed-support projector.traceClassRelativeEntropyBits: PDF p.2, (2): Umegaki relative entropy in bits. The accepted extended finite-compression formula includes the trace correction on subnormalized compressions and infinity on support failure. No entropy-finiteness premise.PositiveHilbertBlock: PDF p.2, DPI: positivity of an actual finite operator block matrix.IsHilbertCPTP: PDF p.2, DPI and its proof: physical preprocessing means complex linear, trace-preserving and completely positive on trace class. All finite matrix amplifications are required, with no Kraus-rank bound. Off-domain values are unused. Printed: CPM. Convention: CPTP, as required by the proof's measurement pullback.ClassicalInputChannel: PDF pp.1–2: an arbitrary cq channel on a nonempty input set (the Nonempty instance is imposed by each capacity statement). Its outputs are actual densities.cqJointAcceptance: PDF p.2, Theorem 1: Tr(Q piAB), computed from the diagonal classical blocks Q_x = (<x| tensor I) Q (|x> tensor I). Every family of effects has a direct-sum realization, and the omitted off-diagonal blocks never affect either cq trace.cqProductAcceptance: PDF p.2, Theorem 1: Tr(Q (piA tensor piB)), with actual marginals piA=diag(P), piB=sum_y P(y)rho_y. Both sums converge absolutely: the trace pairings are in [0,1] and the PMF weights sum to one.cqTestingBeta: PDF p.2, (1),(3): type-II optimization for the cq pair in its exact diagonal-block representation. No finite-support restriction on P is imposed.cqTestingInformation: PDF p.2, (3): hypothesis-testing information of the constructed cq pair.optimizedTestingInformation: PDF p.2, (3): supremum over all discrete input distributions; extended suprema preserve unbounded channel information.ClassicalMessageCode: PDF p.2: an actual m-message code. Repeated codewords and zero POVM elements are allowed. Completeness holds on the entire output space.uniformDecodingError: PDF p.2: average error with uniformly distributed messages.finiteMessageRate: PDF p.2: rate is log2(m) for a positive integer message count.oneUseCodeCapacity: PDF p.2, Theorem 1: operational one-shot capacity, defined independently from testing information. An unbounded channel has capacity +infinity.BlockHilbert: PDF p.4, (10): B tensor (n+1) in completed Hilbert coordinates. The zero sequence index denotes one channel use; every rate denominator is positive.blockBasis: PDF p.4: canonical orthonormal tensor-product basis of the output block.vanishingErrorCapacity: PDF p.4, (10): independent operational capacity from actual sequences of codes with error tending to zero and their lower limiting rates. There is no compatibility, causality, stationarity or product-input assumption on W.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Information
import Definitions.Def_QAlgorithms_Defs_RealLabelRegisters
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P13
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P63
/-!
# One-shot classical-quantum capacity and hypothesis testing
Wang and Renner, arXiv:1007.5456v3. Page references are PDF pages.
All output Hilbert spaces may be infinite dimensional and nonseparable.
The accepted State, nuclear trace-class, base-two logarithm, and extended
relative-entropy definitions are reused without changing their bodies. Local
operator/code interfaces have distinct names because the same-name frozen
interfaces have different types or operational tasks (see ASSESSMENT.json).
The cq pair is represented by its exact
trace contractions against diagonal test blocks: off-diagonal classical blocks
contribute to neither acceptance probability, and every family of effects is
realized by a bounded direct-sum effect. Thus this representation optimizes all
binary tests, without restricting the alphabet or the distribution support.
Equation (7), as a single finite-code existence claim for an unbounded channel,
and the unspecified computational claim after (1), are deferred in HARD.md.
Compilation is pending the batch handoff.
-/
noncomputable section
open Filter
open scoped ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P20
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P13
(IsTraceClass IsPositive operatorTrace State)
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
/-- PDF p.2, (1): a bounded binary effect; singular effects are allowed. -/
def IsBinaryEffect (Q : H →L[ℂ] H) : Prop :=
IsPositive Q ∧ IsPositive (1 - Q)
/-- PDF p.2: all bounded binary effects on the output space. -/
abbrev Effect (H : Type*) [NormedAddCommGroup H] [InnerProductSpace ℂ H]
[CompleteSpace H] := {Q : H →L[ℂ] H // IsBinaryEffect Q}
/-- PDF p.2, (1): the actual trace pairing Tr(Q rho). The product of a bounded
operator with a trace-class operator is trace class, so the basis trace converges. -/
def traceAcceptance {I : Type*} (b : HilbertBasis I ℂ H)
(Q rho : H →L[ℂ] H) : ℝ :=
(operatorTrace b (Q.comp rho)).re
/-- PDF p.2, (1): extended negative logarithm, including -log2(0)=+infinity.
The infinity branch is included for totality; testing beta is finite on states
at the error parameters used by the statements. -/
def negativeLogTwo (x : ℝ≥0∞) : EReal :=
if x = 0 then ⊤ else if x = ⊤ then ⊥ else (-logTwo x.toReal : ℝ)
/-- PDF p.2, (1): infimum of type-II acceptance over all feasible bounded tests.
The extended infimum of an empty set is infinity. For states and epsilon>=0,
I is feasible and every objective lies in [0,1]. -/
def hilbertTestingBeta {I : Type*} (b : HilbertBasis I ℂ H) (epsilon : ℝ)
(rho sigma : H →L[ℂ] H) : ℝ≥0∞ :=
sInf {z | ∃ Q : Effect H,
1 - epsilon ≤ traceAcceptance b Q.val rho ∧
z = ENNReal.ofReal (traceAcceptance b Q.val sigma)}
/-- PDF p.2, (1): unnormalized hypothesis-testing divergence in bits. -/
def hilbertTestingDivergence {I : Type*} (b : HilbertBasis I ℂ H) (epsilon : ℝ)
(rho sigma : H →L[ℂ] H) : EReal :=
negativeLogTwo (hilbertTestingBeta b epsilon rho sigma)
/-- PDF p.2: support of a positive operator is the orthogonal complement of
its kernel, a closed subspace. The projection is not an inverse or matrix power. -/
def closedSupportProjector (rho : H →L[ℂ] H) : H →L[ℂ] H :=
(LinearMap.ker rho.toLinearMap)ᗮ.starProjection
/-- PDF p.2: order-zero Renyi divergence with the actual closed-support projector. -/
def orderZeroDivergence {I : Type*} (b : HilbertBasis I ℂ H)
(rho sigma : H →L[ℂ] H) : EReal :=
negativeLogTwo (ENNReal.ofReal (traceAcceptance b (closedSupportProjector rho) sigma))
/-- PDF p.2, (2): Umegaki relative entropy in bits. The accepted extended
finite-compression formula includes the trace correction on subnormalized
compressions and infinity on support failure. No entropy-finiteness premise. -/
def traceClassRelativeEntropyBits {I : Type*} {b : HilbertBasis I ℂ H}
(rho sigma : State b) : ℝ≥0∞ :=
QAlgorithms.Papers.Independent.Dependency50.P13.relativeEntropy rho.val sigma.val /
ENNReal.ofReal (Real.log 2)
/-- PDF p.2, DPI: positivity of an actual finite operator block matrix. -/
def PositiveHilbertBlock (n : ℕ) (A : Fin n → Fin n → (H →L[ℂ] H)) : Prop :=
∀ v : Fin n → H,
(∑ i, ∑ j, inner ℂ (v i) (A i j (v j))).im = 0 ∧
0 ≤ (∑ i, ∑ j, inner ℂ (v i) (A i j (v j))).re
/-- PDF p.2, DPI and its proof: physical preprocessing means complex linear,
trace-preserving and completely positive on trace class. All finite matrix
amplifications are required, with no Kraus-rank bound. Off-domain values are unused.
Printed: CPM. Convention: CPTP, as required by the proof's measurement pullback. -/
def IsHilbertCPTP {K J I : Type*} [NormedAddCommGroup K] [InnerProductSpace ℂ K]
[CompleteSpace K] (b : HilbertBasis I ℂ H) (d : HilbertBasis J ℂ K)
(Phi : (H →L[ℂ] H) → (K →L[ℂ] K)) : Prop :=
(∀ A B, IsTraceClass A → IsTraceClass B → Phi (A + B) = Phi A + Phi B) ∧
(∀ (c : ℂ) A, IsTraceClass A → Phi (c • A) = c • Phi A) ∧
(∀ A, IsTraceClass A →
IsTraceClass (Phi A) ∧ operatorTrace d (Phi A) = operatorTrace b A) ∧
∀ n (A : Fin n → Fin n → (H →L[ℂ] H)),
(∀ i j, IsTraceClass (A i j)) → PositiveHilbertBlock n A →
PositiveHilbertBlock n (fun i j => Phi (A i j))
/-- PDF pp.1–2: an arbitrary cq channel on a nonempty input set (the Nonempty
instance is imposed by each capacity statement). Its outputs are actual densities. -/
abbrev ClassicalInputChannel (X : Type*) {I : Type*} (b : HilbertBasis I ℂ H) := X → State b
/-- PDF p.2, Theorem 1: Tr(Q piAB), computed from the diagonal classical blocks
Q_x = (<x| tensor I) Q (|x> tensor I). Every family of effects has a direct-sum
realization, and the omitted off-diagonal blocks never affect either cq trace. -/
def cqJointAcceptance {X I : Type*} (b : HilbertBasis I ℂ H)
(W : ClassicalInputChannel X b) (P : PMF X) (Q : X → Effect H) : ℝ :=
∑' x, (P x).toReal * traceAcceptance b (Q x).val (W x).val.val
/-- PDF p.2, Theorem 1: Tr(Q (piA tensor piB)), with actual marginals
piA=diag(P), piB=sum_y P(y)rho_y. Both sums converge absolutely: the trace
pairings are in [0,1] and the PMF weights sum to one. -/
def cqProductAcceptance {X I : Type*} (b : HilbertBasis I ℂ H)
(W : ClassicalInputChannel X b) (P : PMF X) (Q : X → Effect H) : ℝ :=
∑' x, (P x).toReal *
(∑' y, (P y).toReal * traceAcceptance b (Q x).val (W y).val.val)
/-- PDF p.2, (1),(3): type-II optimization for the cq pair in its exact
diagonal-block representation. No finite-support restriction on P is imposed. -/
def cqTestingBeta {X I : Type*} (b : HilbertBasis I ℂ H)
(W : ClassicalInputChannel X b) (P : PMF X) (epsilon : ℝ) : ℝ≥0∞ :=
sInf {z | ∃ Q : X → Effect H,
1 - epsilon ≤ cqJointAcceptance b W P Q ∧
z = ENNReal.ofReal (cqProductAcceptance b W P Q)}
/-- PDF p.2, (3): hypothesis-testing information of the constructed cq pair. -/
def cqTestingInformation {X I : Type*} (b : HilbertBasis I ℂ H)
(W : ClassicalInputChannel X b) (P : PMF X) (epsilon : ℝ) : EReal :=
negativeLogTwo (cqTestingBeta b W P epsilon)
/-- PDF p.2, (3): supremum over all discrete input distributions; extended
suprema preserve unbounded channel information. -/
def optimizedTestingInformation {X I : Type*} (b : HilbertBasis I ℂ H)
(W : ClassicalInputChannel X b) (epsilon : ℝ) : EReal :=
⨆ P : PMF X, cqTestingInformation b W P epsilon
/-- PDF p.2: an actual m-message code. Repeated codewords and zero POVM
elements are allowed. Completeness holds on the entire output space. -/
structure ClassicalMessageCode (X : Type*) (H : Type*) [NormedAddCommGroup H]
[InnerProductSpace ℂ H] [CompleteSpace H] (m : ℕ) where
positive : 0 < m
word : Fin m → X
decoder : Fin m → (H →L[ℂ] H)
effect : ∀ i, IsBinaryEffect (decoder i)
complete : ∑ i, decoder i = 1
/-- PDF p.2: average error with uniformly distributed messages. -/
def uniformDecodingError {X I : Type*} {m : ℕ} (b : HilbertBasis I ℂ H)
(W : ClassicalInputChannel X b) (C : ClassicalMessageCode X H m) : ℝ :=
1 - (m : ℝ)⁻¹ * ∑ i, traceAcceptance b (C.decoder i) (W (C.word i)).val.val
/-- PDF p.2: rate is log2(m) for a positive integer message count. -/
def finiteMessageRate (m : ℕ) : ℝ := logTwo m
/-- PDF p.2, Theorem 1: operational one-shot capacity, defined independently
from testing information. An unbounded channel has capacity +infinity. -/
def oneUseCodeCapacity {X I : Type*} (b : HilbertBasis I ℂ H)
(W : ClassicalInputChannel X b) (epsilon : ℝ) : EReal :=
sSup {r | ∃ (m : ℕ) (C : ClassicalMessageCode X H m),
uniformDecodingError b W C ≤ epsilon ∧ r = (finiteMessageRate m : EReal)}
/-- PDF p.4, (10): B tensor (n+1) in completed Hilbert coordinates. The zero
sequence index denotes one channel use; every rate denominator is positive. -/
abbrev BlockHilbert (I : Type*) (n : ℕ) :=
QAlgorithms.RealRegisters.Hilbert (Fin (n + 1) → I)
/-- PDF p.4: canonical orthonormal tensor-product basis of the output block. -/
def blockBasis (I : Type*) (n : ℕ) :
HilbertBasis (Fin (n + 1) → I) ℂ (BlockHilbert I n) :=
HilbertBasis.ofRepr (LinearIsometryEquiv.refl ℂ _)
/-- PDF p.4, (10): independent operational capacity from actual sequences of
codes with error tending to zero and their lower limiting rates. There is no
compatibility, causality, stationarity or product-input assumption on W. -/
def vanishingErrorCapacity {I : Type*} {X : ℕ → Type*}
(W : ∀ n, ClassicalInputChannel (X n) (blockBasis I n)) : EReal :=
sSup {r | ∃ (m : ℕ → ℕ) (C : ∀ n, ClassicalMessageCode (X n) (BlockHilbert I n) (m n)),
Tendsto (fun n => uniformDecodingError (blockBasis I n) (W n) (C n)) atTop (nhds 0) ∧
r = Filter.liminf (fun n => ((finiteMessageRate (m n) / (n + 1 : ℕ) : ℝ) : EReal)) atTop}
/-! Small sanity checks on definitions; no source theorem is proved here. -/
example : logTwo 1 = 0 := by simp [logTwo]
example : finiteMessageRate 1 = 0 := by simp [finiteMessageRate, logTwo]
example : negativeLogTwo 0 = ⊤ := by simp [negativeLogTwo]
example : negativeLogTwo ⊤ = ⊥ := by simp [negativeLogTwo]
example {I : Type*} (b : HilbertBasis I ℂ H) (rho : H →L[ℂ] H) :
traceAcceptance b 0 rho = 0 := by simp [traceAcceptance, operatorTrace]
example {I : Type*} (b : HilbertBasis I ℂ H) (rho : State b) :
operatorTrace b rho.val.val = 1 := rho.property.2
example {I : Type*} (b : HilbertBasis I ℂ H) (rho : State b) :
traceAcceptance b 1 rho.val.val = 1 := by
simpa only [traceAcceptance, ContinuousLinearMap.one_def,
ContinuousLinearMap.id_comp, Complex.one_re] using congrArg Complex.re rho.property.2
example {X I : Type*} (b : HilbertBasis I ℂ H) (W : ClassicalInputChannel X b)
(P : PMF X) (Q : X → Effect H) :
cqJointAcceptance b W P Q =
∑' x, (P x).toReal * traceAcceptance b (Q x).val (W x).val.val := rfl
example : negativeLogTwo 1 = 0 := by simp [negativeLogTwo, logTwo]
example : closedSupportProjector (0 : H →L[ℂ] H) = 0 := by
simp [closedSupportProjector]
example (n : ℕ) : PositiveHilbertBlock n (fun _ _ => (0 : H →L[ℂ] H)) := by
intro v
simp
example {I : Type*} (b : HilbertBasis I ℂ H) : IsHilbertCPTP b b id := by
refine ⟨?_, ?_, ?_, ?_⟩
· intro A B hA hB
rfl
· intro c A hA
rfl
· intro A hA
exact ⟨hA, rfl⟩
· intro n A hA hPositive
exact hPositive
example {X : Type*} (C : ClassicalMessageCode X H 0) : False :=
(Nat.lt_irrefl 0) C.positive
end QAlgorithms.Papers.Independent.Support50.P20
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P20.BlockHilbert
For an arbitrary type and natural number , this abbreviation denotes : the space of square-summable complex-valued functions indexed by all functions , with its norm. The type need not be finite, countable, or inhabited. At , labels are functions from a singleton to ; if is empty, the label type is empty and the Hilbert space is the zero space.
QAlgorithms.Papers.Independent.Support50.P20.ClassicalInputChannel
For any type , any complete complex inner product space with its compatible normed additive group structure, any index type , and any Hilbert basis , this abbreviation is the type of functions assigning to each a bounded complex-linear operator together with the following properties: admits sequences with summable and for every ; ; for every ; and
No finiteness, countability, topology, or measurability condition is imposed on , and no regularity condition is imposed on the assignment. If is empty, this assignment has no values to supply; if is the zero space and is nonempty, the trace-one requirement cannot be satisfied.
QAlgorithms.Papers.Independent.Support50.P20.ClassicalMessageCode
For an arbitrary type , a complete complex Hilbert space , and a natural number , this structure consists of a proof that , a word for each , and a bounded complex-linear operator for each such . It requires that and are self-adjoint and that and for every . It also requires , where is the identity operator. Repeated words are allowed. The required proof excludes .
QAlgorithms.Papers.Independent.Support50.P20.Effect
For any type equipped with a normed additive commutative group structure, a compatible complex inner product space structure, and completeness, is the type of bounded complex-linear operators satisfying , , and, for every , and . An element consists of such an operator together with evidence of these properties; no trace-class condition is imposed, and the zero-dimensional space is allowed.
QAlgorithms.Papers.Independent.Support50.P20.IsBinaryEffect
For a complete complex inner product space , with its compatible normed additive group structure, and a bounded complex-linear operator , this predicate means that both and are self-adjoint and have nonnegative quadratic forms: , , and, for every , and . There is no trace-class assumption or nontriviality assumption on .
QAlgorithms.Papers.Independent.Support50.P20.IsHilbertCPTP
Let and be complete complex inner product spaces with their compatible normed additive group structures, let be arbitrary index types, let and be Hilbert bases of and , respectively, and let be an arbitrary function from bounded complex-linear operators on to bounded complex-linear operators on . In this predicate, an operator on either space is called trace class precisely when there exist sequences in that space with summable and for every vector . The predicate requires all of the following: for trace-class , ; for every and trace-class , ; for every trace-class , is trace class and
and, for every and every family of trace-class operators on , if has zero imaginary part and nonnegative real part for every , then has zero imaginary part and nonnegative real part for every . The case is included and imposes only the corresponding zero-sum conditions. The predicate imposes no conditions on at operators that are not trace class.
QAlgorithms.Papers.Independent.Support50.P20.PositiveHilbertBlock
For any complete complex inner product space with its compatible normed additive group structure, every natural number , and every family of bounded complex-linear operators on , this predicate means that for every family of vectors ,
There is no trace-class assumption on the entries. When , both sums are zero and the predicate holds.
QAlgorithms.Papers.Independent.Support50.P20.blockBasis
For every type and natural number , this definition supplies the Hilbert basis of indexed by functions , obtained from the identity complex-linear isometric equivalence of that space with itself. Explicitly, the basis vector indexed by is the function whose value at a label is when and otherwise. No finiteness, countability, or nonemptiness assumption is imposed on ; if is empty, this is the empty basis of the zero space.
QAlgorithms.Papers.Independent.Support50.P20.closedSupportProjector
For any complete complex inner product space with its compatible normed additive group structure and any bounded complex-linear operator , this definition is the bounded orthogonal projection onto
There is no positivity, self-adjointness, trace-class, or normalization assumption on . In particular, gives the zero projection, while an injective gives the identity projection.
QAlgorithms.Papers.Independent.Support50.P20.cqJointAcceptance
For arbitrary types , a complete complex Hilbert space , and a Hilbert basis of , let be a probability mass function on , let assign an operator to each , and let assign an operator to each . Each is a bounded complex-linear operator admitting sequences with and for every ; it satisfies , for every , and . Both and are self-adjoint and have nonnegative real quadratic forms. The definition gives the real number . Neither index type is required to be finite or countable. Infinite sums here use the total-sum convention, which returns zero for a nonsummable family.
QAlgorithms.Papers.Independent.Support50.P20.cqProductAcceptance
For arbitrary types , a complete complex Hilbert space , and a Hilbert basis , let be a probability mass function on . Let assign to each a bounded complex-linear operator that admits a representation with , is self-adjoint with for every , and satisfies . Let , for each , be a bounded complex-linear operator such that and are self-adjoint with nonnegative real quadratic forms. The definition gives , a real number with the indicated nesting of sums. The types may be infinite or uncountable; each infinite sum uses the total-sum convention, returning zero if its family is not summable.
QAlgorithms.Papers.Independent.Support50.P20.cqTestingBeta
For arbitrary types , a complete complex Hilbert space , a Hilbert basis , a probability mass function on , and any real , let be self-adjoint bounded complex-linear operators with nonnegative real quadratic forms and , each admitting a representation with . For a family of bounded complex-linear operators, require that both and are self-adjoint with nonnegative real quadratic forms. Write , , , and . The definition is the infimum in of over all such families satisfying . An empty feasible set gives . There are no finiteness or countability assumptions on , and no range restriction on ; infinite sums use the total-sum convention, returning zero when nonsummable.
QAlgorithms.Papers.Independent.Support50.P20.cqTestingInformation
For arbitrary types , a complete complex Hilbert space , a Hilbert basis , a probability mass function on , and any real , let be bounded complex-linear operators satisfying , for every , and , each with a representation for which . For every family of bounded complex-linear operators such that and are self-adjoint with nonnegative real quadratic forms, put , , , and . Let be the infimum of over these families with , taking if there are none. The definition returns the extended real if , if , and otherwise. The index types need not be finite or countable, is unrestricted, and nonsummable infinite sums evaluate to zero.
QAlgorithms.Papers.Independent.Support50.P20.finiteMessageRate
For every natural number , including , the definition gives the real number , with regarded as a real number. The real logarithm is total and has , so the value at is .
QAlgorithms.Papers.Independent.Support50.P20.hilbertTestingBeta
For a complete complex inner product space with its compatible normed additive group structure, any index type , a Hilbert basis , any real , and arbitrary bounded complex-linear operators , this definition is
where each nonnegative real objective value is regarded as an extended nonnegative real. The infimum is if no such exists. There are no positivity, trace-class, or normalization assumptions on or , and no restriction on ; nonsummable complex families in the displayed sums have total sum zero.
QAlgorithms.Papers.Independent.Support50.P20.hilbertTestingDivergence
For a complete complex inner product space with its compatible normed additive group structure, any index type , a Hilbert basis , any real , and arbitrary bounded complex-linear operators , let
with the infimum taken in over bounded complex-linear such that and are self-adjoint with nonnegative real quadratic forms on every vector, and
The defined divergence is when , when , and otherwise. In particular, an empty feasible set gives . No state or trace-class assumptions are imposed on , no range is imposed on , and the complex sums equal zero if their families are not summable.
QAlgorithms.Papers.Independent.Support50.P20.negativeLogTwo
For every extended nonnegative real number , this definition gives an extended real number by
In the last case, is first converted to its finite real value. Values greater than are allowed and give negative outputs.
QAlgorithms.Papers.Independent.Support50.P20.oneUseCodeCapacity
For arbitrary types , a complete complex Hilbert space , a Hilbert basis , and any real , let be bounded complex-linear operators admitting with , satisfying , for every , and . The definition is the supremum in the extended reals of all values for which there exist a natural number , words , and bounded complex-linear operators such that and are self-adjoint with nonnegative real quadratic forms, , and . Repeated words are allowed. An empty set of qualifying values has supremum , and an unbounded set has supremum . Neither index type is required to be countable, is unrestricted, and nonsummable infinite sums evaluate to zero.
QAlgorithms.Papers.Independent.Support50.P20.optimizedTestingInformation
For arbitrary types , a complete complex Hilbert space , a Hilbert basis , and any real , let be self-adjoint bounded complex-linear operators with nonnegative real quadratic forms and , each admitting with . For each probability mass function on , write . Consider all families of bounded complex-linear operators for which and are self-adjoint with nonnegative real quadratic forms, and define . Let be the infimum in of subject to ; an empty feasible set gives . Assign to the extended real at zero, at , and otherwise. The definition is the supremum of these extended real values over all . If is empty, there is no such , and this supremum is . No countability assumptions or restriction on are imposed; nonsummable infinite sums evaluate to zero.
QAlgorithms.Papers.Independent.Support50.P20.orderZeroDivergence
For a complete complex inner product space with its compatible normed additive group structure, any index type , a Hilbert basis , and arbitrary bounded complex-linear operators , let be the orthogonal projection onto and set
The defined extended real value is if , and if . Here is finite because it is obtained from a real number, so the branch of the negative-log definition is not reached. No positivity, trace-class, or normalization conditions are imposed on or ; the complex sum is zero for a nonsummable family. In particular, gives .
QAlgorithms.Papers.Independent.Support50.P20.traceAcceptance
For a complete complex inner product space with its compatible normed additive group structure, an arbitrary index type , a Hilbert basis of , and arbitrary bounded complex-linear operators , the real number defined here is
Neither operator is assumed positive, trace class, or normalized, so this definition does not assert that the value lies in . The sum is the total infinite-sum operation, which equals zero when the complex-valued family is not summable; an empty basis also gives zero.
QAlgorithms.Papers.Independent.Support50.P20.traceClassRelativeEntropyBits
Let be any complete complex inner product space with its compatible normed additive group structure, let be any index type, and let be a Hilbert basis. The arguments are bounded complex-linear operators on that are self-adjoint, have nonnegative real quadratic forms on every vector, satisfy , and each admit sequences , indexed by , such that is summable and for every , with the respective operator. For each and every orthonormal family in , form matrices and , and assign the value
where and use the continuous functional calculus and the real logarithm is total, with . The defined value is
The quantification includes , whose empty compression contributes zero; values are allowed.
QAlgorithms.Papers.Independent.Support50.P20.uniformDecodingError
For arbitrary types , a complete complex Hilbert space , a Hilbert basis , and a natural number , let assign to each a bounded complex-linear operator admitting with , satisfying , for every , and . Let supply , words , and bounded complex-linear operators such that and are self-adjoint with nonnegative real quadratic forms and . The definition gives the real number . Repeated words are allowed, and the code’s positivity requirement excludes division by zero. The basis index type need not be countable; its infinite sum uses the total-sum convention, returning zero if nonsummable.
QAlgorithms.Papers.Independent.Support50.P20.vanishingErrorCapacity
For an arbitrary type , a family of types indexed by natural numbers, and maps , put and let be its coordinate basis indexed by . Each must be a bounded complex-linear operator admitting a representation with , satisfying , for every , and . The definition is the supremum in the extended reals of all for which there exist natural numbers and, for every , words and bounded complex-linear operators on , indexed by , such that and are self-adjoint with nonnegative real quadratic forms, , the real sequence tends to zero as , and , with this lower limit taken in the extended reals. Codes are required for every , including zero, and repeated words are allowed. The denominator is always positive. The types may be empty or uncountable, nonsummable infinite sums evaluate to zero, and an empty set of qualifying rates has supremum .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.