Definitions for Quantum broadcast channels
DefinitionQAlgorithms_Papers_Independent_Gap48_P39The objects the formalized statements of Quantum broadcast channels (arXiv:quant-ph/0603098) are stated in. Each was checked against the paper by a blind read-back and a moderator.
CQChannel: Classical-input broadcast channel, PDF p.2. Normalization excludes empty outputs.CQChannel.word: The actual memoryless product output for an input word, PDF p.4.rank: Source rank convention floor(2^(nR)), PDF p.4; at nonnegative rates it is positive.NonnegativeTriple: Nonnegative classical common/Bob/Charlie rates, PDF p.4.NonnegativePair: Nonnegative two-resource rates, with task-specific coordinate interpretation.CQBroadcastCode: Deterministic words and separate decoding POVMs, PDF p.4.CQBroadcastCode.Good: Joint maximum-error test, for EVERY message triple, PDF p.4.cqBroadcastAchievable: Vanishing maximum joint error at fixed rates; all sufficiently large positive n, PDF p.4.cqBroadcastCapacity: Operational CLOSED classical capacity, not an entropic definition, PDF p.4.labelEntropy: H(T) for a joint probability distribution, PDF pp.3–5.cqTB: The actual TB marginal of (14); weights stay subnormalized, including zero weights.cqTC: The actual TC marginal of (14), PDF p.4.superpositionPrivateInfo: I(X;B|T) in (14), using H(BT)-H(T)-sum p(t,x) H(B_x), PDF pp.4–5.commonInfo: I(T;C) in (14), PDF p.4.totalInfo: I(X;B) in (14), PDF p.4.SuperpositionBounds: The three simultaneous inequalities (13), without hiding the sum-rate bound.superpositionCap: Classical auxiliary cap, PDF pp.4,14; all physical output dimensions are positive.superpositionRegion: Classical auxiliary union;noneallows every finite auxiliary, PDF p.4.Degraded: Source degradedness involves marginal channels, not a recovery map for BC, PDF pp.2,4.CommutingBob: Bob marginal commutation only, PDF p.4.QuantumAux: Quantum auxiliary data (15). There is no upper bound on its dimension, PDF p.4.quantumTB: TB marginal of (15), with X traced out, PDF p.4.quantumTC: TC marginal of (15), PDF p.4.quantumPrivateInfo: I(X;B|T) of (15); conditional independence given classical X eliminates H(T|X).quantumOuterRegion: Quantum-auxiliary outer region, PDF pp.4,7. The optional sum inequality is §II-C.degradedClassicalRegion: Reduced two-inequality classical region in Theorem 2, PDF p.4.wordType: Empirical type of a positive-length word; n=0 is never used by the theorem, PDF p.4.CommonCode: Common-message code, with an indexed word family (not assumed injective), PDF p.4.CommonCode.Good: Constant composition, l1 type approximation and joint maximum-error test, PDF p.4.BroadcastInstrument: Rectangular instrument with finitely many Kraus operators per classical branch, §I-B p.3 and §§III,V pp.7,12–13. Padding permits a common Kraus rank.BroadcastInstrument.branch: The subnormalized quantum state in a branch, PDF p.3.BroadcastInstrument.output: An instrument's explicit classical block output, not a coherent branch label, PDF p.3.measurement: A POVM as a classical-output channel, §I-B p.3.CQCode: CQ entanglement generation code, §III p.7: pure preparation for every common message, Bob's instrument, and Charlie's measurement. No shared resources/messages.CQCode.decoded: Decoding AFTER the channel, preserving Alice's reference, §III p.7.commonEprTarget: Both correct common labels AND an EPR of rank k in one joint target, p.7.CQCode.Good: Single JOINT fidelity test for every message, §III p.7.cqAchievable: Vanishing-error cq rates, §III p.7; first coordinate common bits, second EPR ebits.cqGenerationCapacity: CQ(N), the independently defined closed operational region, §III p.7.ensembleBob: Conditional reference/Bob state computed from the input and channel, p.8.ensembleCharlie: Conditional Charlie output of the same input, p.8.ensembleCoherent: I(A coherent-to BT), averaged over classical T. Individual terms may be negative, pp.7–8.ensembleCommon: Minimum of BOTH receiver Holevo informations, pp.7–8.quantumCap: Auxiliary cardinality cap in Theorems 3/5, PDF pp.8,11,14.quantumInformationRegion: Single-letter information union.bounded=trueimposes the source's cap; otherwise every finite T is allowed. First coordinate is common classical or GHZ.regularizedQuantumRegion: RAW regularized union over strictly positive blocklengths, as defined p.4. The closures in the capacity theorems are separate, justified by pp.10,12.rankGhzDensity: Arbitrary-rank tripartite GHZ density, §IV p.11. m is positive when used as a target.qqTarget: PRODUCT EPR_k and GHZ_m, regrouped as Alice,Bob,Charlie, §IV p.11.QQCode: EPR–GHZ generation code: one pure encoding and separate CPTP decoders, p.11.QQCode.decoded: Correct composition order: channel first, local decoders second, pp.11–12. This corrects the ill-typed printed display in the operational definition on p.11.QQCode.Good: One joint fidelity test to the PRODUCT target; not two marginal tests, p.11.qqAchievable: Quantum rate order (GHZ,EPR_B), §IV p.11.qqCapacity: Q(N), the closed operational EPR–GHZ region, §IV p.11.DephasingData: Generalized-dephasing environment vectors need not be orthogonal, pp.3,8,11.DephasingData.isometry: U|x> = |x>_B |psi_x>_O, a rectangular isometry because the vectors are unit, pp.8,11.generalizedDephasingBroadcast: Keep B,C and discard ONLY E. N itself need not be isometric, Theorem 4 p.8.dephasingRegion: The dephasing entropy union, pp.8,11. F retains Charlie's part of O=CE (or all O=C). H(TX)-H(TO)=H(X|T)-H(O|T); no division by zero-weight p(t).qutritPinching: The rank-(2,1) qutrit pinching map, PDF p.8.pinchingRegion: Equation (25) p.8: downward closure of (f(p),p), 0≤p≤1. The printed Figure 1 interchanges the flat/curved resource roles and is not used.twoEprTarget: Two independent EPR resources regrouped by owner, §V p.13.TwoEprCode: Unassisted two-EPR GENERATION code: freely prepared pure block input with retained local references; separate decoders and no classical side messages, p.13.TwoEprCode.decoded: Unassisted generation output, with both external Alice registers retained, p.13.twoEprAchievable: Vanishing joint error to independent EPRs, §V p.13.twoEprCapacity: Closed two-EPR generation region; rank-one axes remain present, p.13.TwoEprTransmissionCode: Two-EPR TRANSMISSION code: Alice acts ONLY on supplied sender halves. The two external references are fixed independent EPR halves, not freely prepared, p.13.TwoEprTransmissionCode.decoded: External references untouched throughout encoding, channel and decoding, p.13.twoEprTransmissionAchievable: Independent entanglement transmission rates with no side communication, p.13.twoEprTransmissionCapacity: Closed transmission region, separately defined from generation, p.13.twoEprInformation: The two coherent informations of ONE joint input (references may be correlated), p.13.assistedTarget: AC and BC EPRs, product and regrouped as Alice,(Bob,(Charlie_AC,Charlie_BC)), p.13.ReceiverMergingCode: One-way receiver-assisted code, §V pp.12–13: Alice prepares a pure input; Bob retains an EPR half and sends ONE classical branch to Charlie, who decodes conditionally. No initial entanglement or other messages/shared randomness.ReceiverMergingCode.decoded: Sum over the ACTUAL communicated branch, retain both EPR resources, p.13.assistedAchievable: Simultaneous AC,BC rates from one-way Bob-to-Charlie assisted codes, p.13.mergingInformation: (I(A coherent-to BC),I(B coherent-to C)) from one pure reference/input, p.13.rawRegularizedSuperposition: Positive blocklength raw superposition union of §II p.4, keeping all three inequalities on the ACTUAL block channel; independent of the capacity region.binaryExample: The p.4 separation example: constant singleton Bob, noiseless binary Charlie.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Channel
import Definitions.Def_QAlgorithms_Defs_Ensemble
import Definitions.Def_QAlgorithms_Defs_MatrixDistances
import Definitions.Def_QAlgorithms_Defs_QuantumInformation
import Definitions.Def_QAlgorithms_Defs_QuantumOutputMetrics
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P08
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P19
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P03
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P67
/-!
Quantum broadcast channels, arXiv:quant-ph/0603098v2.
All page references are PDF pages. Entropies/rates are in bits, distances are full
trace norms, and fidelity is squared. Operational regions are defined independently
of information regions. Only accepted pinned modules are imported. Compilation is
pending the batch handoff. Source corrections are recorded in MODERATION_NOTES.md.
-/
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Gap48.P39
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks holevoInfo)
open QAlgorithms.Papers.Independent.Dependency50.P19 (both epr mutualInformation marginalRA marginalRB)
open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity conditionalEntropy groupedChannelPower)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C X T E : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype X] [DecidableEq X]
variable [Fintype T] [DecidableEq T] [Fintype E] [DecidableEq E]
/-- Classical-input broadcast channel, PDF p.2. Normalization excludes empty outputs. -/
structure CQChannel (X B C : Type) [Fintype B] [Fintype C] where
state : X → Op (B × C)
density : ∀ x, IsDensityMatrix (state x)
/-- The actual memoryless product output for an input word, PDF p.4. -/
def CQChannel.word {n : ℕ} (W : CQChannel X B C) (x : Fin n → X) :
Op ((Fin n → B) × (Fin n → C)) :=
fun i j => ∏ k, W.state (x k) (i.1 k, i.2 k) (j.1 k, j.2 k)
/-- Source rank convention floor(2^(nR)), PDF p.4; at nonnegative rates it is positive. -/
def rank (n : ℕ) (R : ℝ) : ℕ := ⌊Real.rpow 2 ((n : ℝ) * R)⌋₊
/-- Nonnegative classical common/Bob/Charlie rates, PDF p.4. -/
def NonnegativeTriple (r : ℝ × ℝ × ℝ) : Prop :=
0 ≤ r.1 ∧ 0 ≤ r.2.1 ∧ 0 ≤ r.2.2
/-- Nonnegative two-resource rates, with task-specific coordinate interpretation. -/
def NonnegativePair (r : ℝ × ℝ) : Prop := 0 ≤ r.1 ∧ 0 ≤ r.2
/-- Deterministic words and separate decoding POVMs, PDF p.4. -/
structure CQBroadcastCode (X B C : Type) [Fintype B] [Fintype C]
[DecidableEq B] [DecidableEq C] (n m k l : ℕ) where
word : Fin m → Fin k → Fin l → (Fin n → X)
bob : (Fin m × Fin k) → Op (Fin n → B)
bob_povm : IsPOVM bob
charlie : (Fin m × Fin l) → Op (Fin n → C)
charlie_povm : IsPOVM charlie
/-- Joint maximum-error test, for EVERY message triple, PDF p.4. -/
def CQBroadcastCode.Good {n m k l : ℕ} (D : CQBroadcastCode X B C n m k l)
(W : CQChannel X B C) (epsilon : ℝ) : Prop :=
∀ s i j, 1 - epsilon ≤ effectProb
(Matrix.kronecker (D.bob (s, i)) (D.charlie (s, j))) (W.word (D.word s i j))
/-- Vanishing maximum joint error at fixed rates; all sufficiently large positive n, PDF p.4. -/
def cqBroadcastAchievable (W : CQChannel X B C) (r : ℝ × ℝ × ℝ) : Prop :=
NonnegativeTriple r ∧ ∀ epsilon > (0 : ℝ), ∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ D : CQBroadcastCode X B C n (rank n r.1) (rank n r.2.1) (rank n r.2.2),
D.Good W epsilon
/-- Operational CLOSED classical capacity, not an entropic definition, PDF p.4. -/
def cqBroadcastCapacity (W : CQChannel X B C) : Set (ℝ × ℝ × ℝ) :=
closure {r | cqBroadcastAchievable W r}
/-- H(T) for a joint probability distribution, PDF pp.3–5. -/
def labelEntropy (p : Distribution (T × X)) : ℝ :=
vnEntropy (Matrix.diagonal fun t => ((∑ x, p.val (t, x) : ℝ) : ℂ))
/-- The actual TB marginal of (14); weights stay subnormalized, including zero weights. -/
def cqTB (W : CQChannel X B C) (p : Distribution (T × X)) : Op (T × B) :=
cqBlocks fun t => ∑ x, (p.val (t, x) : ℂ) • traceRight (W.state x)
/-- The actual TC marginal of (14), PDF p.4. -/
def cqTC (W : CQChannel X B C) (p : Distribution (T × X)) : Op (T × C) :=
cqBlocks fun t => ∑ x, (p.val (t, x) : ℂ) • traceLeft (W.state x)
/-- I(X;B|T) in (14), using H(BT)-H(T)-sum p(t,x) H(B_x), PDF pp.4–5. -/
def superpositionPrivateInfo (W : CQChannel X B C) (p : Distribution (T × X)) : ℝ :=
vnEntropy (cqTB W p) - labelEntropy p -
∑ t, ∑ x, p.val (t, x) * vnEntropy (traceRight (W.state x))
/-- I(T;C) in (14), PDF p.4. -/
def commonInfo (W : CQChannel X B C) (p : Distribution (T × X)) : ℝ :=
mutualInformation (cqTC W p)
/-- I(X;B) in (14), PDF p.4. -/
def totalInfo (W : CQChannel X B C) (p : Distribution (T × X)) : ℝ :=
holevoInfo (fun x => ∑ t, p.val (t, x)) (fun x => traceRight (W.state x))
/-- The three simultaneous inequalities (13), without hiding the sum-rate bound. -/
def SuperpositionBounds (W : CQChannel X B C) (p : Distribution (T × X))
(r : ℝ × ℝ × ℝ) : Prop :=
NonnegativeTriple r ∧ r.2.1 ≤ superpositionPrivateInfo W p ∧
r.1 + r.2.2 ≤ commonInfo W p ∧ r.1 + r.2.1 + r.2.2 ≤ totalInfo W p
/-- Classical auxiliary cap, PDF pp.4,14; all physical output dimensions are positive. -/
def superpositionCap (X B C : Type) [Fintype X] [Fintype B] [Fintype C] : ℕ :=
min (Fintype.card X) (Fintype.card B ^ 2 + Fintype.card C ^ 2 - 1)
/-- Classical auxiliary union; `none` allows every finite auxiliary, PDF p.4. -/
def superpositionRegion (W : CQChannel X B C) (cap : Option ℕ) : Set (ℝ × ℝ × ℝ) :=
{r | ∃ t : ℕ, 0 < t ∧ (∀ b ∈ cap, t ≤ b) ∧
∃ p : Distribution (Fin t × X), SuperpositionBounds W p r}
/-- Source degradedness involves marginal channels, not a recovery map for BC, PDF pp.2,4. -/
def Degraded (W : CQChannel X B C) : Prop :=
∃ M : Superop B C, IsChannel M ∧ ∀ x, traceLeft (W.state x) = M (traceRight (W.state x))
/-- Bob marginal commutation only, PDF p.4. -/
def CommutingBob (W : CQChannel X B C) : Prop :=
∀ x y, traceRight (W.state x) * traceRight (W.state y) =
traceRight (W.state y) * traceRight (W.state x)
/-- Quantum auxiliary data (15). There is no upper bound on its dimension, PDF p.4. -/
structure QuantumAux (X T : Type) [Fintype X] [Fintype T] where
probability : Distribution X
state : X → Op T
density : ∀ x, IsDensityMatrix (state x)
/-- TB marginal of (15), with X traced out, PDF p.4. -/
def quantumTB (W : CQChannel X B C) (S : QuantumAux X T) : Op (T × B) :=
∑ x, (S.probability.val x : ℂ) • Matrix.kronecker (S.state x) (traceRight (W.state x))
/-- TC marginal of (15), PDF p.4. -/
def quantumTC (W : CQChannel X B C) (S : QuantumAux X T) : Op (T × C) :=
∑ x, (S.probability.val x : ℂ) • Matrix.kronecker (S.state x) (traceLeft (W.state x))
/-- I(X;B|T) of (15); conditional independence given classical X eliminates H(T|X). -/
def quantumPrivateInfo (W : CQChannel X B C) (S : QuantumAux X T) : ℝ :=
vnEntropy (quantumTB W S) - vnEntropy (∑ x, (S.probability.val x : ℂ) • S.state x) -
∑ x, S.probability.val x * vnEntropy (traceRight (W.state x))
/-- Quantum-auxiliary outer region, PDF pp.4,7. The optional sum inequality is §II-C. -/
def quantumOuterRegion (W : CQChannel X B C) (sumBound : Bool) : Set (ℝ × ℝ × ℝ) :=
{r | NonnegativeTriple r ∧ ∃ t : ℕ, 0 < t ∧ ∃ S : QuantumAux X (Fin t),
r.2.1 ≤ quantumPrivateInfo W S ∧ r.1 + r.2.2 ≤ mutualInformation (quantumTC W S) ∧
(sumBound = true → r.1 + r.2.1 + r.2.2 ≤
holevoInfo S.probability.val (fun x => traceRight (W.state x)))}
/-- Reduced two-inequality classical region in Theorem 2, PDF p.4. -/
def degradedClassicalRegion (W : CQChannel X B C) : Set (ℝ × ℝ × ℝ) :=
{r | NonnegativeTriple r ∧ ∃ t : ℕ, 0 < t ∧ t ≤ min (Fintype.card X) (Fintype.card B ^ 2) ∧
∃ p : Distribution (Fin t × X), r.2.1 ≤ superpositionPrivateInfo W p ∧ r.1 + r.2.2 ≤ commonInfo W p}
/-- Empirical type of a positive-length word; n=0 is never used by the theorem, PDF p.4. -/
def wordType {n : ℕ} (x : Fin n → X) (a : X) : ℝ :=
((Finset.univ.filter fun i => x i = a).card : ℝ) / n
/-- Common-message code, with an indexed word family (not assumed injective), PDF p.4. -/
structure CommonCode (X B C : Type) [Fintype B] [Fintype C]
[DecidableEq B] [DecidableEq C] (n m : ℕ) where
word : Fin m → (Fin n → X)
bob : Fin m → Op (Fin n → B)
bob_povm : IsPOVM bob
charlie : Fin m → Op (Fin n → C)
charlie_povm : IsPOVM charlie
/-- Constant composition, l1 type approximation and joint maximum-error test, PDF p.4. -/
def CommonCode.Good {n m : ℕ} (D : CommonCode X B C n m) (W : CQChannel X B C)
(p : Distribution X) (epsilon delta : ℝ) : Prop :=
∃ P : X → ℝ, (∑ x, |P x - p.val x|) ≤ delta ∧
∀ s, (∀ x, wordType (D.word s) x = P x) ∧
1 - epsilon ≤ effectProb (Matrix.kronecker (D.bob s) (D.charlie s)) (W.word (D.word s))
/-- Normalization sanity: no asymptotic definition uses the empty block. -/
example : rank 0 0 = 1 := by simp [rank]
/-- The zero-use product is the singleton identity. -/
example (W : CQChannel X B C) (x : Fin 0 → X)
(i j : (Fin 0 → B) × (Fin 0 → C)) : W.word x i j = 1 := by simp [CQChannel.word]
/-- Empirical type on one use is the point mass at the input symbol. -/
example (x : Fin 1 → X) (a : X) : wordType x a = (if x 0 = a then 1 else 0) := by
by_cases h : x 0 = a
· have hfilter :
(Finset.univ.filter fun i : Fin 1 => x i = a) = Finset.univ := by
apply Finset.filter_eq_self.mpr
intro i _
have hi : i = (0 : Fin 1) := Subsingleton.elim _ _
rw [hi]
exact h
unfold wordType
rw [hfilter]
simp [h]
· simp [wordType, h]
/-- Rectangular instrument with finitely many Kraus operators per classical branch,
§I-B p.3 and §§III,V pp.7,12–13. Padding permits a common Kraus rank. -/
structure BroadcastInstrument (I J O : Type) [Fintype I] [Fintype J] [Fintype O] [DecidableEq I] where
krausRank : ℕ
kraus : O → Fin krausRank → Matrix J I ℂ
normalized : ∑ o, ∑ k, (kraus o k)ᴴ * kraus o k = 1
/-- The subnormalized quantum state in a branch, PDF p.3. -/
def BroadcastInstrument.branch {I J O : Type} [Fintype I] [Fintype J] [Fintype O] [DecidableEq I]
(D : BroadcastInstrument I J O) (o : O) : Superop I J := krausApply (D.kraus o)
/-- An instrument's explicit classical block output, not a coherent branch label, PDF p.3. -/
def BroadcastInstrument.output {I J O : Type} [Fintype I] [Fintype J] [Fintype O] [DecidableEq I]
(D : BroadcastInstrument I J O) : Superop I (O × J) :=
fun rho => cqBlocks fun o => D.branch o rho
/-- A POVM as a classical-output channel, §I-B p.3. -/
def measurement {I O : Type} [Fintype I] [DecidableEq O] (M : O → Op I) : Superop I O :=
fun rho => Matrix.diagonal fun o => (M o * rho).trace
/-- CQ entanglement generation code, §III p.7: pure preparation for every common
message, Bob's instrument, and Charlie's measurement. No shared resources/messages. -/
structure CQCode (A B C : Type) [Fintype A] [Fintype B] [Fintype C]
[DecidableEq B] [DecidableEq C] (n m k : ℕ) where
encode : Fin m → EuclideanSpace ℂ (Fin k × (Fin n → A))
unit : ∀ s, IsState (encode s)
bob : BroadcastInstrument (Fin n → B) (Fin k) (Fin m)
charlie : Fin m → Op (Fin n → C)
charlie_povm : IsPOVM charlie
/-- Decoding AFTER the channel, preserving Alice's reference, §III p.7. -/
def CQCode.decoded {n m k : ℕ} (D : CQCode A B C n m k)
(N : Superop A (B × C)) (s : Fin m) : Op (Fin k × ((Fin m × Fin k) × Fin m)) :=
idTensorSuperop (both D.bob.output (measurement D.charlie))
(idTensorSuperop (groupedChannelPower N n) (pureDensity (D.encode s)))
/-- Both correct common labels AND an EPR of rank k in one joint target, p.7. -/
def commonEprTarget (m k : ℕ) (s : Fin m) : Op (Fin k × ((Fin m × Fin k) × Fin m)) :=
fun i j => if i.2.1.1 = s ∧ i.2.2 = s ∧ j.2.1.1 = s ∧ j.2.2 = s then
epr k (i.1, i.2.1.2) (j.1, j.2.1.2) else 0
/-- Single JOINT fidelity test for every message, §III p.7. -/
def CQCode.Good {n m k : ℕ} (D : CQCode A B C n m k) (N : Superop A (B × C))
(epsilon : ℝ) : Prop :=
∀ s, 1 - epsilon ≤ squaredFidelity (D.decoded N s) (commonEprTarget m k s)
/-- Vanishing-error cq rates, §III p.7; first coordinate common bits, second EPR ebits. -/
def cqAchievable (N : Superop A (B × C)) (r : ℝ × ℝ) : Prop :=
NonnegativePair r ∧ ∀ epsilon > (0 : ℝ), ∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ D : CQCode A B C n (rank n r.1) (rank n r.2), D.Good N epsilon
/-- CQ(N), the independently defined closed operational region, §III p.7. -/
def cqGenerationCapacity (N : Superop A (B × C)) : Set (ℝ × ℝ) := closure {r | cqAchievable N r}
/-- Conditional reference/Bob state computed from the input and channel, p.8. -/
def ensembleBob {a : ℕ} (S : PureEnsemble (Fin a × A)) (N : Superop A (B × C))
(s : Fin S.count) : Op (Fin a × B) :=
marginalRA (idTensorSuperop N (pureDensity (S.vector s)))
/-- Conditional Charlie output of the same input, p.8. -/
def ensembleCharlie {a : ℕ} (S : PureEnsemble (Fin a × A)) (N : Superop A (B × C))
(s : Fin S.count) : Op C := traceLeft (traceLeft (idTensorSuperop N (pureDensity (S.vector s))))
/-- I(A coherent-to BT), averaged over classical T. Individual terms may be negative, pp.7–8. -/
def ensembleCoherent {a : ℕ} (S : PureEnsemble (Fin a × A)) (N : Superop A (B × C)) : ℝ :=
∑ s, S.weight s * (vnEntropy (traceLeft (ensembleBob S N s)) - vnEntropy (ensembleBob S N s))
/-- Minimum of BOTH receiver Holevo informations, pp.7–8. -/
def ensembleCommon {a : ℕ} (S : PureEnsemble (Fin a × A)) (N : Superop A (B × C)) : ℝ :=
min (holevoInfo S.weight (fun s => traceLeft (ensembleBob S N s)))
(holevoInfo S.weight (ensembleCharlie S N))
/-- Auxiliary cardinality cap in Theorems 3/5, PDF pp.8,11,14. -/
def quantumCap (A B C : Type) [Fintype A] [Fintype B] [Fintype C] : ℕ :=
min (Fintype.card A ^ 2) (Fintype.card B ^ 2 + Fintype.card C ^ 2 - 1)
/-- Single-letter information union. `bounded=true` imposes the source's cap;
otherwise every finite T is allowed. First coordinate is common classical or GHZ. -/
def quantumInformationRegion (N : Superop A (B × C)) (bounded : Bool) : Set (ℝ × ℝ) :=
{r | NonnegativePair r ∧ ∃ a : ℕ, 0 < a ∧
∃ S : PureEnsemble (Fin a × A), 0 < S.count ∧
(bounded = true → S.count ≤ quantumCap A B C) ∧
r.2 ≤ ensembleCoherent S N ∧ r.1 ≤ ensembleCommon S N}
/-- RAW regularized union over strictly positive blocklengths, as defined p.4.
The closures in the capacity theorems are separate, justified by pp.10,12. -/
def regularizedQuantumRegion (N : Superop A (B × C)) : Set (ℝ × ℝ) :=
{r | ∃ n : ℕ, 0 < n ∧ ((n : ℝ) * r.1, (n : ℝ) * r.2) ∈
quantumInformationRegion (groupedChannelPower N n) true}
/-- Arbitrary-rank tripartite GHZ density, §IV p.11. m is positive when used as a target. -/
def rankGhzDensity (m : ℕ) : Op (Fin m × (Fin m × Fin m)) :=
fun i j => if i.1 = i.2.1 ∧ i.1 = i.2.2 ∧ j.1 = j.2.1 ∧ j.1 = j.2.2 then
(m : ℂ)⁻¹ else 0
/-- PRODUCT EPR_k and GHZ_m, regrouped as Alice,Bob,Charlie, §IV p.11. -/
def qqTarget (m k : ℕ) : Op ((Fin k × Fin m) × ((Fin k × Fin m) × Fin m)) :=
fun i j => epr k (i.1.1, i.2.1.1) (j.1.1, j.2.1.1) *
rankGhzDensity m (i.1.2, (i.2.1.2, i.2.2)) (j.1.2, (j.2.1.2, j.2.2))
/-- EPR–GHZ generation code: one pure encoding and separate CPTP decoders, p.11. -/
structure QQCode (A B C : Type) [Fintype A] [Fintype B] [Fintype C]
[DecidableEq B] [DecidableEq C] (n m k : ℕ) where
encode : EuclideanSpace ℂ ((Fin k × Fin m) × (Fin n → A))
unit : IsState encode
bob : Superop (Fin n → B) (Fin k × Fin m)
bob_channel : IsChannel bob
charlie : Superop (Fin n → C) (Fin m)
charlie_channel : IsChannel charlie
/-- Correct composition order: channel first, local decoders second, pp.11–12.
This corrects the ill-typed printed display in the operational definition on p.11. -/
def QQCode.decoded {n m k : ℕ} (D : QQCode A B C n m k) (N : Superop A (B × C)) :
Op ((Fin k × Fin m) × ((Fin k × Fin m) × Fin m)) :=
idTensorSuperop (both D.bob D.charlie)
(idTensorSuperop (groupedChannelPower N n) (pureDensity D.encode))
/-- One joint fidelity test to the PRODUCT target; not two marginal tests, p.11. -/
def QQCode.Good {n m k : ℕ} (D : QQCode A B C n m k) (N : Superop A (B × C))
(epsilon : ℝ) : Prop := 1 - epsilon ≤ squaredFidelity (D.decoded N) (qqTarget m k)
/-- Quantum rate order (GHZ,EPR_B), §IV p.11. -/
def qqAchievable (N : Superop A (B × C)) (r : ℝ × ℝ) : Prop :=
NonnegativePair r ∧ ∀ epsilon > (0 : ℝ), ∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ D : QQCode A B C n (rank n r.1) (rank n r.2), D.Good N epsilon
/-- Q(N), the closed operational EPR–GHZ region, §IV p.11. -/
def qqCapacity (N : Superop A (B × C)) : Set (ℝ × ℝ) := closure {r | qqAchievable N r}
/-- Zero-rate resources have rank one, not dimension zero, pp.4,7,11. -/
example (n : ℕ) : rank n 0 = 1 := by simp [rank]
/-- Arbitrary-rank GHZ normalization formula has unit rank-one value. -/
example : rankGhzDensity 1 (0, (0, 0)) (0, (0, 0)) = 1 := by simp [rankGhzDensity]
/-- The independent target is constructed as the actual product, p.11. -/
example (m k : ℕ) (i j : (Fin k × Fin m) × ((Fin k × Fin m) × Fin m)) :
qqTarget m k i j = epr k (i.1.1, i.2.1.1) (j.1.1, j.2.1.1) *
rankGhzDensity m (i.1.2, (i.2.1.2, i.2.2)) (j.1.2, (j.2.1.2, j.2.2)) := rfl
/-- A common label appears as a diagonal block, so no unintended coherence is encoded. -/
example {I J O : Type} [Fintype I] [Fintype J] [Fintype O] [DecidableEq I]
(D : BroadcastInstrument I J O) (rho : Op I) (o p : O) (h : o ≠ p) (i j : J) :
D.output rho (o, i) (p, j) = 0 := by simp [BroadcastInstrument.output, cqBlocks, h]
/-- Generalized-dephasing environment vectors need not be orthogonal, pp.3,8,11. -/
structure DephasingData (X O : Type) [Fintype O] where
state : X → EuclideanSpace ℂ O
unit : ∀ x, IsState (state x)
/-- U|x> = |x>_B |psi_x>_O, a rectangular isometry because the vectors are unit, pp.8,11. -/
def DephasingData.isometry {O : Type} [Fintype O] (D : DephasingData X O) :
Matrix (X × O) X ℂ := fun i x => if i.1 = x then D.state x i.2 else 0
/-- Keep B,C and discard ONLY E. N itself need not be isometric, Theorem 4 p.8. -/
def generalizedDephasingBroadcast (D : DephasingData X (C × E)) : Superop X (X × C) :=
fun rho => idTensorSuperop traceRight (conjSuperop D.isometry rho)
/-- The dephasing entropy union, pp.8,11. F retains Charlie's part of O=CE
(or all O=C). H(TX)-H(TO)=H(X|T)-H(O|T); no division by zero-weight p(t). -/
def dephasingRegion {O : Type} [Fintype O] [DecidableEq O]
(D : DephasingData X O) (F : Superop O C) : Set (ℝ × ℝ) :=
{r | NonnegativePair r ∧ ∃ t : ℕ, 0 < t ∧ t ≤ Fintype.card X ∧
∃ p : Distribution (Fin t × X),
r.2 ≤ vnEntropy (Matrix.diagonal fun tx => (p.val tx : ℂ)) -
vnEntropy (cqBlocks fun s => ∑ x, (p.val (s, x) : ℂ) • pureDensity (D.state x)) ∧
r.1 ≤ mutualInformation (cqBlocks fun s =>
∑ x, (p.val (s, x) : ℂ) • F (pureDensity (D.state x)))}
/-- The rank-(2,1) qutrit pinching map, PDF p.8. -/
def qutritPinching : Superop (Fin 3) (Fin 3) :=
fun rho i j => if (i.val < 2 ↔ j.val < 2) then rho i j else 0
/-- Equation (25) p.8: downward closure of (f(p),p), 0≤p≤1.
The printed Figure 1 interchanges the flat/curved resource roles and is not used. -/
def pinchingRegion : Set (ℝ × ℝ) :=
{r | NonnegativePair r ∧ ∃ p : ℝ, 0 ≤ p ∧ p ≤ 1 ∧ r.2 ≤ p ∧
r.1 ≤ if p ≤ 1 / 2 then 1 else binEntropy2 p}
/-- The pinching retains 01 coherence. -/
example (rho : Op (Fin 3)) : qutritPinching rho 0 1 = rho 0 1 := by simp [qutritPinching]
/-- The pinching deletes 02 coherence. -/
example (rho : Op (Fin 3)) : qutritPinching rho 0 2 = 0 := by simp [qutritPinching]
/-- The equation (25) breakpoint is (common/GHZ,EPR)=(1,1/2). -/
example : (1, (1 / 2 : ℝ)) ∈ pinchingRegion := by
refine ⟨⟨by norm_num, by norm_num⟩, 1 / 2, by norm_num, by norm_num, le_rfl, ?_⟩
norm_num
/-- The dilation's Bob label is the actual input basis label. -/
example {O : Type} [Fintype O] (D : DephasingData X O) (x : X) (o : O) :
D.isometry (x, o) x = D.state x o := by simp [DephasingData.isometry]
/-- Two independent EPR resources regrouped by owner, §V p.13. -/
def twoEprTarget (k l : ℕ) : Op ((Fin k × Fin l) × (Fin k × Fin l)) :=
fun i j => epr k (i.1.1, i.2.1) (j.1.1, j.2.1) *
epr l (i.1.2, i.2.2) (j.1.2, j.2.2)
/-- Unassisted two-EPR GENERATION code: freely prepared pure block input with
retained local references; separate decoders and no classical side messages, p.13. -/
structure TwoEprCode (A B C : Type) [Fintype A] [Fintype B] [Fintype C]
[DecidableEq B] [DecidableEq C] (n k l : ℕ) where
encode : EuclideanSpace ℂ ((Fin k × Fin l) × (Fin n → A))
unit : IsState encode
bob : Superop (Fin n → B) (Fin k)
bob_channel : IsChannel bob
charlie : Superop (Fin n → C) (Fin l)
charlie_channel : IsChannel charlie
/-- Unassisted generation output, with both external Alice registers retained, p.13. -/
def TwoEprCode.decoded {n k l : ℕ} (D : TwoEprCode A B C n k l) (N : Superop A (B × C)) :
Op ((Fin k × Fin l) × (Fin k × Fin l)) :=
idTensorSuperop (both D.bob D.charlie)
(idTensorSuperop (groupedChannelPower N n) (pureDensity D.encode))
/-- Vanishing joint error to independent EPRs, §V p.13. -/
def twoEprAchievable (N : Superop A (B × C)) (r : ℝ × ℝ) : Prop :=
NonnegativePair r ∧ ∀ epsilon > (0 : ℝ), ∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ D : TwoEprCode A B C n (rank n r.1) (rank n r.2),
1 - epsilon ≤ squaredFidelity (D.decoded N) (twoEprTarget (rank n r.1) (rank n r.2))
/-- Closed two-EPR generation region; rank-one axes remain present, p.13. -/
def twoEprCapacity (N : Superop A (B × C)) : Set (ℝ × ℝ) := closure {r | twoEprAchievable N r}
/-- Two-EPR TRANSMISSION code: Alice acts ONLY on supplied sender halves.
The two external references are fixed independent EPR halves, not freely prepared, p.13. -/
structure TwoEprTransmissionCode (A B C : Type) [Fintype A] [Fintype B] [Fintype C]
[DecidableEq B] [DecidableEq C] (n k l : ℕ) where
encode : Superop (Fin k × Fin l) (Fin n → A)
encode_channel : IsChannel encode
bob : Superop (Fin n → B) (Fin k)
bob_channel : IsChannel bob
charlie : Superop (Fin n → C) (Fin l)
charlie_channel : IsChannel charlie
/-- External references untouched throughout encoding, channel and decoding, p.13. -/
def TwoEprTransmissionCode.decoded {n k l : ℕ} (D : TwoEprTransmissionCode A B C n k l)
(N : Superop A (B × C)) : Op ((Fin k × Fin l) × (Fin k × Fin l)) :=
idTensorSuperop (both D.bob D.charlie ∘ groupedChannelPower N n ∘ D.encode) (twoEprTarget k l)
/-- Independent entanglement transmission rates with no side communication, p.13. -/
def twoEprTransmissionAchievable (N : Superop A (B × C)) (r : ℝ × ℝ) : Prop :=
NonnegativePair r ∧ ∀ epsilon > (0 : ℝ), ∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ D : TwoEprTransmissionCode A B C n (rank n r.1) (rank n r.2),
1 - epsilon ≤ squaredFidelity (D.decoded N) (twoEprTarget (rank n r.1) (rank n r.2))
/-- Closed transmission region, separately defined from generation, p.13. -/
def twoEprTransmissionCapacity (N : Superop A (B × C)) : Set (ℝ × ℝ) :=
closure {r | twoEprTransmissionAchievable N r}
/-- The two coherent informations of ONE joint input (references may be correlated), p.13. -/
def twoEprInformation {AB AC : Type} [Fintype AB] [Fintype AC]
[DecidableEq AB] [DecidableEq AC] (N : Superop A (B × C))
(psi : EuclideanSpace ℂ ((AB × AC) × A)) : ℝ × ℝ :=
let rho := idTensorSuperop N (pureDensity psi)
let rhoAB_B : Op (AB × B) := fun i j => ∑ ac, ∑ c, rho ((i.1, ac), (i.2, c)) ((j.1, ac), (j.2, c))
let rhoAC_C : Op (AC × C) := fun i j => ∑ ab, ∑ b, rho ((ab, i.1), (b, i.2)) ((ab, j.1), (b, j.2))
(vnEntropy (traceLeft rhoAB_B) - vnEntropy rhoAB_B,
vnEntropy (traceLeft rhoAC_C) - vnEntropy rhoAC_C)
/-- The independent EPR target is product, not an arbitrary correlated pair. -/
example (k l : ℕ) (i j : (Fin k × Fin l) × (Fin k × Fin l)) :
twoEprTarget k l i j = epr k (i.1.1, i.2.1) (j.1.1, j.2.1) *
epr l (i.1.2, i.2.2) (j.1.2, j.2.2) := rfl
/-- With both resources trivial the target is a normalized singleton state. -/
example : twoEprTarget 1 1 ((0, 0), (0, 0)) ((0, 0), (0, 0)) = 1 := by
simp [twoEprTarget, epr]
/-- AC and BC EPRs, product and regrouped as Alice,(Bob,(Charlie_AC,Charlie_BC)), p.13. -/
def assistedTarget (k l : ℕ) : Op (Fin k × (Fin l × (Fin k × Fin l))) :=
fun i j => epr k (i.1, i.2.2.1) (j.1, j.2.2.1) *
epr l (i.2.1, i.2.2.2) (j.2.1, j.2.2.2)
/-- One-way receiver-assisted code, §V pp.12–13: Alice prepares a pure input;
Bob retains an EPR half and sends ONE classical branch to Charlie, who decodes
conditionally. No initial entanglement or other messages/shared randomness. -/
structure ReceiverMergingCode (A B C : Type) [Fintype A] [Fintype B] [Fintype C]
[DecidableEq B] [DecidableEq C] (n k l m : ℕ) where
encode : EuclideanSpace ℂ (Fin k × (Fin n → A))
unit : IsState encode
bob : BroadcastInstrument (Fin n → B) (Fin l) (Fin m)
charlie : Fin m → Superop (Fin n → C) (Fin k × Fin l)
charlie_channel : ∀ s, IsChannel (charlie s)
/-- Sum over the ACTUAL communicated branch, retain both EPR resources, p.13. -/
def ReceiverMergingCode.decoded {n k l m : ℕ} (D : ReceiverMergingCode A B C n k l m)
(N : Superop A (B × C)) : Op (Fin k × (Fin l × (Fin k × Fin l))) :=
∑ s, idTensorSuperop (both (D.bob.branch s) (D.charlie s))
(idTensorSuperop (groupedChannelPower N n) (pureDensity D.encode))
/-- Simultaneous AC,BC rates from one-way Bob-to-Charlie assisted codes, p.13. -/
def assistedAchievable (N : Superop A (B × C)) (r : ℝ × ℝ) : Prop :=
NonnegativePair r ∧ ∀ epsilon > (0 : ℝ), ∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0,
∃ m : ℕ, 0 < m ∧ ∃ D : ReceiverMergingCode A B C n (rank n r.1) (rank n r.2) m,
1 - epsilon ≤ squaredFidelity (D.decoded N) (assistedTarget (rank n r.1) (rank n r.2))
/-- (I(A coherent-to BC),I(B coherent-to C)) from one pure reference/input, p.13. -/
def mergingInformation {R : Type} [Fintype R] [DecidableEq R]
(N : Superop A (B × C)) (psi : EuclideanSpace ℂ (R × A)) : ℝ × ℝ :=
let rho := idTensorSuperop N (pureDensity psi)
let bc := traceLeft rho
(vnEntropy bc - vnEntropy rho, vnEntropy (traceLeft bc) - vnEntropy bc)
/-- Positive blocklength raw superposition union of §II p.4, keeping all three
inequalities on the ACTUAL block channel; independent of the capacity region. -/
def rawRegularizedSuperposition (W : CQChannel X B C) : Set (ℝ × ℝ × ℝ) :=
{r | NonnegativeTriple r ∧ ∃ n t : ℕ, 0 < n ∧ 0 < t ∧
t ≤ superpositionCap (Fin n → X) (Fin n → B) (Fin n → C) ∧
∃ p : Distribution (Fin t × (Fin n → X)),
let tb := cqBlocks fun s => ∑ x, (p.val (s, x) : ℂ) • traceRight (W.word x)
let tc := cqBlocks fun s => ∑ x, (p.val (s, x) : ℂ) • traceLeft (W.word x)
(n : ℝ) * r.2.1 ≤ vnEntropy tb - labelEntropy p -
∑ s, ∑ x, p.val (s, x) * vnEntropy (traceRight (W.word x)) ∧
(n : ℝ) * (r.1 + r.2.2) ≤ mutualInformation tc ∧
(n : ℝ) * (r.1 + r.2.1 + r.2.2) ≤
holevoInfo (fun x => ∑ s, p.val (s, x)) (fun x => traceRight (W.word x))}
/-- The p.4 separation example: constant singleton Bob, noiseless binary Charlie. -/
def binaryExample : CQChannel Bool Unit Bool where
state x := pureDensity (ket (Unit.unit, x))
density x := ⟨pureDensity_posSemidef _, by simp [pureDensity, ket, Matrix.trace]⟩
/-- Alice–Charlie and Bob–Charlie resources are independently tensorized. -/
example (k l : ℕ) (i j : Fin k × (Fin l × (Fin k × Fin l))) :
assistedTarget k l i j = epr k (i.1, i.2.2.1) (j.1, j.2.2.1) *
epr l (i.2.1, i.2.2.2) (j.2.1, j.2.2.2) := rfl
/-- Bob is constant and Charlie retains the binary basis value in the separation example. -/
example (x : Bool) : binaryExample.state x (Unit.unit, x) (Unit.unit, x) = 1 := by
simp [binaryExample, pureDensity, ket]
end QAlgorithms.Papers.Independent.Gap48.P39
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Gap48.P39.BroadcastInstrument.branch
For finite types , with decidable equality on , let consist of a natural number and matrices , indexed by and , satisfying . For every , its branch is the function on arbitrary complex matrices given by
There is no density-matrix assumption on . The number may be zero, in which case each branch is zero; the normalization equation must still hold.
QAlgorithms.Papers.Independent.Gap48.P39.BroadcastInstrument
For finite types , with decidable equality on , an object of this structure consists of a natural number and complex matrices with rows indexed by and columns indexed by , for every and , together with the single normalization requirement
No positivity of the individual matrices, nonemptiness of the index types, or positivity or minimality of is required. If or is empty, the left side is zero, so normalization can hold only when is empty.
QAlgorithms.Papers.Independent.Gap48.P39.BroadcastInstrument.output
For finite types , with decidable equality on , let consist of a natural number and matrices satisfying . Its output is the function taking any complex matrix on to the matrix on whose entries are
No positivity or trace condition is imposed on . Empty index sets and are included, subject to the displayed normalization equation.
QAlgorithms.Papers.Independent.Gap48.P39.CQBroadcastCode.Good
For an arbitrary input type , finite output types with decidable equality, natural numbers , a code with words and positive semidefinite measurement matrices on and on , each family summing to its identity matrix, a family of trace-one matrices on , and any real , this predicate requires
where . No restriction on is imposed. If any of is zero, the universally quantified success condition is vacuous; is also included, with the product defining equal to .
QAlgorithms.Papers.Independent.Gap48.P39.CQBroadcastCode
For an arbitrary input type , finite output types with decidable equality, and natural numbers , this structure consists of an encoding function assigning a word to every , , and ; complex matrices on ; and complex matrices on . The matrices must satisfy
There is no success requirement in the structure. All four natural parameters may be zero: empty outcome families still have to satisfy their displayed normalization equations, which are impossible when the corresponding identity matrix is nonzero.
QAlgorithms.Papers.Independent.Gap48.P39.CQChannel
For an arbitrary type and finite types , a channel of this structure consists of a complex matrix , indexed by , for every , together with the requirement that every is positive semidefinite and has trace . No finiteness assumption is imposed on . If is empty, the density requirements are vacuous; if either output type is empty and is nonempty, those requirements cannot hold because an empty matrix has trace .
QAlgorithms.Papers.Independent.Gap48.P39.CQChannel.word
For an arbitrary input type , finite output types , a family of positive semidefinite complex matrices of trace on , any natural number , and any word , this defines the matrix on by
Here and mean functions from to the respective types. The definition includes , when the empty product is , so the resulting matrix has its single entry equal to .
QAlgorithms.Papers.Independent.Gap48.P39.CQCode.Good
For finite types with decidable equality, natural numbers , a code , an arbitrary function from matrices on to matrices on , and any real , goodness means the following inequality for every label :
Here matrix square roots mean continuous functional calculus with the real square-root function. To define , the code supplies unit vectors on , , matrices satisfying , and positive semidefinite on summing to . First apply, separately to each reference matrix block of , the map
Then apply on the map whose label- diagonal block is , and on the diagonal-output map with label- entry , retaining the reference register; all these applications to a subsystem act on its matrix blocks. The target has entry between and exactly when , , and , and zero otherwise. No range restriction on and no channel assumption on is imposed; when , goodness is vacuous.
QAlgorithms.Papers.Independent.Gap48.P39.CQCode.decoded
For finite types with decidable equality, natural numbers , a code , any function from complex matrices on to complex matrices on , and , write for the code’s unit vector on , where ; write for its matrices satisfying , and for its positive semidefinite matrices on summing to the identity. Define the function by
where is the matrix with a single in position . Put and . The decoded matrix , indexed by , is
There is no assumption that is a channel or even linear. Zero parameters are allowed whenever the supplied code and label exist; products over zero coordinates equal .
QAlgorithms.Papers.Independent.Gap48.P39.CQCode
For finite types , with decidable equality on , and natural numbers , such a code consists of vectors for every , each satisfying ; a natural number and matrices , for , satisfying
and matrices on , for , each positive semidefinite and satisfying . Here , , and mean functions from into the corresponding type. The parameters may all be zero; the vector-normalization requirement is vacuous when , while for it requires the vector index set to be nonempty. No success requirement is part of this structure.
QAlgorithms.Papers.Independent.Gap48.P39.CommonCode.Good
For finite types with decidable equality, natural numbers , a code consisting of words and positive semidefinite measurement matrices on and on satisfying and , an assignment of density matrices on , a probability distribution , and arbitrary real numbers , the defined proposition asserts that there exists a function such that
and every message satisfies both
where
No separate nonnegativity or normalization condition is imposed on . When , every displayed frequency is zero because real division by zero gives zero. When there are no messages, the conditions quantified over messages are vacuous. No sign or range restriction on or is part of this definition.
QAlgorithms.Papers.Independent.Gap48.P39.CommonCode
For any type , finite types with decidable equality, and natural numbers , an object of this structure consists of a word for every message , complex matrices indexed by , and complex matrices indexed by , together with the requirements
There is no injectivity requirement on the words and no success requirement in the structure itself. Both and are allowed as parameters; for , each word is the unique empty word, while for , the two normalization equations require the respective identity matrices to equal zero, which is impossible on a nonzero-dimensional space.
QAlgorithms.Papers.Independent.Gap48.P39.CommutingBob
For finite types , with the required decidable equality instances, let assign density matrices on , each positive semidefinite with trace . Define . This predicate holds exactly when
The quantification includes , and if is empty the predicate is vacuously true.
QAlgorithms.Papers.Independent.Gap48.P39.Degraded
For finite types , with the required decidable equality instances, let assign to each a positive semidefinite trace-one matrix on . This predicate holds exactly when there exist a function from complex matrices on to complex matrices on , a natural number , and matrices with rows indexed by and columns indexed by , such that
and, for every ,
where and . The same must work for every . The number may be zero, in which case the sums are zero and the completeness equation is still required; if is empty, the conditions indexed by are vacuous, but the existence and completeness requirements remain.
QAlgorithms.Papers.Independent.Gap48.P39.DephasingData.isometry
For a type , a finite type , and data consisting of vectors with for every , this defines the complex matrix , with rows indexed by and columns indexed by , by
Thus column is supported only on rows whose first coordinate is . Empty index types are allowed whenever the supplied normalized-vector data exist.
QAlgorithms.Papers.Independent.Gap48.P39.DephasingData
For types , with finite, this structure consists of a family of vectors , one for every , together with the requirement for every . No orthogonality, distinctness, or other relation between different vectors is required. The type may be empty, in which case both the family and its normalization condition are vacuous; if is nonempty and is empty, no such structure exists.
QAlgorithms.Papers.Independent.Gap48.P39.NonnegativePair
For a real pair , this predicate means precisely and , including equality in either coordinate.
QAlgorithms.Papers.Independent.Gap48.P39.NonnegativeTriple
For a real triple , this predicate means precisely
Zero coordinates are permitted.
QAlgorithms.Papers.Independent.Gap48.P39.QQCode.Good
For finite types with decidable equality, natural numbers , a code consisting of a unit encoding vector and two decoders , , each possessing a finite Kraus representation with , an arbitrary matrix map , and any real , goodness means
All square roots here use continuous functional calculus. The decoded matrix is obtained from by applying to the input block and then the two decoders independently, preserving the reference register, where
The target has entry between and exactly when , , and , and has entry zero otherwise. There is no restriction on and no channel assumption on ; a code cannot exist when or .
QAlgorithms.Papers.Independent.Gap48.P39.QQCode.decoded
For finite types with decidable equality, natural numbers , a code with unit encoding vector and decoders , admitting finite Kraus representations with , and an arbitrary matrix map , the decoded matrix is
Here in register expressions denote the finite sets of those sizes; is defined by
An identity extension applies the given map separately to every block selected by the two reference indices, and applies to the register and to the register. The result is indexed by . No channel condition on is part of this definition, and at the displayed product is the empty product .
QAlgorithms.Papers.Independent.Gap48.P39.QQCode
For finite types , with decidable equality on , and natural numbers , a code consists of a vector satisfying , a map from matrices on to matrices on , and a map from matrices on to matrices on . Each decoder must admit a finite Kraus representation: for suitable finitely many rectangular matrices , respectively ,
No positivity condition is imposed on as parameters. If or , the vector space for is zero-dimensional, so no vector satisfies the required norm ; instead makes each block register a singleton.
QAlgorithms.Papers.Independent.Gap48.P39.QuantumAux
For finite types , this structure consists of a function satisfying for every and , together with a matrix on for every , and the requirements that every be positive semidefinite and have trace . The density requirement applies even to labels with . No such structure exists when is empty; its probability and density requirements also exclude an empty .
QAlgorithms.Papers.Independent.Gap48.P39.ReceiverMergingCode.decoded
For finite register types with the required decidable equalities, arbitrary natural numbers , a receiver merging code with unit encoding vector , Bob branches satisfying , and Charlie channels admitting finite trace preserving Kraus representations, and an arbitrary function from matrices on to matrices on , the decoded matrix on is
Here ; extending a map by an identity means applying it separately to each matrix block indexed by the retained register; and means first applying to each block of the first register and then to each block of the second. The map is defined, even when is not a channel or linear, by
where is the matrix unit. No channel assumption on is part of this definition, and uses empty products equal to .
QAlgorithms.Papers.Independent.Gap48.P39.ReceiverMergingCode
For finite types , with decidable equality on , and natural numbers , a receiver merging code consists of a vector satisfying ; a Bob instrument with outcomes and output space ; and, for each outcome , a Charlie channel from matrices on to matrices on . Here means the functions , and similarly for . The instrument consists of a natural number and matrices , indexed by , satisfying ; its branch sends to . Each Charlie channel must admit a finite Kraus representation with . No positivity condition is imposed on separately: zero values are included subject to these requirements, although makes the unit vector requirement impossible.
QAlgorithms.Papers.Independent.Gap48.P39.SuperpositionBounds
For finite types , with the required decidable equality instances, let assign density matrices on , let be nonnegative with total sum , and let . Put , , , and ; define and to have respective diagonal -blocks and , and all off-diagonal -blocks zero. The predicate holds exactly when all three coordinates of are nonnegative and
Here a density matrix is positive semidefinite with trace , and , where , , is applied through continuous functional calculus. All inequalities are non-strict, and zero coordinates and zero probabilities are allowed.
QAlgorithms.Papers.Independent.Gap48.P39.TwoEprCode.decoded
For finite types with decidable equality, natural numbers , a code consisting of a norm-one vector on and two decoder maps as below, and any map from complex matrices on to complex matrices on , this definition returns the following matrix on . For a matrix on , define
where has entry at and zero elsewhere. Choose finite Kraus representations , , and , , and put
Writing for pairs in , the returned matrix is
Thus the first pair of registers is retained while the word register passes through the displayed map and the two decoders. No channel, linearity, or positivity assumption is imposed on . The definition includes , when the product is empty and equals .
QAlgorithms.Papers.Independent.Gap48.P39.TwoEprCode
For finite types , with decidable equality on , and natural numbers , this structure consists of a complex vector indexed by , satisfying , together with maps from complex matrices on to complex matrices on , and from complex matrices on to complex matrices on . Each map must admit a finite Kraus representation: for each , there must be a natural number and matrices of the appropriate input and output dimensions such that and for every input matrix . The types are not required to be nonempty, and the parameters may be zero; however, or makes the vector space for zero-dimensional, so the norm-one requirement cannot then hold. When , each word register is a singleton.
QAlgorithms.Papers.Independent.Gap48.P39.TwoEprTransmissionCode.decoded
For finite types with decidable equality, natural numbers , a transmission code with encoder and decoders , and any map from matrices on to matrices on , this definition returns a matrix on . Each of is required by the code to have a finite Kraus representation with . Define
and extend linearly; if and , put . Let have entry between and exactly when , and zero otherwise. The returned matrix is obtained by applying separately to every block of with its first pair of indices fixed:
There is no channel assumption on . The definition includes , with empty products equal to , and or , when the target and returned matrices have empty index sets.
QAlgorithms.Papers.Independent.Gap48.P39.TwoEprTransmissionCode
For finite types , with decidable equality on , and natural numbers , this structure consists of three maps between complex matrix spaces: an encoder from matrices on to matrices on , a decoder from matrices on to matrices on , and a decoder from matrices on to matrices on . Each of these three maps must admit a finite Kraus representation: there must be a natural number and appropriately sized matrices such that and the map sends every to . Neither nonempty types nor positive values of are required; zero-dimensional registers are included, with existence of the data governed by these Kraus equations. For , each word register is a singleton.
QAlgorithms.Papers.Independent.Gap48.P39.assistedAchievable
For finite register types with the required decidable equalities, an arbitrary matrix function , meaning a function from matrices on to matrices on , and a real pair , this predicate requires and the following: for every real , there is a natural number such that every natural number admits a natural number and a receiver merging code with dimensions
The natural floor is the nonnegative integer floor. Such a code has a unit vector on , a finite Kraus instrument with outcomes and total Kraus normalization , and a finite Kraus trace preserving channel for each outcome. Its decoded matrix is the sum over of the outputs obtained from by applying the entrywise tensor extension of to the input registers, retaining the first register, and then applying and to the respective outputs. The tensor extension has entries . The target is
and the squared fidelity used here is
with square roots interpreted through continuous functional calculus. The quantifier includes all , without requiring , and no channel hypothesis on is included.
QAlgorithms.Papers.Independent.Gap48.P39.assistedTarget
For all natural numbers , this definition gives a complex matrix indexed by tuples , with and . Its entries are
There is no further condition equating primed and unprimed labels. For positive , this is the pure-density matrix of the vector . Zero values of or are allowed; then the entire index type is empty and the definition yields the unique matrix on that empty type.
QAlgorithms.Papers.Independent.Gap48.P39.binaryExample
This defines a classical input, quantum output channel with Boolean input, a one element Bob register , and a Boolean Charlie register: input is assigned the matrix
Thus its assigned matrix is the outer product of the coordinate basis vector at with itself. The accompanying requirement is that each such matrix is positive semidefinite and has trace .
QAlgorithms.Papers.Independent.Gap48.P39.commonEprTarget
For natural numbers and a label , the target is the complex matrix on given by
Thus the two label registers are fixed to , and the remaining two registers have entries whenever each row or column pair has equal coordinates. The existence of requires . The definition also permits , in which case the entire matrix index set is empty; reciprocals are interpreted using the total complex-field inverse, with .
QAlgorithms.Papers.Independent.Gap48.P39.commonInfo
For finite types , with the required decidable equality instances, let assign density matrices on , meaning positive semidefinite matrices of trace , and let be nonnegative with total sum . Write , , and . This definition is
where and , with , is applied through continuous functional calculus. Zero probabilities are permitted; an empty admits no such .
QAlgorithms.Papers.Independent.Gap48.P39.cqAchievable
For finite types with decidable equality, any function from matrices on to matrices on , and a real pair , achievability means and that, for every real , there is a natural number such that for every natural a code exists with
Such a code consists of unit vectors on , ; finitely many matrices satisfying ; and positive semidefinite matrices on summing to . For every , its decoded matrix must satisfy
Here is obtained from by retaining its reference register, applying on its register the map
then applying to the map with diagonal label- blocks , and to the diagonal-output map with label- entry ; subsystem maps act on matrix blocks. The target has entry between and exactly when , , and , and zero otherwise. The square roots use continuous functional calculus. Since the rates are nonnegative, , including dimension for a zero rate. Codes may depend on both and ; has no upper bound, and need not be a channel.
QAlgorithms.Papers.Independent.Gap48.P39.cqBroadcastAchievable
For an arbitrary input type , finite output types with decidable equality, a family of trace-one matrices on , and a real triple , this predicate requires all three coordinates to be nonnegative and requires the following: for every real , there exists a natural number such that, for every natural number , there is a code with message sizes
Such a code assigns words and has positive semidefinite matrices on and on , with and , satisfying for every message triple, where the entries of are the products of the corresponding entries of . The threshold and codes may depend on , and the code may depend on . There is no upper bound on ; zero rates are allowed and give message size .
QAlgorithms.Papers.Independent.Gap48.P39.cqBroadcastCapacity
For an arbitrary input type , finite output types with decidable equality, and a family of trace-one matrices on , this defines a subset of as the topological closure of the following set: all nonnegative triples such that, for every , there is an integer for which every admits words , with , , and , and positive semidefinite matrices on and on , each family summing to the respective identity, such that
for every message triple. Here . The closure is taken in the usual topology on real triples, so it also includes limits of triples satisfying this condition.
QAlgorithms.Papers.Independent.Gap48.P39.cqGenerationCapacity
For finite types with decidable equality and any function from matrices on to matrices on , this capacity is the closure in of the following set of pairs : both coordinates are nonnegative, and for every , all sufficiently large positive integers admit a code with labels and reference and decoded quantum registers of dimension . A code comprises unit vectors , matrices with , and positive semidefinite on with . For every label , it must satisfy
The matrix is obtained from , retaining its reference register, by applying to the input register the map
followed on by the map with diagonal label- blocks , and on by the diagonal-output map with label- entry ; subsystem applications act on matrix blocks. The target has entry between and precisely when , , and , and zero otherwise; square roots use continuous functional calculus. Thus membership in the capacity includes limits of pairs satisfying this code-existence condition, without requiring that the limiting pair itself satisfy that condition. Zero rates are allowed and give register dimension ; no channel assumption on is included.
QAlgorithms.Papers.Independent.Gap48.P39.cqTB
For finite types , with decidable equality on , a family of trace-one complex matrices on , and a function with nonnegative entries summing to , this defines a complex matrix indexed by , whose entries are
Thus the diagonal block for is the weighted sum of the matrices obtained by summing over the coordinate; the weights in that block are not divided by their sum. Labels with have zero blocks.
QAlgorithms.Papers.Independent.Gap48.P39.cqTC
For finite types , with decidable equality on , a family of trace-one complex matrices on , and a function with nonnegative entries summing to , this defines a complex matrix indexed by , whose entries are
Thus the diagonal block for is the weighted sum of the matrices obtained by summing over the coordinate; the weights in that block are not divided by their sum. Labels with have zero blocks.
QAlgorithms.Papers.Independent.Gap48.P39.degradedClassicalRegion
For finite types with decidable equality and an assignment of positive semidefinite, trace-one matrices on , write , , and , where is applied by continuous functional calculus. The defined set consists of exactly the nonnegative triples for which there exist an integer
and numbers , indexed by and , satisfying , with the following properties. Set , let have diagonal block equal to and all other blocks zero, and define in the same way using . Then
The definition requires no degrading map or commutativity assumption. If the upper bound on is zero, the set is empty.
QAlgorithms.Papers.Independent.Gap48.P39.dephasingRegion
Let be finite register index types with decidable equality, let be a finite type with decidable equality, let be a unit vector for every , and let be any function taking complex matrices on to complex matrices on ; no linearity or channel assumption on is imposed. Write , and , where is applied by continuous functional calculus. This defines the set of pairs with for which there exist an integer satisfying and real numbers , indexed by and , satisfying , such that, for the block diagonal matrices
one has
The partial traces mean summing the diagonal indices of the register being removed. Zero probabilities are allowed. If is empty, the requirement cannot be met, so the defined set is empty.
QAlgorithms.Papers.Independent.Gap48.P39.ensembleBob
Let be any natural number, let be finite types and a type, and let be an ensemble consisting of a natural number , weights with , and unit vectors . For any function from matrices on to matrices on , and any , define . The defined matrix on has entries
The ensemble weights do not enter this matrix. No channel assumption is imposed on . Although is syntactically permitted, no such ensemble can then exist: its weights must sum to , while each of its vectors must have norm .
QAlgorithms.Papers.Independent.Gap48.P39.ensembleCharlie
Let be any natural number, let be finite types and a type, and let consist of a natural number , nonnegative weights summing to , and unit vectors on . For an arbitrary function from matrices on to matrices on , and a label , put . The defined matrix on is
The weights are unused in this definition, and is not required to be a channel or linear. The parameter may formally be zero, but in that case an ensemble satisfying the stated normalization requirements cannot exist.
QAlgorithms.Papers.Independent.Gap48.P39.ensembleCoherent
For finite types , with decidable equality on , any natural number , an ensemble consisting of unit vectors and weights with , and any function from matrices on to matrices on , the defined real number is
where is defined by continuous functional calculus, and
No positivity, normalization, or linearity assumption is imposed on , so the entropy expressions are the displayed functional-calculus expressions even when their arguments are not density matrices. The ensemble conditions exclude and exclude .
QAlgorithms.Papers.Independent.Gap48.P39.ensembleCommon
For finite types , with decidable equality on , a natural number , and an arbitrary map from complex matrices on to complex matrices on , let consist of finitely many vectors of norm , with real weights satisfying . For reference indices , put , and define matrices
Writing , where is applied by continuous functional calculus, the definition is
Zero weights are allowed. The weights’ normalization precludes an empty ensemble, and precludes such normalized vectors. No channel assumption is imposed on .
QAlgorithms.Papers.Independent.Gap48.P39.generalizedDephasingBroadcast
For finite register index types , with decidable equality as needed for the matrix operations, let satisfy for every . Define when , and otherwise. This declaration defines a function from complex matrices on to complex matrices on : conjugate the input by , and then trace out , leaving untouched. Explicitly, for every matrix and all , ,
The input is arbitrary; positivity and trace are not conditions on the argument of this function.
QAlgorithms.Papers.Independent.Gap48.P39.labelEntropy
For finite types , with decidable equality on , and a real-valued function satisfying for every pair and , this defines the entropy of the diagonal matrix with diagonal entries . Explicitly, the value is
with zero entries contributing . The entropy used in the code is , where , , and is defined by continuous functional calculus. Existence of the stipulated distribution excludes an empty .
QAlgorithms.Papers.Independent.Gap48.P39.measurement
For a finite type , a type with decidable equality, and any family of complex matrices , the defined function sends an arbitrary complex matrix on to the matrix on with entries
The diagonal entries are complex traces, without taking real parts. The definition requires neither that be finite nor that the form a positive, normalized measurement, and it imposes no density-matrix condition on .
QAlgorithms.Papers.Independent.Gap48.P39.mergingInformation
For finite types with the required decidable equalities, any finite type with decidable equality, an arbitrary function from matrices on to matrices on , and any vector , define the matrix on and its marginal on by
Then the defined information pair is
where , , and is defined by continuous functional calculus. The definition assumes neither that is a channel nor that has norm ; finite empty register types are not excluded.
QAlgorithms.Papers.Independent.Gap48.P39.pinchingRegion
This defines the set of pairs for which and there exists satisfying
where , with zero logarithmic terms interpreted as . The case uses the first branch. Both endpoints are included: permits and , while permits and .
QAlgorithms.Papers.Independent.Gap48.P39.qqAchievable
For finite types with decidable equality and an arbitrary matrix map , a real pair is achievable precisely when and, for every real , there is a positive integer such that for every natural number there exists a code with
Such a code comprises a unit vector and maps , , each of the form with finitely many Kraus matrices satisfying . Let result from by retaining the reference , applying
and then independently applying . The required inequality is
with square roots defined by continuous functional calculus, where is the outer product of , with the registers grouped as above. Nonnegative rates make ; a zero rate gives the corresponding dimension . No channel condition is imposed on .
QAlgorithms.Papers.Independent.Gap48.P39.qqCapacity
For finite types with decidable equality and an arbitrary matrix map , this capacity is the closure in of the following set of nonnegative rate pairs : for every , all sufficiently large positive integers admit dimensions , , a unit vector , and decoders , admitting finite Kraus representations with . Their decoded matrix is obtained by applying to the input register
and then applying the decoders independently, leaving the reference unchanged; it must satisfy
where the square roots use continuous functional calculus and is the outer product of . Equivalently, a pair belongs to the capacity precisely when every open neighborhood of it contains a pair satisfying these conditions. Zero rates are included and give dimension in the corresponding register; no channel assumption on is part of the definition.
QAlgorithms.Papers.Independent.Gap48.P39.qqTarget
For natural numbers , this defines a matrix on registers grouped as . Writing a row index as and a column index as , its entry is
This expands the product of the matrix with entries when each of its two indices has equal components and the matrix with entries when each of its two indices has three equal components. For positive , it is the outer product of the correspondingly regrouped vector
If either or is zero, its indexing type is empty.
QAlgorithms.Papers.Independent.Gap48.P39.quantumCap
For any finite types , the natural number is
The subtraction by is natural-number subtraction, so it is truncated at zero. Empty types are included; in particular, the value is zero when is empty or when both and are empty.
QAlgorithms.Papers.Independent.Gap48.P39.quantumInformationRegion
For finite types , with decidable equality on , an arbitrary matrix map , and a Boolean parameter , this definition gives the set of pairs satisfying for which there exist positive integers , weights with , and unit vectors , such that
For , form
The remaining requirements are
where , with applied by continuous functional calculus. Zero ensemble weights are permitted, and no channel condition is required of ; when , the cardinality implication imposes no restriction.
QAlgorithms.Papers.Independent.Gap48.P39.quantumOuterRegion
For finite types with decidable equality, let assign to every a positive semidefinite complex matrix on with trace , and let be a Boolean parameter. Write , , and , where is applied by continuous functional calculus. The defined set consists of exactly the triples whose coordinates are nonnegative and for which there exist a positive integer , a probability distribution , and density matrices on , meaning , , , and , such that, with , , and ,
and, if , also
There is no upper bound on ; when , the last implication imposes no condition. Empty types are not explicitly excluded, although the required probability distribution cannot exist when is empty.
QAlgorithms.Papers.Independent.Gap48.P39.quantumPrivateInfo
For finite types , with the required decidable equality instances, let assign positive semidefinite trace-one matrices on , and let consist of nonnegative weights with and positive semidefinite trace-one matrices on . Put . This definition is the real number
where , with , , applied through continuous functional calculus. Zero weights are permitted, but each , including those with zero weight, is required to be a density matrix.
QAlgorithms.Papers.Independent.Gap48.P39.quantumTB
For finite types , with the required decidable equality instances, let assign positive semidefinite trace-one matrices on , and let consist of nonnegative weights summing to and positive semidefinite trace-one matrices on . This definition is the matrix on
Equivalently, its entry at is . Zero weights are allowed, while every must still satisfy the density requirements.
QAlgorithms.Papers.Independent.Gap48.P39.quantumTC
For finite types , with the required decidable equality instances, let assign positive semidefinite trace-one matrices on , and let consist of nonnegative weights summing to and positive semidefinite trace-one matrices on . This definition is the matrix on
Equivalently, its entry at is . Zero weights are allowed, and the density requirements apply to all labels, including those with zero weight.
QAlgorithms.Papers.Independent.Gap48.P39.qutritPinching
This defines a function on all complex matrices by retaining an entry precisely when its row and column indices either both lie in or both lie outside that set. Thus
There is no positivity, Hermiticity, or normalization requirement on the input.
QAlgorithms.Papers.Independent.Gap48.P39.rank
For every natural number and every real number , this defines the natural number
where the power is a real power and the floor takes values in the natural numbers. In particular, the value is when or , and it is when and .
QAlgorithms.Papers.Independent.Gap48.P39.rankGhzDensity
For every natural number , this is the complex matrix indexed by triples from , with entries
For , it is the outer product of with itself. The definition also includes , when the indexing type is empty and the matrix has no entries; scalar inversion is total, with .
QAlgorithms.Papers.Independent.Gap48.P39.rawRegularizedSuperposition
For finite types with the required decidable equalities, let assign to every a positive semidefinite matrix on with trace . The defined set consists of real triples with all three coordinates nonnegative for which there exist natural numbers and a probability function , satisfying and , such that
and
Here , and similarly for ; the subtraction by in the cardinality bound is natural number subtraction, truncated at zero; and . The word output has entries , its marginals are and , and the block diagonal matrices are and . In the second inequality, retains the classical label and retains . Throughout, , with applied by continuous functional calculus. This definition uses existence at a finite block length and takes no closure; if the cardinality bound is zero, no positive can satisfy it.
QAlgorithms.Papers.Independent.Gap48.P39.regularizedQuantumRegion
For finite types with decidable equality and an arbitrary map from matrices on to matrices on , define its grouped -fold map by
where has a single entry at . The regularized region consists of pairs for which some positive integer admits positive integers , weights summing to , and unit vectors , with
Set , and let on the reference register and have entries ; let be its reference partial trace and let . Membership requires and
where , with applied by continuous functional calculus. Thus the definition is a union over positive block lengths, without taking a closure; is not required to be a channel.
QAlgorithms.Papers.Independent.Gap48.P39.superpositionCap
For any three finite types , including empty types, this definition is the natural number
The subtraction by is natural-number subtraction, so it is truncated at zero. In particular, the value is zero if is empty or if both and are empty.
QAlgorithms.Papers.Independent.Gap48.P39.superpositionPrivateInfo
For finite types , with the decidable equality instances required for the matrix expressions, let assign to each a positive semidefinite matrix on with trace , and let satisfy and . Define the -marginal by , put , and define the block diagonal matrix by . Then this definition is the real number
where , with applied through continuous functional calculus and . Zero probability entries are allowed; the probability assumption cannot hold when is empty.
QAlgorithms.Papers.Independent.Gap48.P39.superpositionRegion
For finite types , with the required decidable equality instances, let assign positive semidefinite trace-one matrices on , and let be either absent or a specified natural number . This definition is the set of triples for which there exist a positive integer and a nonnegative function of total sum , with when the cap is present, such that and
Here , , , , and are block diagonal matrices with respective -blocks and . The entropy is , with , , applied through continuous functional calculus. An absent cap imposes no upper bound on ; a cap of zero or an empty makes this set empty. The definition takes this existentially specified set itself, without applying closure.
QAlgorithms.Papers.Independent.Gap48.P39.totalInfo
For finite types , with the required decidable equality instances, let assign positive semidefinite trace-one matrices on , and let be nonnegative with . Define and . This definition is
where , for applied through continuous functional calculus with . The sum includes entries of probability zero, and the probability assumption excludes an empty .
QAlgorithms.Papers.Independent.Gap48.P39.twoEprAchievable
For finite types with decidable equality, any map from complex matrices on to complex matrices on , and a real pair , this predicate means that and that, for every real , there is a natural number such that every natural number admits the following data. Set and . There must be a norm-one vector on , and decoder maps and , where this notation denotes maps between matrix spaces and each decoder has a finite Kraus representation with . Let be the linear map specified on matrix units by
and form by applying , followed by the two decoder maps in parallel, to the word-register blocks of , leaving the first two registers untouched. Define , indexed by , to have entry between and when , and entry zero otherwise. The required inequality is
with square roots interpreted through continuous functional calculus. There is no assumption that is a channel. The quantifier includes ; only positive block lengths occur, and the nonnegative rates ensure , including or at rate zero.
QAlgorithms.Papers.Independent.Gap48.P39.twoEprCapacity
For finite types with decidable equality and any map from complex matrices on to complex matrices on , this definition is the closure in of the following set of pairs . Both coordinates must be nonnegative, and for every there must be such that every integer admits a norm-one vector on , where , , and decoder maps on and with output dimensions , respectively. Each decoder must have a finite Kraus representation with . Define the word map by
and extend linearly. Apply this map and then the two decoders in parallel to the word blocks of the matrix , retaining , to obtain . The target matrix has entry precisely when each reference label equals its corresponding decoded label on both its row and column, and zero otherwise. The condition is , where
uses continuous functional calculus. Taking the closure also includes all limits of pairs satisfying these conditions; membership in the closure does not itself assert that the pair satisfies the displayed coding condition. No channel assumption on or nonemptiness assumption on is part of this definition.
QAlgorithms.Papers.Independent.Gap48.P39.twoEprInformation
For a type , finite types with decidable equality, any map from complex matrices on to complex matrices on , and any complex vector indexed by , define the matrix by applying to each block of :
Define matrices on and on by
The returned real pair is
where each indicated partial trace sums matching reference indices, and , with evaluated by continuous functional calculus. No normalization of , channel property of , or nonemptiness of the finite types is required; empty-index sums are zero.
QAlgorithms.Papers.Independent.Gap48.P39.twoEprTarget
For all natural numbers , this defines a complex matrix on . For row index and column index , its entry is
The inverses are taken in . When , this is the projector onto , equivalently the product of EPR projectors of ranks and , with the registers grouped as displayed. Either natural number may be ; then the matrix index type is empty and the definition gives the unique empty matrix.
QAlgorithms.Papers.Independent.Gap48.P39.twoEprTransmissionAchievable
For finite types with decidable equality, any map from matrices on to matrices on , and a real pair , this predicate requires and the following: for every real , there is a natural number such that every admits an encoder from matrices on to matrices on , and decoders from matrices on to matrices of dimensions , where , . All three maps must have finite Kraus representations , . Define by linear extension of
Let have entry when the reference and transmitted labels agree separately on both row and column, and zero otherwise. Apply the encoder, then , then the two decoders in parallel to its transmitted-register blocks, retaining its reference registers, to obtain . The requirement is
using continuous functional calculus for square roots. No channel assumption is imposed on . All positive errors, including errors at least , are quantified over; block lengths here are positive and .
QAlgorithms.Papers.Independent.Gap48.P39.twoEprTransmissionCapacity
For finite types with decidable equality and any map from matrices on to matrices on , this definition is the closure in of the set of nonnegative pairs satisfying the following coding condition. For every , there is such that every natural number admits an encoder from a register of dimension to , and separate decoders from to registers of dimensions , where , . Each encoder or decoder must be a map for a finite family satisfying . The word map between encoder and decoders is the linear extension of
The input target has entry between and if , and zero otherwise. Applying the encoder, word map, and separate decoders to its second pair of registers, while retaining the first pair, must produce satisfying , where , with square roots defined by continuous functional calculus. The closure includes limits of such rate pairs. No nonemptiness assumption on the types or channel assumption on is imposed.
QAlgorithms.Papers.Independent.Gap48.P39.wordType
For a natural number , a word , and a symbol , the defined real number is
The definition includes : the numerator is then zero, and division by zero in the real field is defined to give zero, so the value is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.