Definitions for On Shor's channel extension and constrained channels
DefinitionQAlgorithms_Papers_Independent_Gap48_P46The objects the formalized statements of On Shor's channel extension and constrained channels (arXiv:quant-ph/0306196) are stated in. Each was checked against the paper by a blind read-back and a moderator.
states: PDF p.2: normalized density matrices, including one-dimensional systems.shorEnsembleEntropy: PDF p.3: average output entropy.fixedMeanChi: PDF p.2: fixed-mean chi is defined independently of the entropy-roof identity.Constraint: PDF p.3: nonempty closed state-space subset. Ambient and relative closedness agree because the finite-dimensional state space is closed. Convexity is separate.constrainedChiCapacity: PDF p.3, Eq.(3): capacity optimizes over mean states.linearConstraint: PDF p.3: linear inequality constraint.budgetDomain: PDF pp.3,16: nonnegative feasible budgets, without an artificial upper bound.IsOptimalConstrainedEnsemble: PDF p.3: actual optimality of a feasible ensemble.shorEnsembleDistance: PDF p.4: extended nonnegative distance sum; 0 times infinity contributes 0.tensorMarginalConstraint: PDF p.6: all joint densities with constrained marginals, including entanglement.ConstrainedAdditive: PDF p.6, Eq.(8): additivity for one constraint pair.AllConstraints: PDF pp.6–7: every nonempty closed constraint pair, including nonconvex pairs.LinearAdditive: PDF p.6: all feasible positive-observable linear constraints.ChiSubadditive: PDF p.6, Eq.(9): pointwise chi subadditivity.RoofSuperadditive: PDF p.6, Eq.(10): strong superadditivity of the mixed entropy roof.ProductChiAdditive: PDF p.7: product-state chi additivity for every pair of states.ProductRoofAdditive: PDF p.7: product-state roof additivity for every pair of states.flaggedChannelSum: PDF p.8: block diagonal mixture, allowing different branch output spaces.twoBranchFlaggedChannel: PDF p.9: two-branch direct-sum mixture.shor: PDF pp.10–11, Remark 2: full-algebra extension. None labels failure; some j labels success. The diagonal label blocks alone determine the output.dephaseLabel: PDF p.11: delete off-diagonal classical-label input blocks.secondConstraint: PDF pp.11,13: only the second marginal is constrained.maxValue: PDF pp.11,13,17: optimized value on nonempty bounded feasible sections.MaximizesValue: PDF pp.11,13,17: feasible maximizing point and universal upper bound.finiteTilt: PDF p.11: objective in the finite-d approximation.shorTiltObjective: PDF p.13, Eq.(25): single-channel tilted objective.jointTilted: PDF p.13, Eq.(26): joint tilted objective, with B retained in its feasible domain.admissibleTail: PDF p.13: physical cofinal tail, excluding d=0,1 and q>1.extensionSequence: PDF p.13: unconstrained capacities on the physical tail, zero scalar prefix.jointExtensionSequence: PDF p.13: joint capacities on the physical tail, with the second marginal in B.AsymptoticAdditive: PDF p.13, Theorem 2(ii): both limits exist and satisfy the sum relation.GlobalUnconstrained: PDF p.15: global unconstrained conjecture, quantified over every finite dimension.GlobalConstrained: PDF p.15: global constrained conjecture, including nonconvex closed constraints.PartialTraceConstrained: PDF p.8: global constrained additivity restricted to partial-trace channels.sumObservable: PDF p.15: two-system additive observable.allocations: PDF pp.15–16: feasible allocations; empty local sections are excluded.WeakAt: PDF p.15, Eq.(33): weak allocation identity and attainment.GlobalWeak: PDF p.16: global weak conjecture, every channel pair and feasible positive costs.blockObservable: PDF pp.15–16: additive cost on n copies; the i-th term acts on the i-th factor.blockAllocations: PDF p.16: feasible n-use budget allocations.BlockWeak: PDF p.16: conditional n-channel weak allocation identity, for positive n.CostConstrainedCode: PDF p.15, operational C: finite unassisted collective code, per-codeword additive budget and decoding POVM. Capacity is not defined by an entropy regularization.CostConstrainedCode.Reliable: PDF p.15: uniform decoding error at most epsilon for every message.AchievableConstrainedRate: PDF p.15: asymptotically reliable rates in bits, with integer message counts.constrainedOperationalCapacity: PDF p.15: operational capacity is the supremum of achievable code rates.sectionSet: PDF p.17: feasible equality, upper or lower linear section.sectionDomain: PDF p.17: exactly the budgets with a nonempty section.sectionValue: PDF p.17: optimized section value, with attainment asserted by the theorem.singletonMixedEnsemble: PDF p.2: the one-element ensemble at a given density, witnessing a feasible mean.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Channel
import Definitions.Def_QAlgorithms_Defs_Ensemble
import Definitions.Def_QAlgorithms_Defs_Measurement
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P23
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P54
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P08
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P63
/-!
Holevo and Shirokov, arXiv:quant-ph/0306196v2. References are PDF pages.
Only pinned accepted libraries are imported. The finite mixed ensemble,
its mean, its output Holevo information and its mixed roof are reused from P08;
the operational code carrier is reused from P63. Other new objects are paper-local.
Short names of unrelated accepted concepts are avoided (see ASSESSMENT.json).
Real extrema are used on nonempty bounded value sets; attainment is a conclusion.
Asymptotic sequences use arbitrary zero scalar prefixes before their physical tail.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P46
open scoped Matrix ComplexConjugate ENNReal ComplexOrder
open Filter
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)
open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)
open QAlgorithms.Papers.Independent.Information100.P08
(Ensemble ensembleAverage outputHolevo mixedRoof)
variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]
variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]
/-- PDF p.2: normalized density matrices, including one-dimensional systems. -/
def states (I : Type) [Fintype I] : Set (Matrix I I ℂ) := {rho | IsDensityMatrix rho}
/-- PDF p.3: average output entropy. -/
def shorEnsembleEntropy (e : Ensemble I) (Phi : Superop I O) : ℝ :=
∑ i, e.prob i * vnEntropy (Phi (e.state i))
/-- PDF p.2: fixed-mean chi is defined independently of the entropy-roof identity. -/
def fixedMeanChi (Phi : Superop I O) (rho : Matrix I I ℂ) : ℝ :=
sSup {v | ∃ e : Ensemble I, (ensembleAverage e) = rho ∧ v = outputHolevo Phi e}
/-- PDF p.3: nonempty closed state-space subset. Ambient and relative closedness
agree because the finite-dimensional state space is closed. Convexity is separate. -/
def Constraint (A : Set (Matrix I I ℂ)) : Prop :=
A.Nonempty ∧ IsClosed A ∧ A ⊆ states I
/-- PDF p.3, Eq.(3): capacity optimizes over mean states. -/
def constrainedChiCapacity (Phi : Superop I O) (A : Set (Matrix I I ℂ)) : ℝ := sSup (fixedMeanChi Phi '' A)
/-- PDF p.3: linear inequality constraint. -/
def linearConstraint (A : Matrix I I ℂ) (alpha : ℝ) : Set (Matrix I I ℂ) :=
{rho | IsDensityMatrix rho ∧ effectProb A rho ≤ alpha}
/-- PDF pp.3,16: nonnegative feasible budgets, without an artificial upper bound. -/
def budgetDomain (A : Matrix I I ℂ) : Set ℝ :=
{alpha | 0 ≤ alpha ∧ (linearConstraint A alpha).Nonempty}
/-- PDF p.3: actual optimality of a feasible ensemble. -/
def IsOptimalConstrainedEnsemble (Phi : Superop I O) (A : Set (Matrix I I ℂ)) (e : Ensemble I) : Prop :=
(ensembleAverage e) ∈ A ∧ outputHolevo Phi e = constrainedChiCapacity Phi A
/-- PDF p.4: extended nonnegative distance sum; 0 times infinity contributes 0. -/
def shorEnsembleDistance (e : Ensemble I) (Phi : Superop I O) (rho : Matrix I I ℂ) : ℝ≥0∞ :=
∑ i, ENNReal.ofReal (e.prob i) * relativeEntropyBits (Phi (e.state i)) (Phi rho)
/-- PDF p.6: all joint densities with constrained marginals, including entanglement. -/
def tensorMarginalConstraint (A : Set (Matrix I I ℂ)) (B : Set (Matrix J J ℂ)) :
Set (Matrix (I × J) (I × J) ℂ) :=
{sigma | IsDensityMatrix sigma ∧ traceRight sigma ∈ A ∧ traceLeft sigma ∈ B}
/-- PDF p.6, Eq.(8): additivity for one constraint pair. -/
def ConstrainedAdditive (Phi : Superop I O) (Psi : Superop J K)
(A : Set (Matrix I I ℂ)) (B : Set (Matrix J J ℂ)) : Prop :=
constrainedChiCapacity (tensorChannel Phi Psi) (tensorMarginalConstraint A B) = constrainedChiCapacity Phi A + constrainedChiCapacity Psi B
/-- PDF pp.6–7: every nonempty closed constraint pair, including nonconvex pairs. -/
def AllConstraints (Phi : Superop I O) (Psi : Superop J K) : Prop :=
∀ A B, Constraint A → Constraint B → ConstrainedAdditive Phi Psi A B
/-- PDF p.6: all feasible positive-observable linear constraints. -/
def LinearAdditive (Phi : Superop I O) (Psi : Superop J K) : Prop :=
∀ (A : Matrix I I ℂ) (B : Matrix J J ℂ), A.PosSemidef → B.PosSemidef →
∀ alpha ∈ budgetDomain A, ∀ beta ∈ budgetDomain B,
ConstrainedAdditive Phi Psi (linearConstraint A alpha) (linearConstraint B beta)
/-- PDF p.6, Eq.(9): pointwise chi subadditivity. -/
def ChiSubadditive (Phi : Superop I O) (Psi : Superop J K) : Prop :=
∀ sigma ∈ states (I × J), fixedMeanChi (tensorChannel Phi Psi) sigma ≤
fixedMeanChi Phi (traceRight sigma) + fixedMeanChi Psi (traceLeft sigma)
/-- PDF p.6, Eq.(10): strong superadditivity of the mixed entropy roof. -/
def RoofSuperadditive (Phi : Superop I O) (Psi : Superop J K) : Prop :=
∀ sigma ∈ states (I × J), (mixedRoof (fun X => vnEntropy (Phi X))) (traceRight sigma) + (mixedRoof (fun X => vnEntropy (Psi X))) (traceLeft sigma) ≤
(mixedRoof (fun X => vnEntropy (tensorChannel Phi Psi X))) sigma
/-- PDF p.7: product-state chi additivity for every pair of states. -/
def ProductChiAdditive (Phi : Superop I O) (Psi : Superop J K) : Prop :=
∀ rho ∈ states I, ∀ omega ∈ states J,
fixedMeanChi (tensorChannel Phi Psi) (Matrix.kronecker rho omega) = fixedMeanChi Phi rho + fixedMeanChi Psi omega
/-- PDF p.7: product-state roof additivity for every pair of states. -/
def ProductRoofAdditive (Phi : Superop I O) (Psi : Superop J K) : Prop :=
∀ rho ∈ states I, ∀ omega ∈ states J,
(mixedRoof (fun X => vnEntropy (tensorChannel Phi Psi X))) (Matrix.kronecker rho omega) = (mixedRoof (fun X => vnEntropy (Phi X))) rho + (mixedRoof (fun X => vnEntropy (Psi X))) omega
/-- PDF p.8: block diagonal mixture, allowing different branch output spaces. -/
def flaggedChannelSum {T : Type} [Fintype T] [DecidableEq T] {B : T → Type}
[∀ t, Fintype (B t)] (q : T → ℝ) (Phi : (t : T) → Superop I (B t)) :
Superop I (Sigma B) :=
fun X a b => if h : a.1 = b.1 then
(q a.1 : ℂ) * Phi a.1 X a.2 (h.symm ▸ b.2) else 0
/-- PDF p.9: two-branch direct-sum mixture. -/
def twoBranchFlaggedChannel (q : ℝ) (Phi : Superop I O) (Psi : Superop I K) : Superop I (O ⊕ K) :=
fun X a b => match a, b with
| .inl i, .inl j => (q : ℂ) * Phi X i j
| .inr i, .inr j => ((1 - q : ℝ) : ℂ) * Psi X i j
| _, _ => 0
/-- PDF pp.10–11, Remark 2: full-algebra extension. None labels failure;
some j labels success. The diagonal label blocks alone determine the output. -/
def shor (Phi : Superop I O) (E : Matrix I I ℂ) (q : ℝ) (d : ℕ) :
Superop (I × Fin d) (O ⊕ Option (Fin d)) :=
fun X a b => match a, b with
| .inl i, .inl j => ((1 - q : ℝ) : ℂ) * Phi (traceRight X) i j
| .inr i, .inr j => if i = j then (q : ℂ) *
(match i with
| none => ((1 - E) * traceRight X).trace
| some k => (E * (Matrix.of fun i j => X (i,k) (j,k))).trace) else 0
| _, _ => 0
/-- PDF p.11: delete off-diagonal classical-label input blocks. -/
def dephaseLabel (d : ℕ) (X : Matrix (I × Fin d) (I × Fin d) ℂ) :
Matrix (I × Fin d) (I × Fin d) ℂ :=
fun a b => if a.2 = b.2 then X a b else 0
/-- PDF pp.11,13: only the second marginal is constrained. -/
def secondConstraint (B : Set (Matrix J J ℂ)) : Set (Matrix (I × J) (I × J) ℂ) :=
{sigma | IsDensityMatrix sigma ∧ traceLeft sigma ∈ B}
/-- PDF pp.11,13,17: optimized value on nonempty bounded feasible sections. -/
def maxValue {X : Type*} (S : Set X) (f : X → ℝ) : ℝ := sSup (f '' S)
/-- PDF pp.11,13,17: feasible maximizing point and universal upper bound. -/
def MaximizesValue {X : Type*} (S : Set X) (f : X → ℝ) (v : ℝ) : Prop :=
IsGreatest (f '' S) v
/-- PDF p.11: objective in the finite-d approximation. -/
def finiteTilt (Phi : Superop I O) (Psi : Superop J K)
(E : Matrix I I ℂ) (q : ℝ) (d : ℕ) (sigma : Matrix (I × J) (I × J) ℂ) : ℝ :=
(1 - q) * fixedMeanChi (tensorChannel Phi Psi) sigma +
q * Real.logb 2 d * effectProb E (traceRight sigma)
/-- PDF p.13, Eq.(25): single-channel tilted objective. -/
def shorTiltObjective (Phi : Superop I O) (E : Matrix I I ℂ) (lam : ℝ) (rho : Matrix I I ℂ) : ℝ :=
fixedMeanChi Phi rho + lam * effectProb E rho
/-- PDF p.13, Eq.(26): joint tilted objective, with B retained in its feasible domain. -/
def jointTilted (Phi : Superop I O) (Psi : Superop J K)
(E : Matrix I I ℂ) (lam : ℝ) (sigma : Matrix (I × J) (I × J) ℂ) : ℝ :=
fixedMeanChi (tensorChannel Phi Psi) sigma + lam * effectProb E (traceRight sigma)
/-- PDF p.13: physical cofinal tail, excluding d=0,1 and q>1. -/
def admissibleTail (lam : ℝ) (d : ℕ) : Prop := 2 ≤ d ∧ lam ≤ Real.logb 2 d
/-- PDF p.13: unconstrained capacities on the physical tail, zero scalar prefix. -/
def extensionSequence (Phi : Superop I O) (E : Matrix I I ℂ) (lam : ℝ) (d : ℕ) : ℝ :=
if admissibleTail lam d then
constrainedChiCapacity (shor Phi E (lam / Real.logb 2 d) d) (states (I × Fin d)) else 0
/-- PDF p.13: joint capacities on the physical tail, with the second marginal in B. -/
def jointExtensionSequence (Phi : Superop I O) (Psi : Superop J K)
(B : Set (Matrix J J ℂ)) (E : Matrix I I ℂ) (lam : ℝ) (d : ℕ) : ℝ :=
if admissibleTail lam d then
constrainedChiCapacity (tensorChannel (shor Phi E (lam / Real.logb 2 d) d) Psi)
(secondConstraint (I := I × Fin d) B) else 0
/-- PDF p.13, Theorem 2(ii): both limits exist and satisfy the sum relation. -/
def AsymptoticAdditive (Phi : Superop I O) (Psi : Superop J K)
(B : Set (Matrix J J ℂ)) : Prop :=
∀ E, IsEffect E → ∀ lam : ℝ, 0 ≤ lam → ∃ L : ℝ,
Tendsto (extensionSequence Phi E lam) atTop (nhds L) ∧
Tendsto (jointExtensionSequence Phi Psi B E lam) atTop (nhds (L + constrainedChiCapacity Psi B))
/-- PDF p.15: global unconstrained conjecture, quantified over every finite dimension. -/
def GlobalUnconstrained : Prop :=
∀ (A B C D : Type) [Fintype A] [Fintype B] [Fintype C] [Fintype D]
[DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]
[Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(Phi : Superop A B) (Psi : Superop C D), IsChannel Phi → IsChannel Psi →
ConstrainedAdditive Phi Psi (states A) (states C)
/-- PDF p.15: global constrained conjecture, including nonconvex closed constraints. -/
def GlobalConstrained : Prop :=
∀ (A B C D : Type) [Fintype A] [Fintype B] [Fintype C] [Fintype D]
[DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]
[Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(Phi : Superop A B) (Psi : Superop C D), IsChannel Phi → IsChannel Psi →
AllConstraints Phi Psi
/-- PDF p.8: global constrained additivity restricted to partial-trace channels. -/
def PartialTraceConstrained : Prop :=
∀ (A B C D : Type) [Fintype A] [Fintype B] [Fintype C] [Fintype D]
[DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]
[Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D],
AllConstraints (traceRight : Superop (A × B) A) (traceRight : Superop (C × D) C)
/-- PDF p.15: two-system additive observable. -/
def sumObservable (A : Matrix I I ℂ) (B : Matrix J J ℂ) :
Matrix (I × J) (I × J) ℂ := Matrix.kronecker A 1 + Matrix.kronecker 1 B
/-- PDF pp.15–16: feasible allocations; empty local sections are excluded. -/
def allocations (A : Matrix I I ℂ) (B : Matrix J J ℂ) (gamma : ℝ) : Set (ℝ × ℝ) :=
{p | p.1 ∈ budgetDomain A ∧ p.2 ∈ budgetDomain B ∧ p.1 + p.2 = gamma}
/-- PDF p.15, Eq.(33): weak allocation identity and attainment. -/
def WeakAt (Phi : Superop I O) (Psi : Superop J K)
(A : Matrix I I ℂ) (B : Matrix J J ℂ) (gamma : ℝ) : Prop :=
let f := fun p : ℝ × ℝ => constrainedChiCapacity Phi (linearConstraint A p.1) +
constrainedChiCapacity Psi (linearConstraint B p.2)
constrainedChiCapacity (tensorChannel Phi Psi) (linearConstraint (sumObservable A B) gamma) =
maxValue (allocations A B gamma) f ∧ MaximizesValue (allocations A B gamma) f (maxValue (allocations A B gamma) f)
/-- PDF p.16: global weak conjecture, every channel pair and feasible positive costs. -/
def GlobalWeak : Prop :=
∀ (A B C D : Type) [Fintype A] [Fintype B] [Fintype C] [Fintype D]
[DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]
[Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(Phi : Superop A B) (Psi : Superop C D), IsChannel Phi → IsChannel Psi →
∀ (X : Matrix A A ℂ) (Y : Matrix C C ℂ), X.PosSemidef → Y.PosSemidef →
∀ gamma ∈ budgetDomain (sumObservable X Y), WeakAt Phi Psi X Y gamma
/-- PDF pp.15–16: additive cost on n copies; the i-th term acts on the i-th factor. -/
def blockObservable (A : Matrix I I ℂ) (n : ℕ) : Matrix (Fin n → I) (Fin n → I) ℂ :=
fun x y => ∑ i : Fin n, A (x i) (y i) *
∏ j ∈ Finset.univ.erase i, if x j = y j then (1 : ℂ) else 0
/-- PDF p.16: feasible n-use budget allocations. -/
def blockAllocations (A : Matrix I I ℂ) (n : ℕ) (alpha : ℝ) : Set (Fin n → ℝ) :=
{a | (∀ i, a i ∈ budgetDomain A) ∧ ∑ i, a i = (n : ℝ) * alpha}
/-- PDF p.16: conditional n-channel weak allocation identity, for positive n. -/
def BlockWeak (Phi : Superop I O) (A : Matrix I I ℂ) (alpha : ℝ) : Prop :=
∀ n : ℕ, 1 ≤ n →
let S := blockAllocations A n alpha
let f := fun a : Fin n → ℝ => ∑ i, constrainedChiCapacity Phi (linearConstraint A (a i))
constrainedChiCapacity (piSuperop (fun _ : Fin n => Phi))
(linearConstraint (blockObservable A n) ((n : ℝ) * alpha)) = maxValue S f ∧
MaximizesValue S f (maxValue S f)
/-- PDF p.15, operational C: finite unassisted collective code, per-codeword additive
budget and decoding POVM. Capacity is not defined by an entropy regularization. -/
structure CostConstrainedCode (I O : Type) [Fintype I] [Fintype O] [DecidableEq O]
(A : Matrix I I ℂ) (alpha : ℝ) (n : ℕ) where
messages : ℕ
code : QAlgorithms.Papers.Independent.Information100.P63.Code
(Fin n → I) (Fin n → O) messages
cost : ∀ w, effectProb (blockObservable A n) (code.word w) ≤ (n : ℝ) * alpha
/-- PDF p.15: uniform decoding error at most epsilon for every message. -/
def CostConstrainedCode.Reliable (Phi : Superop I O) {A : Matrix I I ℂ} {alpha : ℝ} {n : ℕ}
(c : CostConstrainedCode I O A alpha n) (epsilon : ℝ) : Prop :=
∀ w, 1 - epsilon ≤ effectProb (c.code.measurement w)
(piSuperop (fun _ : Fin n => Phi) (c.code.word w))
/-- PDF p.15: asymptotically reliable rates in bits, with integer message counts. -/
def AchievableConstrainedRate (Phi : Superop I O) (A : Matrix I I ℂ) (alpha R : ℝ) : Prop :=
0 ≤ R ∧ ∀ epsilon : ℝ, 0 < epsilon → ∀ delta : ℝ, 0 < delta →
∃ N : ℕ, 1 ≤ N ∧ ∀ n : ℕ, N ≤ n → ∃ c : CostConstrainedCode I O A alpha n,
c.Reliable Phi epsilon ∧ (R - delta) * (n : ℝ) ≤ Real.logb 2 c.messages
/-- PDF p.15: operational capacity is the supremum of achievable code rates. -/
def constrainedOperationalCapacity (Phi : Superop I O) (A : Matrix I I ℂ) (alpha : ℝ) : ℝ :=
sSup {R | AchievableConstrainedRate Phi A alpha R}
/-- PDF p.17: feasible equality, upper or lower linear section. -/
def sectionSet {V : Type*} [AddCommMonoid V] [Module ℝ V]
(S : Set V) (l : V →ₗ[ℝ] ℝ) (rel : ℝ → ℝ → Prop) (alpha : ℝ) : Set V :=
{x | x ∈ S ∧ rel (l x) alpha}
/-- PDF p.17: exactly the budgets with a nonempty section. -/
def sectionDomain {V : Type*} [AddCommMonoid V] [Module ℝ V]
(S : Set V) (l : V →ₗ[ℝ] ℝ) (rel : ℝ → ℝ → Prop) : Set ℝ :=
{alpha | (sectionSet S l rel alpha).Nonempty}
/-- PDF p.17: optimized section value, with attainment asserted by the theorem. -/
def sectionValue {V : Type*} [AddCommMonoid V] [Module ℝ V]
(S : Set V) (F : V → ℝ) (l : V →ₗ[ℝ] ℝ) (rel : ℝ → ℝ → Prop) (alpha : ℝ) : ℝ :=
maxValue (sectionSet S l rel alpha) F
/-- PDF p.2: the one-element ensemble at a given density, witnessing a feasible mean. -/
def singletonMixedEnsemble (rho : Matrix I I ℂ) (hrho : IsDensityMatrix rho) : Ensemble I where
size := 1
prob := fun _ => 1
state := fun _ => rho
nonneg := fun _ => by norm_num
total := by simp
density := fun _ => hrho
/-- Sanity: a singleton ensemble has exactly its input mean and zero Holevo information. -/
example (rho : Matrix I I ℂ) (hrho : IsDensityMatrix rho) (Phi : Superop I O) :
ensembleAverage (singletonMixedEnsemble rho hrho) = rho ∧
outputHolevo Phi (singletonMixedEnsemble rho hrho) = 0 := by
constructor
· change (∑ _ : Fin 1, (1 : ℝ) • rho) = rho
simp
· change vnEntropy (Phi (∑ _ : Fin 1, (1 : ℝ) • rho)) -
(∑ _ : Fin 1, (1 : ℝ) * vnEntropy (Phi rho)) = 0
simp
/-- Sanity: the imported code carries normalized input states and a positive message count. -/
example {A : Matrix I I ℂ} {alpha : ℝ} {n : ℕ}
(c : CostConstrainedCode I O A alpha n) (w : Fin c.messages) :
0 < c.messages ∧ IsDensityMatrix (c.code.word w) :=
⟨c.code.positive, c.code.state w⟩
/-- Sanity: a singleton feasible set has its objective value. -/
example {X : Type*} (x : X) (f : X → ℝ) : maxValue {x} f = f x := by
simp [maxValue]
/-- Sanity: cross-sector output coherences of Shor's map vanish. -/
example (Phi : Superop I O) (E : Matrix I I ℂ) (q : ℝ) (d : ℕ)
(X : Matrix (I × Fin d) (I × Fin d) ℂ) (i : O) (j : Option (Fin d)) :
shor Phi E q d X (.inl i) (.inr j) = 0 := rfl
/-- Sanity: the zero-copy additive observable is zero. The results use positive n. -/
example (A : Matrix I I ℂ) : blockObservable A 0 = 0 := by
ext x y
simp [blockObservable]
/-- Sanity: the prefix does not evaluate capacities at d=0 or d=1. -/
example (Phi : Superop I O) (E : Matrix I I ℂ) (lam : ℝ) :
extensionSequence Phi E lam 0 = 0 ∧ extensionSequence Phi E lam 1 = 0 := by
simp [extensionSequence, admissibleTail]
end QAlgorithms.Papers.Independent.Gap48.P46
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Gap48.P46.AchievableConstrainedRate
For finite index types , with decidable equality, an arbitrary map , a matrix , and , this predicate says and that, for every and every , there exists an integer such that for every there are an integer , density matrices on , and positive semidefinite matrices on summing to , satisfying
Here density means positive semidefinite with trace ,
The threshold may depend on both tolerances, and the code may depend on the tolerances and on . The definition assumes neither that is a channel nor that is positive semidefinite or is nonnegative; it imposes no upper bound on either positive tolerance.
QAlgorithms.Papers.Independent.Gap48.P46.AllConstraints
For finite index types , equipped with decidable equality, and arbitrary functions , , this proposition says that for every nonempty closed set of positive semidefinite trace- matrices on , and every nonempty closed set of positive semidefinite trace- matrices on ,
Here, for any function and set ,
where , with evaluated by the real continuous functional calculus; each real supremum is if its defining set is empty or unbounded above. The set consists of positive semidefinite trace- matrices whose marginals and belong to and . The tensor function is given by
with the corresponding matrix unit. No convexity requirement is imposed on the constraint sets, and no channel assumption is imposed on either function. If or is empty, the required nonempty sets of density matrices do not exist, so the universal implication holds vacuously.
QAlgorithms.Papers.Independent.Gap48.P46.AsymptoticAdditive
For finite index types with decidable equality, arbitrary maps and , and any set , this predicate says that for every matrix such that both and are positive semidefinite, and every real , there exists a real such that
To define these quantities, let be the positive semidefinite, trace- matrices on a finite index set , let , and let be the real supremum of over all finite ensembles of density matrices with nonnegative weights summing to and mean . Here , with applied by continuous functional calculus. If and , put , define a map on matrices indexed by by the block on , diagonal entries at an additional label and at additional labels , and zero elsewhere, where and ; then set
For every other , set . The marginal is obtained by summing the diagonal indices of the first register. The tensor map is defined by
where the 's are matrix units. All suprema here are the total real suprema used in the definitions, with empty supremum . The quantification includes , and neither map is assumed to be a channel nor is assumed to be nonempty, closed, or a set of density matrices.
QAlgorithms.Papers.Independent.Gap48.P46.BlockWeak
For finite index types , with decidable equality, an arbitrary map , a matrix , and , this predicate requires the following for every integer :
and the right-hand supremum is attained and dominates every value in the indicated set. Here consists of nonnegative summing to , with each bound admitting a density matrix satisfying ;
For any map , the quantity is the supremum over density matrices with , followed by the supremum over finite ensembles , , of density matrices with , of
where density means positive semidefinite with trace , and for applied by continuous functional calculus. No channel assumption on , positivity assumption on , or admissibility assumption on is included. The attainment requirement forces to be nonempty for every ; there is no requirement at .
QAlgorithms.Papers.Independent.Gap48.P46.ChiSubadditive
For finite index types , each with decidable equality, and arbitrary matrix-valued maps and , this property means that every positive semidefinite trace-one matrix on satisfies
Here
with the matrix unit, and the partial traces are given by summing over and over , respectively. For any map , is the real supremum, over all finite ensembles with , , , each positive semidefinite of trace one, and , of
No channel or linearity hypotheses are imposed on either map. Empty index types are permitted; if or is empty, there is no such , so the universally quantified condition is vacuous. The real suprema do not assert that optimizing ensembles exist.
QAlgorithms.Papers.Independent.Gap48.P46.ConstrainedAdditive
For finite index types , equipped with decidable equality, arbitrary functions , , and arbitrary sets , , this proposition is the equality
For any such function and set , the quantity means
where , with evaluated by the real continuous functional calculus; each real supremum is if its defining set is empty or unbounded above. The set consists of positive semidefinite trace- matrices whose marginals and belong to and , respectively. The function is defined, even for these arbitrary functions, by
where is the matrix with entry at and zero elsewhere. No channel assumptions on , or constraint assumptions on , are included; empty types and empty sets are allowed.
QAlgorithms.Papers.Independent.Gap48.P46.Constraint
For a finite index type and a set , this proposition means that is nonempty, is closed in the usual finite-dimensional matrix topology, and every is positive semidefinite with . No convexity condition is included. If is empty, no set satisfies this proposition.
QAlgorithms.Papers.Independent.Gap48.P46.CostConstrainedCode.Reliable
For finite input and output index types , with the equality decisions needed for the matrix-unit formula, an arbitrary map , a matrix , real numbers , a natural block length , and a cost-constrained code , this predicate requires
The code supplies , positive semidefinite trace-one , positive semidefinite summing to , and, for each , , where . The success lower bound is required for every message, rather than only after averaging. Neither a channel assumption on nor a range restriction on is included, and is permitted.
QAlgorithms.Papers.Independent.Gap48.P46.CostConstrainedCode
For finite types , with decidable equality on , a matrix , , and , this structure consists of a natural number of messages, a proof that , density matrices indexed by on the register , and matrices on satisfying and , together with the condition
Each density matrix is positive semidefinite with trace . The cost condition applies separately to every message. There is no channel, decoding-success condition, or positivity assumption on in this structure. The block length is allowed; its cost matrix is zero and its cost inequality is .
QAlgorithms.Papers.Independent.Gap48.P46.GlobalConstrained
This proposition says that for every four finite, nonempty types , each with decidable equality, every two channels and , and every two nonempty closed sets and , one has
Here consists of positive semidefinite, trace- matrices, and , . A channel must admit a finite family with and for every matrix . The quantity is the real supremum of over all finite ensembles of density matrices with nonnegative weights summing to and mean , where and is applied by continuous functional calculus. The tensor map has entries
using matrix units. The constraint sets need not be convex.
QAlgorithms.Papers.Independent.Gap48.P46.GlobalUnconstrained
This proposition says that for every four finite, nonempty types , each with decidable equality, and every two maps and that are channels, one has
A channel here means that there exist a natural number and matrices of the appropriate rectangular size such that and for every input matrix . The set consists of positive semidefinite matrices of trace . For any map , is the real supremum of over every finite ensemble of density matrices with nonnegative real weights summing to and mean ; , with applied by continuous functional calculus. The tensor map is
where and are matrix units. The joint constraint in the definition requires both marginals to be density matrices in addition to requiring itself to be a density matrix; these marginal conditions are automatic for such .
QAlgorithms.Papers.Independent.Gap48.P46.GlobalWeak
This proposition universally quantifies over nonempty finite types , each with decidable equality, maps and , and assumes that each map has a finite Kraus representation: with , and likewise for . For every positive semidefinite , positive semidefinite , and nonnegative for which some density matrix satisfies , it asserts
and that the supremum on the right is attained. Here a density matrix is positive semidefinite with trace ; consists of nonnegative with such that each separate cost bound has a density matrix satisfying it; and
with the analogous definitions for the other maps, where for applied by continuous functional calculus. The product map acts by . Attainment means that an admissible pair realizes the supremum and its value dominates every admissible pair.
QAlgorithms.Papers.Independent.Gap48.P46.IsOptimalConstrainedEnsemble
For finite index types , with decidable equality on , any function , any set , and a finite ensemble with , , , and , this proposition requires that its average belongs to and that
Here , with evaluated by the real continuous functional calculus; each real supremum is if its defining set is empty or unbounded above. No channel assumption on or closedness assumption on is included. The average-membership condition makes the proposition impossible when is empty.
QAlgorithms.Papers.Independent.Gap48.P46.LinearAdditive
For finite index types , each equipped with decidable equality, and arbitrary maps and , this property asserts the following equality for every positive semidefinite , positive semidefinite , and real budgets satisfying and making both sets
nonempty:
Here the map is defined on every matrix by
where is the matrix with entry at and zero elsewhere. For any such map , is the real supremum of
over all natural numbers , nonnegative real weights with , and positive semidefinite trace-one matrices with . The entropy expression is , using the stated real functional calculus. The partial traces have entries and . No channel, linearity, or positivity assumptions are imposed on or . Empty index types are allowed; if either input index type is empty, there are no admissible budgets for that side and the property is vacuous. The suprema are total real suprema and do not assert attainment.
QAlgorithms.Papers.Independent.Gap48.P46.MaximizesValue
For any type , subset , function , and real number , this property means that is a greatest element of : there exists with , and every satisfies . It does not require the maximizing point to be unique. If is empty, the property is false for every .
QAlgorithms.Papers.Independent.Gap48.P46.PartialTraceConstrained
This proposition says that for every four finite, nonempty types , each with decidable equality, and every nonempty closed sets and , one has
Here is the set of positive semidefinite matrices of trace , , and . The joint map is explicitly
and , are the marginals obtained by summing the other register's diagonal indices. For any map , is the real supremum of over every finite ensemble of density matrices with nonnegative weights summing to and mean , with and applied by continuous functional calculus. No convexity assumption is imposed on either constraint set.
QAlgorithms.Papers.Independent.Gap48.P46.ProductChiAdditive
For finite index types , each equipped with decidable equality, and arbitrary maps and , this property asserts that every pair of positive semidefinite trace-one matrices on and on satisfies
The product matrix has entries , and
where is a matrix unit. For each map , is the real supremum of
over all finite ensembles indexed by , with , nonnegative real weights summing to one, positive semidefinite trace-one constituent matrices, and average . Here . No channel or linearity assumptions are imposed on either map, and no optimizing ensemble is asserted to exist. Empty index types are included; if or is empty, the required pair of density matrices does not exist and the condition is vacuous.
QAlgorithms.Papers.Independent.Gap48.P46.ProductRoofAdditive
For finite index types , each with decidable equality, and arbitrary maps and , this property asserts that all positive semidefinite trace-one matrices on and on satisfy
For any map , is the real infimum of over every , every family of nonnegative real weights summing to one, and every family of positive semidefinite trace-one matrices with average ; these constituent matrices are not required to be pure. Here
where denotes a matrix unit, and . Neither map is assumed to be linear, positive, or a channel. The infima are total real infima and need not be attained. Empty types are permitted; if either input index type is empty, the quantification over the required density matrices is vacuous.
QAlgorithms.Papers.Independent.Gap48.P46.RoofSuperadditive
For finite index types , each with decidable equality, and arbitrary maps and , this property asserts that every positive semidefinite trace-one matrix on satisfies
For a map , the quantity is the real infimum of over all , nonnegative real weights summing to one, and positive semidefinite trace-one matrices satisfying ; the constituent matrices need not be pure. Here
where denotes a matrix unit. The two marginal matrices have entries and . No channel, linearity, or positivity conditions are assumed for or . Empty types are allowed; if an input index type is empty, no satisfies the density condition and the property is vacuous. These are total real infima, with no assertion that a minimizing ensemble exists.
QAlgorithms.Papers.Independent.Gap48.P46.WeakAt
For finite index types , with decidable equality, arbitrary maps and , matrices , , and , this predicate asserts an equality of constrained ensemble capacities together with attainment of the allocation supremum. Explicitly, call a matrix a density matrix when it is positive semidefinite with trace , put , where is applied by continuous functional calculus, and define
Let consist of pairs with , , and with at least one density matrix satisfying each of the respective cost bounds . Set . The assertion is
and this supremum belongs to and is at least every member of . Here the product map is defined on matrix units by
Neither map is assumed to be a channel, neither cost matrix is assumed positive semidefinite, and is unrestricted. The attainment clause requires to be nonempty. All displayed suprema are real order suprema; the underlying total operation returns for an empty or unbounded-above set.
QAlgorithms.Papers.Independent.Gap48.P46.admissibleTail
For every real number and natural number , this predicate means exactly
It excludes and , allows equality in both inequalities, and imposes no lower bound on .
QAlgorithms.Papers.Independent.Gap48.P46.allocations
For finite index types , arbitrary matrices , , and any real number , this definition gives the set of real pairs satisfying
such that there exists a positive semidefinite matrix on with and , and there exists a positive semidefinite matrix on with and . No positivity or Hermitian assumption is imposed on or . Empty index types are allowed, in which case the corresponding trace- witness cannot exist; the allocation set is also empty whenever .
QAlgorithms.Papers.Independent.Gap48.P46.blockAllocations
For a finite index type , a complex matrix indexed by , , and , this defines the set of functions such that
The witnesses may depend on . No positivity or Hermiticity assumption is imposed on , and no sign restriction is imposed directly on . For , the coordinate conditions are vacuous and the sum condition is , so the set contains the unique empty function for every .
QAlgorithms.Papers.Independent.Gap48.P46.blockObservable
For an index type with decidable equality, a complex matrix indexed by , and every natural number , this defines a matrix indexed by functions by
Thus each summand uses an entry of in one coordinate and requires equality in every other coordinate. No Hermiticity or positivity assumption is imposed on . When , the indexing set contains the unique empty function and the resulting one-by-one matrix is zero; when , the product in each summand is empty and equals .
QAlgorithms.Papers.Independent.Gap48.P46.budgetDomain
For a finite index type and any complex matrix , this defines the set of real numbers
No Hermitian or positivity assumption is imposed on . Negative budgets are excluded even if a density matrix satisfies their inequality; if is empty, this domain is empty.
QAlgorithms.Papers.Independent.Gap48.P46.constrainedChiCapacity
For finite index types , with decidable equality on , any function , and any set , this defines
where for , evaluated by the real continuous functional calculus. Each supremum is a real supremum, with value when its defining set is empty or unbounded above. In particular, is allowed and gives value . No channel assumption on , or nonemptiness, closedness, or density condition on , is required by this definition.
QAlgorithms.Papers.Independent.Gap48.P46.constrainedOperationalCapacity
For finite index types , with decidable equality, an arbitrary map , a matrix , and , this defines the real supremum of all such that, for every , all sufficiently large integer block lengths admit messages with , positive semidefinite trace-one input matrices on , and positive semidefinite output matrices on summing to , for which every message satisfies
Here , and . “Sufficiently large” means that some threshold , depending on , works for every . No channel or positivity hypothesis is added. This is a real-valued total supremum, returning if the set of qualifying rates is empty or unbounded above.
QAlgorithms.Papers.Independent.Gap48.P46.dephaseLabel
For any index type , natural number , and complex matrix indexed by , this defines the matrix
Thus all entries with equal second-coordinate labels are retained, including entries with , and entries with different labels are set to zero. No positivity, trace, or Hermiticity condition is imposed on . The case gives the unique matrix on the empty index type.
QAlgorithms.Papers.Independent.Gap48.P46.extensionSequence
For finite index types with decidable equality, an arbitrary map , a matrix , a real number , and a natural number , this definition is unless and ; when these conditions hold, put , and its value is
Here is the set of positive semidefinite matrices on of trace . For an input matrix indexed by , set and . The output of , indexed by the disjoint union of and , has -block , diagonal entries at and at , and all remaining entries zero. For any map , is the real supremum of over all finite ensembles of density matrices with nonnegative weights summing to and weighted mean ; , with applied by continuous functional calculus. These are total real suprema, with an empty supremum equal to . The definition assumes neither that is a channel nor that is an effect, and may be negative; consequently need not be nonnegative. In particular, always give .
QAlgorithms.Papers.Independent.Gap48.P46.finiteTilt
For finite index types with decidable equality, arbitrary maps and , a matrix , a real number , a natural number , and a matrix , this definition assigns the real number
Here, for any map between finite matrix spaces, is the real supremum of
over all natural numbers , nonnegative real weights summing to , and positive semidefinite matrices of trace whose weighted mean is ; , where is applied using the continuous functional calculus. The tensor map is defined on every matrix by
where and are matrix units. Neither map is required to be a channel, neither matrix is required to be a state or an effect, and need not lie in . Empty index types and are included; the real logarithm convention gives , and an empty set of ensemble values has real supremum .
QAlgorithms.Papers.Independent.Gap48.P46.fixedMeanChi
For finite index types , with decidable equality on , any function , and any matrix , this defines the real supremum
where , with applied through the real continuous functional calculus. No channel assumption on or density assumption on is supplied. An ensemble satisfying the displayed conditions necessarily has positive length and a density matrix as its average; if no such ensemble exists, the defining set is empty. The real supremum used here equals for an empty set or a set unbounded above.
QAlgorithms.Papers.Independent.Gap48.P46.flaggedChannelSum
For any input index type , finite type with decidable equality, family of finite types indexed by , arbitrary real weights , and arbitrary maps , this defines a map from matrices on to matrices indexed by the disjoint union . For every input matrix , its entries are
where in the first case is identified with an element of using the equality . Thus its diagonal block at is , and all blocks between different labels vanish. The weights need not be nonnegative or sum to one, and the maps need not be channels or linear. The types and may be empty; an empty gives an empty output index type.
QAlgorithms.Papers.Independent.Gap48.P46.jointExtensionSequence
For finite index types with decidable equality, arbitrary maps and , any set , any matrix , real number , and natural number , this definition is unless and . Otherwise, with , its value is
where consists of positive semidefinite matrices of trace . For a matrix on , write and ; the map has output block on , diagonal output at an additional label , diagonal output at each additional label , and zero elsewhere. For maps and , understood as maps on matrices, their tensor map has entries
For any such map , is the real supremum of over all finite ensembles of density matrices with nonnegative weights summing to and weighted mean , where and is applied by continuous functional calculus. Empty real suprema are . No channel assumptions, effect assumption on , nonnegativity assumption on , or nonemptiness, closedness, or density-matrix restriction on is imposed; give .
QAlgorithms.Papers.Independent.Gap48.P46.jointTilted
For finite index types with decidable equality, arbitrary maps and , an arbitrary matrix , any real number , and any matrix , this definition assigns
For a map , denotes the real supremum of over all finite ensembles of positive semidefinite, trace- matrices , with nonnegative real weights summing to and weighted mean ; , where is applied by continuous functional calculus. The tensor map is given by
using matrix units and . No channel, positivity, normalization, or sign assumptions are imposed on the supplied maps, matrices, or ; empty index types are included, and an empty ensemble-value set has real supremum .
QAlgorithms.Papers.Independent.Gap48.P46.linearConstraint
For a finite index type , any complex matrix , and any real number , this defines
The matrix is not assumed Hermitian or positive semidefinite, and need not be nonnegative. The set may be empty, including whenever is empty.
QAlgorithms.Papers.Independent.Gap48.P46.maxValue
For any type , subset , and function , this defines the real number , using the total real supremum operation. No nonemptiness, boundedness, continuity, or attainment hypothesis is imposed. In particular, this operation returns when the image is empty or is unbounded above; the definition does not assert that the value is achieved by any point of .
QAlgorithms.Papers.Independent.Gap48.P46.secondConstraint
For finite index types and any set of complex matrices on , this defines the set
The constraint therefore requires the partial trace over to belong to . The set is otherwise arbitrary: it need not be nonempty, closed, or a set of density matrices. If is empty, or if either or is empty, the defined set is empty.
QAlgorithms.Papers.Independent.Gap48.P46.sectionDomain
For an additive commutative monoid equipped with a real module structure, a subset , a real-linear map , and an arbitrary binary relation on , this defines the set
Thus membership requires at least one witness in the corresponding section. No positivity restriction on or additional property of is imposed; if is empty, this domain is empty.
QAlgorithms.Papers.Independent.Gap48.P46.sectionSet
For an additive commutative monoid equipped with a real module structure, a subset , a real-linear map , an arbitrary binary relation on , and , this defines
No topological structure, nonemptiness assumption, or restriction on the relation is imposed; in particular, the relation need not be an inequality or equality.
QAlgorithms.Papers.Independent.Gap48.P46.sectionValue
For an additive commutative monoid equipped with a real module structure, a subset , an arbitrary function , a real-linear map , an arbitrary binary relation on , and , this defines
The definition imposes no continuity, boundedness, nonemptiness, or attainment requirement. It uses the total real supremum operation, which returns when the displayed set is empty or unbounded above.
QAlgorithms.Papers.Independent.Gap48.P46.shor
For a finite input index type with decidable equality, an output index type , an arbitrary map , an arbitrary matrix , a real number , and a natural number , this defines a map from matrices on to matrices indexed by . Given an input matrix , write
The output block on is . The other output block is diagonal, with entry at and entry at the label ; all other entries, including entries connecting the two output blocks, are zero. These are complex traces without taking their real parts. No channel assumption is imposed on , no effect or Hermiticity assumption is imposed on , and is unrestricted. The value is included: the input index type is then empty, , the -block is , and the only entry of the other block is zero.
QAlgorithms.Papers.Independent.Gap48.P46.shorEnsembleDistance
For finite index types , with decidable equality on , a finite ensemble with nonnegative real weights summing to and positive semidefinite trace- matrices , any function , and any matrix , this defines the extended nonnegative real number
Here , viewed in , and unless are both positive semidefinite with trace and ; when these conditions hold,
with both matrix functions evaluated by the real continuous functional calculus and the natural logarithm. No channel assumption on or density assumption on is imposed. The sum uses extended nonnegative arithmetic, including , so a zero-weight term contributes zero even when its relative entropy is infinite.
QAlgorithms.Papers.Independent.Gap48.P46.shorEnsembleEntropy
For finite index types , with decidable equality on , let be a finite ensemble consisting of a natural number , real weights with , and positive semidefinite matrices with . For any function , this defines
where is evaluated by the real continuous functional calculus. No channel, linearity, or density-preservation assumption is imposed on . Zero weights are allowed; cannot satisfy the ensemble’s weight-sum requirement.
QAlgorithms.Papers.Independent.Gap48.P46.shorTiltObjective
For finite index types , with decidable equality on , an arbitrary map , arbitrary matrices , and any real number , this definition assigns
The quantity is the real supremum of
over every finite ensemble consisting of a natural number of positive semidefinite matrices of trace and nonnegative real weights satisfying and . Here , with applied by continuous functional calculus. There is no assumption that is a channel, that is an effect, that is a density matrix, or that is nonnegative. Empty index types are permitted, and if no such ensemble exists, the real supremum defining is .
QAlgorithms.Papers.Independent.Gap48.P46.singletonMixedEnsemble
For a finite type , a complex matrix indexed by , and a hypothesis that is positive semidefinite with , this definition constructs an ensemble with exactly one entry: its probability is , and its state is . Thus its probability is nonnegative, its probabilities sum to , and its sole state is a density matrix. If is empty, the trace condition cannot hold.
QAlgorithms.Papers.Independent.Gap48.P46.states
For a finite type , this defines the set of complex matrices indexed by that are positive semidefinite and have trace exactly :
The type may be empty; in that case this set is empty.
QAlgorithms.Papers.Independent.Gap48.P46.sumObservable
For any index types with decidable equality and arbitrary complex matrices indexed by and indexed by , this definition gives the matrix
where the two 's are identity matrices and is the Kronecker delta. Neither finiteness nor nonemptiness of the index types, nor Hermitian or positivity assumptions on the matrices, is required.
QAlgorithms.Papers.Independent.Gap48.P46.tensorMarginalConstraint
For finite index types and arbitrary sets , , this defines the set of matrices that are positive semidefinite, have trace , and satisfy
Thus the first condition constrains the marginal on , and the second constrains the marginal on . The sets are not assumed nonempty or closed. The resulting set is empty if either index type or either constraint set is empty.
QAlgorithms.Papers.Independent.Gap48.P46.twoBranchFlaggedChannel
For index types , an arbitrary real number , and arbitrary maps and , this defines the map into matrices indexed by the disjoint union whose value on every input matrix is
The first block uses indices from , the second uses indices from , and all entries between the two summands are zero. There is no restriction , and neither map is assumed to be a channel or linear. The index types may be empty, in which case their corresponding blocks have no entries.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.