Definitions for Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions
DefinitionQAlgorithms_Papers_Independent_Support50_P02The objects the formalized statements of Capacity Theorems for Quantum Multiple Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions (arXiv:quant-ph/0501045) are stated in. Each was checked against the paper by a blind read-back and a moderator.
independentPairs: Reindex two independent reference/input pairs as (references, inputs), pp.5–7, (8).macPower: Memoryless MAC power with each sender's n inputs grouped together, pp.5–7.bellPair: Product of two Bell targets, regrouped as (references, receiver outputs), p.7.cqInput: Alice's input and Bob's independent reference/input state in (7), p.8.cqMessageTarget: Joint classical label/pure quantum target, with reference first, pp.6–7,23.dephaseClassicalRegister: Dephase the decoder's classical register, making its output an instrument, pp.5–6.pureEnsembleAverage: The average state, p.4.CQMacData: Data of (7), p.8: one Alice ensemble and one independent pure Bob pair.CQMacData.output: Conditional BC states from that same input data, (7), p.8.CQMacData.averageOutput: Average BC output of (7), p.8.CQMacData.classical: I(X;C) of (7), pp.4,8.CQMacData.conditionalCoherent: I_c(B coherent-to CX), evaluated on the SAME state (7), pp.4,8.CQMacData.sideClassical: I(X;BC) of (7), p.30.CQMacData.coherent: I_c(B coherent-to C) of the averaged BC state, p.30.QQData: Data of (8), p.8: independent pure reference/input pairs, with arbitrary references.QQData.output: The actual ABC output in (8), reference pair grouped first, p.8.QQData.bobOutput: BC marginal computed by tracing Alice's reference from that output, p.8.QQData.aliceOutput: AC marginal computed by tracing Bob's reference from that output, p.8.QQData.aliceConditional: I_c(A coherent-to BC), p.8.QQData.bobConditional: I_c(B coherent-to AC), p.8.QQData.sumCoherent: I_c(AB coherent-to C), p.8.QQData.aliceCoherent: I_c(A coherent-to C), p.30.QQData.bobCoherent: I_c(B coherent-to C), p.30.Nonnegative: Nonnegative operational rate pairs, pp.5–8.CQMacData.Rectangle: Boundary-inclusive rectangle from a fixed state (7), pp.7–8,13. Correction: replace the printed strict signs BEFORE closure; the replacer edge otherwise excludes (0,0). This does not claim equality of the strict and closed unions.cqOne: CQ one-use region; optional cap on the alphabet, pp.8,36.QQData.Pentagon: One-state qq pentagon with ALL three constraints, pp.8,18. The same disclosed non-strict boundary correction as for Theorem 1 is used.qqOne: QQ one-use pentagon union, p.8.qqRectangles: Earlier qq rectangle union, on the SAME product inputs (8), p.30.cqPentagons: Alternative cq pentagons on a single state (7), p.30.regularized: Positive-block regularization, with multiplication avoiding division at k=0, pp.7–8,30.CQGeneration: CQ generation code, pp.5–6, (1)–(2): separate pure preparations and joint decoder. A final dephasing incqDecodedmakes the classical output an instrument.cqDecoded: Apply the one n-use joint channel and decoder while leaving Bob's reference untouched, then read the classical decoder output, pp.5–7.CQGeneration.Good: Uniform-message average of a JOINT classical/Bell fidelity, (1)–(2), p.6.CQTransmission: CQ entanglement transmission, pp.6–7: local CPTP encoder on a Bell half only.CQTransmission.Good: Transmission success (3)–(4), pp.6–7; reference is never acted on by the encoder.CQStrong: CQ strong transmission, p.23: local stochastic classical preparations, one fixed quantum encoder and one fixed joint decoder. Mixed message states represent finite private random pure preparations after discarding Alice's private seed. No seed is available to Charlie except through the charged n channel uses.CQStrong.Good: Maximal JOINT error for every classical message and every reference/input pure state, (36), p.23. Correction: test the ORIGINAL message, as the inverse cyclic relabeling on p.25 does. The printed arbitrary f(m) target would permit a constant f.QQGeneration: QQ generation code, p.7, (5); the sender preparations are independent.QQGeneration.Good: One fidelity against the PRODUCT Bell target, (5), p.7.QQTransmission: QQ transmission code, (6), p.7; two individually local CPTP encoders, no reference access or pre-shared sender/decoder resources.QQTransmission.decoded: Encoders act only on the two input halves; channel and decoder act jointly, p.7.QQTransmission.Good: One simultaneous fidelity, not separate marginal fidelities, (6), p.7.QQTransmission.Strong: Strong qq transmission, (37), pp.23–24: all independent external references, allowing arbitrary entanglement WITHIN each pair, and one product-target fidelity.operationalRegion: Closed region from actual integer-rank codes with vanishing error and arbitrary asymptotic rate slack, pp.6–7. Positive n,m,k guard all logs, divisions, and targets. The code predicate contains its existential code BEFORE its universal input tests.MACScenario: The three operational tasks, pp.5–7,23–24.cqMacCapacity: Closed operational CQ region for the chosen task, pp.5–7,23.qqMacCapacity: Closed operational Q region for the chosen task, pp.5–7,23–24.optimizedSum: Optimized sum information over exactly product purifications (8), p.30. For finite positive physical dimensions and CPTP N, this set is nonempty and bounded; reference compression bounds their dimensions and gives attainment.controlledErasure: Corrected controlled-erasure channel of §7.1, PDF p.32. Printed N0=sum_j |flag><0,j| and Ni=|i><1,i| are NOT TP and dephase Bob. The prose and N(tau tensor rho)=tau00|flag><flag|+tau11 rho instead specify K_j=|flag><0,j| and ONE L=sum_j |j><1,j|. This entry formula implements those Kraus operators, retaining transfer-sector coherences.collectivePhaseOperator: Collective phase flip Z tensor Z, §7.2, PDF p.34.collectivePhase: The convex mixture (1-p)rho+p(Z tensor Z)rho(Z tensor Z), p.34.inputCoherent: Channel coherent information using the SAME isometric extension for both outputs, §7.3, PDF p.35. For density rho this equals the purification definition.
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_Papers_Independent_Information100_P67
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P21
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P03
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P19
/-!
Yard–Devetak–Hayden, arXiv:quant-ph/0501045v3. Page numbers are PDF pages.
All registers are finite, dimensions in statements are positive, entropy is in bits,
fidelity is squared Uhlmann fidelity, and trace distance is the FULL trace norm.
The operational code definitions below are independent of the information regions.
Operator matrices, normalized pure ensembles, and Bell densities reuse accepted primitives.
Paper-specific MAC definitions have names distinct from unrelated frozen concepts.
Compilation is pending the explicitly requested batch handoff.
-/
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Support50.P02
open QAlgorithms.Papers.Independent.Information100.P67
(squaredFidelity receiverChannel complementaryChannel IsDegradable)
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E R S I J : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype E] [DecidableEq E]
variable [Fintype R] [DecidableEq R] [Fintype S] [DecidableEq S]
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- Reindex two independent reference/input pairs as (references, inputs), pp.5–7, (8). -/
def independentPairs (rho : Op (R × A)) (tau : Op (S × B)) : Op ((R × S) × (A × B)) :=
fun i j => rho (i.1.1, i.2.1) (j.1.1, j.2.1) * tau (i.1.2, i.2.2) (j.1.2, j.2.2)
/-- Memoryless MAC power with each sender's n inputs grouped together, pp.5–7. -/
def macPower (N : Superop (A × B) C) (n : ℕ) :
Superop ((Fin n → A) × (Fin n → B)) (Fin n → C) :=
fun rho => piSuperop (fun _ : Fin n => N)
(fun x y => rho ((fun k => (x k).1), (fun k => (x k).2))
((fun k => (y k).1), (fun k => (y k).2)))
/-- Product of two Bell targets, regrouped as (references, receiver outputs), p.7. -/
def bellPair (a b : ℕ) : Op ((Fin a × Fin b) × (Fin a × Fin b)) :=
independentPairs (epr a) (epr b)
/-- Alice's input and Bob's independent reference/input state in (7), p.8. -/
def cqInput (rho : Op A) (tau : Op (R × B)) : Op (R × (A × B)) :=
fun i j => rho i.2.1 j.2.1 * tau (i.1,i.2.2) (j.1,j.2.2)
/-- Joint classical label/pure quantum target, with reference first, pp.6–7,23. -/
def cqMessageTarget {m : ℕ} (s : Fin m) (rho : Op (R × I)) : Op (R × (Fin m × I)) :=
fun i j => if i.2.1 = s ∧ j.2.1 = s then rho (i.1,i.2.2) (j.1,j.2.2) else 0
/-- Dephase the decoder's classical register, making its output an instrument, pp.5–6. -/
def dephaseClassicalRegister {m : ℕ} (rho : Op (R × (Fin m × I))) : Op (R × (Fin m × I)) :=
fun i j => if i.2.1 = j.2.1 then rho i j else 0
/-- The average state, p.4. -/
def pureEnsembleAverage (P : PureEnsemble A) : Op A :=
∑ x, (P.weight x : ℂ) • pureDensity (P.vector x)
/-- Data of (7), p.8: one Alice ensemble and one independent pure Bob pair. -/
structure CQMacData (A B : Type*) [Fintype A] [Fintype B] where
ensemble : PureEnsemble A
bobRank : ℕ
bobPositive : 0 < bobRank
bob : EuclideanSpace ℂ (Fin bobRank × B)
bobUnit : IsState bob
/-- Conditional BC states from that same input data, (7), p.8. -/
def CQMacData.output (D : CQMacData A B) (N : Superop (A × B) C)
(x : Fin D.ensemble.count) : Op (Fin D.bobRank × C) :=
idTensorSuperop N (cqInput (pureDensity (D.ensemble.vector x)) (pureDensity D.bob))
/-- Average BC output of (7), p.8. -/
def CQMacData.averageOutput (D : CQMacData A B) (N : Superop (A × B) C) : Op (Fin D.bobRank × C) :=
∑ x, (D.ensemble.weight x : ℂ) • D.output N x
/-- I(X;C) of (7), pp.4,8. -/
def CQMacData.classical (D : CQMacData A B) (N : Superop (A × B) C) : ℝ :=
vnEntropy (traceLeft (D.averageOutput N)) -
∑ x, D.ensemble.weight x * vnEntropy (traceLeft (D.output N x))
/-- I_c(B coherent-to CX), evaluated on the SAME state (7), pp.4,8. -/
def CQMacData.conditionalCoherent (D : CQMacData A B) (N : Superop (A × B) C) : ℝ :=
∑ x, D.ensemble.weight x *
(vnEntropy (traceLeft (D.output N x)) - vnEntropy (D.output N x))
/-- I(X;BC) of (7), p.30. -/
def CQMacData.sideClassical (D : CQMacData A B) (N : Superop (A × B) C) : ℝ :=
vnEntropy (D.averageOutput N) - ∑ x, D.ensemble.weight x * vnEntropy (D.output N x)
/-- I_c(B coherent-to C) of the averaged BC state, p.30. -/
def CQMacData.coherent (D : CQMacData A B) (N : Superop (A × B) C) : ℝ :=
vnEntropy (traceLeft (D.averageOutput N)) - vnEntropy (D.averageOutput N)
/-- Data of (8), p.8: independent pure reference/input pairs, with arbitrary references. -/
structure QQData (A B : Type*) [Fintype A] [Fintype B] where
aliceRank : ℕ
alicePositive : 0 < aliceRank
bobRank : ℕ
bobPositive : 0 < bobRank
alice : EuclideanSpace ℂ (Fin aliceRank × A)
aliceUnit : IsState alice
bob : EuclideanSpace ℂ (Fin bobRank × B)
bobUnit : IsState bob
/-- The actual ABC output in (8), reference pair grouped first, p.8. -/
def QQData.output (D : QQData A B) (N : Superop (A × B) C) :
Op ((Fin D.aliceRank × Fin D.bobRank) × C) :=
idTensorSuperop N (independentPairs (pureDensity D.alice) (pureDensity D.bob))
/-- BC marginal computed by tracing Alice's reference from that output, p.8. -/
def QQData.bobOutput (D : QQData A B) (N : Superop (A × B) C) : Op (Fin D.bobRank × C) :=
fun i j => ∑ a, D.output N ((a,i.1),i.2) ((a,j.1),j.2)
/-- AC marginal computed by tracing Bob's reference from that output, p.8. -/
def QQData.aliceOutput (D : QQData A B) (N : Superop (A × B) C) : Op (Fin D.aliceRank × C) :=
fun i j => ∑ b, D.output N ((i.1,b),i.2) ((j.1,b),j.2)
/-- I_c(A coherent-to BC), p.8. -/
def QQData.aliceConditional (D : QQData A B) (N : Superop (A × B) C) : ℝ :=
vnEntropy (D.bobOutput N) - vnEntropy (D.output N)
/-- I_c(B coherent-to AC), p.8. -/
def QQData.bobConditional (D : QQData A B) (N : Superop (A × B) C) : ℝ :=
vnEntropy (D.aliceOutput N) - vnEntropy (D.output N)
/-- I_c(AB coherent-to C), p.8. -/
def QQData.sumCoherent (D : QQData A B) (N : Superop (A × B) C) : ℝ :=
vnEntropy (traceLeft (D.output N)) - vnEntropy (D.output N)
/-- I_c(A coherent-to C), p.30. -/
def QQData.aliceCoherent (D : QQData A B) (N : Superop (A × B) C) : ℝ :=
vnEntropy (traceLeft (D.output N)) - vnEntropy (D.aliceOutput N)
/-- I_c(B coherent-to C), p.30. -/
def QQData.bobCoherent (D : QQData A B) (N : Superop (A × B) C) : ℝ :=
vnEntropy (traceLeft (D.output N)) - vnEntropy (D.bobOutput N)
/-- Nonnegative operational rate pairs, pp.5–8. -/
def Nonnegative (r : ℝ × ℝ) : Prop := 0 ≤ r.1 ∧ 0 ≤ r.2
/-- Boundary-inclusive rectangle from a fixed state (7), pp.7–8,13.
Correction: replace the printed strict signs BEFORE closure; the replacer edge
otherwise excludes (0,0). This does not claim equality of the strict and closed unions. -/
def CQMacData.Rectangle (D : CQMacData A B) (N : Superop (A × B) C) (r : ℝ × ℝ) : Prop :=
Nonnegative r ∧ r.1 ≤ D.classical N ∧ r.2 ≤ D.conditionalCoherent N
/-- CQ one-use region; optional cap on the alphabet, pp.8,36. -/
def cqOne (N : Superop (A × B) C) (cap : Option ℕ := none) : Set (ℝ × ℝ) :=
{r | ∃ D : CQMacData A B, (∀ b ∈ cap, D.ensemble.count ≤ b) ∧ D.Rectangle N r}
/-- One-state qq pentagon with ALL three constraints, pp.8,18.
The same disclosed non-strict boundary correction as for Theorem 1 is used. -/
def QQData.Pentagon (D : QQData A B) (N : Superop (A × B) C) (r : ℝ × ℝ) : Prop :=
Nonnegative r ∧ r.1 ≤ D.aliceConditional N ∧ r.2 ≤ D.bobConditional N ∧
r.1 + r.2 ≤ D.sumCoherent N
/-- QQ one-use pentagon union, p.8. -/
def qqOne (N : Superop (A × B) C) : Set (ℝ × ℝ) :=
{r | ∃ D : QQData A B, D.Pentagon N r}
/-- Earlier qq rectangle union, on the SAME product inputs (8), p.30. -/
def qqRectangles (N : Superop (A × B) C) : Set (ℝ × ℝ) :=
{r | Nonnegative r ∧ ∃ D : QQData A B,
r.1 ≤ D.aliceCoherent N ∧ r.2 ≤ D.bobCoherent N}
/-- Alternative cq pentagons on a single state (7), p.30. -/
def cqPentagons (N : Superop (A × B) C) : Set (ℝ × ℝ) :=
{r | Nonnegative r ∧ ∃ D : CQMacData A B, r.1 ≤ D.sideClassical N ∧
r.2 ≤ D.conditionalCoherent N ∧ r.1 + r.2 ≤ D.classical N + D.conditionalCoherent N}
/-- Positive-block regularization, with multiplication avoiding division at k=0, pp.7–8,30. -/
def regularized (F : (n : ℕ) → Set (ℝ × ℝ)) : Set (ℝ × ℝ) :=
{r | ∃ n : ℕ, 0 < n ∧ ((n : ℝ) * r.1, (n : ℝ) * r.2) ∈ F n}
/-- CQ generation code, pp.5–6, (1)–(2): separate pure preparations and joint decoder.
A final dephasing in `cqDecoded` makes the classical output an instrument. -/
structure CQGeneration (A B C : Type*) [Fintype A] [Fintype B] [Fintype C]
[DecidableEq C] (n m k : ℕ) where
alice : Fin m → EuclideanSpace ℂ (Fin n → A)
aliceUnit : ∀ s, IsState (alice s)
bob : EuclideanSpace ℂ (Fin k × (Fin n → B))
bobUnit : IsState bob
decoder : Superop (Fin n → C) (Fin m × Fin k)
decoderChannel : IsChannel decoder
/-- Apply the one n-use joint channel and decoder while leaving Bob's reference untouched,
then read the classical decoder output, pp.5–7. -/
def cqDecoded {n m k : ℕ} (N : Superop (A × B) C)
(D : Superop (Fin n → C) (Fin m × Fin k))
(rho : Op (Fin n → A)) (tau : Op (R × (Fin n → B))) :
Op (R × (Fin m × Fin k)) :=
dephaseClassicalRegister (idTensorSuperop D (idTensorSuperop (macPower N n) (cqInput rho tau)))
/-- Uniform-message average of a JOINT classical/Bell fidelity, (1)–(2), p.6. -/
def CQGeneration.Good {n m k : ℕ} (K : CQGeneration A B C n m k)
(N : Superop (A × B) C) (epsilon : ℝ) : Prop :=
1 - epsilon ≤ (m : ℝ)⁻¹ * ∑ s, squaredFidelity (cqMessageTarget s (epr k))
(cqDecoded N K.decoder (pureDensity (K.alice s)) (pureDensity K.bob))
/-- CQ entanglement transmission, pp.6–7: local CPTP encoder on a Bell half only. -/
structure CQTransmission (A B C : Type*) [Fintype A] [Fintype B] [Fintype C]
[DecidableEq C] (n m k : ℕ) where
alice : Fin m → EuclideanSpace ℂ (Fin n → A)
aliceUnit : ∀ s, IsState (alice s)
encoder : Superop (Fin k) (Fin n → B)
encoderChannel : IsChannel encoder
decoder : Superop (Fin n → C) (Fin m × Fin k)
decoderChannel : IsChannel decoder
/-- Transmission success (3)–(4), pp.6–7; reference is never acted on by the encoder. -/
def CQTransmission.Good {n m k : ℕ} (K : CQTransmission A B C n m k)
(N : Superop (A × B) C) (epsilon : ℝ) : Prop :=
1 - epsilon ≤ (m : ℝ)⁻¹ * ∑ s, squaredFidelity (cqMessageTarget s (epr k))
(cqDecoded N K.decoder (pureDensity (K.alice s)) (idTensorSuperop K.encoder (epr k)))
/-- CQ strong transmission, p.23: local stochastic classical preparations, one fixed
quantum encoder and one fixed joint decoder. Mixed message states represent finite
private random pure preparations after discarding Alice's private seed. No seed is
available to Charlie except through the charged n channel uses. -/
structure CQStrong (A B C : Type*) [Fintype A] [Fintype B] [Fintype C]
[DecidableEq C] (n m k : ℕ) where
alice : Fin m → Op (Fin n → A)
aliceDensity : ∀ s, IsDensityMatrix (alice s)
encoder : Superop (Fin k) (Fin n → B)
encoderChannel : IsChannel encoder
decoder : Superop (Fin n → C) (Fin m × Fin k)
decoderChannel : IsChannel decoder
/-- Maximal JOINT error for every classical message and every reference/input pure state,
(36), p.23. Correction: test the ORIGINAL message, as the inverse cyclic relabeling
on p.25 does. The printed arbitrary f(m) target would permit a constant f. -/
def CQStrong.Good {n m k : ℕ} (K : CQStrong A B C n m k)
(N : Superop (A × B) C) (epsilon : ℝ) : Prop :=
∀ s, ∀ t : ℕ, 0 < t → ∀ psi : EuclideanSpace ℂ (Fin t × Fin k), IsState psi →
1 - epsilon ≤ squaredFidelity (cqMessageTarget s (pureDensity psi))
(cqDecoded N K.decoder (K.alice s) (idTensorSuperop K.encoder (pureDensity psi)))
/-- QQ generation code, p.7, (5); the sender preparations are independent. -/
structure QQGeneration (A B C : Type*) [Fintype A] [Fintype B] [Fintype C]
[DecidableEq C] (n a b : ℕ) where
alice : EuclideanSpace ℂ (Fin a × (Fin n → A))
aliceUnit : IsState alice
bob : EuclideanSpace ℂ (Fin b × (Fin n → B))
bobUnit : IsState bob
decoder : Superop (Fin n → C) (Fin a × Fin b)
decoderChannel : IsChannel decoder
/-- One fidelity against the PRODUCT Bell target, (5), p.7. -/
def QQGeneration.Good {n a b : ℕ} (K : QQGeneration A B C n a b)
(N : Superop (A × B) C) (epsilon : ℝ) : Prop :=
1 - epsilon ≤ squaredFidelity (bellPair a b)
(idTensorSuperop K.decoder (idTensorSuperop (macPower N n)
(independentPairs (pureDensity K.alice) (pureDensity K.bob))))
/-- QQ transmission code, (6), p.7; two individually local CPTP encoders,
no reference access or pre-shared sender/decoder resources. -/
structure QQTransmission (A B C : Type*) [Fintype A] [Fintype B] [Fintype C]
[DecidableEq C] (n a b : ℕ) where
alice : Superop (Fin a) (Fin n → A)
aliceChannel : IsChannel alice
bob : Superop (Fin b) (Fin n → B)
bobChannel : IsChannel bob
decoder : Superop (Fin n → C) (Fin a × Fin b)
decoderChannel : IsChannel decoder
/-- Encoders act only on the two input halves; channel and decoder act jointly, p.7. -/
def QQTransmission.decoded {n a b : ℕ} (K : QQTransmission A B C n a b)
(N : Superop (A × B) C) (rho : Op (R × Fin a)) (tau : Op (S × Fin b)) :
Op ((R × S) × (Fin a × Fin b)) :=
idTensorSuperop K.decoder (idTensorSuperop (macPower N n)
(independentPairs (idTensorSuperop K.alice rho) (idTensorSuperop K.bob tau)))
/-- One simultaneous fidelity, not separate marginal fidelities, (6), p.7. -/
def QQTransmission.Good {n a b : ℕ} (K : QQTransmission A B C n a b)
(N : Superop (A × B) C) (epsilon : ℝ) : Prop :=
1 - epsilon ≤ squaredFidelity (bellPair a b) (K.decoded N (epr a) (epr b))
/-- Strong qq transmission, (37), pp.23–24: all independent external references,
allowing arbitrary entanglement WITHIN each pair, and one product-target fidelity. -/
def QQTransmission.Strong {n a b : ℕ} (K : QQTransmission A B C n a b)
(N : Superop (A × B) C) (epsilon : ℝ) : Prop :=
∀ q t : ℕ, 0 < q → 0 < t →
∀ psi : EuclideanSpace ℂ (Fin q × Fin a), IsState psi →
∀ phi : EuclideanSpace ℂ (Fin t × Fin b), IsState phi →
1 - epsilon ≤ squaredFidelity (independentPairs (pureDensity psi) (pureDensity phi))
(K.decoded N (pureDensity psi) (pureDensity phi))
/-- Closed region from actual integer-rank codes with vanishing error and arbitrary
asymptotic rate slack, pp.6–7. Positive n,m,k guard all logs, divisions, and targets.
The code predicate contains its existential code BEFORE its universal input tests. -/
def operationalRegion (good : ℕ → ℕ → ℕ → ℝ → Prop) : Set (ℝ × ℝ) :=
closure {r | Nonnegative r ∧ ∀ epsilon delta : ℝ, 0 < epsilon → 0 < delta →
∃ n0 : ℕ, 0 < n0 ∧ ∀ n ≥ n0, ∃ a b : ℕ, 0 < a ∧ 0 < b ∧
r.1 - delta ≤ Real.logb 2 a / n ∧ r.2 - delta ≤ Real.logb 2 b / n ∧
good n a b epsilon}
/-- The three operational tasks, pp.5–7,23–24. -/
inductive MACScenario where
| generation
| transmission
| strong
/-- Closed operational CQ region for the chosen task, pp.5–7,23. -/
def cqMacCapacity (N : Superop (A × B) C) (scenario : MACScenario := .generation) : Set (ℝ × ℝ) :=
operationalRegion fun n m k epsilon => match scenario with
| .generation => ∃ K : CQGeneration A B C n m k, K.Good N epsilon
| .transmission => ∃ K : CQTransmission A B C n m k, K.Good N epsilon
| .strong => ∃ K : CQStrong A B C n m k, K.Good N epsilon
/-- Closed operational Q region for the chosen task, pp.5–7,23–24. -/
def qqMacCapacity (N : Superop (A × B) C) (scenario : MACScenario := .generation) : Set (ℝ × ℝ) :=
operationalRegion fun n a b epsilon => match scenario with
| .generation => ∃ K : QQGeneration A B C n a b, K.Good N epsilon
| .transmission => ∃ K : QQTransmission A B C n a b, K.Good N epsilon
| .strong => ∃ K : QQTransmission A B C n a b, K.Strong N epsilon
/-- Optimized sum information over exactly product purifications (8), p.30.
For finite positive physical dimensions and CPTP N, this set is nonempty and
bounded; reference compression bounds their dimensions and gives attainment. -/
def optimizedSum (N : Superop (A × B) C) : ℝ :=
sSup {z | ∃ D : QQData A B, z = D.sumCoherent N}
/-- Corrected controlled-erasure channel of §7.1, PDF p.32.
Printed N0=sum_j |flag><0,j| and Ni=|i><1,i| are NOT TP and dephase Bob.
The prose and N(tau tensor rho)=tau00|flag><flag|+tau11 rho instead specify
K_j=|flag><0,j| and ONE L=sum_j |j><1,j|. This entry formula implements those
Kraus operators, retaining transfer-sector coherences. -/
def controlledErasure (d : ℕ) : Superop (Bool × Fin d) (Option (Fin d)) :=
fun rho i j => match i, j with
| none, none => ∑ a, rho (false,a) (false,a)
| some a, some b => rho (true,a) (true,b)
| _, _ => 0
/-- Collective phase flip Z tensor Z, §7.2, PDF p.34. -/
def collectivePhaseOperator : Op (Bool × Bool) :=
Matrix.diagonal fun z => (if z.1 then (-1 : ℂ) else 1) * (if z.2 then (-1 : ℂ) else 1)
/-- The convex mixture (1-p)rho+p(Z tensor Z)rho(Z tensor Z), p.34. -/
def collectivePhase (p : ℝ) : Superop (Bool × Bool) (Bool × Bool) :=
fun rho => ((1 - p : ℝ) : ℂ) • rho + (p : ℂ) • (collectivePhaseOperator * rho * collectivePhaseOperator)
/-- Channel coherent information using the SAME isometric extension for both
outputs, §7.3, PDF p.35. For density rho this equals the purification definition. -/
def inputCoherent (U : Matrix (B × E) A ℂ) (rho : Op A) : ℝ :=
vnEntropy (receiverChannel U rho) - vnEntropy (complementaryChannel U rho)
/-- Sanity checks for the local definitions: scalar Bell normalization, independent
references, classical labels, and erasure coherences. All proofs are complete. -/
example : epr 1 (0,0) (0,0) = 1 := by simp [epr]
example (a b : ℕ) (i j : (Fin a × Fin b) × (Fin a × Fin b)) :
bellPair a b i j = epr a (i.1.1,i.2.1) (j.1.1,j.2.1) *
epr b (i.1.2,i.2.2) (j.1.2,j.2.2) := rfl
example (rho : Op (R × A)) (tau : Op (S × B))
(r rr : R) (s ss : S) (a aa : A) (b bb : B) :
independentPairs rho tau ((r,s),(a,b)) ((rr,ss),(aa,bb)) =
rho (r,a) (rr,aa) * tau (s,b) (ss,bb) := rfl
example {m : ℕ} (s : Fin m) (rho : Op (R × I)) (r t : R) (i j : I) :
cqMessageTarget s rho (r,(s,i)) (t,(s,j)) = rho (r,i) (t,j) := by simp [cqMessageTarget]
example (d : ℕ) (rho : Op (Bool × Fin d)) (a b : Fin d) :
controlledErasure d rho (some a) (some b) = rho (true,a) (true,b) := rfl
example (d : ℕ) (rho : Op (Bool × Fin d)) :
controlledErasure d rho none none = ∑ a, rho (false,a) (false,a) := rfl
example (rho : Op (Bool × Bool)) : collectivePhase 0 rho = rho := by
simp [collectivePhase]
example : collectivePhaseOperator (false,true) (false,true) = -1 := by
simp [collectivePhaseOperator]
example : collectivePhaseOperator (true,true) (true,true) = 1 := by
simp [collectivePhaseOperator]
example (D : CQMacData A B) (N : Superop (A × B) C) :
D.conditionalCoherent N = ∑ x, D.ensemble.weight x *
(vnEntropy (traceLeft (D.output N x)) - vnEntropy (D.output N x)) := rfl
example (D : QQData A B) (N : Superop (A × B) C) :
D.sumCoherent N = vnEntropy (traceLeft (D.output N)) - vnEntropy (D.output N) := rfl
example (F : (n : ℕ) → Set (ℝ × ℝ)) (r : ℝ × ℝ)
(h : r ∈ regularized F) : ∃ n : ℕ, 0 < n ∧
((n : ℝ) * r.1, (n : ℝ) * r.2) ∈ F n := h
end QAlgorithms.Papers.Independent.Support50.P02
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P02.CQGeneration.Good
For finite types , with decidable equality on , natural numbers , a generation datum consists of unit vectors for every , a unit vector , and a decoder admitting a finite Kraus representation with . For any matrix-valued function and any real , the predicate asserts
Here has entries
and has entries , where
For arbitrary square matrices, the squared fidelity used here is
These are the total functional-calculus expressions even when an argument is not positive. No channel assumption on or restriction on is included. The definition permits , when the product does not use . If , the inequality is , because the sum and the totalized inverse of zero are both zero; prevents such a from existing because its vector could not have norm .
QAlgorithms.Papers.Independent.Support50.P02.CQGeneration
For any finite types , with decidable equality on , and natural numbers , this structure consists of a vector of norm for every , a vector of norm , and a function from complex matrices on to complex matrices on that admits a finite Kraus representation: there exist a natural number and matrices , with rows indexed by the latter product and columns indexed by , such that
Here mean functions from to the respective types. No explicit positivity assumptions on , or nonemptiness assumptions on , are included; at each function type is a singleton, at the family of Alice vectors is empty, and at the required norm-one Bob vector cannot exist.
QAlgorithms.Papers.Independent.Support50.P02.CQMacData.Rectangle
For finite index types , with the required decidable equalities, let be a function from complex matrices indexed by to complex matrices indexed by ; no channel assumption on is imposed. The data consist of a finite ensemble , where , , and each has norm , together with an integer and a norm-one vector . Define matrices by
Write , where is applied by continuous functional calculus, and let denote summation over the diagonal of the -dimensional register. For , the predicate holds exactly when
The ensemble normalization precludes , but zero ensemble weights are permitted.
QAlgorithms.Papers.Independent.Support50.P02.CQMacData.averageOutput
For finite index types , an output index type , data comprising nonnegative real weights summing to , unit vectors for , a positive integer , and a unit vector , and any matrix-valued function from matrices on to matrices on , this defines
where
Real weights act as complex scalars. No linearity, positivity, or channel assumption is imposed on .
QAlgorithms.Papers.Independent.Support50.P02.CQMacData.classical
For finite index types , with decidable equality where required by the matrix functional calculus, take data consisting of nonnegative real weights summing to , unit vectors indexed by , a positive integer , and a unit vector , and let be any function from matrices on to matrices on . Define matrices by
and set and . The declaration defines the real number
where is the total continuous functional calculus used in the code. No channel assumption on , or density-matrix assumption on these outputs, is required; the displayed expression remains the definition in those cases.
QAlgorithms.Papers.Independent.Support50.P02.CQMacData.coherent
For finite types , with decidable equality on , let specify unit vectors indexed by , nonnegative real weights with , a positive integer , and a unit vector . In particular, is excluded by the weight condition. For any function from complex matrices on to complex matrices on , set
Writing , the definition assigns , where , , and is evaluated by the total continuous functional calculus. No linearity, channel, or density-matrix condition on the outputs of is assumed.
QAlgorithms.Papers.Independent.Support50.P02.CQMacData.conditionalCoherent
For finite index types , with decidable equality where required by the matrix functional calculus, take data consisting of nonnegative real weights summing to , unit vectors indexed by , a positive integer , and a unit vector , and any function from matrices on to matrices on . Define
and . This declaration defines the real number
Here is the total continuous functional calculus used in the code. There is no assumption that is linear or a channel, or that the matrices to which is applied are density matrices.
QAlgorithms.Papers.Independent.Support50.P02.CQMacData
For finite index types , this defines a structure containing an ensemble with a natural-number count , real weights summing to , and unit vectors , together with a natural number , a proof that , and a vector satisfying . The weight condition forces . The normalization requirements make this structure uninhabited if either or is empty.
QAlgorithms.Papers.Independent.Support50.P02.CQMacData.output
For finite index types , an output index type , data consisting of weights summing to , unit vectors indexed by , a positive integer , and a unit vector , let be any function from matrices on to matrices on , and choose . This defines a matrix on by
The weights do not enter this formula. No linearity or channel condition is imposed on , and the definition imposes no separate density-matrix condition on its output.
QAlgorithms.Papers.Independent.Support50.P02.CQMacData.sideClassical
For finite types , with decidable equality on , let consist of an ensemble of unit vectors , nonnegative real weights satisfying , and a unit vector for a positive integer . The weight condition excludes . Let be any function from complex matrices on to complex matrices on ; no channel assumption is imposed. Define matrices on by
and put . The definition assigns the real number
where uses the total continuous functional calculus. The matrices produced by are not required to be density matrices.
QAlgorithms.Papers.Independent.Support50.P02.CQStrong.Good
For finite types , with decidable equality on , natural numbers , and a datum containing positive semidefinite trace-one matrices on , an encoder , and a decoder , where both maps admit finite Kraus representations with , this predicate says the following for any matrix-valued function and any real : for every , every natural number , and every unit vector ,
The encoded reference–input matrix has entries
the target has entries , and the output has entries
Here is a matrix unit and , where . There is no channel assumption on or restriction on . If , there are no labels ; if , there are no such unit vectors , so in either case the predicate is vacuous whenever exists. At , the empty products equal and is not evaluated.
QAlgorithms.Papers.Independent.Support50.P02.CQStrong
For finite types , with decidable equality on , and arbitrary natural numbers , this structure consists of complex matrices on , one for each , each positive semidefinite with complex trace exactly ; an encoder ; and a decoder . Each map must have, for some natural number , a finite Kraus representation
No communication map or success requirement is part of the structure. The parameters need not be positive: makes the conditions on vacuous, but a density matrix on an empty index set cannot have trace , and a channel from a nonzero-dimensional space to a zero-dimensional space cannot satisfy the stated Kraus identity.
QAlgorithms.Papers.Independent.Support50.P02.CQTransmission.Good
For finite types , with decidable equality on , natural numbers , and a transmission datum containing unit vectors , an encoder , and a decoder , where both maps have finite Kraus representations satisfying , this predicate is defined for any matrix-valued function and any real by
Define on by , and define the encoder output blockwise by
The target is , and the actual output is
Here , with , and denotes a matrix unit. No channel condition on or range restriction on is imposed. Zero parameters are included wherever exists: uses empty products and does not evaluate , while or makes the displayed fidelity average zero, so the condition becomes .
QAlgorithms.Papers.Independent.Support50.P02.CQTransmission
For finite types , with decidable equality on , and arbitrary natural numbers , this structure consists of a family , indexed by , satisfying for every ; an encoder ; and a decoder . Each of the two maps is required to admit a finite Kraus representation
for some natural number , with appropriately sized complex matrices , and the representation must hold for every input matrix. There is no communication map or success condition among the fields. All three natural-number parameters may be zero; when , the vector conditions are vacuous, while a required unit vector on an empty index set, or a channel from a nonzero-dimensional space into a zero-dimensional space, makes the corresponding structure impossible to instantiate.
QAlgorithms.Papers.Independent.Support50.P02.MACScenario
This defines a type with exactly three distinct possibilities, named generation, transmission, and strong. None carries any additional data.
QAlgorithms.Papers.Independent.Support50.P02.Nonnegative
For every ordered pair of real numbers , this predicate means exactly
Either coordinate, or both coordinates, may equal zero.
QAlgorithms.Papers.Independent.Support50.P02.QQData.Pentagon
For finite index types , with the required decidable equalities, let be an arbitrary function from complex matrices on to complex matrices on . The data consist of positive integers and norm-one vectors and . Define
Let , , and , where these traces sum over the corresponding register's diagonal entries. With , where is applied by continuous functional calculus, the predicate for means exactly
No channel assumption on is included.
QAlgorithms.Papers.Independent.Support50.P02.QQData.aliceCoherent
For finite types , with decidable equality on , let contain positive integers and unit vectors , , and let be any function from complex matrices on to complex matrices on . Form
Set and . The defined value is , with , , interpreted through the total continuous functional calculus. No channel or output-density condition is required of .
QAlgorithms.Papers.Independent.Support50.P02.QQData.aliceConditional
For finite types , with decidable equality on , let supply positive integers and unit vectors , , and let be any function from complex matrices on to complex matrices on . Define
and . The definition assigns , where , , using the total continuous functional calculus. No channel assumption on or density-matrix assumption on these output matrices is imposed.
QAlgorithms.Papers.Independent.Support50.P02.QQData.aliceOutput
For finite types , an arbitrary type , data supplying positive integers and unit vectors , , and any function from complex matrices on to complex matrices on , this definition returns the matrix on with entries
The sum is taken after applying to each block. The definition assumes no linearity or channel property of and does not require its result to be a density matrix.
QAlgorithms.Papers.Independent.Support50.P02.QQData.bobCoherent
For finite types , with decidable equality on , let supply positive integers and unit vectors , . For any function from complex matrices on to complex matrices on , define
Let and . This definition assigns , where , , evaluated by the total continuous functional calculus. No linearity, channel, or output-density assumption on is imposed.
QAlgorithms.Papers.Independent.Support50.P02.QQData.bobConditional
For finite types , with decidable equality on , let contain positive integers and unit vectors , . For any function from complex matrices on to complex matrices on , define
and . The defined real number is , where for , evaluated by the total continuous functional calculus. Neither a channel property of nor positivity or normalization of its outputs is assumed.
QAlgorithms.Papers.Independent.Support50.P02.QQData.bobOutput
For finite types , an arbitrary type , positive integers , unit vectors , supplied by , and any function from complex matrices on to complex matrices on , this definition returns the matrix on given by
The sum is outside the application of . No linearity, channel, or output-normalization assumption is imposed on .
QAlgorithms.Papers.Independent.Support50.P02.QQData
For any finite types and , this structure consists of natural numbers , proofs that and , and vectors
with their Euclidean norms equal to . These are the fields named aliceRank, bobRank, alice, and bob, together with their positivity and normalization proofs. The two rank parameters cannot be zero, and the normalization requirements make such data impossible if either or is empty.
QAlgorithms.Papers.Independent.Support50.P02.QQData.output
For finite types , an arbitrary type , data containing positive integers and unit vectors , , and any function from complex matrices on to complex matrices on , this definition returns the matrix indexed by whose entries are
Thus is applied separately to each matrix block specified by the two reference indices. No linearity or channel property of , and no density-matrix property of the result, is required.
QAlgorithms.Papers.Independent.Support50.P02.QQData.sumCoherent
For finite types , with decidable equality on , let specify positive integers and unit vectors , . Given any function from complex matrices on to complex matrices on , set
and . This definition assigns , where , , using the total continuous functional calculus. The function need not be a channel, and its output matrices need not be density matrices.
QAlgorithms.Papers.Independent.Support50.P02.QQGeneration.Good
For finite types , with decidable equality on , natural numbers , and a generation datum containing unit vectors , , and a decoder with a finite Kraus representation , , this predicate is defined for any matrix-valued function and any real by
For reference indices and , define
Then , while the target is
Here is a matrix unit and , with . There is no dephasing of the decoded output, no channel assumption on , and no restriction on . Although zero parameters are syntactically allowed, the unit-vector fields of exclude and ; remains included and makes the product empty, so is not evaluated.
QAlgorithms.Papers.Independent.Support50.P02.QQGeneration
For finite types , with decidable equality on , and arbitrary natural numbers , this structure consists of a unit vector , a unit vector , and a decoder . The decoder must admit, for some natural number , complex matrices such that
No communication map or success condition is included. The parameters are not explicitly required to be positive, but or makes the corresponding required unit vector impossible; likewise, a required channel into a zero-dimensional space from a nonzero-dimensional space cannot exist. The value is included, with and each having one element.
QAlgorithms.Papers.Independent.Support50.P02.QQTransmission.Good
For finite types , with decidable equality on , natural numbers , and transmission data consisting of encoders , , and a decoder , each admitting a finite Kraus representation with , this predicate says, for any matrix-valued function and any real ,
For , let . Define
The output is , and the target is
Here , with , and denotes a matrix unit. No channel assumption on or restriction on is included. If or , the fidelity is zero and the condition becomes , whenever exists. At , the product is empty and the construction does not evaluate .
QAlgorithms.Papers.Independent.Support50.P02.QQTransmission.Strong
For finite types , with decidable equality on , natural numbers , and transmission data containing encoders , , and a decoder , each with a finite Kraus representation , , this predicate is defined for any matrix-valued function and any real . It requires that for every pair of positive natural numbers , every unit vector , and every unit vector ,
For each pair of reference indices, form
and set . Here is a matrix unit and , with . Thus the quantified inputs are independent pure states of the two reference–input pairs. No channel assumption on or range restriction on is imposed. If or , the corresponding unit vectors do not exist and the predicate is vacuous whenever exists; is included and uses empty products without evaluating .
QAlgorithms.Papers.Independent.Support50.P02.QQTransmission.decoded
For finite types , with decidable equality on , reference index types , natural numbers , and transmission data comprising channels , , and , this defines an output matrix from an arbitrary matrix-valued function and arbitrary complex matrices on and on . Each channel condition means a finite Kraus representation with . Define the reference blocks and , and then
The defined output is the matrix on with entries
No positivity or normalization is required of , and no channel or linearity condition is imposed on . The construction includes zero natural-number parameters wherever exists; at , the empty product is and is not evaluated.
QAlgorithms.Papers.Independent.Support50.P02.QQTransmission
For finite types , with decidable equality on , and arbitrary natural numbers , this structure consists of three matrix-valued maps: an Alice encoder , a Bob encoder , and a decoder . Each map must admit a finite Kraus representation
for some natural number , separately for each map. No communication map or success requirement is included. Zero values of are allowed by the parameters, although the Kraus conditions can rule out particular choices; in particular, no such channel can map a nonzero-dimensional input space into a zero-dimensional output space. A zero-dimensional input space is not itself excluded.
QAlgorithms.Papers.Independent.Support50.P02.bellPair
For any natural numbers , this defines a complex matrix indexed by , whose entries are
The reciprocals are taken in . Thus each constituent matrix has constant entry , respectively , whenever both its row and column pairs have equal components, and zero otherwise. Zero values of or are allowed; in those cases the resulting matrix has an empty index set.
QAlgorithms.Papers.Independent.Support50.P02.collectivePhase
For every real number , this defines a function on all complex matrices indexed by Boolean pairs by
using the Boolean-pair order , , , . The definition imposes no positivity or normalization condition on , and no restriction . In particular, gives the identity map and gives conjugation by .
QAlgorithms.Papers.Independent.Support50.P02.collectivePhaseOperator
This defines the complex matrix indexed by pairs of Booleans to be diagonal, with
Thus its diagonal entries in the order , , , are , and all off-diagonal entries are zero.
QAlgorithms.Papers.Independent.Support50.P02.controlledErasure
For every natural number , this defines a function from complex matrices indexed by to complex matrices indexed by , where denotes the extra “none” index. Its value on an arbitrary matrix is
and every entry with exactly one index equal to is zero. No positivity or trace condition on is required. The definition includes ; then the input index set is empty and the output is the zero matrix on the singleton index set .
QAlgorithms.Papers.Independent.Support50.P02.cqDecoded
For finite index types , with decidable equality on , a reference index type , and arbitrary natural numbers , this defines a matrix on from arbitrary matrix-valued functions and , a complex matrix on , and a complex matrix on , where means functions . Writing for a matrix unit, define the matrix on by
The defined output has entries
Thus only entries between different classical labels are removed. No linearity, channel, positivity, normalization, or error assumption is imposed on these arguments. Zero values of are included: at , the products are empty products equal to , so the construction does not evaluate ; if or , the output index set is empty.
QAlgorithms.Papers.Independent.Support50.P02.cqInput
For index types , an arbitrary complex matrix on , and an arbitrary complex matrix on , this defines a matrix on by
There are no positivity, trace, or normalization assumptions, and empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P02.cqMacCapacity
For finite types , each with decidable equality, an arbitrary map from complex matrices on to complex matrices on , and a scenario defaulting to generation, this defines the closure of the nonnegative pairs satisfying
with a code of the selected kind satisfying the condition below. Write for the functions , and similarly for other types. The block map acts on a matrix on by grouping these coordinates into and setting
where is a matrix unit. An extension applies separately to every matrix block indexed by the untouched reference. Put , let have entries between and and zero otherwise, and let
where square roots use the supplied continuous functional calculus. A channel means a map for some finite family with ; a density matrix is positive semidefinite with trace one. In generation, the code consists of unit vectors for , a unit vector , and a decoding channel , and must satisfy
Here inputs are reordered to , and sets to zero all output entries whose two message indices differ. In transmission, is replaced by for an encoding channel , with the same average condition. In strong, Alice instead supplies density matrices on , and there are encoding and decoding channels of those same types such that, for every , every positive integer , and every unit vector ,
The definition assumes neither that is a channel nor that the finite types are nonempty; existence of the required vectors and channels remains part of the rate condition.
QAlgorithms.Papers.Independent.Support50.P02.cqMessageTarget
For index types , a natural number , a chosen label , and any complex matrix on , this defines a matrix on by
No density-matrix assumption is imposed on . Although ranges over all natural numbers, supplying is impossible when .
QAlgorithms.Papers.Independent.Support50.P02.cqOne
For finite index types , with the required decidable equalities, an arbitrary function from complex matrices on to complex matrices on , and an optional natural-number bound , this is the set of pairs for which there exist a finite ensemble of norm-one vectors , indexed by , nonnegative weights summing to , an integer , and a norm-one vector , satisfying the following conditions. Define
and , with applied by continuous functional calculus. Then
where traces out the -dimensional register. If contains , one additionally requires ; if it contains no value, as in the default argument, this restriction is vacuous. Normalization forces , so a bound of admits no such data. No channel property of is required.
QAlgorithms.Papers.Independent.Support50.P02.cqPentagons
For finite index types , with the required decidable equalities, and an arbitrary function from complex matrices on to complex matrices on , this is the set of nonnegative pairs admitting a finite ensemble of norm-one vectors , indexed by , nonnegative weights with , a positive integer , and a norm-one vector , such that
satisfy
Here traces out the -dimensional register and , with applied by continuous functional calculus. Ensemble normalization forces , while zero weights are allowed; need not be a channel.
QAlgorithms.Papers.Independent.Support50.P02.dephaseClassicalRegister
For index types , any natural number , and any complex matrix on , this defines a matrix on the same index set by
Thus entries are retained precisely when their label coordinates agree; no restriction is placed on their other coordinates. No positivity or normalization assumption is required. The case gives a matrix on an empty index set.
QAlgorithms.Papers.Independent.Support50.P02.independentPairs
For index types , and arbitrary complex matrices indexed by and indexed by , this defines a complex matrix indexed by , with entries
Neither input is required to be positive semidefinite or normalized. Empty index types are allowed.
QAlgorithms.Papers.Independent.Support50.P02.inputCoherent
For arbitrary finite types , each equipped with decidable equality, an arbitrary complex matrix with rows indexed by and columns indexed by , and an arbitrary complex matrix indexed by , this defines
where uses continuous functional calculus. Explicitly, the two partial traces have entries and , respectively. No isometry condition on , density-matrix condition on , or nonemptiness condition on the finite types is imposed; the expression uses the total functional calculus and logarithm also outside the density-matrix setting.
QAlgorithms.Papers.Independent.Support50.P02.macPower
For finite index types with decidable equality, an index type , an arbitrary function from complex matrices on to complex matrices on , and any natural number , this defines a function from matrices on to matrices on . Explicitly, for an input matrix and , its output entry is
where and are the two components of , similarly for , and is the matrix with entry at and zero elsewhere. No linearity, positivity, or channel condition is imposed on . The case is included: all sequence index sets are singletons, the empty product is , and the construction preserves the sole entry of , independently of .
QAlgorithms.Papers.Independent.Support50.P02.operationalRegion
For any predicate , where are natural numbers and is real, this defines the following subset of , with closure taken in the usual topology:
The threshold may depend on both tolerances, and may additionally depend on . The predicate is arbitrary; no monotonicity or other property is required. Although its arguments allow zero natural numbers and arbitrary real errors, the condition defining this region tests it only with and . Taking the closure also includes limits of the displayed rate pairs.
QAlgorithms.Papers.Independent.Support50.P02.optimizedSum
For finite types with decidable equality and an arbitrary map from matrices on to matrices on , this defines a real number as follows. For every pair of positive integers and unit vectors , , form the matrix on by
Its -marginal is . The defined number is
where is applied through continuous functional calculus and the supremum is taken in . No channel property of , nonemptiness of the types, or separate boundedness condition is assumed. If no such source vectors exist, the underlying set is empty and its real supremum is the totalized value .
QAlgorithms.Papers.Independent.Support50.P02.pureEnsembleAverage
For a finite index type , let consist of a natural number , real weights for satisfying , and vectors satisfying . This defines the matrix
Equivalently, it is the weighted sum of the matrices whose entries are . The structure permits a natural-number count syntactically, but its weight condition rules out ; together with vector normalization, these conditions also rule out such an ensemble when is empty.
QAlgorithms.Papers.Independent.Support50.P02.qqMacCapacity
For finite types with decidable equality, an arbitrary matrix-valued map , and a scenario defaulting to generation, this defines the closure of the nonnegative pairs such that, for every , there is a positive integer such that every admits positive integers with
and a code of the selected kind. Here denotes the functions from to ; is defined, after grouping the two input strings into a string of pairs, by
Reference extensions apply a map to each reference-indexed matrix block. Write , let be the matrix with entry between and and zero elsewhere, and use
with continuous functional calculus square roots. Every channel required below has a finite Kraus representation with . In generation, a code consists of unit vectors , , and a decoding channel , satisfying
with coordinates reordered so that the two references precede the two inputs or outputs. In transmission, there are encoding channels , , and such a decoding channel, and the same condition holds with the source replaced by
In strong, the same kinds of encoding and decoding channels must, for all positive integers and all unit vectors , , satisfy
again grouping references before inputs and outputs. The definition imposes no channel assumption on and no nonemptiness assumption on .
QAlgorithms.Papers.Independent.Support50.P02.qqOne
For finite index types , with the required decidable equalities, and an arbitrary function from complex matrices on to complex matrices on , this is the set of pairs for which there exist positive integers and norm-one vectors , such that, defining
one has
Here partial traces sum over the diagonal entries of the indicated reference registers, and , with applied by continuous functional calculus. The witnessing data may depend on the pair; no channel property of is required.
QAlgorithms.Papers.Independent.Support50.P02.qqRectangles
For finite index types , with the required decidable equalities, and an arbitrary function from complex matrices on to complex matrices on , this is the set of nonnegative pairs for which there exist positive integers and norm-one vectors , satisfying the following bounds. Define
Then the required inequalities are
Here and trace out the respective reference registers, and , where is applied by continuous functional calculus. No additional bound on , and no channel hypothesis on , appears.
QAlgorithms.Papers.Independent.Support50.P02.regularized
For any family assigning a subset to each natural number , this is the set
Thus membership requires one positive integer witness; contributes nothing. No nonnegativity condition on the pair, closure operation, or limiting condition is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.