Definitions for Trade-off capacities of the quantum Hadamard channels
DefinitionQAlgorithms_Papers_Independent_Gap20_P04The objects the formalized statements of Trade-off capacities of the quantum Hadamard channels (arXiv:1001.1732) are stated in. Each was checked against the paper by a blind read-back and a moderator.
product: PDF pp.10,19: distinct channels; receiver and environment factors are regrouped.PurifiedInputFamily: PDF p.7, (15): arbitrary finite alphabet and reference; validity is separate.PurifiedInputFamily.Valid: PDF pp.3,7: normalized distribution; every conditional vector has norm one.PurifiedInputFamily.input: PDF p.7: input marginal of the conditional PURE reference-input state.PurifiedInputFamily.average: PDF pp.3--4: average input.inputEntropy: PDF p.4: H(A|X)=H(A'|X), by purity of each input.ensembleReceiverEntropy: PDF p.4: H(B).conditionalReceiverEntropy: PDF p.4: H(B|X).conditionalEnvironmentEntropy: PDF p.4: H(E|X), using the same isometry.ensembleCoherentBits: PDF pp.4,9: q=I(A>B X), using conditional ABE purity.jointInfo: PDF pp.4,8: j=I(AX;B), using conditional ABE purity.cqScore: PDF p.9, (21): CQ support objective.ceScore: PDF p.11, (23): CE support objective, with MINUS consumption.purifiedValues: PDF p.7, (15): physical ensembles only.PureInputs: PDF pp.10,20: pure channel-input ensembles in the Holevo maximum.holevoValues: PDF pp.10,20: one-use Holevo values, not regularized classical capacity.RepeatedMax: Positive-block homogeneity with attainment.oneCQ: PDF p.7: literal one-use CQ union, with ONE ensemble.oneCE: PDF p.8: CE rectangle union, E>=0 denotes consumption and may be wasted.oneCQE: PDF p.8, (17)--(19): all THREE inequalities use ONE ensemble.capacityCQ: PDF p.7, (14): closure OUTSIDE the positive-block union.capacityCE: PDF p.8, (16): unrestricted block-input CE region.capacityCQE: PDF p.8: regularized positive-consumption CQE region.CQSupport: PDF pp.9--11: full supporting CQ face, retaining optimizer ties.CEUpper: PDF pp.11,19: upper C at the given consumption budget, allowing flat portions.cqHull: PDF p.21: nonnegative resource-monotone CQ hull, with convex combinations and limits.ceHull: PDF pp.8,21: CE hull permits lowering C and increasing consumption E.binaryEnsemble: PDF pp.13,22: actual purifications with the specified swapped diagonal marginals.binaryCQ: PDF pp.12--13: CQ coordinates of the purified binary ensemble.binaryCE: PDF pp.15,23: CE coordinates of the same purified ensemble.gdDilation: PDF p.5, (10): generalized-dephasing parent isometry when each v_i is unit.measureBasis: PDF p.5: basis measurement, storing its classical outcome diagonally.basisStatePreparation: PDF p.5: basisStatePreparation the conditional environment state.degradingKraus: PDF p.5: rank-one degrading Kraus |xi_b><b|.hadamardCoefficient: PDF p.5, (9): explicit coefficient fixes the conjugations.DephasedReplacement: PDF pp.21,23: same probabilities, dephased INPUT marginals, NEW purifications.dephasingCQ: PDF p.12, Theorem 4: CQ generating family.dephasingCE: PDF p.12, Theorem 4: CE generating family.cloneDelta: PDF pp.6,12: normalization, in real arithmetic.cloneLambda: PDF p.12: lambda_i for i=0,...,N; subtraction is in reals.cloneEta: PDF p.12: eta_i for i=0,...,N-1; subtraction is in reals.entropyVector: PDF p.12: finite Shannon entropy, bits; 0 log 0=0.cloningCQ: PDF p.12, Theorem 5: cloning CQ coordinates.cloningCE: PDF p.12, Theorem 5: cloning CE coordinates.CESupport: PDF pp.11,21: CE supporting face, distinct from choosing one optimizer.selectedCQHull: PDF p.21: CQ hull from one selection per support face and the resource endpoints. Endpoints are represented by their full axis intervals; resource monotonicity is explicit.selectedCEHull: PDF p.21: CE selection hull, including the zero-consumption endpoint and limits.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Ensemble
import Definitions.Def_QAlgorithms_Defs_Channel
import Definitions.Def_QAlgorithms_Defs_BipartiteSeparability
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P24
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P67
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P32
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P44
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P24
/-!
Bradler--Hayden--Touchette--Wilde, arXiv:1001.1732v2, statement draft.
Entropies are bits; E>=0 is consumption. Capacity sets are the source's
regularized entropy-region definitions (14)--(19), whose operational meaning
is recalled in Section III. No signed-rate region or Unruh cutoff is substituted.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P04
open QAlgorithms
open QAlgorithms.Papers.Independent.Claimed50.P24
(Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
dephasingDilation dephasingGamma cloningDilation)
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel dilationPower)
open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)
open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)
open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)
open scoped BigOperators Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
/-!
Repair provenance: frozen Stinespring primitives, Hadamard/EB predicates,
attained-maximum relations, explicit qubit dilations, diagonal map and endpoint
time sharing are imported from the pinned accepted library. No signed-rate
capacity theorem is imported or asserted equivalent to the consumption theorem.
The remaining distinctly named interfaces have different domains from their
frozen namesakes: PurifiedInputFamily stores arbitrary finite reference-input
unit vectors with validity separate, whereas Information100.P58.InputEnsemble
stores mixed erasure-block inputs. ensembleReceiverEntropy is finite base-two
matrix entropy, not Information100.P49.outputEntropy's Gaussian scalar formula;
conditionalReceiverEntropy accepts those purified inputs rather than a
multi-sender product law. The Holevo coordinate reuses Dependency50.P24.ensembleHolevoBits
on the probabilities and conditional receiver densities. ensembleCoherentBits is
a real entropy coordinate, unlike the frozen Hamiltonian commutator coherent.
purifiedValues ranges over this raw family's Valid members, not P24's mixed
two-label ensembles. basisStatePreparation is the linear basis-controlled
preparation map, not Frontier30.P06.FeedbackExecution.prepare's next-input encoding.
-/
variable {I B E J D F : Type}
variable [Fintype I] [Fintype B] [Fintype E]
variable [Fintype J] [Fintype D] [Fintype F]
variable [DecidableEq I] [DecidableEq B] [DecidableEq E]
variable [DecidableEq J] [DecidableEq D] [DecidableEq F]
variable [Nonempty I] [Nonempty B] [Nonempty E]
variable [Nonempty J] [Nonempty D] [Nonempty F]
/-- PDF pp.10,19: distinct channels; receiver and environment factors are regrouped. -/
def product (U : Dilation I B E) (V : Dilation J D F) :
Dilation (I × J) (B × D) (E × F) :=
fun be i => U (be.1.1,be.2.1) i.1 * V (be.1.2,be.2.2) i.2
/-- PDF p.7, (15): arbitrary finite alphabet and reference; validity is separate. -/
structure PurifiedInputFamily (I : Type) where
labels : ℕ
reference : ℕ
prob : Fin labels → ℝ
psi : Fin labels → EuclideanSpace ℂ (Fin reference × I)
/-- PDF pp.3,7: normalized distribution; every conditional vector has norm one. -/
def PurifiedInputFamily.Valid (e : PurifiedInputFamily I) : Prop :=
0 < e.labels ∧ 0 < e.reference ∧ (∀ x, 0 ≤ e.prob x) ∧
(∑ x, e.prob x) = 1 ∧ ∀ x, ‖e.psi x‖ = 1
/-- PDF p.7: input marginal of the conditional PURE reference-input state. -/
def PurifiedInputFamily.input (e : PurifiedInputFamily I) (x : Fin e.labels) : Matrix I I ℂ :=
traceLeft (pureDensity (e.psi x))
/-- PDF pp.3--4: average input. -/
def PurifiedInputFamily.average (e : PurifiedInputFamily I) : Matrix I I ℂ :=
∑ x, (e.prob x : ℂ) • e.input x
/-- PDF p.4: H(A|X)=H(A'|X), by purity of each input. -/
def inputEntropy (e : PurifiedInputFamily I) : ℝ :=
∑ x, e.prob x * vnEntropy (e.input x)
/-- PDF p.4: H(B). -/
def ensembleReceiverEntropy (U : Dilation I B E) (e : PurifiedInputFamily I) : ℝ :=
vnEntropy (receiverChannel U e.average)
/-- PDF p.4: H(B|X). -/
def conditionalReceiverEntropy (U : Dilation I B E) (e : PurifiedInputFamily I) : ℝ :=
∑ x, e.prob x * vnEntropy (receiverChannel U (e.input x))
/-- PDF p.4: H(E|X), using the same isometry. -/
def conditionalEnvironmentEntropy (U : Dilation I B E) (e : PurifiedInputFamily I) : ℝ :=
∑ x, e.prob x * vnEntropy (complementaryChannel U (e.input x))
/-- PDF pp.4,9: q=I(A>B X), using conditional ABE purity. -/
def ensembleCoherentBits (U : Dilation I B E) (e : PurifiedInputFamily I) : ℝ :=
conditionalReceiverEntropy U e - conditionalEnvironmentEntropy U e
/-- PDF pp.4,8: j=I(AX;B), using conditional ABE purity. -/
def jointInfo (U : Dilation I B E) (e : PurifiedInputFamily I) : ℝ :=
inputEntropy e + ensembleReceiverEntropy U e - conditionalEnvironmentEntropy U e
/-- PDF p.9, (21): CQ support objective. -/
def cqScore (U : Dilation I B E) (lam : ℝ) (e : PurifiedInputFamily I) : ℝ :=
ensembleHolevoBits e.prob (fun x => receiverChannel U (e.input x)) + lam * ensembleCoherentBits U e
/-- PDF p.11, (23): CE support objective, with MINUS consumption. -/
def ceScore (U : Dilation I B E) (lam : ℝ) (e : PurifiedInputFamily I) : ℝ :=
jointInfo U e - lam * inputEntropy e
/-- PDF p.7, (15): physical ensembles only. -/
def purifiedValues (f : PurifiedInputFamily I → ℝ) : Set ℝ :=
{v | ∃ e, e.Valid ∧ v = f e}
/-- PDF pp.10,20: pure channel-input ensembles in the Holevo maximum. -/
def PureInputs (e : PurifiedInputFamily I) : Prop :=
∀ x, ∃ v : EuclideanSpace ℂ I, ‖v‖ = 1 ∧ e.input x = pureDensity v
/-- PDF pp.10,20: one-use Holevo values, not regularized classical capacity. -/
def holevoValues (U : Dilation I B E) : Set ℝ :=
{v | ∃ e, e.Valid ∧ PureInputs e ∧ v = ensembleHolevoBits e.prob (fun x => receiverChannel U (e.input x))}
/-- Positive-block homogeneity with attainment. -/
def RepeatedMax (n : ℕ) (S T : Set ℝ) : Prop :=
∃ v, IsGreatest S v ∧ IsGreatest T ((n : ℝ)*v)
/-- PDF p.7: literal one-use CQ union, with ONE ensemble. -/
def oneCQ (U : Dilation I B E) : Set (ℝ × ℝ) :=
{r | 0 ≤ r.1 ∧ 0 ≤ r.2 ∧ ∃ e, e.Valid ∧ r.1 ≤ ensembleHolevoBits e.prob (fun x => receiverChannel U (e.input x)) ∧ r.2 ≤ ensembleCoherentBits U e}
/-- PDF p.8: CE rectangle union, E>=0 denotes consumption and may be wasted. -/
def oneCE (U : Dilation I B E) : Set (ℝ × ℝ) :=
{r | 0 ≤ r.1 ∧ 0 ≤ r.2 ∧ ∃ e, e.Valid ∧ r.1 ≤ jointInfo U e ∧ inputEntropy e ≤ r.2}
/-- PDF p.8, (17)--(19): all THREE inequalities use ONE ensemble. -/
def oneCQE (U : Dilation I B E) : Set (Fin 3 → ℝ) :=
{r | (∀ i, 0 ≤ r i) ∧ ∃ e, e.Valid ∧
r 0 + 2*r 1 ≤ jointInfo U e ∧ r 1 ≤ ensembleCoherentBits U e + r 2 ∧
r 0 + r 1 ≤ ensembleHolevoBits e.prob (fun x => receiverChannel U (e.input x)) + ensembleCoherentBits U e + r 2}
/-- PDF p.7, (14): closure OUTSIDE the positive-block union. -/
def capacityCQ (U : Dilation I B E) : Set (ℝ × ℝ) :=
closure {r | ∃ n : ℕ, 0 < n ∧ (n : ℝ) • r ∈ oneCQ (dilationPower U n)}
/-- PDF p.8, (16): unrestricted block-input CE region. -/
def capacityCE (U : Dilation I B E) : Set (ℝ × ℝ) :=
closure {r | ∃ n : ℕ, 0 < n ∧ (n : ℝ) • r ∈ oneCE (dilationPower U n)}
/-- PDF p.8: regularized positive-consumption CQE region. -/
def capacityCQE (U : Dilation I B E) : Set (Fin 3 → ℝ) :=
closure {r | ∃ n : ℕ, 0 < n ∧ (n : ℝ) • r ∈ oneCQE (dilationPower U n)}
/-- PDF pp.9--11: full supporting CQ face, retaining optimizer ties. -/
def CQSupport (S : Set (ℝ × ℝ)) (lam : ℝ) (r : ℝ × ℝ) : Prop :=
r ∈ S ∧ ∀ s ∈ S, s.1 + lam*s.2 ≤ r.1 + lam*r.2
/-- PDF pp.11,19: upper C at the given consumption budget, allowing flat portions. -/
def CEUpper (S : Set (ℝ × ℝ)) (r : ℝ × ℝ) : Prop :=
r ∈ S ∧ ∀ s ∈ S, s.2 ≤ r.2 → s.1 ≤ r.1
/-- PDF p.21: nonnegative resource-monotone CQ hull, with convex combinations and limits. -/
def cqHull (f : ℝ → ℝ × ℝ) : Set (ℝ × ℝ) :=
closure (convexHull ℝ {r | 0 ≤ r.1 ∧ 0 ≤ r.2 ∧
∃ mu ∈ Set.Icc (0 : ℝ) (1/2), r.1 ≤ (f mu).1 ∧ r.2 ≤ (f mu).2})
/-- PDF pp.8,21: CE hull permits lowering C and increasing consumption E. -/
def ceHull (f : ℝ → ℝ × ℝ) : Set (ℝ × ℝ) :=
closure (convexHull ℝ {r | 0 ≤ r.1 ∧ 0 ≤ r.2 ∧
∃ mu ∈ Set.Icc (0 : ℝ) (1/2), r.1 ≤ (f mu).1 ∧ (f mu).2 ≤ r.2})
/-- PDF pp.13,22: actual purifications with the specified swapped diagonal marginals. -/
def binaryEnsemble (mu : ℝ) : PurifiedInputFamily (Fin 2) where
labels := 2
reference := 2
prob := fun _ => 1/2
psi := fun x => WithLp.toLp 2 fun ai =>
if ai.1 = ai.2 then
if ai.2 = x then (Real.sqrt mu : ℂ) else (Real.sqrt (1-mu) : ℂ)
else 0
/-- PDF pp.12--13: CQ coordinates of the purified binary ensemble. -/
def binaryCQ (U : Dilation (Fin 2) B E) (mu : ℝ) : ℝ × ℝ :=
(ensembleHolevoBits (binaryEnsemble mu).prob
(fun x => receiverChannel U ((binaryEnsemble mu).input x)), ensembleCoherentBits U (binaryEnsemble mu))
/-- PDF pp.15,23: CE coordinates of the same purified ensemble. -/
def binaryCE (U : Dilation (Fin 2) B E) (mu : ℝ) : ℝ × ℝ :=
(jointInfo U (binaryEnsemble mu), inputEntropy (binaryEnsemble mu))
/-- PDF p.5, (10): generalized-dephasing parent isometry when each v_i is unit. -/
def gdDilation (v : I → EuclideanSpace ℂ E) : Dilation I I E :=
fun be i => if be.1 = i then v i be.2 else 0
/-- PDF p.5: basis measurement, storing its classical outcome diagonally. -/
def measureBasis : Superop B B := diagonal
/-- PDF p.5: basisStatePreparation the conditional environment state. -/
def basisStatePreparation (v : B → EuclideanSpace ℂ E) : Superop B E :=
fun rho => ∑ b, rho b b • pureDensity (v b)
/-- PDF p.5: rank-one degrading Kraus |xi_b><b|. -/
def degradingKraus (v : B → EuclideanSpace ℂ E) (b : B) : Matrix E B ℂ :=
fun e c => if c = b then v b e else 0
/-- PDF p.5, (9): explicit coefficient fixes the conjugations. -/
def hadamardCoefficient (zeta : B → EuclideanSpace ℂ I)
(xi : B → EuclideanSpace ℂ E) (rho : Matrix I I ℂ) : Matrix B B ℂ :=
fun b c => (∑ i, ∑ j, conj (zeta b i) * rho i j * zeta c j) *
(∑ e, conj (xi c e) * xi b e)
/-- PDF pp.21,23: same probabilities, dephased INPUT marginals, NEW purifications. -/
def DephasedReplacement (e t : PurifiedInputFamily I) : Prop :=
∃ f : Fin e.labels ≃ Fin t.labels, ∀ x,
t.prob (f x) = e.prob x ∧ t.input (f x) = diagonal (e.input x)
/-- PDF p.12, Theorem 4: CQ generating family. -/
def dephasingCQ (p mu : ℝ) : ℝ × ℝ :=
(1-binEntropy2 mu, binEntropy2 mu-binEntropy2 (dephasingGamma mu p))
/-- PDF p.12, Theorem 4: CE generating family. -/
def dephasingCE (p mu : ℝ) : ℝ × ℝ :=
(1+binEntropy2 mu-binEntropy2 (dephasingGamma mu p), binEntropy2 mu)
/-- PDF pp.6,12: normalization, in real arithmetic. -/
def cloneDelta (N : ℕ) : ℝ := (N : ℝ)*((N : ℝ)+1)/2
/-- PDF p.12: lambda_i for i=0,...,N; subtraction is in reals. -/
def cloneLambda (N : ℕ) (mu : ℝ) (i : Fin (N+1)) : ℝ :=
((N : ℝ)-2*(i.val : ℝ))*mu+(i.val : ℝ)
/-- PDF p.12: eta_i for i=0,...,N-1; subtraction is in reals. -/
def cloneEta (N : ℕ) (mu : ℝ) (i : Fin N) : ℝ :=
((N : ℝ)-1-2*(i.val : ℝ))*mu+(i.val : ℝ)+1
/-- PDF p.12: finite Shannon entropy, bits; 0 log 0=0. -/
def entropyVector {K : Type} [Fintype K] (p : K → ℝ) : ℝ :=
-∑ i, p i * Real.logb 2 (p i)
/-- PDF p.12, Theorem 5: cloning CQ coordinates. -/
def cloningCQ (N : ℕ) (mu : ℝ) : ℝ × ℝ :=
let hb := entropyVector (fun i => cloneLambda N mu i / cloneDelta N)
let he := entropyVector (fun i => cloneEta N mu i / cloneDelta N)
(Real.logb 2 ((N : ℝ)+1)-hb, hb-he)
/-- PDF p.12, Theorem 5: cloning CE coordinates. -/
def cloningCE (N : ℕ) (mu : ℝ) : ℝ × ℝ :=
(Real.logb 2 ((N : ℝ)+1)+binEntropy2 mu-
entropyVector (fun i => cloneEta N mu i / cloneDelta N), binEntropy2 mu)
/-- PDF pp.11,21: CE supporting face, distinct from choosing one optimizer. -/
def CESupport (S : Set (ℝ × ℝ)) (lam : ℝ) (r : ℝ × ℝ) : Prop :=
r ∈ S ∧ ∀ s ∈ S, s.1-lam*s.2 ≤ r.1-lam*r.2
/-- PDF p.21: CQ hull from one selection per support face and the resource endpoints.
Endpoints are represented by their full axis intervals; resource monotonicity is explicit. -/
def selectedCQHull (S : Set (ℝ × ℝ)) (f : ℝ → ℝ × ℝ) : Set (ℝ × ℝ) :=
closure (convexHull ℝ {r | 0 ≤ r.1 ∧ 0 ≤ r.2 ∧ ∃ s : ℝ × ℝ,
((∃ lam : ℝ, 1 ≤ lam ∧ s = f lam) ∨ (s ∈ S ∧ (s.1 = 0 ∨ s.2 = 0))) ∧
r.1 ≤ s.1 ∧ r.2 ≤ s.2})
/-- PDF p.21: CE selection hull, including the zero-consumption endpoint and limits. -/
def selectedCEHull (S : Set (ℝ × ℝ)) (f : ℝ → ℝ × ℝ) : Set (ℝ × ℝ) :=
closure (convexHull ℝ {r | 0 ≤ r.1 ∧ 0 ≤ r.2 ∧ ∃ s : ℝ × ℝ,
((∃ lam ∈ Set.Icc (0 : ℝ) 1, s = f lam) ∨ (s ∈ S ∧ s.2 = 0)) ∧
r.1 ≤ s.1 ∧ s.2 ≤ r.2})
/-! Sanity tests for the local definitions. -/
example : cloneDelta 1 = 1 := by norm_num [cloneDelta]
example (mu : ℝ) : cloneEta 1 mu (0 : Fin 1) = 1 := by simp [cloneEta]
example (rho : Matrix I I ℂ) : diagonal (diagonal rho) = diagonal rho := by
ext i j
simp [diagonal]
example : dephasingGamma 0 0 = 1 := by norm_num [dephasingGamma]
example : (binaryEnsemble 0).psi (0 : Fin 2) ((1 : Fin 2), (1 : Fin 2)) = 1 := by
change (if (1 : Fin 2) = 1 then
if (1 : Fin 2) = 0 then (Real.sqrt (0 : ℝ) : ℂ)
else (Real.sqrt (1 - (0 : ℝ)) : ℂ)
else 0) = 1
norm_num
example (U : Dilation I B E) : cqScore U 0 =
(fun e => ensembleHolevoBits e.prob (fun x => receiverChannel U (e.input x))) := by
funext e
simp [cqScore]
end QAlgorithms.Papers.Independent.Gap20.P04
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Gap20.P04.CESupport
For any set , real number , and point , this predicate means that and
Thus attains the maximum of this linear expression on . There is no sign restriction on or on either coordinate; if is empty, the predicate is false because it requires .
QAlgorithms.Papers.Independent.Gap20.P04.CEUpper
For any set and point , this property means that and every satisfying also satisfies . Both comparisons include equality. If is empty, no point satisfies this property.
QAlgorithms.Papers.Independent.Gap20.P04.CQSupport
For any set , any real number , and any pair , this proposition means
Thus must belong to and attain the greatest value of the displayed linear functional on . The parameter may be negative, zero, or positive; no coordinate nonnegativity or uniqueness is required. For , the proposition is false.
QAlgorithms.Papers.Independent.Gap20.P04.DephasedReplacement
For a type with decidable equality and two purified input families , this property means there exists a bijection from the labels to such that, for every label , and
Thus the reduced input matrix at each matched label is the diagonal part of the original reduced input matrix. No validity condition on either family is assumed: weights need not form a probability distribution, vectors need not be normalized, and reference sizes may be zero. When both label sets are empty, the condition is vacuous.
QAlgorithms.Papers.Independent.Gap20.P04.PureInputs
For a finite index type and a purified input family , consisting of natural numbers , weights , and vectors , this proposition means that for every label there exists a vector satisfying
Here has entries . The condition applies to every label, including labels of zero weight, and imposes no validity requirement on the family or probability requirement on its weights. If , it holds vacuously.
QAlgorithms.Papers.Independent.Gap20.P04.PurifiedInputFamily.Valid
For a purified input family over a type , with natural numbers and , real weights , and complex Euclidean vectors indexed by , validity means exactly
The norm requirement applies even to labels whose weight is zero; a family with no labels or no reference coordinates cannot be valid.
QAlgorithms.Papers.Independent.Gap20.P04.PurifiedInputFamily.average
For any type and a purified input family with labels, reference size , real weights , and vectors , the average is the complex matrix
No validity condition is assumed, so the weights need not be nonnegative or sum to one, and the vectors need not be normalized. The matrix is zero if or .
QAlgorithms.Papers.Independent.Gap20.P04.PurifiedInputFamily.input
For any type , a purified input family with labels, reference size , and vectors , and any label , its input matrix is defined by
Thus it sums the reference coordinate of the matrix whose entries are the corresponding amplitude times the conjugate amplitude. Validity of the family is not assumed. If , this matrix is zero; if , there is no label to which the definition can be applied.
QAlgorithms.Papers.Independent.Gap20.P04.PurifiedInputFamily
For any type , a purified input family consists of two natural numbers and , a real number for each , and a complex Euclidean vector indexed by for each such . This structure alone imposes no positivity, normalization, or nonemptiness requirements: and may be zero, the weights may be negative, and the vectors need not have norm one.
QAlgorithms.Papers.Independent.Gap20.P04.RepeatedMax
For any natural number and any sets , this proposition means that there exists such that
Both greatest values must therefore belong to their respective sets. Neither set may be empty. The definition includes , when it requires to have a greatest element and to have greatest element .
QAlgorithms.Papers.Independent.Gap20.P04.basisStatePreparation
For a finite type , a type , and any family of complex Euclidean vectors indexed by , this defines a function taking a complex matrix to the matrix
Neither normalization of nor a density-matrix condition on is required. If is empty, this is the zero matrix.
QAlgorithms.Papers.Independent.Gap20.P04.binaryCE
For finite types with decidable equality, any complex matrix with rows indexed by and columns indexed by , and any , let , , be diagonal with entry at and at . Set , , and ; these partial traces sum diagonal entries over the indicated register. With
where denotes continuous functional calculus, this defines
No isometry condition on , nonemptiness condition on , or restriction on is imposed. Real square roots of negative arguments are zero.
QAlgorithms.Papers.Independent.Gap20.P04.binaryCQ
For finite types with decidable equality, any complex matrix with rows indexed by and columns indexed by , and any , define diagonal input matrices , , by , , and zero off the diagonal. Put and , where, for a matrix on , and . Writing and , with denoting continuous functional calculus, this defines the pair
No isometry condition on , nonemptiness condition on , or restriction on is imposed; negative square-root arguments give zero.
QAlgorithms.Papers.Independent.Gap20.P04.binaryEnsemble
For every real number , this constructs a family with two labels , a reference register with two basis indices, weight for each label, and vectors whose coordinates are
The displayed real amplitudes are regarded as complex numbers. There is no restriction on ; the real square root is zero on negative arguments, and the construction does not require these vectors to have norm one.
QAlgorithms.Papers.Independent.Gap20.P04.capacityCE
For finite index types with decidable equality and any complex matrix , this defines the Euclidean closure of all nonnegative pairs admitting a positive natural number , positive natural numbers , nonnegative weights summing to one, and unit vectors , indexed by , such that
Here is the type of length- strings over ,
and , with applied by continuous functional calculus. Limits of witnessed pairs are included by the closure. Block length zero is excluded; zero-weight labels still require unit vectors, and need not be an isometry. If is empty, the set is empty.
QAlgorithms.Papers.Independent.Gap20.P04.capacityCQ
For finite index types with decidable equality and any complex matrix , this defines the Euclidean closure of the following set of pairs : , and there exist a positive natural number , positive natural numbers , nonnegative weights summing to one, and unit vectors , indexed by , such that
Here denotes the functions ,
and for , applied by continuous functional calculus. The closure includes limits of such pairs even when no single witness realizes the limiting pair. Block length zero is excluded, zero weights are allowed, and no isometry assumption on is imposed. If is empty, the set is empty.
QAlgorithms.Papers.Independent.Gap20.P04.capacityCQE
For finite index types with decidable equality and any complex matrix , this defines the closure in of all nonnegative triples admitting a positive natural number , positive natural numbers , nonnegative weights summing to one, and unit vectors , indexed by . Put
where denote length- strings, and define
The witness must satisfy
Here , with applied by continuous functional calculus. The closure also includes limits without a single realizing witness. Block length zero is excluded, zero weights are allowed with unit vectors at every label, and no isometry assumption on is imposed. If is empty, the set is empty.
QAlgorithms.Papers.Independent.Gap20.P04.ceHull
For any function , this defines the closure, in the usual topology of , of the real convex hull of
The convex hull consists of finite convex combinations of these points, and its closure also includes their limits. No continuity or boundedness assumption is imposed on . The second coordinate has a lower bound and no specified upper bound. If for every , the resulting set is empty.
QAlgorithms.Papers.Independent.Gap20.P04.ceScore
For finite index types with decidable equality, a complex matrix , a real number , and a family consisting of natural numbers , real weights , and vectors for , define
Writing , where is applied by continuous functional calculus, the defined score is
There is no requirement here that be an isometry or that be valid: its weights need not form a probability distribution, its vectors need not be normalized, and either natural-number dimension may be zero; sums over no labels are zero.
QAlgorithms.Papers.Independent.Gap20.P04.cloneDelta
For every natural number , including , this defines the real number
In particular, its value at is zero.
QAlgorithms.Papers.Independent.Gap20.P04.cloneEta
For every natural number , every real number , and every integer index with , this defines
where the subtraction is real subtraction. No restriction is imposed on . When , there are no admissible indices .
QAlgorithms.Papers.Independent.Gap20.P04.cloneLambda
For every natural number , every real number , and every integer index with , this defines
with all arithmetic in this expression performed in the real numbers. There is no restriction on ; when , the only index is , and the value is zero.
QAlgorithms.Papers.Independent.Gap20.P04.cloningCE
For every natural number and real number , this defines
where
No restriction is imposed on . All divisions and logarithms are total, with division by zero and equal to zero and logarithms of negative real arguments taken at their absolute values. At , the sum is empty and the pair is .
QAlgorithms.Papers.Independent.Gap20.P04.cloningCQ
For every natural number and real number , put
This defines the pair . There is no restriction on and no hypothesis that the entries in either sum form a probability distribution. Division by zero is defined to be zero, , and logarithms of negative arguments use their absolute values; consequently, at both sums are zero and the pair is .
QAlgorithms.Papers.Independent.Gap20.P04.conditionalEnvironmentEntropy
For finite types , with decidable equality on , an arbitrary complex matrix with rows indexed by and columns by , and a purified input family over with labels, reference size , weights , and vectors , put . The conditional environment entropy is
where , with evaluated by continuous functional calculus. No validity, density-matrix, or isometry hypothesis is imposed; the label sum is zero when .
QAlgorithms.Papers.Independent.Gap20.P04.conditionalReceiverEntropy
For finite types , with decidable equality on , an arbitrary complex matrix with rows indexed by and columns by , and a purified input family over with labels, reference size , weights , and vectors , put . The conditional receiver entropy is
where , with evaluated by continuous functional calculus. No validity, density-matrix, or isometry hypothesis is imposed; the label sum is zero when .
QAlgorithms.Papers.Independent.Gap20.P04.cqHull
For any function , this defines the closure, in the usual topology of , of the real convex hull of
Thus the convex hull consists of finite convex combinations of these points, and the closure additionally includes their limits. No continuity or boundedness assumption is imposed on . A parameter contributes points only when both coordinates of are nonnegative; if no parameter does so, the resulting set is empty.
QAlgorithms.Papers.Independent.Gap20.P04.cqScore
For finite types , with decidable equality on and , let be an arbitrary complex matrix from to , let , and let be a purified input family with labels, reference size , weights , and vectors . Define , , and . The score is
where and , both using continuous functional calculus. There is no restriction on the sign of , no validity requirement on , and no isometry requirement on ; is allowed and gives score zero.
QAlgorithms.Papers.Independent.Gap20.P04.degradingKraus
For types , with decidable equality on , any family of complex Euclidean vectors indexed by , and any , this defines an complex matrix by
No normalization or completeness condition is imposed on this family of matrices.
QAlgorithms.Papers.Independent.Gap20.P04.dephasingCE
For arbitrary real numbers , this defines
where . Neither parameter is restricted to a probability interval. The square root is zero for negative arguments, , and logarithms of negative real arguments are interpreted as logarithms of their absolute values.
QAlgorithms.Papers.Independent.Gap20.P04.dephasingCQ
For arbitrary real numbers , this defines the ordered pair
with its first coordinate replaced by ; explicitly, the pair is
where . There are no restrictions on or . These expressions use total real functions: the square root of a negative number is zero, , and the real logarithm at a negative argument equals the logarithm of its absolute value.
QAlgorithms.Papers.Independent.Gap20.P04.ensembleCoherentBits
For finite types , with decidable equality on and , let be an arbitrary complex matrix from to , and let be a purified input family with labels, reference size , weights , and vectors . Define , , and . The ensemble coherent bits are
where , with evaluated by continuous functional calculus. No validity or isometry assumption is required, and the result is zero when .
QAlgorithms.Papers.Independent.Gap20.P04.ensembleReceiverEntropy
For finite types , with decidable equality on , let be a complex matrix with rows indexed by and columns by , and let be a purified input family over , with labels, reference size , weights , and vectors . Set and . The ensemble receiver entropy is
where , with evaluated by continuous functional calculus. Neither validity of nor an isometry condition on is assumed. Empty finite index types and zero label or reference sizes are allowed.
QAlgorithms.Papers.Independent.Gap20.P04.entropyVector
For every type equipped with a finite enumeration and every real-valued function , this defines
No nonnegativity or normalization condition is imposed on . The logarithm is the total real logarithm divided by , so , and for negative arguments it equals . If is empty, the value is zero.
QAlgorithms.Papers.Independent.Gap20.P04.gdDilation
For types , with decidable equality on , and any family of complex Euclidean vectors indexed by , this defines the complex matrix with rows indexed by and columns indexed by through
No normalization of the vectors or isometry condition is required.
QAlgorithms.Papers.Independent.Gap20.P04.hadamardCoefficient
For finite types , a type , families and indexed by , and an arbitrary complex matrix , this defines a complex matrix whose entries are
There are no normalization, orthogonality, positivity, or trace assumptions. If or is empty, every entry is zero.
QAlgorithms.Papers.Independent.Gap20.P04.holevoValues
For finite index types with decidable equality and any complex matrix , this is the set of real numbers
obtained as follows: choose positive natural numbers , nonnegative real weights summing to one, and unit vectors , for ; set , and require, for every , that for some unit vector . Here , with applied by continuous functional calculus; the displayed entropy difference is equivalently the corresponding natural-logarithm entropy difference divided by . Zero weights are permitted, with the same unit-vector and purity conditions on their labels. No isometry condition on is imposed, so its receiver outputs are not required to have trace one. If is empty, the set is empty.
QAlgorithms.Papers.Independent.Gap20.P04.inputEntropy
For a finite type with decidable equality and a purified input family with labels, reference size , weights , and vectors , define . The input entropy is
where is evaluated using the continuous functional calculus. No validity or density-matrix hypothesis is imposed. The sum is zero when .
QAlgorithms.Papers.Independent.Gap20.P04.jointInfo
For finite types , with decidable equality on each, let be an arbitrary complex matrix from to , and let be a purified input family with labels, reference size , weights , and vectors . Define , , , and . The joint information is
where , with evaluated by continuous functional calculus. No validity or isometry hypothesis is imposed; empty finite index types and zero family sizes are included.
QAlgorithms.Papers.Independent.Gap20.P04.measureBasis
For a type with decidable equality, this defines a function on complex matrices that retains the diagonal entries and sets every off-diagonal entry to zero:
The input is an arbitrary matrix; no positivity or trace condition is assumed.
QAlgorithms.Papers.Independent.Gap20.P04.oneCE
For finite index types with decidable equality and any complex matrix , this is the set of pairs with both coordinates nonnegative for which there exist positive natural numbers , nonnegative weights summing to one, and unit vectors , indexed by , satisfying the following inequalities:
where , , and for , applied by continuous functional calculus. Zero-weight labels still require unit vectors. No isometry condition on or purity condition on is imposed. If is empty, the set is empty.
QAlgorithms.Papers.Independent.Gap20.P04.oneCQ
For finite index types with decidable equality and any complex matrix , this is the set of pairs with for which there exist positive natural numbers , nonnegative weights summing to one, and unit vectors , indexed by , such that, on putting
one has
Here , with applied by continuous functional calculus. Labels of zero weight still require unit vectors. There is no isometry assumption on , and no requirement that the reduced inputs be pure. If is empty, this set is empty.
QAlgorithms.Papers.Independent.Gap20.P04.oneCQE
For finite index types with decidable equality and any complex matrix , this is the set of triples of nonnegative real numbers for which there exist positive natural numbers , nonnegative weights summing to one, and unit vectors , indexed by . Define
The required inequalities are exactly
Here , with applied by continuous functional calculus. Zero-weight labels still require unit vectors; is not assumed to be an isometry, and the reduced inputs need not be pure. If is empty, the set is empty.
QAlgorithms.Papers.Independent.Gap20.P04.product
For arbitrary types , let be a complex matrix with rows indexed by and columns by , and let have rows indexed by and columns by . Their product is the matrix with rows indexed by and columns by , defined by
No isometry or normalization condition is imposed, and the index types may be empty.
QAlgorithms.Papers.Independent.Gap20.P04.purifiedValues
For a finite index type and any real-valued function on purified input families over , this defines the set
A family specifies natural numbers , weights , and vectors , indexed by ; validity means exactly
Thus a real number belongs precisely when such a valid family exists with ; no attainment or boundedness property of this set is asserted. Zero weights are allowed, but their associated vectors must still have norm one. If is empty, no valid family exists and the set is empty.
QAlgorithms.Papers.Independent.Gap20.P04.selectedCEHull
For any set and function , this defines the closure, in the usual topology of , of the real convex hull of
There are no additional restrictions on or . In particular, the condition on the second coordinate is , and the branch supplied by does not require to be nonnegative.
QAlgorithms.Papers.Independent.Gap20.P04.selectedCQHull
For any set and function , this defines the closure, in the usual topology of , of the real convex hull of
There are no additional assumptions on or ; either alternative may supply the point , and points with both coordinates zero satisfy the axis condition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.