Definitions for Classical capacity of a noiseless quantum channel assisted by noisy entanglement
DefinitionQAlgorithms_Papers_Independent_Support50_P39The objects the formalized statements of Classical capacity of a noiseless quantum channel assisted by noisy entanglement (arXiv:quant-ph/0106080) are stated in. Each was checked against the paper by a blind read-back and a moderator.
noisyResourceCopies: PDF pp.2--4: independent copies, regrouped as A^n:B^n, with all matrix entries, including off-diagonal entries, retained.aliceAction: PDF p.4: Lambda tensor id_B, with Alice the first factor. This is the linear action on every Bob block, rather than an action just on marginals.clippedCoherentInformation: PDF p.2: the paper's coherent information is clipped at zero.quantumMutualInformation: PDF p.8, Eq. (16): quantum mutual information in bits.Preprocessing: PDF pp.2,7: arbitrary positive block length and positive finite output dimension, with an actual CPTP map. Neither integer is bounded in the optimization.processedResource: PDF pp.2,7: the computed preprocessed resource, not a free state parameter.mutualRatios: PDF p.2, Eq. (4), on its actual domain S(A)>0. The missing unassisted baseline is supplied separately in the capacity theorem. For normalized density inputs this set contains 0 (mixed replacement output) and is contained in [0,2]. Invalid inputs are never used in theorems.coherentRatios: PDF p.7, Eq. (15): positive processed-entropy quotients of the clipped coherent information. The set contains 0 and is contained in [0,1] for states.NoisyResourceBlockCode: PDF p.3, Eq. (6): a finite protocol consuming nk copies and sending a register of dimension d^k. Every message has a CPTP encoder. The SINGLE POVM is chosen before the universal message quantifier. Local ancillas and disposal are subsumed by CPTP maps; no side communication or feedback is supplied.FixedRate: PDF p.3, Eq. (6): fixed-(d,n) achievable rate R, already normalized to bits per qubit. d,n are fixed BEFORE error and rate-slack limits. Arbitrary large block encoders are allowed; this is not an independent-letter restriction. Only positive k are tested, and epsilon ranges over (0,1).operationalRates: PDF p.3, Eq. (6): rates obtainable with one chosen d>=2 and n>=1. In finite positive dimensions the set contains [0,1] and is bounded by 2; these guards are included in the full capacity statement.denseCodingCapacity: PDF p.3, Eq. (6): operational capacity, in classical bits per qubit. This definition contains no entropic capacity identity. On nonphysical input the real supremum can have a junk value; all results require a density matrix.ReliableFamily: PDF p.3, Eq. (6): an arbitrary reliable fixed-(d,n) block family. Only the errors must converge; message lengths and rates may oscillate. Encoders and the common decoder are witnessed by NoisyResourceBlockCode at each positive k. This predicate is used only with d>=2 and n>=1.IsEncoding: PDF p.4, Eq. (9): an admissible finite ensemble of encoding channels.encodingHolevo: PDF p.4, Eqs. (8),(9): the Holevo score computed from an encoding ensemble. No clipping occurs in this per-ensemble expression.denseCodingHolevoValue: PDF p.4, RHS of Eq. (9): the finite-ensemble objective H_d, deliberately separate from the operational C_d in Eq. (6). It is nonempty and bounded for d>=1 and normalized input. Attainment is part of the optimization theorem.finiteCoherentOpt: PDF p.4, Eq. (10): the fixed-output-dimensional optimized clipped coherent information. For normalized input and d>=1 this is a nonempty, bounded real supremum, attained by an actual channel.uniformWeight: PDF p.5: probabilities d^(-2) on the d^2 encoding letters, used for d>=1.unitaryEncoders: PDF p.5: unitary encoders Ad(U_i) after a given preprocessing channel.TracelessTwirling: PDF p.5: the source's unnormalized traceless-matrix twirling property.IsDistillable: PDF p.3, citing Ref. 11 (quant-ph/9801069, Eqs. (4)--(10) and the necessary-and-sufficient criterion following Eq. (9)): distillability means some positive finite tensor power has an entangled two-qubit local-filter output. Filters are arbitrary linear maps: they can be rescaled to physical Kraus contractions without changing positivity of the trace or the PPT test. In 2x2, failure of the PPT test is exactly inseparability. Transposing Alice instead of Bob gives the same positivity test by full transposition.IsBoundEntangled: PDF p.3: bound entangled means normalized, entangled AND nondistillable; this is not restricted to PPT states or to no-communication distillation.productFactor: PDF p.6, Bennett's example: tau tensor sigma regrouped as (T,A):B. Alice owns both T and A.discardFirstAlice: PDF p.6: actually discard T, one part of Alice's register.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Channel
import Definitions.Def_QAlgorithms_Defs_BipartiteSeparability
import Definitions.Def_QAlgorithms_Defs_Measurement
import Definitions.Def_QAlgorithms_Defs_Ensemble
/-!
Horodecki--Horodecki--Horodecki--Leung--Terhal, arXiv:quant-ph/0106080v3.
All page references are PDF pages; all entropies and rates are in bits.
The operational capacity below is defined from actual worst-message block codes,
not from an entropy formula or the unregularized Holevo objective.
Source corrections: Eq. (3) needs the unassisted baseline when Eq. (4) is
restricted to its positive-denominator domain; Eq. (5) needs the processed
Alice entropy from Eq. (15), rather than the printed S(rho_A). These corrections
require independent moderation; see the unit's DISCREPANCIES.md.
The fixed-(d,n) operational/single-letter identification in Eqs. (7),(9)
is deferred and is not an assumption of any declaration here.
-/
namespace QAlgorithms.Papers.Independent.Support50.P39
/-! Accepted-library comparison for this repair: the four original short names
matched different frozen concepts, not reusable definitions of these objects.
Dependency50.P45.resourceCopies is a tensor power of a pure vector, whereas
noisyResourceCopies takes an arbitrary mixed density matrix. Information100.P39
coherentInformation is signed Renyi information in nats; Information100.P22
coherentInformation takes a channel and a purified input. Neither is the paper's
clipped bipartite entropy difference in bits. Frontier30.P06.BlockCode describes
feedback executions with average error, whereas NoisyResourceBlockCode uses a
fixed noisy resource, no feedback, and worst-message success. Claimed50.P13
finiteHolevo is an extended nonnegative relative-entropy score of one ensemble,
whereas denseCodingHolevoValue optimizes all finite CPTP encoding ensembles into
a fixed finite output dimension. These complete paper-local bodies are retained
under distinct names; no frozen definition or theorem meaning is changed. -/
noncomputable section
open QAlgorithms
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.2--4: independent copies, regrouped as A^n:B^n, with all
matrix entries, including off-diagonal entries, retained. -/
def noisyResourceCopies {A B : Type*} (rho : Matrix (A × B) (A × B) ℂ) (n : ℕ) :
Matrix ((Fin n → A) × (Fin n → B)) ((Fin n → A) × (Fin n → B)) ℂ :=
fun i j => ∏ t, rho (i.1 t, i.2 t) (j.1 t, j.2 t)
/-- PDF p.4: Lambda tensor id_B, with Alice the first factor. This is the
linear action on every Bob block, rather than an action just on marginals. -/
def aliceAction {A B C : Type*} (Phi : Superop A C) :
Superop (A × B) (C × B) :=
fun X i j => Phi (fun a a2 => X (a,i.2) (a2,j.2)) i.1 j.1
/-- PDF p.2: the paper's coherent information is clipped at zero. -/
def clippedCoherentInformation {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ) : ℝ :=
max (vnEntropy (traceLeft rho) - vnEntropy rho) 0
/-- PDF p.8, Eq. (16): quantum mutual information in bits. -/
def quantumMutualInformation {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ) : ℝ :=
vnEntropy (traceRight rho) + vnEntropy (traceLeft rho) - vnEntropy rho
/-- PDF pp.2,7: arbitrary positive block length and positive finite output
dimension, with an actual CPTP map. Neither integer is bounded in the optimization. -/
structure Preprocessing (A : Type*) [Fintype A] [DecidableEq A] where
copies : ℕ
copies_pos : 0 < copies
outputDim : ℕ
outputDim_pos : 0 < outputDim
channel : Superop (Fin copies → A) (Fin outputDim)
valid : IsChannel channel
/-- PDF pp.2,7: the computed preprocessed resource, not a free state parameter. -/
def processedResource {A B : Type*} [Fintype A] [DecidableEq A]
(rho : Matrix (A × B) (A × B) ℂ) (P : Preprocessing A) :
Matrix (Fin P.outputDim × (Fin P.copies → B))
(Fin P.outputDim × (Fin P.copies → B)) ℂ :=
aliceAction P.channel (noisyResourceCopies rho P.copies)
/-- PDF p.2, Eq. (4), on its actual domain S(A)>0.
The missing unassisted baseline is supplied separately in the capacity theorem.
For normalized density inputs this set contains 0 (mixed replacement output)
and is contained in [0,2]. Invalid inputs are never used in theorems. -/
def mutualRatios {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ) : Set ℝ :=
{r | ∃ P : Preprocessing A,
0 < vnEntropy (traceRight (processedResource rho P)) ∧
r = quantumMutualInformation (processedResource rho P) /
vnEntropy (traceRight (processedResource rho P))}
/-- PDF p.7, Eq. (15): positive processed-entropy quotients of the clipped
coherent information. The set contains 0 and is contained in [0,1] for states. -/
def coherentRatios {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ) : Set ℝ :=
{r | ∃ P : Preprocessing A,
0 < vnEntropy (traceRight (processedResource rho P)) ∧
r = clippedCoherentInformation (processedResource rho P) /
vnEntropy (traceRight (processedResource rho P))}
/-- PDF p.3, Eq. (6): a finite protocol consuming nk copies and sending a
register of dimension d^k. Every message has a CPTP encoder. The SINGLE POVM
is chosen before the universal message quantifier. Local ancillas and disposal
are subsumed by CPTP maps; no side communication or feedback is supplied. -/
def NoisyResourceBlockCode {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ)
(d n k m : ℕ) (epsilon : ℝ) : Prop :=
∃ Enc : Qubits m → Superop (Fin (n*k) → A) (Fin (d^k)),
(∀ x, IsChannel (Enc x)) ∧
∃ Dec : Qubits m → Matrix (Fin (d^k) × (Fin (n*k) → B))
(Fin (d^k) × (Fin (n*k) → B)) ℂ,
IsPOVM Dec ∧ ∀ x, 1-epsilon ≤
effectProb (Dec x) (aliceAction (Enc x) (noisyResourceCopies rho (n*k)))
/-- PDF p.3, Eq. (6): fixed-(d,n) achievable rate R, already normalized to
bits per qubit. d,n are fixed BEFORE error and rate-slack limits. Arbitrary
large block encoders are allowed; this is not an independent-letter restriction.
Only positive k are tested, and epsilon ranges over (0,1). -/
def FixedRate {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ)
(d n : ℕ) (R : ℝ) : Prop :=
0 ≤ R ∧ ∀ epsilon : ℝ, 0 < epsilon → epsilon < 1 →
∀ delta : ℝ, 0 < delta → ∃ K : ℕ, ∀ k : ℕ, K ≤ k → 0 < k →
∃ m : ℕ, (R-delta) * (k : ℝ) * Real.logb 2 d ≤ m ∧
NoisyResourceBlockCode rho d n k m epsilon
/-- PDF p.3, Eq. (6): rates obtainable with one chosen d>=2 and n>=1.
In finite positive dimensions the set contains [0,1] and is bounded by 2;
these guards are included in the full capacity statement. -/
def operationalRates {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ) : Set ℝ :=
{R | ∃ d n : ℕ, 2 ≤ d ∧ 0 < n ∧ FixedRate rho d n R}
/-- PDF p.3, Eq. (6): operational capacity, in classical bits per qubit.
This definition contains no entropic capacity identity. On nonphysical input
the real supremum can have a junk value; all results require a density matrix. -/
def denseCodingCapacity {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ) : ℝ :=
sSup (operationalRates rho)
/-- PDF p.3, Eq. (6): an arbitrary reliable fixed-(d,n) block family.
Only the errors must converge; message lengths and rates may oscillate.
Encoders and the common decoder are witnessed by NoisyResourceBlockCode at each positive k.
This predicate is used only with d>=2 and n>=1. -/
def ReliableFamily {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ)
(d n : ℕ) (m : ℕ → ℕ) (epsilon : ℕ → ℝ) : Prop :=
(∀ k : ℕ, 0 < k → 0 ≤ epsilon k ∧ epsilon k ≤ 1 ∧
NoisyResourceBlockCode rho d n k (m k) (epsilon k)) ∧
Tendsto epsilon atTop (nhds 0)
/-- PDF p.4, Eq. (9): an admissible finite ensemble of encoding channels. -/
def IsEncoding {A C : Type*} [Fintype A] [Fintype C] [DecidableEq A]
{l : ℕ} (p : Fin l → ℝ) (E : Fin l → Superop A C) : Prop :=
0 < l ∧ (∀ i, 0 ≤ p i) ∧ (∑ i, p i) = 1 ∧ ∀ i, IsChannel (E i)
/-- PDF p.4, Eqs. (8),(9): the Holevo score computed from an encoding ensemble.
No clipping occurs in this per-ensemble expression. -/
def encodingHolevo {A B C : Type*} [Fintype A] [Fintype B] [Fintype C]
[DecidableEq A] [DecidableEq B] [DecidableEq C] {l : ℕ}
(rho : Matrix (A × B) (A × B) ℂ) (n : ℕ)
(p : Fin l → ℝ) (E : Fin l → Superop (Fin n → A) C) : ℝ :=
vnEntropy (∑ i, (p i : ℂ) • aliceAction (E i) (noisyResourceCopies rho n)) -
∑ i, p i * vnEntropy (aliceAction (E i) (noisyResourceCopies rho n))
/-- PDF p.4, RHS of Eq. (9): the finite-ensemble objective H_d, deliberately
separate from the operational C_d in Eq. (6). It is nonempty and bounded for
d>=1 and normalized input. Attainment is part of the optimization theorem. -/
def denseCodingHolevoValue {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ)
(n d : ℕ) : ℝ :=
sSup {r : ℝ | ∃ l : ℕ, ∃ p : Fin l → ℝ,
∃ E : Fin l → Superop (Fin n → A) (Fin d),
IsEncoding p E ∧ r = encodingHolevo rho n p E}
/-- PDF p.4, Eq. (10): the fixed-output-dimensional optimized clipped
coherent information. For normalized input and d>=1 this is a nonempty,
bounded real supremum, attained by an actual channel. -/
def finiteCoherentOpt {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] (rho : Matrix (A × B) (A × B) ℂ)
(n d : ℕ) : ℝ :=
sSup {r : ℝ | ∃ Phi : Superop (Fin n → A) (Fin d), IsChannel Phi ∧
r = clippedCoherentInformation (aliceAction Phi (noisyResourceCopies rho n))}
/-- PDF p.5: probabilities d^(-2) on the d^2 encoding letters, used for d>=1. -/
def uniformWeight (d : ℕ) : Fin (d*d) → ℝ := fun _ => ((d : ℝ)^2)⁻¹
/-- PDF p.5: unitary encoders Ad(U_i) after a given preprocessing channel. -/
def unitaryEncoders {A : Type*} [Fintype A] {d : ℕ}
(Phi : Superop A (Fin d)) (U : Fin (d*d) → Matrix.unitaryGroup (Fin d) ℂ) :
Fin (d*d) → Superop A (Fin d) :=
fun i => conjSuperop (U i : Matrix (Fin d) (Fin d) ℂ) ∘ Phi
/-- PDF p.5: the source's unnormalized traceless-matrix twirling property. -/
def TracelessTwirling {d : ℕ} (U : Fin (d*d) → Matrix.unitaryGroup (Fin d) ℂ) : Prop :=
∀ M : Matrix (Fin d) (Fin d) ℂ, M.trace = 0 →
∑ i, conjSuperop (U i : Matrix (Fin d) (Fin d) ℂ) M = 0
/-- PDF p.3, citing Ref. 11 (quant-ph/9801069, Eqs. (4)--(10) and the
necessary-and-sufficient criterion following Eq. (9)): distillability means
some positive finite tensor power has an entangled two-qubit local-filter
output. Filters are arbitrary linear maps: they can be rescaled to physical
Kraus contractions without changing positivity of the trace or the PPT test.
In 2x2, failure of the PPT test is exactly inseparability. Transposing Alice
instead of Bob gives the same positivity test by full transposition. -/
def IsDistillable {A B : Type*} [Fintype A] [Fintype B]
(rho : Matrix (A × B) (A × B) ℂ) : Prop :=
∃ n : ℕ, 0 < n ∧
∃ F : Matrix (Fin 2) (Fin n → A) ℂ,
∃ G : Matrix (Fin 2) (Fin n → B) ℂ,
let X := Matrix.kronecker F G * noisyResourceCopies rho n * (Matrix.kronecker F G)ᴴ
0 < X.trace.re ∧ ¬ (QAlgorithms.Entanglement.partialTransposeFirst X).PosSemidef
/-- PDF p.3: bound entangled means normalized, entangled AND nondistillable;
this is not restricted to PPT states or to no-communication distillation. -/
def IsBoundEntangled {A B : Type*} [Fintype A] [Fintype B]
[Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ) : Prop :=
IsDensityMatrix rho ∧ ¬ QAlgorithms.Entanglement.IsSeparableDensity rho ∧
¬ IsDistillable rho
/-- PDF p.6, Bennett's example: tau tensor sigma regrouped as (T,A):B.
Alice owns both T and A. -/
def productFactor {T A B : Type*} (tau : Matrix T T ℂ)
(sigma : Matrix (A × B) (A × B) ℂ) :
Matrix ((T × A) × B) ((T × A) × B) ℂ :=
fun i j => tau i.1.1 j.1.1 * sigma (i.1.2,i.2) (j.1.2,j.2)
/-- PDF p.6: actually discard T, one part of Alice's register. -/
def discardFirstAlice {T A B : Type*} [Fintype T]
(rho : Matrix ((T × A) × B) ((T × A) × B) ℂ) : Matrix (A × B) (A × B) ℂ :=
fun i j => ∑ t, rho ((t,i.1),i.2) ((t,j.1),j.2)
/-- Sanity: no resource copies is the scalar unit, not a zero state. -/
example {A B : Type*} (rho : Matrix (A × B) (A × B) ℂ)
(i j : (Fin 0 → A) × (Fin 0 → B)) : noisyResourceCopies rho 0 i j = 1 := by
simp [noisyResourceCopies]
/-- Sanity: applying the identity to Alice retains every off-diagonal entry. -/
example {A B : Type*} (rho : Matrix (A × B) (A × B) ℂ) :
aliceAction (fun X : Matrix A A ℂ => X) rho = rho := rfl
/-- Sanity: a one-letter channel ensemble has normalized weights. -/
example {A C : Type*} [Fintype A] [Fintype C] [DecidableEq A]
(Phi : Superop A C) (hPhi : IsChannel Phi) :
IsEncoding (fun _ : Fin 1 => (1 : ℝ)) (fun _ => Phi) := by
simp [IsEncoding, hPhi]
/-- Sanity: the scalar-output unitary ensemble has one letter of weight one. -/
example : uniformWeight 1 0 = 1 := by norm_num [uniformWeight]
/-- Sanity: the clipping convention keeps negative signed coherent information at zero. -/
example {A B : Type*} [Fintype A] [Fintype B] [DecidableEq A] [DecidableEq B]
(rho : Matrix (A × B) (A × B) ℂ)
(h : vnEntropy (traceLeft rho) ≤ vnEntropy rho) : clippedCoherentInformation rho = 0 := by
exact max_eq_right (sub_nonpos.mpr h)
/-- Sanity: discarding a scalar Alice factor returns precisely sigma. -/
example {A B : Type*} (sigma : Matrix (A × B) (A × B) ℂ) :
discardFirstAlice (productFactor (1 : Matrix Unit Unit ℂ) sigma) = sigma := by
ext i j
simp [discardFirstAlice, productFactor]
end
end QAlgorithms.Papers.Independent.Support50.P39
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P39.FixedRate
For finite types equipped with decidable equality, possibly empty, any complex matrix indexed by , natural numbers , and a real number , this predicate requires and the following quantified assertion: for every real and every real , there exists a natural number such that for every natural number with , there exists a natural number satisfying
and admitting the following encoding and decoding data. For every Boolean string of length , there is a channel from -indexed matrices to matrices indexed by : each channel has a finite, possibly empty Kraus family satisfying and for every . There are positive semidefinite matrices indexed by , with , such that, defining
one has for every . The choices and the encoding and decoding data have the dependencies allowed by this quantifier order. No positivity or normalization is assumed for , and neither nor is required to be positive. In particular, uses empty products, is permitted, and the total logarithm gives .
QAlgorithms.Papers.Independent.Support50.P39.IsBoundEntangled
For finite, nonempty types and a complex matrix indexed by , this predicate means that is positive semidefinite with , that there do not exist a natural number , nonnegative real weights summing to , and positive semidefinite matrices indexed respectively by , each of trace , such that , and that the following objects do not exist: a positive integer and matrices , such that
has while the matrix with entries at row , column , is not positive semidefinite. The matrices have no normalization or contraction requirement; the excluded decomposition permits zero weights, although cannot satisfy its weight-sum condition.
QAlgorithms.Papers.Independent.Support50.P39.IsDistillable
For finite types and an arbitrary complex matrix indexed by , this predicate means that there exist a positive integer , a complex matrix with rows indexed by and columns indexed by , and a complex matrix with rows indexed by and columns indexed by , such that, on defining
one has , and the matrix given by
is not positive semidefinite. No density condition on , normalization or contraction condition on , or nonemptiness assumption on is imposed. If either or is empty, every permitted positive makes , so the strict trace condition cannot hold.
QAlgorithms.Papers.Independent.Support50.P39.IsEncoding
For finite types , with decidable equality on , a natural number , real numbers , and maps from complex matrices indexed by to those indexed by , indexed by , this predicate means that , every , , and each admits a finite Kraus representation: there exist a natural number and matrices with rows indexed by and columns indexed by , such that
Zero weights and empty underlying types are allowed; the Kraus index count may be zero whenever the displayed conditions permit it, but never satisfies the predicate.
QAlgorithms.Papers.Independent.Support50.P39.NoisyResourceBlockCode
For finite types equipped with decidable equality, possibly empty, any complex matrix indexed by , natural numbers , and any real , this predicate asserts the existence of an encoding channel for every Boolean string of length , and a family of decoding matrices . Each encoding maps -indexed square matrices to square matrices indexed by ; explicitly, for each there is a finite, possibly empty family such that and for every . Each is indexed by , is positive semidefinite, and the family satisfies . Define
The remaining requirement is the separate inequality
There is no assumption that is a density matrix or that lies in any particular interval. All zero values of the natural parameters are included: gives one message, gives empty products equal to , and gives , including when .
QAlgorithms.Papers.Independent.Support50.P39.Preprocessing
For a finite type equipped with decidable equality, possibly empty, a preprocessing object consists of natural numbers and , together with a function from complex square matrices indexed by functions to complex square matrices indexed by , and a channel certificate for . Explicitly, this certificate asserts that there exist a natural number and rectangular complex matrices , for , with rows indexed by and columns indexed by those functions into , such that
The number may be zero, in which case both sums are empty; the two dimensions must be strictly positive.
QAlgorithms.Papers.Independent.Support50.P39.ReliableFamily
For finite types with decidable equality, an arbitrary complex matrix indexed by , natural numbers , and functions and , this predicate means that as , and, for every positive integer , and the following objects exist. For each bit string , there is a map from complex matrices indexed by to those indexed by , admitting a finite Kraus representation for every matrix , with ; there are also positive semidefinite matrices , indexed by , such that and for every . Here and denote functions on , and the output matrix is defined blockwise by
There is no condition at beyond its participation in the sequence whose limit is specified; , , , and empty or are permitted, with empty products equal to . No positivity or trace condition on is assumed.
QAlgorithms.Papers.Independent.Support50.P39.TracelessTwirling
For a natural number and a family of unitary complex matrices , indexed by , this predicate means that every complex matrix with satisfies
The sum is unnormalized, and is not required to be Hermitian. When , the sum is empty and the equality holds for the unique matrix on the empty index set.
QAlgorithms.Papers.Independent.Support50.P39.aliceAction
For arbitrary types and any function from complex -indexed square matrices to complex -indexed square matrices, this defines a function from complex matrices indexed by to complex matrices indexed by . For every input matrix , its output satisfies
The types may be empty or infinite, and is an arbitrary function; linearity and channel properties are not required.
QAlgorithms.Papers.Independent.Support50.P39.clippedCoherentInformation
For any finite types equipped with decidable equality, possibly empty, and any complex matrix indexed by , this defines
Here, for a finite square complex matrix , , where and is formed using the continuous functional calculus appearing in the definition; the real logarithm is total, with . No positivity or trace-one condition is imposed on . The maximum makes the defined value nonnegative.
QAlgorithms.Papers.Independent.Support50.P39.coherentRatios
For finite types equipped with decidable equality, possibly empty, and any complex matrix indexed by , this defines the set of real numbers for which there exist positive natural numbers and a channel from -indexed square matrices to -indexed square matrices satisfying the following conditions. The channel requirement means that there is a finite, possibly empty family with and for every . Form the matrix indexed by using
Set and . The required conditions are
Here , where is applied by the continuous functional calculus used in the definition, with . No density-matrix condition is imposed on ; the denominator is strictly positive and the resulting ratio is nonnegative.
QAlgorithms.Papers.Independent.Support50.P39.denseCodingCapacity
For finite types equipped with decidable equality, possibly empty, and any complex matrix indexed by , this defines a real number as the real supremum of the following set of rates . A rate belongs to the set exactly when there exist natural numbers and such that , and for every real and every real , there is a natural number such that every natural number with admits a natural number satisfying
together with an encoding channel for each Boolean string of length and decoding matrices . Each encoding maps matrices indexed by to matrices indexed by , and has a finite, possibly empty family satisfying and for every input matrix . The matrices are positive semidefinite, indexed by , and satisfy . For every message , they must satisfy
Here and are spaces of functions on , and is allowed. No positivity or trace-one hypothesis is imposed on . The supremum is taken in the real numbers using the total supremum operation, which returns for an empty set or a set unbounded above; in particular, if either or is empty, the rate set is empty and the defined value is .
QAlgorithms.Papers.Independent.Support50.P39.denseCodingHolevoValue
For finite types with decidable equality, an arbitrary complex matrix indexed by , and natural numbers , this is the real supremum of all values
obtained by choosing a positive integer , weights with , and maps from matrices indexed by to matrices indexed by , each having a finite representation for all , with . Here
The real logarithm and functional calculus are used as total operations. No density condition on is imposed; , , and empty underlying types are included, with empty products equal to . The supremum uses the total real supremum operation, whose value is for an empty or unbounded-above defining set.
QAlgorithms.Papers.Independent.Support50.P39.discardFirstAlice
For arbitrary types , with finite, and an arbitrary complex matrix indexed by , this defines a complex matrix indexed by with entries
for all and . No positivity or trace condition on , or finiteness condition on , is assumed. If is empty, the result is the zero matrix.
QAlgorithms.Papers.Independent.Support50.P39.encodingHolevo
For finite types with decidable equality, an arbitrary complex matrix indexed by , natural numbers , arbitrary real weights , and arbitrary maps from complex matrices indexed by to those indexed by , for , define matrices indexed by by
The declared real number is
where is the continuous functional calculus and the real logarithm is interpreted as its total real-valued operation. No distribution condition on , channel condition on , or density-matrix condition on is required. The formula includes , when the product is empty and equals , and , when its value is ; the underlying finite types may also be empty.
QAlgorithms.Papers.Independent.Support50.P39.finiteCoherentOpt
For finite types with decidable equality, an arbitrary complex matrix indexed by , and natural numbers , this is the real supremum, over all maps from matrices indexed by to matrices indexed by that admit a finite Kraus representation for every , with , of
Here
and , using the total real logarithm and functional calculus. There is no density condition on . Zero values of and empty underlying types are allowed, with empty products equal to ; the total real supremum is if its defining set is empty or unbounded above.
QAlgorithms.Papers.Independent.Support50.P39.mutualRatios
For finite types equipped with decidable equality, possibly empty, and any complex matrix indexed by , this defines the set of real numbers for which there exist positive natural numbers and a channel from -indexed square matrices to -indexed square matrices with the following properties. Being a channel means that some finite, possibly empty family satisfies and for every . Define a matrix indexed by by
Writing and , the required conditions are
Here , where is applied through the continuous functional calculus used in the definition, with the total convention . Thus the denominator is required to be strictly positive; no density-matrix condition is imposed on .
QAlgorithms.Papers.Independent.Support50.P39.noisyResourceCopies
For arbitrary types , any complex matrix indexed by , and any natural number , this defines a complex matrix indexed by pairs of functions , where and , by
There are no finiteness, positivity, or normalization assumptions on . The case is included: both function spaces are singletons, and the resulting one-by-one matrix has entry , the empty product.
QAlgorithms.Papers.Independent.Support50.P39.operationalRates
For finite types equipped with decidable equality, possibly empty, and any complex matrix indexed by , this defines the set of real numbers for which there exist natural numbers and such that and the following holds: for every real and every real , there exists a natural number such that every natural number with admits a natural number with
and encoding and decoding data as follows. For each Boolean string of length , an encoding channel maps matrices indexed by to matrices indexed by ; it has some finite Kraus family , possibly empty, with and for every . There are positive semidefinite matrices indexed by , summing to the identity, such that
The dimensions are fixed before are chosen, and is allowed. No density-matrix condition is imposed on . If either or is empty, the positive copy count makes every displayed success value zero, so the set is empty.
QAlgorithms.Papers.Independent.Support50.P39.processedResource
For a finite type equipped with decidable equality, an arbitrary type , any complex matrix indexed by , and a preprocessing object , this defines a matrix indexed by , where , , and denotes functions . The object supplies a channel : there is a finite, possibly empty family of matrices satisfying and for every -indexed input matrix . The defined matrix has entries
Neither nor has an additional positivity, normalization, or finiteness requirement.
QAlgorithms.Papers.Independent.Support50.P39.productFactor
For arbitrary types , a complex matrix indexed by , and a complex matrix indexed by , this defines a complex matrix indexed by through
for every , , and . No finiteness, nonemptiness, positivity, or trace assumptions are imposed; empty types simply leave no corresponding entries.
QAlgorithms.Papers.Independent.Support50.P39.quantumMutualInformation
For any finite types equipped with decidable equality, possibly empty, and any complex matrix indexed by , this defines
Here , with applied by the continuous functional calculus used in the definition, and with the total real logarithm satisfying . No positivity, normalization, or nonnegativity condition is imposed on this expression or on .
QAlgorithms.Papers.Independent.Support50.P39.uniformWeight
For every natural number , this defines the real-valued function on that takes the constant value . When , its domain is empty; the total real inverse used in the formula assigns .
QAlgorithms.Papers.Independent.Support50.P39.unitaryEncoders
For a finite type , a natural number , an arbitrary map from complex matrices indexed by to complex matrices, and a family of unitary matrices indexed by , this defines a family of maps by
No channel or linearity condition on is assumed. The type may be empty, and gives an empty family.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.