Definitions for Coding Theorems of Quantum Information Theory
DefinitionQAlgorithms_Papers_Independent_Renew46_P43The objects the formalized statements of Coding Theorems of Quantum Information Theory (arXiv:quant-ph/9907077) are stated in. Each was checked against the paper by a blind read-back and a moderator.
wordTensor: PDF pp.8,11: product of a list of matrices, with time in increasing coordinate order.exp2: PDF p.11: base-two exponential.pmfEntropy: PDF p.11: Shannon entropy, with the continuous zero-mass convention.varianceSet: PDF p.11: variance-typical sequences, including the zero-probability constraints.varianceConstant: PDF p.12: K_V = 2 log_2(e)/e, distinct from the entropy-variance constant.FineResolution: PDF pp.12-14: a chosen fine spectral resolution, including zero eigenvalues and a full choice of rank-one projectors inside degenerate eigenspaces.FineResolution.law: PDF p.12: the normalized spectral weights, adapted to the PMF interface.FineResolution.atom: PDF pp.12-14: fine projections computed from columns of the accepted unitary basis. Column phases cancel; all degeneracy choices remain available.FineResolution.state: PDF p.12: the state constructed from its spectral resolution.varianceProjector: PDF p.12: variance-typical projector in the chosen spectral basis.spectralN: PDF p.12: rank of sqrt(rho(1-rho)), evaluated on its spectral list.spectralMu: PDF p.12: least positive eigenvalue of sqrt(rho(1-rho)); zero on empty support.varianceTail: PDF p.12: the explicitly natural-exponential variance tail; pure states have N=0.IsShadow: PDF p.12: an eta-shadow is an effect with at least eta state mass.entropyProjector: PDF pp.13-14: entropy-typical projector. Zero-probability spectral words are excluded rather than assigning them the totalized value log(0).entropyConstant: PDF p.14: choose the advertised upper bound as the common K_H(d). Increasing a valid variance constant only decreases all stated lower bounds.constantProjector: PDF p.14: constant-typical projector, with absolute coordinate deviations.complexOperatorNorm: PDF p.15: the operator norm, expressed using the induced Euclidean operator.etaFunction: PDF pp.15,64: eta(t)=-t log_2(t), including eta(0)=0.IsCountablePOVM: PDF pp.10,62: a genuinely countable POVM; HasSum rules out a junk tsum.sqrtInstrumentBranch: PDF p.10: square-root instrument branch.interior: PDF p.10: the actual nonselective operation, including every outcome.totalDisturbance: PDF p.10: trace norm of the labelled block-diagonal difference. For countably many outcomes the one norm on the direct sum is the sum of the block one norms.PureSource: PDF pp.7-8: a finite set of distinct pure letters with an arbitrary probability law.PureSource.average: PDF p.7: average source state, computed from the ensemble.PureSource.weight: PDF pp.7-8: iid word probability.PureSource.word: PDF pp.7-8: the actual pure product word.SourceCode: PDF p.7: arbitrary state-valued encoding and a CPTP decoder. The resource is Hilbert dimension k, with no restriction on the decoder's Kraus rank or isometry.SourceCode.fidelity: PDF p.7: average overlap fidelity of the actual code.SourceCode.distortion: PDF p.8: average half-trace-norm distortion.SourceCode.rate: PDF p.11: log_2(dim K)/n, guarded by the code's positive dimension and length.EncoderExtension: PDF pp.7-8: a quantum encoding extends the given state-valued encoder by one fixed CPTP map on every matrix, including off-diagonal operators.purification: PDF p.8: a specific purification with reference first, obtained by vectorizing sqrt(rho); its partial trace over the reference is rho for every density operator.sourceFe: PDF p.8: source-state entanglement fidelity, using the actual extended channel.SourceQuality: PDF pp.11,19: the four operational code qualities used in Chapter I.MeetsQuality: PDF pp.11,19: quality of an actual block code. No quantum extension is assumed for arbitrary encoding, and entanglement fidelity is only evaluated on a CPTP extension.minimumSourceRate: PDF p.11: minimum rate among actual codes; the extended nonnegative real infimum is +infinity on an empty feasible set, never a spurious zero.sourceRate: PDF p.11: fixed-error operational limsup of block minima; n+1 ranges exactly over all positive lengths.projectionEncoder: PDF p.16: the actual compression map into the range coordinates of an isometry V. For a state the second coefficient is (1-Tr(rho Pi))/k.IntrinsicSystem: PDF pp.60-61: a finite C*-algebra in a multiplicity-free direct-sum representation. Its ordinary matrix trace is intrinsic; dim is the SUM of block Hilbert dimensions.IntrinsicSystem.IsState: PDF p.61: intrinsic normalized states, including classical and hybrid systems.IntrinsicSystem.IsPureState: PDF p.61: minimal intrinsic projections, represented by rank-one block states.intrinsicAmplification: PDF p.62: matrix amplification of a Heisenberg map, preserving the ancillary matrix blocks, not just diagonal ancillary states.IntrinsicOperation: PDF p.62: a CP-unital Heisenberg map on the specified block algebras. Its linear extension off the domain algebra is immaterial and is not assumed positive.Embedding: PDF pp.61,65: a subsystem inclusion, in independent intrinsic coordinates. No tensor-factor representation or disjointness is imposed.Hom: PDF p.66: a star homomorphism, which is not required injective.CommutingImages: PDF pp.62,65: elementwise compatibility of two map images.intrinsicRestriction: PDF pp.62,65-69: the intrinsic trace adjoint, using only matrix units that belong to the domain algebra. This is restriction for an inclusion map.viewedEntropy: PDF p.69: H(phi)=H(phi_*rho), for the one fixed ambient state rho.jointState: PDF pp.66,69: the state pulled back by the product map F G. Compatibility makes this a joint state; central overlaps are allowed.intrinsicMutualInformation: PDF pp.65,69: mutual information, formed from the same ambient rho throughout.intrinsicConditionalEntropy: PDF pp.65,69: conditional entropy; it may be negative.familyState: PDF pp.62,68: joint pullback for any finite family. Product order is fixed by the finite list; theorems require distinct images to commute, so the choice is irrelevant.familyEntropy: PDF pp.65,68: entropy of the generated algebra of a subset of a compatible family, computed by the trace adjoint of multiplication, which preserves its intrinsic spectrum.Diagonalization: PDF pp.66-67: positive-coefficient diagonalization of a state, on its support; zero eigenspaces are not required in this definition.TraceNonincreasing: PDF p.70: the source's maximality condition, on positive domain elements.classicalKLTerm: PDF pp.64-65: nonnegative base-two relative-entropy contribution. The continuous zero-first-mass value is q / log 2, so the linear corrections sum to zero for normalized laws, including laws with zero entries. This form avoids undefined infinity-minus-infinity for countably many outcomes.countableEntropy: PDF pp.62,65: entropy of a countable probability law, possibly +infinity.measuredInformation: PDF p.72: the actual outcome-law mutual information of commuting observables.hybridInformation: PDF pp.70,72: mutual information between an intrinsic subsystem and a countable observable, as the weighted divergence of its posterior states from its marginal.cqAverage: PDF p.73: average state for an arbitrary measurable input law.cqInformation: PDF p.73: cq mutual information, defined by relative entropy before invoking the entropy-difference identity, including arbitrary input probability measures.cqMeasuredInformation: PDF pp.37,73: measured information from the conditional and marginal outcome laws of the actual POVM, including countably many outcomes.fullAlgebra: PDF pp.60-61: a full matrix system in intrinsic coordinates.identityOperation: PDF pp.61,65: the identity is a CP-unital operation on every intrinsic system.identityEmbedding: PDF p.65: identity subsystem, used for sanity checks of restriction.xIndices: PDF p.74: two copies of the finite factor index, labelled as X and Y.yIndices: PDF p.74: the Y labels, separate from the X labels.observableJoint: PDF pp.69-70: joint state of a finite observable and a compatible intrinsic subsystem, with the observable's actual outcome retained.HybridSource: PDF pp.53-55: a possibly correlated finite classical/hybrid pure-letter source. The law is joint on all classical letters and the pure Y letter; it need not factor.HybridSource.marginal: PDF pp.53,57: the computed marginal state on X(J)Y of the joint source law.HybridSource.subsetEntropy: PDF pp.57-58: H(X(J)|YX(J^c)), computed from the same correlated source.HybridSource.lowerRegion: PDF pp.57-58: upward unbounded source rate region, with lower subset constraints.HybridSource.corner: PDF p.58: source permutation corner, conditioned on the preceding classical letters and Y, with the source's order rather than its reverse.IsExtreme: PDF p.57: ordinary extremality; no coordinatewise upper-maximality condition.empiricalWeight: PDF p.29: empirical law weights; the source calls this the type of the word. Positive n is required in every theorem using this definition.wordConditionalEntropy: PDF p.29: conditional output entropy for the actual word's empirical law.conditionalVarianceProjector: PDF p.29: conditional variance-typical projector. Equal input letters are grouped in the count conditions; the tensor factors remain in their original time order. An empty input-letter group imposes only 0≤0 and contributes the scalar identity.changeSpectrum: PDF pp.30-31: change the eigenvalue list in a chosen simultaneous fine basis.divergenceTail: PDF p.31: base-two divergence tail, with 2^{-n*infinity}=0 at positive n.PartyWords: PDF pp.45-46: the regrouped multi-party basis, with each sender holding a word.MultipleData: PDF p.45: finite pure-letter source data. Validity is stated separately so that explicit example ensembles can be constructed without admitted definition proofs.MultipleData.Valid: PDF p.45: source validity, with no product-state promise or independent sender law.MultipleData.average: PDF p.45: computed average source density.MultipleData.word: PDF pp.45-46: the actual temporal word, regrouped by sender.MultipleData.blockAverage: PDF p.46: the average block state, in the same party grouping as the encoder.multipleMarginal: PDF p.45: partial trace to any sender subset, including the empty subset.partyMaps: PDF p.45: tensor product of heterogeneous local maps, on all matrix units. This preserves entangled source letters and does not replace them by their marginals.MultipleCode: PDF pp.45-46: joint CPTP decoder with range in the actual product block algebra. CPTP extensions from intrinsic input algebras to full matrices are equivalent by precomposing block pinching. This imposes no restriction on intrinsic local encoders.MultipleCode.channel: PDF p.46: the full joint source recovery channel.MultipleCode.rate: PDF p.46: rate of each actual local compression space.MultipleCode.fidelity: PDF p.46: ensemble-averaged pure-word fidelity.MultipleCode.distortion: PDF p.46: ensemble-averaged half trace distance.quantumSourceRegion: PDF p.46: actual code-sequence rate region; error vanishes and every rate coordinate converges to the specified rate, over all positive lengths.entanglementSourceRegion: PDF p.46: Fe only for fully quantum systems. The explicit domain guard prevents an assertion of a purification rate region on a hybrid system.HybridSource.systems: PDF pp.53-55: intrinsic systems, with Y the last party.HybridSource.classicalCoordinate: Read a classical coordinate through the fixed dependent-system identification.HybridSource.quantumCoordinate: Read Y through the same fixed dependent-system identification.HybridSource.multiple: PDF pp.53-55: the actual joint classical/pure-Y source, with Y the last party.HybridSource.withYRate: PDF pp.55-56: append the entropy of Y to the classical compression rates.ProductData: PDF pp.45-46: product-letter data for arbitrary local encoders. The JOINT law may be correlated; only each source letter is a product across senders.ProductData.Valid: PDF pp.45-46: normalized distinct local pure letters in the respective intrinsic systems.ProductData.multiple: PDF p.45: construct the joint pure ensemble from local product letters and the original correlated law, rather than replacing that law by a product of marginals.ArbitraryMultipleCode: PDF p.46: arbitrary separate state-valued encoders and an actual joint CPTP decoder. Only the local word is supplied to each encoder.ArbitraryMultipleCode.fidelity: PDF p.46: actual average overlap quality for the arbitrary local encoders.ArbitraryMultipleCode.distortion: PDF p.46: average half trace norm for the same arbitrary code.arbitrarySourceRegion: PDF p.46: arbitrary-encoding operational region, only on product-letter sources.SourceRegionProperties: PDF p.46: closed, convex and coordinatewise upward closed, including unbounded regions.wheelVector: PDF pp.47-48: the four wheel vectors |0>,|1>,|+>,|->, with real signs.clonedWheel: PDF pp.47-48: the actual cloned-wheel source, with the same randomly chosen pure state sent to both encoders. Its law is diagonal, not independent across parties.clonedCross: PDF p.52: the two orthogonal alternatives of the cloned cross.eprSourceVector: PDF pp.51-52: the two Bell alternatives |Phi+> and |Phi->, in party coordinates.eprSource: PDF p.51: the actual equidistributed EPR source.wheelQuantumOuter: PDF pp.47-48: the necessary quantum cloned-wheel rate region.nonnegativeSumRegion: PDF p.48: the arbitrary-encoding sum-rate region for a two-source example.halfRateRegion: PDF pp.51-52: the half-qubit individual-rate necessary constraints.StateChannel: PDF p.20: nonstationary channels are arbitrary nonempty measurable state sets on the one fixed output system. Input laws need not have finite support.StateChannel.capacity: PDF p.24: single-use capacity, optimized over all probability measures on the measurable state set. Information is bounded by log_2(dim A's Hilbert representation), so the real supremum is bounded and nonempty.NonstationaryCode: PDF pp.23-24: actual nonstationary product-state code with a collective block POVM and a failure outcome. The error criterion is maximum message error.NonstationaryCode.error: PDF p.23: maximum error, with the message-set nonemptiness enforced in the code.nonstationaryN: PDF p.23: optimal number of messages among actual codes. For 0≤lambda<1 the set is nonempty and bounded by dim(output)^n/(1-lambda), so Nat.sSup is an actual finite maximum; no statement below uses this definition in the unbounded lambda≥1 regime.MaximalCodeConclusion: PDF pp.24-25: all maximal-code conclusions, including membership in the large event and the trace bound for actual chosen entropy-typical projectors.FiniteChannel: PDF p.28: finite stationary channel, with input labels retained even when several labels are mapped to the same output state.FiniteChannel.information: PDF pp.28-29: finite-law Holevo information, using the same normalized channel.FiniteChannel.capacity: PDF p.28: capacity of the finite channel; PMF is compact and nonempty, and information is bounded. This real supremum has no empty/unbounded-set junk.FiniteCode: PDF pp.23,28: finite stationary code, collective decoding, optional failure.FiniteCode.error: PDF pp.23,28: maximum-message error for the actual channel and decoder.finiteN: PDF p.28: actual optimal message count, finite whenever lambda<1.FiniteCode.Composition: PDF pp.28,33: the code really has a fixed empirical composition P.FiniteCode.codebook: PDF p.53: actual finite codebook, with duplicate encodings removed as a set.IntrinsicSourceCode: PDF p.20: an intrinsic-output source code must decode into the declared block algebra. Quantum input maps may be extended by precomposing intrinsic block pinching.intrinsicSourceRate: PDF p.20: fixed-error rates in the intrinsic source algebra; resource cost is log Hilbert dimension of the compressed system, not dimension of the algebra.letterOutputEntropy: PDF pp.28,34: H(V|P), for any finite family of output states.conditionalDivergence: PDF pp.28,34: conditional quantum divergence, allowing unsupported output states and zero-probability input letters (0*infinity=0 in ENNReal).individualExponent: PDF p.34: individual entropy-threshold exponent, with empty infimum +infinity.collectiveExponent: PDF p.34: collective entropy-threshold exponent.greedyExponent: PDF p.34: E_g(R,P); the factor 1/2 multiplies ONLY the collective exponent. The supremum is paired with an explicit attainment conclusion below.greedyBound: PDF p.35: optimize the greedy bound over all rate-admissible input laws.sphereExponent: PDF p.35: sphere-packing exponent, minimizing over the full normalized channel class, with no commutativity restriction on comparison-channel states.sphereBound: PDF p.36: global sphere-packing bound. Attainment is stated below.minimumChannelError: PDF p.28: minimum maximum error among actual n-block codes at rate at least R.errorExponent: PDF p.34: a zero error has exponent +infinity, not totalized log(0)=0.reliability: PDF p.34: joint liminf in length tending to infinity and POSITIVE rate slack tending to zero. It is not the error exponent at the exactly fixed finite-block rate.universalRange: PDF p.17: least common support over ALL states and ALL fine bases of entropy at most R, not just the eigenbasis of the particular source being compressed.universalProjector: PDF p.17: the orthogonal projector onto the actual universal least common support.highEntropyDivergence: PDF p.17: entropy-constrained divergence infimum. An empty constraint set has value +infinity and therefore a zero exponential tail.countTypes: PDF p.31: finitely many realizable count vectors, with no uncountable sum.exactProjector: PDF pp.30-31: exact spectral-type projector for a prescribed count vector.spectralTypeState: PDF p.31: state of a realizable spectral type; positive length is required below.highEntropyProjector: PDF p.31: the entropy-high spectral projector is a finite sum of exact types.conditionalTypes: PDF p.31: realizable conditional count tables for a fixed input word.conditionalExactProjector: PDF p.31: the conditional exact-type projector, with original time order restored.conditionalTypeState: PDF p.31: a realizable conditional type's comparison states. An empty input class is assigned the original state; its entropy/divergence weight is exactly zero.lowConditionalProjector: PDF p.31: conditional entropy-low projector, as a finite sum of realizable types.lowEntropyDivergence: PDF p.31: low-entropy divergence infimum for a single normalized state.SideCode: PDF pp.53-55: separate classical encoders and a collective conditioned POVM on the free Y^n register, retaining an explicit failure outcome.HybridSource.classicalWords: PDF pp.53-55: classical words obtained from an iid joint source word.HybridSource.sideWord: PDF pp.53-55: Y word, with the correct block power.SideCode.message: PDF pp.53-55: actual message tuple, each message seeing its own classical word only.SideCode.error: PDF pp.53-55: ensemble-averaged whole-tuple decoding error.SideCode.disturbance: PDF pp.53-55: mean unhalved trace norm for the actual labelled square-root instrument after discarding transmitted classical messages, including its failure block.SideCode.rate: PDF pp.53-55: classical message rate in bits per source symbol.HybridSource.classicalMass: PDF p.54: marginal probability of a classical tuple.HybridSource.conditional: PDF p.54: conditional Y state. A zero-mass branch is filled by a fixed source pure state, rather than by an unnormalized zero state.ClassicalSideCode: PDF pp.56-57: quantum source encoder with classical side information. TheencoderKnowsflag changes its actual domain: false requires one common encoding for every classical word; the decoder always receives the classical word for free.ClassicalSideCode.fidelity: PDF pp.56-57: actual ensemble-averaged pure-word fidelity.classicalSideRate: PDF p.57: fixed-error limsup of operational minimum rates, with the encoder's side-information domain part of the code type.independentLaw: PDF pp.40,43: the independent sender law, constructed before the pure conditional-output refinement. The product normalization is a finite distributive law.macReductionSource: PDF p.43: source reduction data, with the source constructed from normalized pure decompositions of EVERY channel output and the independent sender laws.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Ensemble
import Definitions.Def_QAlgorithms_Defs_Channel
import Definitions.Def_QAlgorithms_Defs_Measurement
import Definitions.Def_QAlgorithms_Defs_MatrixDistances
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P40
import Definitions.Def_QAlgorithms_Defs_QuantumOutputMetrics
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P08
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P06
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P60
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P19
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P22
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P27
/-!
A. Winter, Coding Theorems of Quantum Information Theory, quant-ph/9907077v1.
All logarithms and unnamed exponentials are base two. Real.exp is used only for
explicit e-exponentials. Local definitions are confined to this paper.
Compilation is pending the independent mechanical batch handoff.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.8,11: product of a list of matrices, with time in increasing coordinate order. -/
def wordTensor {n : ℕ} {I : Fin n → Type*}
(rho : ∀ i, Matrix (I i) (I i) ℂ) : Matrix (∀ i, I i) (∀ i, I i) ℂ :=
fun a b => ∏ i, rho i (a i) (b i)
/-- PDF p.11: base-two exponential. -/
def exp2 (x : ℝ) : ℝ := (2 : ℝ) ^ x
/-- PDF p.11: Shannon entropy, with the continuous zero-mass convention. -/
def pmfEntropy {I : Type} [Fintype I] (P : PMF I) : ℝ :=
QAlgorithms.Papers.Independent.Information100.P27.shannon (fun i => (P i).toReal)
/-- PDF p.11: variance-typical sequences, including the zero-probability constraints. -/
def varianceSet {I : Type*} [Fintype I] [DecidableEq I] (P : PMF I)
(n : ℕ) (alpha : ℝ) : Finset (Fin n → I) :=
Finset.univ.filter fun w => ∀ i,
|(count w i : ℝ) - n * (P i).toReal| ≤
alpha * Real.sqrt ((P i).toReal * (1 - (P i).toReal)) * Real.sqrt n
/-- PDF p.12: K_V = 2 log_2(e)/e, distinct from the entropy-variance constant. -/
def varianceConstant : ℝ := 2 * Real.logb 2 (Real.exp 1) / Real.exp 1
/-- PDF pp.12-14: a chosen fine spectral resolution, including zero eigenvalues
and a full choice of rank-one projectors inside degenerate eigenspaces. -/
abbrev FineResolution (d : ℕ) :=
QAlgorithms.Papers.Independent.Dependency50.P19.Spectrum (Fin d)
/-- PDF p.12: the normalized spectral weights, adapted to the PMF interface. -/
def FineResolution.law {d : ℕ} (S : FineResolution d) : PMF (Fin d) :=
PMF.ofFintype (fun j => ENNReal.ofReal (S.weight j)) (by
calc
∑ j, ENNReal.ofReal (S.weight j) = ENNReal.ofReal (∑ j, S.weight j) :=
(ENNReal.ofReal_sum_of_nonneg (fun j _ => S.nonneg j)).symm
_ = 1 := by rw [S.total]; norm_num)
/-- PDF pp.12-14: fine projections computed from columns of the accepted unitary basis.
Column phases cancel; all degeneracy choices remain available. -/
def FineResolution.atom {d : ℕ} (S : FineResolution d) (j : Fin d) :
Matrix (Fin d) (Fin d) ℂ :=
fun a b => (S.basis : Matrix (Fin d) (Fin d) ℂ) a j *
conj ((S.basis : Matrix (Fin d) (Fin d) ℂ) b j)
/-- PDF p.12: the state constructed from its spectral resolution. -/
def FineResolution.state {d : ℕ} (S : FineResolution d) : Matrix (Fin d) (Fin d) ℂ :=
QAlgorithms.Papers.Independent.Dependency50.P19.Spectrum.density S
/-- PDF p.12: variance-typical projector in the chosen spectral basis. -/
def varianceProjector {d : ℕ} (S : FineResolution d) (n : ℕ) (alpha : ℝ) :=
∑ w ∈ varianceSet S.law n alpha, wordTensor (fun k => S.atom (w k))
/-- PDF p.12: rank of sqrt(rho(1-rho)), evaluated on its spectral list. -/
def spectralN {d : ℕ} (S : FineResolution d) : ℕ :=
(Finset.univ.filter fun j => 0 < Real.sqrt ((S.law j).toReal * (1 - (S.law j).toReal))).card
/-- PDF p.12: least positive eigenvalue of sqrt(rho(1-rho)); zero on empty support. -/
def spectralMu {d : ℕ} (S : FineResolution d) : ℝ :=
let v := fun j => Real.sqrt ((S.law j).toReal * (1 - (S.law j).toReal))
let support := Finset.univ.filter fun j => 0 < v j
if h : support.Nonempty then support.inf' h v else 0
/-- PDF p.12: the explicitly natural-exponential variance tail; pure states have N=0. -/
def varianceTail {d : ℕ} (S : FineResolution d) (alpha : ℝ) : ℝ :=
2 * spectralN S * Real.exp (-2 * (spectralMu S)^2 * alpha^2)
/-- PDF p.12: an eta-shadow is an effect with at least eta state mass. -/
def IsShadow {I : Type*} [Fintype I] [DecidableEq I]
(rho B : Matrix I I ℂ) (eta : ℝ) : Prop := IsEffect B ∧ eta ≤ effectProb rho B
/-- PDF pp.13-14: entropy-typical projector. Zero-probability spectral words are
excluded rather than assigning them the totalized value log(0). -/
def entropyProjector {d n : ℕ} (S : Fin n → FineResolution d) (delta : ℝ) :=
∑ w ∈ (Finset.univ.filter fun w : Fin n → Fin d =>
(∀ i, 0 < ((S i).law (w i)).toReal) ∧
|(∑ i, -Real.logb 2 ((S i).law (w i)).toReal) -
∑ i, vnEntropy (S i).state| ≤ delta * Real.sqrt n),
wordTensor (fun i => (S i).atom (w i))
/-- PDF p.14: choose the advertised upper bound as the common K_H(d).
Increasing a valid variance constant only decreases all stated lower bounds. -/
def entropyConstant (d : ℕ) : ℝ := max ((Real.logb 2 3)^2) ((Real.logb 2 d)^2)
/-- PDF p.14: constant-typical projector, with absolute coordinate deviations. -/
def constantProjector {d : ℕ} (S : FineResolution d) (n : ℕ) (delta : ℝ) :=
∑ w ∈ (Finset.univ.filter fun w : Fin n → Fin d => ∀ j,
|(count w j : ℝ) - n * (S.law j).toReal| ≤ delta * Real.sqrt n),
wordTensor (fun i => S.atom (w i))
/-- PDF p.15: the operator norm, expressed using the induced Euclidean operator. -/
def complexOperatorNorm {I : Type*} [Fintype I] (M : Matrix I I ℂ) : ℝ :=
‖(Matrix.toEuclideanLin M).toContinuousLinearMap‖
/-- PDF pp.15,64: eta(t)=-t log_2(t), including eta(0)=0. -/
def etaFunction (t : ℝ) : ℝ := -t * Real.logb 2 t
/-- PDF pp.10,62: a genuinely countable POVM; HasSum rules out a junk tsum. -/
def IsCountablePOVM {B I : Type*} [Countable B] [Fintype I] [DecidableEq I]
(D : B → Matrix I I ℂ) : Prop :=
(∀ b, (D b).PosSemidef) ∧ HasSum D 1
/-- PDF p.10: square-root instrument branch. -/
def sqrtInstrumentBranch {B I : Type*} [Fintype I] [DecidableEq I]
(D : B → Matrix I I ℂ) (rho : Matrix I I ℂ) (b : B) :=
cfc Real.sqrt (D b) * rho * cfc Real.sqrt (D b)
/-- PDF p.10: the actual nonselective operation, including every outcome. -/
def interior {B I : Type*} [Fintype I] [DecidableEq I]
(D : B → Matrix I I ℂ) (rho : Matrix I I ℂ) := ∑' b, sqrtInstrumentBranch D rho b
/-- PDF p.10: trace norm of the labelled block-diagonal difference. For countably
many outcomes the one norm on the direct sum is the sum of the block one norms. -/
def totalDisturbance {B I : Type*} [Fintype I] [DecidableEq I]
(D : B → Matrix I I ℂ) (rho : Matrix I I ℂ) (label : B) : ℝ :=
∑' b, traceNorm ((if b = label then rho else 0) - sqrtInstrumentBranch D rho b)
/-! Small definition checks, with no admitted proof. -/
example {I : Type*} (rho : Matrix I I ℂ) (a b : Fin 0 → I) : copies 0 rho a b = 1 := by
simp [copies, Matrix.of_apply]
example {I : Type*} [Fintype I] [DecidableEq I] (rho : Matrix I I ℂ) :
traceDistance rho rho = 0 := by simp [traceDistance, traceNorm, cfc_zero]
example : etaFunction 0 = 0 := by simp [etaFunction]
example {B I : Type*} [Fintype I] [DecidableEq I] (rho : Matrix I I ℂ) (b : B) :
sqrtInstrumentBranch (fun _ : B => 0) rho b = 0 := by simp [sqrtInstrumentBranch, cfc_zero]
/-- PDF pp.7-8: a finite set of distinct pure letters with an arbitrary probability law. -/
structure PureSource (a d : ℕ) where
alphabet_pos : 0 < a
dimension_pos : 0 < d
law : PMF (Fin a)
letter : Fin a → Matrix (Fin d) (Fin d) ℂ
pure : ∀ x, IsPure (letter x)
distinct : Function.Injective letter
/-- PDF p.7: average source state, computed from the ensemble. -/
def PureSource.average {a d : ℕ} (S : PureSource a d) :=
∑ x, ((S.law x).toReal : ℂ) • S.letter x
/-- PDF pp.7-8: iid word probability. -/
def PureSource.weight {a d n : ℕ} (S : PureSource a d) (w : Fin n → Fin a) : ℝ :=
∏ i, (S.law (w i)).toReal
/-- PDF pp.7-8: the actual pure product word. -/
def PureSource.word {a d n : ℕ} (S : PureSource a d) (w : Fin n → Fin a) :=
wordTensor (fun i => S.letter (w i))
/-- PDF p.7: arbitrary state-valued encoding and a CPTP decoder. The resource is
Hilbert dimension k, with no restriction on the decoder's Kraus rank or isometry. -/
structure SourceCode {a d : ℕ} (S : PureSource a d) (n : ℕ) where
length_pos : 0 < n
dim : ℕ
dim_pos : 0 < dim
encode : (Fin n → Fin a) → Matrix (Fin dim) (Fin dim) ℂ
encoded_state : ∀ w, IsDensityMatrix (encode w)
decode : Superop (Fin dim) (Fin n → Fin d)
decoder_channel : IsChannel decode
/-- PDF p.7: average overlap fidelity of the actual code. -/
def SourceCode.fidelity {a d n : ℕ} {S : PureSource a d} (c : SourceCode S n) : ℝ :=
∑ w, S.weight w * effectProb (c.decode (c.encode w)) (S.word w)
/-- PDF p.8: average half-trace-norm distortion. -/
def SourceCode.distortion {a d n : ℕ} {S : PureSource a d} (c : SourceCode S n) : ℝ :=
∑ w, S.weight w * traceDistance (c.decode (c.encode w)) (S.word w)
/-- PDF p.11: log_2(dim K)/n, guarded by the code's positive dimension and length. -/
def SourceCode.rate {a d n : ℕ} {S : PureSource a d} (c : SourceCode S n) : ℝ :=
Real.logb 2 c.dim / n
/-- PDF pp.7-8: a quantum encoding extends the given state-valued encoder by one
fixed CPTP map on every matrix, including off-diagonal operators. -/
def EncoderExtension {a d n : ℕ} {S : PureSource a d} (c : SourceCode S n)
(E : Superop (Fin n → Fin d) (Fin c.dim)) : Prop :=
IsChannel E ∧ ∀ w, E (S.word w) = c.encode w
/-- PDF p.8: a specific purification with reference first, obtained by vectorizing
sqrt(rho); its partial trace over the reference is rho for every density operator. -/
def purification {I : Type*} [Fintype I] [DecidableEq I] (rho : Matrix I I ℂ) :
Matrix (I × I) (I × I) ℂ :=
fun a b => cfc Real.sqrt rho a.2 a.1 * conj (cfc Real.sqrt rho b.2 b.1)
/-- PDF p.8: source-state entanglement fidelity, using the actual extended channel. -/
def sourceFe {I : Type*} [Fintype I] [DecidableEq I]
(rho : Matrix I I ℂ) (T : Superop I I) : ℝ :=
effectProb (idTensorSuperop (R := I) T (purification rho)) (purification rho)
/-- PDF pp.11,19: the four operational code qualities used in Chapter I. -/
inductive SourceQuality where
| arbitraryFidelity | quantumFidelity | quantumEntanglement | arbitraryDistortion
/-- PDF pp.11,19: quality of an actual block code. No quantum extension is assumed
for arbitrary encoding, and entanglement fidelity is only evaluated on a CPTP extension. -/
def MeetsQuality {a d n : ℕ} {S : PureSource a d} (c : SourceCode S n)
(q : SourceQuality) (lambda : ℝ) : Prop :=
match q with
| .arbitraryFidelity => 1 - c.fidelity ≤ lambda
| .arbitraryDistortion => c.distortion ≤ lambda
| .quantumFidelity => (∃ E, EncoderExtension c E) ∧ 1 - c.fidelity ≤ lambda
| .quantumEntanglement => ∃ E, EncoderExtension c E ∧
1 - sourceFe (copies n S.average) (c.decode ∘ E) ≤ lambda
/-- PDF p.11: minimum rate among actual codes; the extended nonnegative real
infimum is +infinity on an empty feasible set, never a spurious zero. -/
def minimumSourceRate {a d : ℕ} (S : PureSource a d) (q : SourceQuality)
(n : ℕ) (lambda : ℝ) : ℝ≥0∞ :=
sInf {r | ∃ c : SourceCode S n, MeetsQuality c q lambda ∧ r = ENNReal.ofReal c.rate}
/-- PDF p.11: fixed-error operational limsup of block minima; n+1 ranges exactly
over all positive lengths. -/
def sourceRate {a d : ℕ} (S : PureSource a d) (q : SourceQuality) (lambda : ℝ) : ℝ≥0∞ :=
Filter.limsup (fun n : ℕ => minimumSourceRate S q (n+1) lambda) Filter.atTop
/-- PDF p.16: the actual compression map into the range coordinates of an isometry V.
For a state the second coefficient is (1-Tr(rho Pi))/k. -/
def projectionEncoder {I : Type*} [Fintype I] {k : ℕ}
(V : Matrix I (Fin k) ℂ) : Superop I (Fin k) :=
fun rho => Vᴴ * rho * V + ((rho.trace - (rho * (V * Vᴴ)).trace) / (k : ℂ)) • 1
example {a d : ℕ} (S : PureSource a d) (w : Fin 0 → Fin a) : S.weight w = 1 := by
simp [PureSource.weight]
example {a d : ℕ} {S : PureSource a d} (lambda : ℝ) :
minimumSourceRate S .arbitraryFidelity 0 lambda = ⊤ := by
have hc : IsEmpty (SourceCode S 0) := ⟨fun c => (Nat.lt_irrefl 0 c.length_pos)⟩
letI := hc
simp [minimumSourceRate]
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
/-- PDF pp.60-61: a finite C*-algebra in a multiplicity-free direct-sum representation.
Its ordinary matrix trace is intrinsic; dim is the SUM of block Hilbert dimensions. -/
structure IntrinsicSystem where
dim : ℕ
positive : 0 < dim
block : Fin dim → ℕ
/-- PDF p.61: intrinsic normalized states, including classical and hybrid systems. -/
def IntrinsicSystem.IsState (A : IntrinsicSystem) (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) : Prop :=
IsDensityMatrix rho ∧ InBlocks A.block rho
/-- PDF p.61: minimal intrinsic projections, represented by rank-one block states. -/
def IntrinsicSystem.IsPureState (A : IntrinsicSystem) (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) : Prop :=
QAlgorithms.Papers.Independent.Information100.P08.IsPure rho ∧ InBlocks A.block rho
/-- PDF p.62: matrix amplification of a Heisenberg map, preserving the ancillary
matrix blocks, not just diagonal ancillary states. -/
def intrinsicAmplification {A B : IntrinsicSystem}
(F : Matrix (Fin A.dim) (Fin A.dim) ℂ →ₗ[ℂ] Matrix (Fin B.dim) (Fin B.dim) ℂ)
(m : ℕ) (T : Matrix (Fin m × Fin A.dim) (Fin m × Fin A.dim) ℂ) :
Matrix (Fin m × Fin B.dim) (Fin m × Fin B.dim) ℂ :=
fun a b => F (fun i j => T (a.1,i) (b.1,j)) a.2 b.2
/-- PDF p.62: a CP-unital Heisenberg map on the specified block algebras. Its
linear extension off the domain algebra is immaterial and is not assumed positive. -/
structure IntrinsicOperation (A B : IntrinsicSystem) where
map : Matrix (Fin A.dim) (Fin A.dim) ℂ →ₗ[ℂ] Matrix (Fin B.dim) (Fin B.dim) ℂ
blocks : ∀ T, InBlocks A.block T → InBlocks B.block (map T)
unit : map 1 = 1
cp : ∀ (m : ℕ) (T : Matrix (Fin m × Fin A.dim) (Fin m × Fin A.dim) ℂ),
(∀ a b, A.block a.2 ≠ A.block b.2 → T a b = 0) →
T.PosSemidef → (intrinsicAmplification map m T).PosSemidef
/-- PDF pp.61,65: a subsystem inclusion, in independent intrinsic coordinates.
No tensor-factor representation or disjointness is imposed. -/
structure Embedding (A B : IntrinsicSystem) extends IntrinsicOperation A B where
mul : ∀ T U, InBlocks A.block T → InBlocks A.block U → map (T * U) = map T * map U
star : ∀ T, InBlocks A.block T → map Tᴴ = (map T)ᴴ
faithful : ∀ T U, InBlocks A.block T → InBlocks A.block U → map T = map U → T = U
/-- PDF p.66: a star homomorphism, which is not required injective. -/
structure Hom (A B : IntrinsicSystem) extends IntrinsicOperation A B where
mul : ∀ T U, InBlocks A.block T → InBlocks A.block U → map (T * U) = map T * map U
star : ∀ T, InBlocks A.block T → map Tᴴ = (map T)ᴴ
/-- PDF pp.62,65: elementwise compatibility of two map images. -/
def CommutingImages {A B C : IntrinsicSystem}
(F : Matrix (Fin A.dim) (Fin A.dim) ℂ →ₗ[ℂ] Matrix (Fin C.dim) (Fin C.dim) ℂ)
(G : Matrix (Fin B.dim) (Fin B.dim) ℂ →ₗ[ℂ] Matrix (Fin C.dim) (Fin C.dim) ℂ) : Prop :=
∀ T U, InBlocks A.block T → InBlocks B.block U → F T * G U = G U * F T
/-- PDF pp.62,65-69: the intrinsic trace adjoint, using only matrix units that
belong to the domain algebra. This is restriction for an inclusion map. -/
def intrinsicRestriction (A : IntrinsicSystem) {B : IntrinsicSystem}
(F : Matrix (Fin A.dim) (Fin A.dim) ℂ →ₗ[ℂ] Matrix (Fin B.dim) (Fin B.dim) ℂ)
(rho : Matrix (Fin B.dim) (Fin B.dim) ℂ) : Matrix (Fin A.dim) (Fin A.dim) ℂ :=
fun i j => if A.block i = A.block j then (rho * F (Matrix.single j i 1)).trace else 0
/-- PDF p.69: H(phi)=H(phi_*rho), for the one fixed ambient state rho. -/
def viewedEntropy (A : IntrinsicSystem) {B : IntrinsicSystem}
(F : Matrix (Fin A.dim) (Fin A.dim) ℂ →ₗ[ℂ] Matrix (Fin B.dim) (Fin B.dim) ℂ)
(rho : Matrix (Fin B.dim) (Fin B.dim) ℂ) : ℝ := vnEntropy (intrinsicRestriction A F rho)
/-- PDF pp.66,69: the state pulled back by the product map F G. Compatibility
makes this a joint state; central overlaps are allowed. -/
def jointState (A B : IntrinsicSystem) {C : IntrinsicSystem}
(F : Matrix (Fin A.dim) (Fin A.dim) ℂ →ₗ[ℂ] Matrix (Fin C.dim) (Fin C.dim) ℂ)
(G : Matrix (Fin B.dim) (Fin B.dim) ℂ →ₗ[ℂ] Matrix (Fin C.dim) (Fin C.dim) ℂ)
(rho : Matrix (Fin C.dim) (Fin C.dim) ℂ) :
Matrix (Fin A.dim × Fin B.dim) (Fin A.dim × Fin B.dim) ℂ :=
fun i j => if A.block i.1 = A.block j.1 ∧ B.block i.2 = B.block j.2 then
(rho * (F (Matrix.single j.1 i.1 1) * G (Matrix.single j.2 i.2 1))).trace else 0
/-- PDF pp.65,69: mutual information, formed from the same ambient rho throughout. -/
def intrinsicMutualInformation (A B : IntrinsicSystem) {C : IntrinsicSystem}
(F : Matrix (Fin A.dim) (Fin A.dim) ℂ →ₗ[ℂ] Matrix (Fin C.dim) (Fin C.dim) ℂ)
(G : Matrix (Fin B.dim) (Fin B.dim) ℂ →ₗ[ℂ] Matrix (Fin C.dim) (Fin C.dim) ℂ)
(rho : Matrix (Fin C.dim) (Fin C.dim) ℂ) : ℝ :=
viewedEntropy A F rho + viewedEntropy B G rho - vnEntropy (jointState A B F G rho)
/-- PDF pp.65,69: conditional entropy; it may be negative. -/
def intrinsicConditionalEntropy (A B : IntrinsicSystem) {C : IntrinsicSystem}
(F : Matrix (Fin A.dim) (Fin A.dim) ℂ →ₗ[ℂ] Matrix (Fin C.dim) (Fin C.dim) ℂ)
(G : Matrix (Fin B.dim) (Fin B.dim) ℂ →ₗ[ℂ] Matrix (Fin C.dim) (Fin C.dim) ℂ)
(rho : Matrix (Fin C.dim) (Fin C.dim) ℂ) : ℝ :=
vnEntropy (jointState A B F G rho) - viewedEntropy B G rho
/-- PDF pp.62,68: joint pullback for any finite family. Product order is fixed by
the finite list; theorems require distinct images to commute, so the choice is irrelevant. -/
def familyState {I : Type*} [Fintype I] [DecidableEq I] (A : I → IntrinsicSystem) {C : IntrinsicSystem}
(F : ∀ i, Matrix (Fin (A i).dim) (Fin (A i).dim) ℂ →ₗ[ℂ]
Matrix (Fin C.dim) (Fin C.dim) ℂ)
(rho : Matrix (Fin C.dim) (Fin C.dim) ℂ) :
Matrix (∀ i, Fin (A i).dim) (∀ i, Fin (A i).dim) ℂ :=
fun a b => if ∀ i, (A i).block (a i) = (A i).block (b i) then
(rho * ((Finset.univ : Finset I).toList.map fun i => F i (Matrix.single (b i) (a i) 1)).prod).trace
else 0
/-- PDF pp.65,68: entropy of the generated algebra of a subset of a compatible family,
computed by the trace adjoint of multiplication, which preserves its intrinsic spectrum. -/
def familyEntropy {I : Type*} [Fintype I] [DecidableEq I] (A : I → IntrinsicSystem) {C : IntrinsicSystem}
(F : ∀ i, Matrix (Fin (A i).dim) (Fin (A i).dim) ℂ →ₗ[ℂ]
Matrix (Fin C.dim) (Fin C.dim) ℂ)
(rho : Matrix (Fin C.dim) (Fin C.dim) ℂ) (J : Finset I) : ℝ :=
vnEntropy (familyState (fun i : {i // i ∈ J} => A i.val) (fun i => F i.val) rho)
/-- PDF pp.66-67: positive-coefficient diagonalization of a state, on its support;
zero eigenspaces are not required in this definition. -/
def Diagonalization (A : IntrinsicSystem) {m : ℕ} (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ)
(p : Fin m → ℝ) (P : Fin m → Matrix (Fin A.dim) (Fin A.dim) ℂ) : Prop :=
(∀ i, 0 < p i) ∧ (∀ i, A.IsPureState (P i)) ∧
(∀ i j, i ≠ j → P i * P j = 0) ∧ rho = ∑ i, (p i : ℂ) • P i
/-- PDF p.70: the source's maximality condition, on positive domain elements. -/
def TraceNonincreasing {A B : IntrinsicSystem} (F : IntrinsicOperation A B) : Prop :=
∀ T, InBlocks A.block T → T.PosSemidef → (F.map T).trace.re ≤ T.trace.re
/-- PDF pp.64-65: nonnegative base-two relative-entropy contribution. The
continuous zero-first-mass value is q / log 2, so the linear corrections sum
to zero for normalized laws, including laws with zero entries. This form
avoids undefined infinity-minus-infinity for countably many outcomes. -/
def classicalKLTerm (p q : ℝ) : ℝ≥0∞ :=
if p = 0 then ENNReal.ofReal (q / Real.log 2) else if q = 0 then ⊤ else
ENNReal.ofReal (p * Real.logb 2 (p / q) + (q - p) / Real.log 2)
/-- PDF pp.62,65: entropy of a countable probability law, possibly +infinity. -/
def countableEntropy {B : Type*} (p : B → ℝ) : ℝ≥0∞ :=
∑' b, ENNReal.ofReal (-p b * Real.logb 2 (p b))
/-- PDF p.72: the actual outcome-law mutual information of commuting observables. -/
def measuredInformation {B D : Type*} {A : IntrinsicSystem}
(X : B → Matrix (Fin A.dim) (Fin A.dim) ℂ)
(Y : D → Matrix (Fin A.dim) (Fin A.dim) ℂ)
(rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) : ℝ≥0∞ :=
∑' z : B × D, classicalKLTerm (effectProb rho (X z.1 * Y z.2))
(effectProb rho (X z.1) * effectProb rho (Y z.2))
/-- PDF pp.70,72: mutual information between an intrinsic subsystem and a countable
observable, as the weighted divergence of its posterior states from its marginal. -/
def hybridInformation (X : IntrinsicSystem) {A : IntrinsicSystem} {B : Type*}
(E : Embedding X A) (D : B → Matrix (Fin A.dim) (Fin A.dim) ℂ)
(rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) : ℝ≥0∞ :=
∑' b, ENNReal.ofReal (effectProb rho (D b)) *
relativeBits
(((effectProb rho (D b))⁻¹ : ℂ) •
intrinsicRestriction X E.map (cfc Real.sqrt (D b) * rho * cfc Real.sqrt (D b)))
(intrinsicRestriction X E.map rho)
/-- PDF p.73: the usual entrywise Borel structure on finite complex matrices.
It is the Borel structure for the finite-dimensional operator-norm topology. -/
local instance matrixMeasurableSpace {I J : Type*} [Fintype I] [Fintype J] :
MeasurableSpace (Matrix I J ℂ) :=
inferInstanceAs (MeasurableSpace (I → J → ℂ))
/-- PDF p.73: average state for an arbitrary measurable input law. -/
def cqAverage {X : Type*} [MeasurableSpace X] {I : Type*} [Fintype I]
(mu : Measure X) (W : X → Matrix I I ℂ) := ∫ x, W x ∂mu
/-- PDF p.73: cq mutual information, defined by relative entropy before invoking
the entropy-difference identity, including arbitrary input probability measures. -/
def cqInformation {X : Type*} [MeasurableSpace X] {I : Type*} [Fintype I] [DecidableEq I]
(mu : Measure X) (W : X → Matrix I I ℂ) : ℝ≥0∞ :=
∫⁻ x, relativeBits (W x) (cqAverage mu W) ∂mu
/-- PDF pp.37,73: measured information from the conditional and marginal outcome
laws of the actual POVM, including countably many outcomes. -/
def cqMeasuredInformation {X B : Type*} [MeasurableSpace X] {I : Type*}
[Fintype I] [DecidableEq I] (mu : Measure X) (W : X → Matrix I I ℂ)
(D : B → Matrix I I ℂ) : ℝ≥0∞ :=
∫⁻ x, ∑' b, classicalKLTerm (effectProb (W x) (D b))
(effectProb (cqAverage mu W) (D b)) ∂mu
example : classicalKLTerm 0 0 = 0 := by simp [classicalKLTerm]
example {A B : IntrinsicSystem} (F : IntrinsicOperation A B) :
F.map 1 = 1 := F.unit
/-- PDF pp.60-61: a full matrix system in intrinsic coordinates. -/
def fullAlgebra (d : ℕ) (hd : 0 < d) : IntrinsicSystem := ⟨d, hd, fun _ => 0⟩
/-- PDF pp.61,65: the identity is a CP-unital operation on every intrinsic system. -/
def identityOperation (A : IntrinsicSystem) : IntrinsicOperation A A where
map := LinearMap.id
blocks := fun _ h => h
unit := rfl
cp := fun _ _ _ h => h
/-- PDF p.65: identity subsystem, used for sanity checks of restriction. -/
def identityEmbedding (A : IntrinsicSystem) : Embedding A A where
toIntrinsicOperation := identityOperation A
mul := fun _ _ _ _ => rfl
star := fun _ _ => rfl
faithful := fun _ _ _ _ h => h
example (A : IntrinsicSystem) (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ)
(h : InBlocks A.block rho) : intrinsicRestriction A (identityEmbedding A).map rho = rho := by
ext i j
by_cases hij : A.block i = A.block j
· simp [intrinsicRestriction, identityEmbedding, identityOperation, hij, Matrix.trace_mul_single]
· simp [intrinsicRestriction, hij, h i j hij]
/-- PDF p.74: two copies of the finite factor index, labelled as X and Y. -/
def xIndices (n : ℕ) : Finset (Fin n × Bool) := Finset.univ.filter fun i => i.2 = false
/-- PDF p.74: the Y labels, separate from the X labels. -/
def yIndices (n : ℕ) : Finset (Fin n × Bool) := Finset.univ.filter fun i => i.2 = true
/-- PDF pp.69-70: joint state of a finite observable and a compatible intrinsic
subsystem, with the observable's actual outcome retained. -/
def observableJoint {B : Type*} [Fintype B] [DecidableEq B] {Y A : IntrinsicSystem}
(E : Embedding Y A) (X : B → Matrix (Fin A.dim) (Fin A.dim) ℂ)
(rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) :
Matrix (B × Fin Y.dim) (B × Fin Y.dim) ℂ :=
fun a b => if a.1 = b.1 then
intrinsicRestriction Y E.map (cfc Real.sqrt (X a.1) * rho * cfc Real.sqrt (X a.1)) a.2 b.2 else 0
/-- PDF pp.53-55: a possibly correlated finite classical/hybrid pure-letter source.
The law is joint on all classical letters and the pure Y letter; it need not factor. -/
structure HybridSource (s : ℕ) where
alphabet : Fin s → ℕ
alphabet_pos : ∀ i, 0 < alphabet i
system : IntrinsicSystem
pure_count : ℕ
pure_count_pos : 0 < pure_count
letter : Fin pure_count → Matrix (Fin system.dim) (Fin system.dim) ℂ
pure : ∀ p, system.IsPureState (letter p)
distinct : Function.Injective letter
law : PMF ((∀ i, Fin (alphabet i)) × Fin pure_count)
/-- PDF pp.53,57: the computed marginal state on X(J)Y of the joint source law. -/
def HybridSource.marginal {s : ℕ} (S : HybridSource s) (J : Finset (Fin s)) :
Matrix (QAlgorithms.Papers.Independent.Claimed50.P40.Letters S.alphabet J × Fin S.system.dim)
(QAlgorithms.Papers.Independent.Claimed50.P40.Letters S.alphabet J × Fin S.system.dim) ℂ :=
fun a b => if a.1 = b.1 then
∑ x, if QAlgorithms.Papers.Independent.Claimed50.P40.Matches J x.1 a.1 then
((S.law x).toReal : ℂ) * S.letter x.2 a.2 b.2 else 0
else 0
/-- PDF pp.57-58: H(X(J)|YX(J^c)), computed from the same correlated source. -/
def HybridSource.subsetEntropy {s : ℕ} (S : HybridSource s) (J : Finset (Fin s)) : ℝ :=
vnEntropy (S.marginal Finset.univ) - vnEntropy (S.marginal Jᶜ)
/-- PDF pp.57-58: upward unbounded source rate region, with lower subset constraints. -/
def HybridSource.lowerRegion {s : ℕ} (S : HybridSource s) : Set (Fin s → ℝ) :=
{R | ∀ J : Finset (Fin s), S.subsetEntropy J ≤ ∑ i ∈ J, R i}
/-- PDF p.58: source permutation corner, conditioned on the preceding classical
letters and Y, with the source's order rather than its reverse. -/
def HybridSource.corner {s : ℕ} (S : HybridSource s) (pi : Equiv.Perm (Fin s)) : Fin s → ℝ :=
fun a =>
let J := QAlgorithms.Papers.Independent.Claimed50.P40.predecessors pi (pi.symm a)
vnEntropy (S.marginal (insert a J)) - vnEntropy (S.marginal J)
/-- PDF p.57: ordinary extremality; no coordinatewise upper-maximality condition. -/
def IsExtreme {I : Type*} (S : Set (I → ℝ)) (R : I → ℝ) : Prop :=
R ∈ S ∧ ∀ a ∈ S, ∀ b ∈ S, ∀ t : ℝ, 0 < t → t < 1 →
R = t • a + (1 - t) • b → a = R ∧ b = R
example {s : ℕ} (S : HybridSource s) : S.subsetEntropy ∅ = 0 := by
unfold HybridSource.subsetEntropy
rw [Finset.compl_empty]
exact sub_self _
/-- PDF p.29: empirical law weights; the source calls this the type of the word.
Positive n is required in every theorem using this definition. -/
def empiricalWeight {a n : ℕ} (w : Fin n → Fin a) (x : Fin a) : ℝ := count w x / (n : ℝ)
/-- PDF p.29: conditional output entropy for the actual word's empirical law. -/
def wordConditionalEntropy {a d n : ℕ} (S : Fin a → FineResolution d) (w : Fin n → Fin a) : ℝ :=
∑ x, empiricalWeight w x * vnEntropy (S x).state
/-- PDF p.29: conditional variance-typical projector. Equal input letters are
grouped in the count conditions; the tensor factors remain in their original time order.
An empty input-letter group imposes only 0≤0 and contributes the scalar identity. -/
def conditionalVarianceProjector {a d n : ℕ} (S : Fin a → FineResolution d)
(w : Fin n → Fin a) (delta : ℝ) :=
∑ j ∈ (Finset.univ.filter fun j : Fin n → Fin d => ∀ x r,
|((Finset.univ.filter fun k => w k = x ∧ j k = r).card : ℝ) -
count w x * ((S x).law r).toReal| ≤
delta * Real.sqrt (count w x) *
Real.sqrt (((S x).law r).toReal * (1 - ((S x).law r).toReal))),
wordTensor (fun k => (S (w k)).atom (j k))
/-- PDF pp.30-31: change the eigenvalue list in a chosen simultaneous fine basis. -/
def changeSpectrum {d : ℕ} (S : FineResolution d) (P : PMF (Fin d)) : FineResolution d :=
{ S with
weight := fun j => (P j).toReal
nonneg := fun j => ENNReal.toReal_nonneg
total := by
have ht : ∑ j : Fin d, P j = 1 := by
simpa only [tsum_fintype] using P.tsum_coe
calc
∑ j, (P j).toReal = (∑ j, P j).toReal :=
(ENNReal.toReal_sum (fun j _ => P.apply_ne_top j)).symm
_ = 1 := by rw [ht]; simp }
/-- PDF p.31: base-two divergence tail, with 2^{-n*infinity}=0 at positive n. -/
def divergenceTail (n : ℕ) (D : ℝ≥0∞) : ℝ :=
if D = ⊤ then 0 else exp2 (-(n : ℝ) * D.toReal)
example (n : ℕ) : divergenceTail n ⊤ = 0 := by simp [divergenceTail]
/-- PDF pp.45-46: the regrouped multi-party basis, with each sender holding a word. -/
abbrev PartyWords {s : ℕ} (A : Fin s → IntrinsicSystem) (n : ℕ) := ∀ i, Fin n → Fin (A i).dim
/-- PDF p.45: finite pure-letter source data. Validity is stated separately so that
explicit example ensembles can be constructed without admitted definition proofs. -/
structure MultipleData (s : ℕ) (L : Type*) [Fintype L] where
system : Fin s → IntrinsicSystem
law : PMF L
letter : L → Matrix (∀ i, Fin (system i).dim) (∀ i, Fin (system i).dim) ℂ
/-- PDF p.45: source validity, with no product-state promise or independent sender law. -/
def MultipleData.Valid {s : ℕ} {L : Type*} [Fintype L] (S : MultipleData s L) : Prop :=
(∀ x, IsPure (S.letter x)) ∧ Function.Injective S.letter ∧
∀ x u v, (∃ i, (S.system i).block (u i) ≠ (S.system i).block (v i)) → S.letter x u v = 0
/-- PDF p.45: computed average source density. -/
def MultipleData.average {s : ℕ} {L : Type*} [Fintype L] (S : MultipleData s L) :=
∑ x, ((S.law x).toReal : ℂ) • S.letter x
/-- PDF pp.45-46: the actual temporal word, regrouped by sender. -/
def MultipleData.word {s n : ℕ} {L : Type*} [Fintype L] (S : MultipleData s L)
(w : Fin n → L) : Matrix (PartyWords S.system n) (PartyWords S.system n) ℂ :=
fun a b => ∏ t, S.letter (w t) (fun i => a i t) (fun i => b i t)
/-- PDF p.46: the average block state, in the same party grouping as the encoder. -/
def MultipleData.blockAverage {s : ℕ} {L : Type*} [Fintype L] (S : MultipleData s L) (n : ℕ) :
Matrix (PartyWords S.system n) (PartyWords S.system n) ℂ :=
fun a b => ∏ t, S.average (fun i => a i t) (fun i => b i t)
/-- PDF p.45: partial trace to any sender subset, including the empty subset. -/
def multipleMarginal {s : ℕ} (A : Fin s → IntrinsicSystem)
(rho : Matrix (∀ i, Fin (A i).dim) (∀ i, Fin (A i).dim) ℂ) (J : Finset (Fin s)) :
Matrix (∀ i : {i // i ∈ J}, Fin (A i.val).dim)
(∀ i : {i // i ∈ J}, Fin (A i.val).dim) ℂ :=
fun a b => ∑ u, ∑ v,
if (∀ i : {i // i ∈ J}, u i.val = a i ∧ v i.val = b i) ∧
(∀ i, i ∉ J → u i = v i) then rho u v else 0
/-- PDF p.45: tensor product of heterogeneous local maps, on all matrix units.
This preserves entangled source letters and does not replace them by their marginals. -/
def partyMaps {s : ℕ} (A : Fin s → IntrinsicSystem) (n : ℕ) (k : Fin s → ℕ)
(E : ∀ i, Superop (Fin n → Fin (A i).dim) (Fin (k i))) :
Superop (PartyWords A n) (∀ i, Fin (k i)) :=
fun T a b => ∑ u, ∑ v, T u v * ∏ i, E i (Matrix.single (u i) (v i) 1) (a i) (b i)
/-- PDF pp.45-46: joint CPTP decoder with range in the actual product block algebra.
CPTP extensions from intrinsic input algebras to full matrices are equivalent by
precomposing block pinching. This imposes no restriction on intrinsic local encoders. -/
structure MultipleCode {s : ℕ} {L : Type*} [Fintype L] (S : MultipleData s L) (n : ℕ) where
length_pos : 0 < n
dim : Fin s → ℕ
dim_pos : ∀ i, 0 < dim i
encode : ∀ i, Superop (Fin n → Fin (S.system i).dim) (Fin (dim i))
encoder_channel : ∀ i, IsChannel (encode i)
decode : Superop (∀ i, Fin (dim i)) (PartyWords S.system n)
decoder_channel : IsChannel decode
output_blocks : ∀ T, T.PosSemidef → ∀ u v,
(∃ i t, (S.system i).block (u i t) ≠ (S.system i).block (v i t)) → decode T u v = 0
/-- PDF p.46: the full joint source recovery channel. -/
def MultipleCode.channel {s n : ℕ} {L : Type*} [Fintype L] {S : MultipleData s L}
(c : MultipleCode S n) : Superop (PartyWords S.system n) (PartyWords S.system n) :=
c.decode ∘ partyMaps S.system n c.dim c.encode
/-- PDF p.46: rate of each actual local compression space. -/
def MultipleCode.rate {s n : ℕ} {L : Type*} [Fintype L] {S : MultipleData s L}
(c : MultipleCode S n) (i : Fin s) : ℝ := Real.logb 2 (c.dim i) / n
/-- PDF p.46: ensemble-averaged pure-word fidelity. -/
def MultipleCode.fidelity {s n : ℕ} {L : Type*} [Fintype L] {S : MultipleData s L}
(c : MultipleCode S n) : ℝ :=
∑ w : Fin n → L, (∏ t, (S.law (w t)).toReal) * effectProb (c.channel (S.word w)) (S.word w)
/-- PDF p.46: ensemble-averaged half trace distance. -/
def MultipleCode.distortion {s n : ℕ} {L : Type*} [Fintype L] {S : MultipleData s L}
(c : MultipleCode S n) : ℝ :=
∑ w : Fin n → L, (∏ t, (S.law (w t)).toReal) * traceDistance (c.channel (S.word w)) (S.word w)
/-- PDF p.46: actual code-sequence rate region; error vanishes and every rate
coordinate converges to the specified rate, over all positive lengths. -/
def quantumSourceRegion {s : ℕ} {L : Type*} [Fintype L] (S : MultipleData s L)
(distortion : Bool := false) : Set (Fin s → ℝ) :=
{R | ∃ c : ∀ n, MultipleCode S (n+1),
(∀ i, Tendsto (fun n => (c n).rate i) atTop (nhds (R i))) ∧
Tendsto (fun n => if distortion then (c n).distortion else 1 - (c n).fidelity) atTop (nhds 0)}
/-- PDF p.46: Fe only for fully quantum systems. The explicit domain guard
prevents an assertion of a purification rate region on a hybrid system. -/
def entanglementSourceRegion {s : ℕ} {L : Type*} [Fintype L] (S : MultipleData s L)
(_fullyQuantum : ∀ i a b, (S.system i).block a = (S.system i).block b) : Set (Fin s → ℝ) :=
{R | ∃ c : ∀ n, MultipleCode S (n+1),
(∀ i, Tendsto (fun n => (c n).rate i) atTop (nhds (R i))) ∧
Tendsto (fun n => 1 - sourceFe (S.blockAverage (n+1)) (c n).channel) atTop (nhds 0)}
/-- PDF pp.53-55: intrinsic systems, with Y the last party. -/
def HybridSource.systems {s : ℕ} (S : HybridSource s) : Fin (s+1) → IntrinsicSystem :=
Fin.lastCases S.system (fun i => ⟨S.alphabet i, S.alphabet_pos i, Fin.val⟩)
/-- Read a classical coordinate through the fixed dependent-system identification. -/
def HybridSource.classicalCoordinate {s : ℕ} (S : HybridSource s)
(a : ∀ i, Fin (S.systems i).dim) (i : Fin s) : Fin (S.alphabet i) :=
Fin.cast (by simp [HybridSource.systems]) (a i.castSucc)
/-- Read Y through the same fixed dependent-system identification. -/
def HybridSource.quantumCoordinate {s : ℕ} (S : HybridSource s)
(a : ∀ i, Fin (S.systems i).dim) : Fin S.system.dim :=
Fin.cast (by simp [HybridSource.systems]) (a (Fin.last s))
/-- PDF pp.53-55: the actual joint classical/pure-Y source, with Y the last party. -/
def HybridSource.multiple {s : ℕ} (S : HybridSource s) :
MultipleData (s+1) ((∀ i, Fin (S.alphabet i)) × Fin S.pure_count) where
system := S.systems
law := S.law
letter := fun x a b =>
if (∀ i : Fin s, S.classicalCoordinate a i = x.1 i ∧ S.classicalCoordinate b i = x.1 i) then
S.letter x.2 (S.quantumCoordinate a) (S.quantumCoordinate b) else 0
/-- PDF pp.55-56: append the entropy of Y to the classical compression rates. -/
def HybridSource.withYRate {s : ℕ} (S : HybridSource s) (R : Fin s → ℝ) : Fin (s+1) → ℝ :=
Fin.lastCases (vnEntropy (S.marginal ∅)) R
/-- PDF pp.45-46: product-letter data for arbitrary local encoders. The JOINT law
may be correlated; only each source letter is a product across senders. -/
structure ProductData (s : ℕ) where
system : Fin s → IntrinsicSystem
alphabet : Fin s → ℕ
law : PMF (∀ i, Fin (alphabet i))
localLetter : ∀ i, Fin (alphabet i) → Matrix (Fin (system i).dim) (Fin (system i).dim) ℂ
/-- PDF pp.45-46: normalized distinct local pure letters in the respective intrinsic systems. -/
def ProductData.Valid {s : ℕ} (S : ProductData s) : Prop :=
(∀ i, 0 < S.alphabet i) ∧ (∀ i x, (S.system i).IsPureState (S.localLetter i x)) ∧
∀ i, Function.Injective (S.localLetter i)
/-- PDF p.45: construct the joint pure ensemble from local product letters and the
original correlated law, rather than replacing that law by a product of marginals. -/
def ProductData.multiple {s : ℕ} (S : ProductData s) : MultipleData s (∀ i, Fin (S.alphabet i)) :=
⟨S.system, S.law, fun x => wordTensor (fun i => S.localLetter i (x i))⟩
/-- PDF p.46: arbitrary separate state-valued encoders and an actual joint CPTP
decoder. Only the local word is supplied to each encoder. -/
structure ArbitraryMultipleCode {s : ℕ} (S : ProductData s) (n : ℕ) where
length_pos : 0 < n
dim : Fin s → ℕ
dim_pos : ∀ i, 0 < dim i
encode : ∀ i, (Fin n → Fin (S.alphabet i)) → Matrix (Fin (dim i)) (Fin (dim i)) ℂ
encoded_state : ∀ i w, IsDensityMatrix (encode i w)
decode : Superop (∀ i, Fin (dim i)) (PartyWords S.system n)
decoder_channel : IsChannel decode
output_blocks : ∀ T, T.PosSemidef → ∀ u v,
(∃ i t, (S.system i).block (u i t) ≠ (S.system i).block (v i t)) → decode T u v = 0
/-- PDF p.46: actual average overlap quality for the arbitrary local encoders. -/
def ArbitraryMultipleCode.fidelity {s n : ℕ} {S : ProductData s}
(c : ArbitraryMultipleCode S n) : ℝ :=
∑ w : Fin n → (∀ i, Fin (S.alphabet i)),
(∏ t, (S.law (w t)).toReal) *
effectProb (c.decode (wordTensor (fun i => c.encode i (fun t => w t i)))) (S.multiple.word w)
/-- PDF p.46: average half trace norm for the same arbitrary code. -/
def ArbitraryMultipleCode.distortion {s n : ℕ} {S : ProductData s}
(c : ArbitraryMultipleCode S n) : ℝ :=
∑ w : Fin n → (∀ i, Fin (S.alphabet i)),
(∏ t, (S.law (w t)).toReal) *
traceDistance (c.decode (wordTensor (fun i => c.encode i (fun t => w t i)))) (S.multiple.word w)
/-- PDF p.46: arbitrary-encoding operational region, only on product-letter sources. -/
def arbitrarySourceRegion {s : ℕ} (S : ProductData s) (distortion : Bool := false) : Set (Fin s → ℝ) :=
{R | ∃ c : ∀ n, ArbitraryMultipleCode S (n+1),
(∀ i, Tendsto (fun n => Real.logb 2 ((c n).dim i) / (n+1 : ℝ)) atTop (nhds (R i))) ∧
Tendsto (fun n => if distortion then (c n).distortion else 1 - (c n).fidelity) atTop (nhds 0)}
/-- PDF p.46: closed, convex and coordinatewise upward closed, including unbounded regions. -/
def SourceRegionProperties {s : ℕ} (T : Set (Fin s → ℝ)) : Prop :=
IsClosed T ∧ Convex ℝ T ∧ ∀ R ∈ T, ∀ Rnew, (∀ i, R i ≤ Rnew i) → Rnew ∈ T
/-- PDF pp.47-48: the four wheel vectors |0>,|1>,|+>,|->, with real signs. -/
def wheelVector (x : Fin 4) : EuclideanSpace ℂ (Fin 2) :=
WithLp.toLp 2 fun b =>
if x.val < 2 then (if b.val = x.val then 1 else 0) else
if x.val = 3 ∧ b.val = 1 then -((Real.sqrt 2 : ℂ)⁻¹) else (Real.sqrt 2 : ℂ)⁻¹
/-- PDF pp.47-48: the actual cloned-wheel source, with the same randomly chosen
pure state sent to both encoders. Its law is diagonal, not independent across parties. -/
def clonedWheel : ProductData 2 where
system := fun _ => fullAlgebra 2 (by decide)
alphabet := fun _ => 4
law := PMF.map (fun x : Fin 4 => fun _ : Fin 2 => x) (PMF.uniformOfFintype (Fin 4))
localLetter := fun _ x => pureDensity (wheelVector x)
/-- PDF p.52: the two orthogonal alternatives of the cloned cross. -/
def clonedCross : ProductData 2 where
system := fun _ => fullAlgebra 2 (by decide)
alphabet := fun _ => 2
law := PMF.map (fun x : Fin 2 => fun _ : Fin 2 => x) (PMF.uniformOfFintype (Fin 2))
localLetter := fun _ x => pureDensity (ket x)
/-- PDF pp.51-52: the two Bell alternatives |Phi+> and |Phi->, in party coordinates. -/
def eprSourceVector (x : Fin 2) : EuclideanSpace ℂ (Fin 2 → Fin 2) :=
WithLp.toLp 2 fun a => if a 0 = a 1 then
(if x.val = 1 ∧ (a 0).val = 1 then -1 else 1) * (Real.sqrt 2 : ℂ)⁻¹ else 0
/-- PDF p.51: the actual equidistributed EPR source. -/
def eprSource : MultipleData 2 (Fin 2) where
system := fun _ => fullAlgebra 2 (by decide)
law := PMF.uniformOfFintype (Fin 2)
letter := fun x => pureDensity (eprSourceVector x)
/-- PDF pp.47-48: the necessary quantum cloned-wheel rate region. -/
def wheelQuantumOuter : Set (Fin 2 → ℝ) :=
{R | 1/2 ≤ R 0 ∧ 1/2 ≤ R 1 ∧ 3/2 ≤ R 0 + R 1}
/-- PDF p.48: the arbitrary-encoding sum-rate region for a two-source example. -/
def nonnegativeSumRegion (h : ℝ) : Set (Fin 2 → ℝ) :=
{R | 0 ≤ R 0 ∧ 0 ≤ R 1 ∧ h ≤ R 0 + R 1}
/-- PDF pp.51-52: the half-qubit individual-rate necessary constraints. -/
def halfRateRegion : Set (Fin 2 → ℝ) := {R | 1/2 ≤ R 0 ∧ 1/2 ≤ R 1}
example : wheelVector 0 0 = 1 := by norm_num [wheelVector]
example : eprSourceVector 0 (fun _ => (0 : Fin 2)) = (Real.sqrt 2 : ℂ)⁻¹ := by
simp [eprSourceVector]
/-- PDF p.20: nonstationary channels are arbitrary nonempty measurable state sets
on the one fixed output system. Input laws need not have finite support. -/
structure StateChannel (A : IntrinsicSystem) where
carrier : Set (Matrix (Fin A.dim) (Fin A.dim) ℂ)
nonempty : carrier.Nonempty
measurable : MeasurableSet carrier
states : ∀ rho ∈ carrier, A.IsState rho
/-- PDF p.24: single-use capacity, optimized over all probability measures on the
measurable state set. Information is bounded by log_2(dim A's Hilbert representation),
so the real supremum is bounded and nonempty. -/
def StateChannel.capacity {A : IntrinsicSystem} (W : StateChannel A) : ℝ :=
sSup {r | ∃ P : ProbabilityMeasure W.carrier,
r = (cqInformation (P : Measure W.carrier) (fun x => x.val)).toReal}
/-- PDF pp.23-24: actual nonstationary product-state code with a collective block
POVM and a failure outcome. The error criterion is maximum message error. -/
structure NonstationaryCode {A : IntrinsicSystem} (W : ℕ → StateChannel A) (n : ℕ) where
length_pos : 0 < n
messages : ℕ
messages_pos : 0 < messages
encode : Fin messages → (i : Fin n) → Matrix (Fin A.dim) (Fin A.dim) ℂ
allowed : ∀ m i, encode m i ∈ (W i.val).carrier
decode : Option (Fin messages) → Matrix (Fin n → Fin A.dim) (Fin n → Fin A.dim) ℂ
povm : IsPOVM decode
blocks : ∀ m, QAlgorithms.Papers.Independent.Claimed50.P40.InBlockPower A.block n (decode m)
/-- PDF p.23: maximum error, with the message-set nonemptiness enforced in the code. -/
def NonstationaryCode.error {A : IntrinsicSystem} {W : ℕ → StateChannel A} {n : ℕ}
(c : NonstationaryCode W n) : ℝ :=
(Finset.univ : Finset (Fin c.messages)).sup'
⟨⟨0, c.messages_pos⟩, Finset.mem_univ _⟩
(fun m => 1 - effectProb (wordTensor (c.encode m)) (c.decode (some m)))
/-- PDF p.23: optimal number of messages among actual codes. For 0≤lambda<1 the
set is nonempty and bounded by dim(output)^n/(1-lambda), so Nat.sSup is an actual
finite maximum; no statement below uses this definition in the unbounded lambda≥1 regime. -/
def nonstationaryN {A : IntrinsicSystem} (W : ℕ → StateChannel A) (n : ℕ) (lambda : ℝ) : ℕ :=
sSup {m | ∃ c : NonstationaryCode W n, c.messages = m ∧ c.error ≤ lambda}
/-- PDF pp.24-25: all maximal-code conclusions, including membership in the
large event and the trace bound for actual chosen entropy-typical projectors. -/
def MaximalCodeConclusion {A : IntrinsicSystem} {W : ℕ → StateChannel A} {n : ℕ}
(P : ∀ i : Fin n, ProbabilityMeasure (W i.val).carrier)
(event : Set (∀ i : Fin n, (W i.val).carrier)) (K delta lambda : ℝ)
(projective : Bool) : Prop :=
∃ c : NonstationaryCode W n, c.error ≤ lambda ∧
(∀ m, (fun (i : Fin n) => (⟨c.encode m i, c.allowed m i⟩ : (W i.val).carrier)) ∈ event) ∧
(∃ S : Fin c.messages → Fin n → FineResolution A.dim,
(∀ m i, (S m i).state = c.encode m i) ∧
∀ m, (c.decode (some m)).trace.re ≤ (entropyProjector (S m) delta).trace.re) ∧
Real.logb 2 c.messages ≥
(∑ i : Fin n, (cqInformation (P i : Measure (W i.val).carrier) (fun x => x.val)).toReal) -
K * Real.sqrt n ∧
(projective = true → ∀ m, c.decode (some m) * c.decode (some m) = c.decode (some m))
/-- PDF p.28: finite stationary channel, with input labels retained even when
several labels are mapped to the same output state. -/
structure FiniteChannel (a : ℕ) (A : IntrinsicSystem) where
alphabet_pos : 0 < a
state : Fin a → Matrix (Fin A.dim) (Fin A.dim) ℂ
valid : ∀ x, A.IsState (state x)
/-- PDF pp.28-29: finite-law Holevo information, using the same normalized channel. -/
def FiniteChannel.information {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A) (P : PMF (Fin a)) : ℝ :=
vnEntropy (∑ x, ((P x).toReal : ℂ) • W.state x) - ∑ x, (P x).toReal * vnEntropy (W.state x)
/-- PDF p.28: capacity of the finite channel; PMF is compact and nonempty, and
information is bounded. This real supremum has no empty/unbounded-set junk. -/
def FiniteChannel.capacity {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A) : ℝ :=
sSup (Set.range W.information)
/-- PDF pp.23,28: finite stationary code, collective decoding, optional failure. -/
structure FiniteCode {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A) (n : ℕ) where
length_pos : 0 < n
messages : ℕ
messages_pos : 0 < messages
word : Fin messages → Fin n → Fin a
decode : Option (Fin messages) → Matrix (Fin n → Fin A.dim) (Fin n → Fin A.dim) ℂ
povm : IsPOVM decode
blocks : ∀ m, QAlgorithms.Papers.Independent.Claimed50.P40.InBlockPower A.block n (decode m)
/-- PDF pp.23,28: maximum-message error for the actual channel and decoder. -/
def FiniteCode.error {a n : ℕ} {A : IntrinsicSystem} {W : FiniteChannel a A} (c : FiniteCode W n) : ℝ :=
(Finset.univ : Finset (Fin c.messages)).sup'
⟨⟨0, c.messages_pos⟩, Finset.mem_univ _⟩
(fun m => 1 - effectProb (wordTensor (fun i => W.state (c.word m i))) (c.decode (some m)))
/-- PDF p.28: actual optimal message count, finite whenever lambda<1. -/
def finiteN {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A) (n : ℕ) (lambda : ℝ) : ℕ :=
sSup {m | ∃ c : FiniteCode W n, c.messages = m ∧ c.error ≤ lambda}
/-- PDF pp.28,33: the code really has a fixed empirical composition P. -/
def FiniteCode.Composition {a n : ℕ} {A : IntrinsicSystem} {W : FiniteChannel a A}
(c : FiniteCode W n) (P : PMF (Fin a)) : Prop :=
∀ m x, empiricalWeight (c.word m) x = (P x).toReal
/-- PDF p.53: actual finite codebook, with duplicate encodings removed as a set. -/
def FiniteCode.codebook {a n : ℕ} {A : IntrinsicSystem} {W : FiniteChannel a A}
(c : FiniteCode W n) : Finset (Fin n → Fin a) := Finset.univ.image c.word
/-- PDF p.20: an intrinsic-output source code must decode into the declared block
algebra. Quantum input maps may be extended by precomposing intrinsic block pinching. -/
def IntrinsicSourceCode {a n : ℕ} (A : IntrinsicSystem) {S : PureSource a A.dim} (c : SourceCode S n) : Prop :=
∀ T, T.PosSemidef →
QAlgorithms.Papers.Independent.Claimed50.P40.InBlockPower A.block n (c.decode T)
/-- PDF p.20: fixed-error rates in the intrinsic source algebra; resource cost
is log Hilbert dimension of the compressed system, not dimension of the algebra. -/
def intrinsicSourceRate {a : ℕ} (A : IntrinsicSystem) (S : PureSource a A.dim)
(quantum : Bool) (lambda : ℝ) : ℝ≥0∞ :=
Filter.limsup (fun n : ℕ => sInf {r | ∃ c : SourceCode S (n+1),
IntrinsicSourceCode A c ∧ MeetsQuality c
(if quantum then .quantumFidelity else .arbitraryFidelity) lambda ∧
r = ENNReal.ofReal c.rate}) atTop
/-- PDF pp.28,34: H(V|P), for any finite family of output states. -/
def letterOutputEntropy {a d : ℕ} (P : PMF (Fin a))
(V : Fin a → Matrix (Fin d) (Fin d) ℂ) : ℝ :=
∑ x, (P x).toReal * vnEntropy (V x)
/-- PDF pp.28,34: conditional quantum divergence, allowing unsupported output
states and zero-probability input letters (0*infinity=0 in ENNReal). -/
def conditionalDivergence {a d : ℕ} (P : PMF (Fin a))
(V W : Fin a → Matrix (Fin d) (Fin d) ℂ) : ℝ≥0∞ :=
∑ x, ENNReal.ofReal (P x).toReal * relativeBits (V x) (W x)
/-- PDF p.34: individual entropy-threshold exponent, with empty infimum +infinity. -/
def individualExponent {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A)
(P : PMF (Fin a)) (L : ℝ) : ℝ≥0∞ :=
sInf {D | ∃ V : FiniteChannel a A, L < letterOutputEntropy P V.state ∧
D = conditionalDivergence P V.state W.state}
/-- PDF p.34: collective entropy-threshold exponent. -/
def collectiveExponent {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A)
(P : PMF (Fin a)) (L : ℝ) : ℝ≥0∞ :=
sInf {D | ∃ rho : Matrix (Fin A.dim) (Fin A.dim) ℂ, A.IsState rho ∧ vnEntropy rho ≤ L ∧
D = relativeBits rho (∑ x, ((P x).toReal : ℂ) • W.state x)}
/-- PDF p.34: E_g(R,P); the factor 1/2 multiplies ONLY the collective exponent.
The supremum is paired with an explicit attainment conclusion below. -/
def greedyExponent {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A)
(R : ℝ) (P : PMF (Fin a)) : ℝ≥0∞ :=
sSup {D | ∃ L Lprime : ℝ, R ≤ Lprime - L ∧
D = min (individualExponent W P L) ((1/2 : ℝ≥0∞) * collectiveExponent W P Lprime)}
/-- PDF p.35: optimize the greedy bound over all rate-admissible input laws. -/
def greedyBound {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A) (R : ℝ) : ℝ≥0∞ :=
sSup {D | ∃ P : PMF (Fin a), R ≤ W.information P ∧ D = greedyExponent W R P}
/-- PDF p.35: sphere-packing exponent, minimizing over the full normalized channel
class, with no commutativity restriction on comparison-channel states. -/
def sphereExponent {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A)
(R : ℝ) (P : PMF (Fin a)) : ℝ≥0∞ :=
sInf {D | ∃ V : FiniteChannel a A, V.information P ≤ R ∧
D = conditionalDivergence P V.state W.state}
/-- PDF p.36: global sphere-packing bound. Attainment is stated below. -/
def sphereBound {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A) (R : ℝ) : ℝ≥0∞ :=
sSup (Set.range (sphereExponent W R))
/-- PDF p.28: minimum maximum error among actual n-block codes at rate at least R. -/
def minimumChannelError {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A) (n : ℕ) (R : ℝ) : ℝ≥0∞ :=
sInf {e | ∃ c : FiniteCode W n, (c.messages : ℝ) ≥ exp2 (n * R) ∧ e = ENNReal.ofReal c.error}
/-- PDF p.34: a zero error has exponent +infinity, not totalized log(0)=0. -/
def errorExponent (n : ℕ) (e : ℝ≥0∞) : ℝ≥0∞ :=
if e = 0 then ⊤ else if e = ⊤ then 0 else ENNReal.ofReal (-Real.logb 2 e.toReal / n)
/-- PDF p.34: joint liminf in length tending to infinity and POSITIVE rate slack
tending to zero. It is not the error exponent at the exactly fixed finite-block rate. -/
def reliability {a : ℕ} {A : IntrinsicSystem} (W : FiniteChannel a A) (R : ℝ) : ℝ≥0∞ :=
Filter.liminf (fun z : ℕ × ℝ =>
errorExponent (z.1+1) (minimumChannelError W (z.1+1) (R-z.2)))
((atTop : Filter ℕ) ×ˢ nhdsWithin 0 (Set.Ioi 0))
example (n : ℕ) : errorExponent n 0 = ⊤ := by simp [errorExponent]
/-- PDF p.17: least common support over ALL states and ALL fine bases of entropy
at most R, not just the eigenbasis of the particular source being compressed. -/
def universalRange (d n : ℕ) (R : ℝ) : Submodule ℂ (EuclideanSpace ℂ (Fin n → Fin d)) :=
Submodule.span ℂ {v | ∃ S : FineResolution d, vnEntropy S.state ≤ R ∧
∃ u : EuclideanSpace ℂ (Fin n → Fin d), v = act (varianceProjector S n 0) u}
/-- PDF p.17: the orthogonal projector onto the actual universal least common support. -/
def universalProjector (d n : ℕ) (R : ℝ) :
Matrix (Fin n → Fin d) (Fin n → Fin d) ℂ :=
fun a b => inner ℂ (ket a) ((universalRange d n R).starProjection (ket b))
/-- PDF p.17: entropy-constrained divergence infimum. An empty constraint set
has value +infinity and therefore a zero exponential tail. -/
def highEntropyDivergence {I : Type*} [Fintype I] [DecidableEq I]
(rho : Matrix I I ℂ) (R : ℝ) : ℝ≥0∞ :=
sInf {D | ∃ nu : Matrix I I ℂ, IsDensityMatrix nu ∧ R ≤ vnEntropy nu ∧ D = relativeBits nu rho}
/-- PDF p.31: finitely many realizable count vectors, with no uncountable sum. -/
def countTypes (d n : ℕ) : Finset (Fin d → ℕ) :=
Finset.univ.image (fun w : Fin n → Fin d => fun j => count w j)
/-- PDF pp.30-31: exact spectral-type projector for a prescribed count vector. -/
def exactProjector {d : ℕ} (S : FineResolution d) (n : ℕ) (r : Fin d → ℕ) :=
∑ w ∈ (Finset.univ.filter fun w : Fin n → Fin d => ∀ j, count w j = r j),
wordTensor (fun i => S.atom (w i))
/-- PDF p.31: state of a realizable spectral type; positive length is required below. -/
def spectralTypeState {d : ℕ} (S : FineResolution d) (n : ℕ) (r : Fin d → ℕ) :=
∑ j, ((r j / (n : ℝ) : ℝ) : ℂ) • S.atom j
/-- PDF p.31: the entropy-high spectral projector is a finite sum of exact types. -/
def highEntropyProjector {d : ℕ} (S : FineResolution d) (n : ℕ) (L : ℝ) :=
∑ r ∈ ((countTypes d n).filter fun r => L ≤ vnEntropy (spectralTypeState S n r)),
exactProjector S n r
/-- PDF p.31: realizable conditional count tables for a fixed input word. -/
def conditionalTypes {a n : ℕ} (d : ℕ) (w : Fin n → Fin a) : Finset (Fin a → Fin d → ℕ) :=
Finset.univ.image (fun j : Fin n → Fin d => fun x r =>
(Finset.univ.filter fun t => w t = x ∧ j t = r).card)
/-- PDF p.31: the conditional exact-type projector, with original time order restored. -/
def conditionalExactProjector {a d n : ℕ} (S : Fin a → FineResolution d) (w : Fin n → Fin a)
(r : Fin a → Fin d → ℕ) :=
∑ j ∈ (Finset.univ.filter fun j : Fin n → Fin d => ∀ x k,
(Finset.univ.filter fun t => w t = x ∧ j t = k).card = r x k),
wordTensor (fun t => (S (w t)).atom (j t))
/-- PDF p.31: a realizable conditional type's comparison states. An empty input
class is assigned the original state; its entropy/divergence weight is exactly zero. -/
def conditionalTypeState {a d n : ℕ} (S : Fin a → FineResolution d) (w : Fin n → Fin a)
(r : Fin a → Fin d → ℕ) (x : Fin a) : Matrix (Fin d) (Fin d) ℂ :=
if count w x = 0 then (S x).state else
∑ j, ((r x j / (count w x : ℝ) : ℝ) : ℂ) • (S x).atom j
/-- PDF p.31: conditional entropy-low projector, as a finite sum of realizable types. -/
def lowConditionalProjector {a d n : ℕ} (S : Fin a → FineResolution d) (w : Fin n → Fin a) (L : ℝ) :=
∑ r ∈ ((conditionalTypes d w).filter fun r =>
(∑ x, empiricalWeight w x * vnEntropy (conditionalTypeState S w r x)) ≤ L),
conditionalExactProjector S w r
/-- PDF p.31: low-entropy divergence infimum for a single normalized state. -/
def lowEntropyDivergence {I : Type*} [Fintype I] [DecidableEq I]
(rho : Matrix I I ℂ) (L : ℝ) : ℝ≥0∞ :=
sInf {D | ∃ nu : Matrix I I ℂ, IsDensityMatrix nu ∧ vnEntropy nu ≤ L ∧ D = relativeBits nu rho}
/-- PDF pp.53-55: separate classical encoders and a collective conditioned POVM
on the free Y^n register, retaining an explicit failure outcome. -/
structure SideCode {s : ℕ} (S : HybridSource s) (n : ℕ) where
length_pos : 0 < n
messages : Fin s → ℕ
messages_pos : ∀ i, 0 < messages i
encode : ∀ i, (Fin n → Fin (S.alphabet i)) → Fin (messages i)
decode : (∀ i, Fin (messages i)) →
Option (∀ i, Fin n → Fin (S.alphabet i)) →
Matrix (Fin n → Fin S.system.dim) (Fin n → Fin S.system.dim) ℂ
povm : ∀ m, IsPOVM (decode m)
blocks : ∀ m x, QAlgorithms.Papers.Independent.Claimed50.P40.InBlockPower S.system.block n (decode m x)
/-- PDF pp.53-55: classical words obtained from an iid joint source word. -/
def HybridSource.classicalWords {s n : ℕ} (S : HybridSource s)
(w : Fin n → ((∀ i, Fin (S.alphabet i)) × Fin S.pure_count)) :=
fun i t => (w t).1 i
/-- PDF pp.53-55: Y word, with the correct block power. -/
def HybridSource.sideWord {s n : ℕ} (S : HybridSource s)
(w : Fin n → ((∀ i, Fin (S.alphabet i)) × Fin S.pure_count)) :=
wordTensor (fun t => S.letter (w t).2)
/-- PDF pp.53-55: actual message tuple, each message seeing its own classical word only. -/
def SideCode.message {s n : ℕ} {S : HybridSource s} (c : SideCode S n)
(x : ∀ i, Fin n → Fin (S.alphabet i)) := fun i => c.encode i (x i)
/-- PDF pp.53-55: ensemble-averaged whole-tuple decoding error. -/
def SideCode.error {s n : ℕ} {S : HybridSource s} (c : SideCode S n) : ℝ :=
1 - ∑ w : Fin n → ((∀ i, Fin (S.alphabet i)) × Fin S.pure_count),
(∏ t, (S.law (w t)).toReal) * effectProb (S.sideWord w)
(c.decode (c.message (S.classicalWords w)) (some (S.classicalWords w)))
/-- PDF pp.53-55: mean unhalved trace norm for the actual labelled square-root
instrument after discarding transmitted classical messages, including its failure block. -/
def SideCode.disturbance {s n : ℕ} {S : HybridSource s} (c : SideCode S n) : ℝ :=
∑ w : Fin n → ((∀ i, Fin (S.alphabet i)) × Fin S.pure_count),
(∏ t, (S.law (w t)).toReal) *
totalDisturbance (c.decode (c.message (S.classicalWords w))) (S.sideWord w)
(some (S.classicalWords w))
/-- PDF pp.53-55: classical message rate in bits per source symbol. -/
def SideCode.rate {s n : ℕ} {S : HybridSource s} (c : SideCode S n) (i : Fin s) : ℝ :=
Real.logb 2 (c.messages i) / n
/-- PDF p.54: marginal probability of a classical tuple. -/
def HybridSource.classicalMass {s : ℕ} (S : HybridSource s) (x : ∀ i, Fin (S.alphabet i)) : ℝ :=
∑ p, (S.law (x,p)).toReal
/-- PDF p.54: conditional Y state. A zero-mass branch is filled by a fixed source
pure state, rather than by an unnormalized zero state. -/
def HybridSource.conditional {s : ℕ} (S : HybridSource s) (x : ∀ i, Fin (S.alphabet i)) :=
if S.classicalMass x = 0 then S.letter ⟨0,S.pure_count_pos⟩ else
∑ p, (((S.law (x,p)).toReal / S.classicalMass x : ℝ) : ℂ) • S.letter p
/-- PDF pp.56-57: quantum source encoder with classical side information. The
`encoderKnows` flag changes its actual domain: false requires one common encoding
for every classical word; the decoder always receives the classical word for free. -/
structure ClassicalSideCode (S : HybridSource 1) (n : ℕ) (encoderKnows : Bool) where
length_pos : 0 < n
dim : ℕ
dim_pos : 0 < dim
encode : (Fin n → Fin (S.alphabet 0)) → (Fin n → Fin S.pure_count) →
Matrix (Fin dim) (Fin dim) ℂ
encoded_state : ∀ x p, IsDensityMatrix (encode x p)
decoderOnly : encoderKnows = false → ∀ x y p, encode x p = encode y p
decode : (Fin n → Fin (S.alphabet 0)) → Superop (Fin dim) (Fin n → Fin S.system.dim)
decoder_channel : ∀ x, IsChannel (decode x)
/-- PDF pp.56-57: actual ensemble-averaged pure-word fidelity. -/
def ClassicalSideCode.fidelity {S : HybridSource 1} {n : ℕ} {known : Bool}
(c : ClassicalSideCode S n known) : ℝ :=
∑ w : Fin n → ((∀ i, Fin (S.alphabet i)) × Fin S.pure_count),
(∏ t, (S.law (w t)).toReal) *
effectProb (c.decode (fun t => (w t).1 0)
(c.encode (fun t => (w t).1 0) (fun t => (w t).2))) (S.sideWord w)
/-- PDF p.57: fixed-error limsup of operational minimum rates, with the encoder's
side-information domain part of the code type. -/
def classicalSideRate (S : HybridSource 1) (encoderKnows : Bool) (lambda : ℝ) : ℝ≥0∞ :=
Filter.limsup (fun n : ℕ => sInf {r |
∃ c : ClassicalSideCode S (n+1) encoderKnows, 1 - c.fidelity ≤ lambda ∧
r = ENNReal.ofReal (Real.logb 2 c.dim / (n+1 : ℝ))}) atTop
/-- PDF pp.40,43: the independent sender law, constructed before the pure
conditional-output refinement. The product normalization is a finite distributive law. -/
def independentLaw {s : ℕ} {a : Fin s → ℕ} (P : ∀ i, PMF (Fin (a i))) :
PMF (∀ i, Fin (a i)) :=
PMF.ofFintype (fun x => ∏ i, P i (x i)) (by
rw [← Fintype.prod_sum]
have h : ∀ i, (∑ x, P i x) = 1 := fun i => by simpa only [tsum_fintype] using (P i).tsum_coe
simp only [h, Finset.prod_const_one])
/-- PDF p.43: source reduction data, with the source constructed from normalized
pure decompositions of EVERY channel output and the independent sender laws. -/
def macReductionSource
(C : QAlgorithms.Papers.Independent.Claimed50.P40.ClassicalChannel 2)
(P : QAlgorithms.Papers.Independent.Claimed50.P40.InputLaw C.alphabet)
(b : ℕ) (hb : 0 < b) (pi : Fin b → Matrix (Fin C.output) (Fin C.output) ℂ)
(hpure : ∀ j, (IsPure (pi j)) ∧ InBlocks C.block (pi j)) (hdistinct : Function.Injective pi)
(q : (∀ i, Fin (C.alphabet i)) → PMF (Fin b)) : HybridSource 2 where
alphabet := C.alphabet
alphabet_pos := C.alphabet_pos
system := ⟨C.output, C.output_pos, C.block⟩
pure_count := b
pure_count_pos := hb
letter := pi
pure := hpure
distinct := hdistinct
law := (independentLaw P).bind (fun x => PMF.map (fun j => (x,j)) (q x))
/-- Empty temporal block is the scalar identity, even for entangled source letters. -/
example {s : ℕ} {L : Type*} [Fintype L] (S : MultipleData s L) (w : Fin 0 → L)
(a b : PartyWords S.system 0) : S.word w a b = 1 := by
simp [MultipleData.word]
/-- Independent-law construction retains the actual product weights. -/
example {s : ℕ} {a : Fin s → ℕ} (P : ∀ i, PMF (Fin (a i))) (x : ∀ i, Fin (a i)) :
independentLaw P x = ∏ i, P i (x i) := rfl
end QAlgorithms.Papers.Independent.Renew46.P43
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Renew46.P43.ArbitraryMultipleCode.distortion
For natural numbers , product data , and an arbitrary multiple code for of length , the code’s distortion is the following real number. Here ; party has alphabet size , positive system dimension , letter matrices , and positive code dimension ; is the joint probability mass function in ; is the trace-one positive semidefinite encoded matrix for local word ; and is the decoder, admitting a finite Kraus representation with and satisfying the stipulated zero-entry condition across unequal system block labels on every positive semidefinite input. For each word of joint alphabet symbols, set
Here , and are length- words with values below . Then
where the matrix square root is defined by continuous functional calculus. The probability masses are taken as real numbers. The letter matrices in are not assumed to be density matrices or pure states. Zero parties are allowed, with all empty products equal to ; zero code length is excluded by the code’s fields.
QAlgorithms.Papers.Independent.Renew46.P43.ArbitraryMultipleCode.fidelity
For natural numbers , product data , and an arbitrary multiple code for of length , the code’s fidelity is the real number below. Here ; party has alphabet size , positive system dimension , letter matrices , and positive code dimension ; is the joint probability mass function supplied by ; is the trace-one positive semidefinite encoded matrix assigned by to local word ; and is its decoder, which has a finite Kraus representation with and whose positive semidefinite outputs have zero entries whenever some party and time coordinate have unequal system block labels. For a word of joint letters , define its weight and two matrices by
The indices range over , and range over . The definition is
The masses here are the real values of the probability mass function. No purity or density assumption on is imposed through . The case is included, with empty products equal to .
QAlgorithms.Papers.Independent.Renew46.P43.ArbitraryMultipleCode
For any natural number , product data consists of, for each party , a positive system dimension , a block label function , an alphabet size , and matrices for alphabet symbols , together with a joint probability mass function on the tuples . No validity condition on these letter matrices is part of this declaration. For any natural number , an arbitrary multiple code for of length consists of a proof that , positive integers for all parties, an encoding function assigning to every local word a positive semidefinite matrix of trace , and a decoding map from matrices indexed by tuples , with , to matrices indexed by tuples of system words , with . The decoder must admit a finite Kraus representation: there are and matrices , , such that and for every matrix . It must also satisfy, for every positive semidefinite input matrix and every pair of output indices ,
Thus no such code has length . The case is included: the party tuples then have a single empty value, and the conditions quantified over parties are vacuous.
QAlgorithms.Papers.Independent.Renew46.P43.ClassicalSideCode.fidelity
Let be a hybrid source with one classical alphabet , where , a quantum space , where , block labels , and distinct letter matrices , where and whenever . Its law is an arbitrary probability mass function on . For any natural number , Boolean parameter , and code of the specified type, the code data require , a positive encoding dimension , a density matrix for every pair of classical and letter words, and a decoding channel for every classical word. A density matrix is positive semidefinite with trace one; each decoding channel has a finite representation with . If , the encoding must satisfy for all . The definition assigns the real number
Thus the sum includes every length- word, including words of probability zero; there is no code argument of this type at .
QAlgorithms.Papers.Independent.Renew46.P43.ClassicalSideCode
For a one-sender hybrid source , a natural number , and a Boolean parameter , this structure consists of the following data and requirements. The source has a positive classical alphabet size , a quantum dimension with basis block labels, distinct normalized pure states supported within those blocks, and a joint probability mass function on classical symbols and pure-state labels. A code requires , a compression dimension with , and an encoding function assigning a matrix to every classical word and label word ; every such matrix must be positive semidefinite and have trace , including for words of zero source probability. If , it additionally requires for all ; when the parameter is true, this implication imposes no restriction. Finally, for every classical word , the structure supplies a function from matrices to matrices indexed by length- quantum basis words, and requires a finite Kraus representation
for some natural number . No object of this structure exists for .
QAlgorithms.Papers.Independent.Renew46.P43.CommutingImages
For any intrinsic systems , each having a positive natural-number dimension and a natural-number block-label function , and any complex-linear maps and , the commuting-images condition means that for every and , if whenever and whenever , then .
QAlgorithms.Papers.Independent.Renew46.P43.Diagonalization
Let have a positive integer dimension and a natural-number block-label function . For any natural number , arbitrary matrix , real coefficients , and matrices , this predicate means that every ; for every there exists with Euclidean norm such that , and whenever ; for all distinct indices ; and
There is no requirement that the coefficients sum to , that have trace , or that the sum to the identity. The case is included: all indexed conditions are vacuous, and the predicate holds exactly when .
QAlgorithms.Papers.Independent.Renew46.P43.Embedding
For intrinsic systems with positive natural-number dimensions and natural-number block-label functions , an embedding consists of a complex-linear map with the following properties. It sends every matrix whose entries vanish between differently labelled -indices to a matrix whose entries vanish between differently labelled -indices, and . For every natural number , including , and every positive semidefinite matrix indexed by pairs , with and , such that whenever , the matrix with entries at is positive semidefinite; at these matrices are empty. Moreover, for every whose entries vanish between differently labelled -indices, ; for every such , , where denotes conjugate transpose; and for every such pair , equality implies .
QAlgorithms.Papers.Independent.Renew46.P43.EncoderExtension
For natural numbers , let be a source with , , a probability mass function on , and distinct matrices , each of the form for a unit vector . Let be a code with , a compressed dimension , an assigned positive semidefinite trace-one matrix for every length- source word , and a channel decoding compressed matrices into matrices indexed by length- strings over . For any function from matrices on that string space to , the predicate asserts that is a channel and that, for every word , including words of zero source probability,
Here a channel, for both the decoder and , means a function admitting a finite Kraus representation on every input matrix, with . Thus no such source or code exists when , , or .
QAlgorithms.Papers.Independent.Renew46.P43.FineResolution.atom
For every natural number , every fine resolution consisting of nonnegative real weights summing to and a unitary complex matrix , and every index , this defines the complex matrix with entries
The weights do not enter this formula, including when the weight at is zero; when , neither such a fine resolution nor such an index exists.
QAlgorithms.Papers.Independent.Renew46.P43.FineResolution.law
For every natural number and every fine resolution , consisting of nonnegative real weights summing to and a unitary complex matrix , this defines a probability mass function on whose mass at is , regarded as an extended nonnegative real number. Zero weights give zero mass; there is no such input when .
QAlgorithms.Papers.Independent.Renew46.P43.FineResolution
For each natural number , a fine resolution consists of real weights indexed by , with for every and , together with a unitary complex matrix . Zero weights are allowed. The parameter is included, but no fine resolution exists then, since the empty sum cannot equal .
QAlgorithms.Papers.Independent.Renew46.P43.FineResolution.state
For any natural number and spectral data consisting of real weights , indexed by , with , and a complex unitary matrix , this defines the matrix
Here is the conjugate transpose. Although is included in the parameter range, no such exists then, because its weights would have empty sum , contrary to their required sum .
QAlgorithms.Papers.Independent.Renew46.P43.FiniteChannel.capacity
For every natural number , every system with positive dimension and block-label function , and every finite channel consisting of positive semidefinite trace-one matrices satisfying whenever , its capacity is the real supremum
where , , and matrix evaluation uses continuous functional calculus. The definition takes a supremum over all such probability laws, including those with zero probabilities, and does not assert that a maximizing law exists.
QAlgorithms.Papers.Independent.Renew46.P43.FiniteChannel.information
For every natural number , every system with positive dimension and block-label function , every finite channel on that system—so , and its matrices are positive semidefinite, have trace , and vanish between coordinates with different block labels—and every probability mass function on , the information is the real number
where is evaluated by continuous functional calculus. Zero probabilities are allowed, and the sums include every alphabet element.
QAlgorithms.Papers.Independent.Renew46.P43.FiniteChannel
For a natural number and a system consisting of a positive integer dimension and a block-label function , a finite channel consists of a proof that and a family of complex matrices . Each must be positive semidefinite with trace , and must satisfy whenever . Thus the alphabet cannot be empty; no distinctness condition is imposed on its matrices.
QAlgorithms.Papers.Independent.Renew46.P43.FiniteCode.Composition
For natural numbers , let have positive dimension and block labels , and let assign its letters positive semidefinite, trace-one matrices vanishing between unequal block labels. Let be a code of positive length , with messages, words , and positive semidefinite decoding matrices summing to the identity, indexed by the messages together with , and vanishing between strings with unequal block labels at any coordinate. For any probability mass function on the letters, the code has composition precisely when, for every message and every letter ,
where the probability mass is regarded as a real number. Thus every codeword must have exactly these letter frequencies; letters of probability zero must be absent, and the condition cannot hold if any is not an integer.
QAlgorithms.Papers.Independent.Renew46.P43.FiniteCode.codebook
For natural numbers , an intrinsic system consisting of a positive dimension and a block label , a finite channel with positive alphabet size , and a finite code for of length , the codebook is the finite set
where is the code’s positive message count and its encoding map. The channel assigns each input letter a positive semidefinite matrix of trace whose entries between distinct -blocks vanish. The code also requires and supplies positive semidefinite measurement matrices, indexed by the messages together with an additional outcome, that sum to the identity and have zero entries between output words whose block labels differ at any coordinate. The codebook definition uses only the encoding map: repeated words appear once, and no injectivity or error bound is assumed.
QAlgorithms.Papers.Independent.Renew46.P43.FiniteCode.error
For natural numbers , let have positive dimension and block labels , and let assign its letters positive semidefinite, trace-one matrices with zero entries between unequal block labels. Let be a code of positive length , with messages, words , and positive semidefinite decoding matrices summing to the identity, including an outcome ; these matrices have zero entries between strings differing in block label at any coordinate. Define the output matrix for message by
The code’s error is the real number
The maximum is over a nonempty finite set. Only the decoding outcome labelled by the transmitted message contributes to its success term; the outcome does not.
QAlgorithms.Papers.Independent.Renew46.P43.FiniteCode
Let be natural numbers, and let consist of a positive dimension and a block label function . Let be a finite channel with input letters, assigning each letter a positive semidefinite complex matrix of trace , whose entry is zero whenever . A finite code for of length consists of the following data and requirements: ; a positive natural number of messages; a word for each message ; and complex matrices , indexed by pairs of strings in , for outcomes . Every is positive semidefinite, their sum is the identity, and whenever there exists a coordinate with . Distinct messages are not required to have distinct words. There is no such code at length .
QAlgorithms.Papers.Independent.Renew46.P43.Hom
For intrinsic systems with positive natural-number dimensions and natural-number block-label functions , a homomorphism consists of a complex-linear map satisfying the following conditions. If whenever , then whenever , and . For every natural number and every positive semidefinite matrix indexed by , where and , whose entries vanish whenever the two -indices have different block labels, the matrix with entries at is positive semidefinite; this includes , when the matrices are empty. Finally, for every whose entries vanish between differently labelled -indices, , and for every such , , where denotes conjugate transpose.
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.classicalCoordinate
For every natural number , let consist of positive alphabet sizes for , a system of positive dimension with block labels , a positive number of distinct pure states with and whenever , and a probability mass function on . Its associated systems have dimensions . For every coordinate tuple in these systems and every , the classical-coordinate function returns , regarded as an element of ; the dimension cast does not change its numerical value. When , there is no index to which this function can be applied.
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.classicalMass
Let , including zero, and let have positive classical alphabet sizes for , a quantum system of dimension with block labels, a positive number of distinct normalized pure states supported within those blocks, and a joint probability mass function on . Here denotes the real value of that probability mass. For any classical tuple , the definition is
Thus zero-mass classical tuples are included. When , there is one empty classical tuple, and its mass is .
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.classicalWords
Let , including zero, and let be a hybrid source: it has positive classical alphabet sizes for , a quantum system of dimension with basis block labels , a positive number of distinct pure states with and whenever , and a joint probability mass function on pairs with and . For any length- word of such pairs, write . The definition returns the family of classical words
Thus it retains each sender’s classical coordinate at every position and discards the pure-state labels. If , every returned word is empty; if , the returned family is empty.
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.conditional
Let , including zero, and let have positive classical alphabet sizes , quantum dimension with basis block labels , distinct pure states with and zero entries between different blocks, and joint probability masses summing to . For any classical tuple , set . The definition returns
The zero-mass case explicitly selects the state with label , which exists because . When , is the unique empty tuple and this expression is the average .
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.corner
For any natural number , let consist of positive alphabet sizes for , a positive dimension with block labels , a positive number of distinct matrices with and whenever , and a joint probability mass function on alphabet tuples and labels . For a subset of sender indices, define the matrix , indexed by pairs with and , by
Write , where is applied by continuous functional calculus, with . Given any permutation of the sender indices, the defined corner is the real vector whose coordinate at is
Thus contains exactly the indices occurring before in the order specified by . The definition includes , when the resulting vector is the unique function on the empty index set.
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.lowerRegion
For any natural number , let have positive alphabet sizes , positive system dimension with block labels , a positive number of pairwise distinct matrices with and zero entries between different blocks, and joint real probabilities on full classical tuples and labels . Put , and for define by when , and by when , where are classical tuples on and are system indices. Write , with evaluated by continuous functional calculus. The lower region is exactly the set of real vectors satisfying
The empty subset contributes . When , the region consists of the unique empty real vector.
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.marginal
For any natural number , let be a source with positive alphabet sizes , positive system dimension , block labels , a positive number of pairwise distinct matrices with and whenever , and a probability mass function on pairs , where and . Write for the real probability assigned to that pair. For every subset , the marginal is the complex matrix indexed by pairs , where and , with entries
Here the sum ranges over all full input tuples and all labels . For , there is one empty classical label and the matching condition is vacuous, so the matrix is .
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource
For any natural number , including , a hybrid source consists of positive integers for each ; a system specified by a positive dimension and a function assigning block labels; a positive integer ; matrices for ; and a probability mass function on . Each must equal for some complex vector with Euclidean norm , and must satisfy whenever . The matrices are pairwise distinct: implies . The probability law may correlate all its coordinates and may assign probability zero to some tuples. When , the classical input tuple has exactly one possible value, the empty tuple.
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.multiple
For every natural number , consider a source with positive alphabet sizes , a system of positive dimension and block labels , a positive number of distinct pure states with and entries zero between different -blocks, and a probability mass function on pairs , where and . This definition constructs data for parties with that same label set and exactly the law . Party has dimension and block label ; the last party is the original system. For coordinate tuples and , the matrix assigned to label has entry if and for every , and entry zero otherwise. No independence condition is imposed on . When , the coordinate condition is vacuous and the assigned matrix is simply .
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.quantumCoordinate
For every natural number , let consist of positive alphabet sizes for , a system of positive dimension with block labels , a positive number of distinct states with whose entries vanish between different -blocks, and a probability mass function on . For every tuple of coordinates in the associated systems of dimensions , the quantum-coordinate function returns the last coordinate , regarded as an element of . The dimension cast preserves its numerical value. This also applies when , in which case the tuple has only this last coordinate.
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.sideWord
Let , including zero, and let have positive classical alphabet sizes for , a quantum system of dimension with block labels , a positive number of distinct pure states with and zero entries between different blocks, and a joint probability mass function on classical tuples and labels . For any length- word , the definition returns the matrix indexed by quantum basis words , with entries
The classical coordinates do not enter this expression. For , the indexing set contains one empty word and the resulting matrix has entry .
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.subsetEntropy
For any natural number , let specify positive alphabet sizes , a positive system dimension with block labels , a positive number of pairwise distinct matrices with and zero entries between different blocks, and a joint probability mass function with real probabilities on full classical tuples and labels . Put . For each , define the matrix , indexed by a classical tuple on and a system index , by if , and otherwise by . Define , where and is evaluated by continuous functional calculus. For every subset , the subset entropy is the real number
In particular, it is for ; for , the second matrix is the average . The definition also includes .
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.systems
For any natural number and hybrid source , the source supplies positive alphabet sizes for , an intrinsic system of positive dimension with block labels , a positive number of distinct letter matrices, and a probability mass function on . Each letter matrix is for some complex vector of norm and has zero entries between unequal block labels. The defined family has intrinsic systems: at index it has dimension and assigns basis index the natural-number block label itself; at the last index it is exactly the intrinsic system supplied by . Thus
For , the family contains only the supplied intrinsic system.
QAlgorithms.Papers.Independent.Renew46.P43.HybridSource.withYRate
For every natural number , let have positive alphabet sizes , a system of positive dimension with block labels , a positive number of distinct pure states with whose entries vanish between different -blocks, and a probability mass function on classical tuples and state labels . For every real-valued vector , with no sign restriction, this definition returns the -coordinate vector whose coordinate is and whose last coordinate is the entropy of the empty-classical-subset marginal. Explicitly, that marginal has entries , up to its singleton empty-tuple index, and the appended value is , where is applied by continuous functional calculus, with value zero at . When , the result consists solely of this entropy coordinate.
QAlgorithms.Papers.Independent.Renew46.P43.IntrinsicOperation
For intrinsic systems and , each consisting of a positive natural-number dimension and a block-label function , respectively , an intrinsic operation consists of a complex-linear map satisfying three conditions: whenever for every pair with , its image satisfies whenever ; ; and, for every natural number and every positive semidefinite matrix indexed by whose entries vanish whenever , the matrix indexed by with entries at is positive semidefinite. This last requirement includes , when both amplified matrices have empty index sets.
QAlgorithms.Papers.Independent.Renew46.P43.IntrinsicSourceCode
Let be natural numbers, and let consist of a positive dimension and an arbitrary block-label function . Let be a source with , a probability mass function on , and distinct matrices , where each has norm one; zero probabilities are allowed. Let be a source code of length , with a positive compressed dimension , an assigned density matrix for every word , and a decoder admitting finitely many Kraus matrices such that and for every . This defines the property that, for every positive semidefinite matrix and every pair of output words ,
The input need not have trace one. No block condition is imposed here on the source letters themselves. Although is a natural-number parameter, no code of length zero satisfies the required code structure.
QAlgorithms.Papers.Independent.Renew46.P43.IntrinsicSystem.IsPureState
For an intrinsic system with positive dimension and block-label function , and any complex matrix , the predicate that is a pure state of means that there exists a vector with Euclidean norm such that for all , and additionally whenever .
QAlgorithms.Papers.Independent.Renew46.P43.IntrinsicSystem.IsState
For an intrinsic system with positive dimension and block-label function , and any complex matrix , the predicate that is a state of means that is positive semidefinite, , and for every pair of indices with .
QAlgorithms.Papers.Independent.Renew46.P43.IntrinsicSystem
An intrinsic system consists of a natural number , a proof that , and an arbitrary function assigning a block label to each index. The labels need not be consecutive, and some natural numbers may label no index.
QAlgorithms.Papers.Independent.Renew46.P43.IsCountablePOVM
For every countable type , every finite type with decidable equality, and every family of complex matrices indexed by , this predicate means that every is positive semidefinite and that the unordered sum converges to the identity matrix, meaning that the net of sums over finite subsets of converges to that identity. Finite and empty index types are included: if is empty, every such family satisfies the predicate; if is empty and is nonempty, none does.
QAlgorithms.Papers.Independent.Renew46.P43.IsExtreme
For any type , with no finiteness or nonemptiness assumption, any set of real-valued functions on , and any function , the defined property holds precisely when and, for every and every real satisfying ,
where the vector operations and equalities are pointwise. If is empty, the property is false; if is empty, there is only one such function and the property is equivalent to its membership in .
QAlgorithms.Papers.Independent.Renew46.P43.IsShadow
For every finite index type with decidable equality, arbitrary complex matrices indexed by , and real number , the predicate holds exactly when and are positive semidefinite and . No positivity or normalization condition is imposed on , and no sign restriction is imposed on . If is empty, both positive semidefiniteness conditions hold and the predicate reduces to .
QAlgorithms.Papers.Independent.Renew46.P43.MaximalCodeConclusion
Let consist of a positive dimension and block labels , and let each be a nonempty measurable set of positive semidefinite trace-one matrices whose entries vanish between different blocks. For a natural number , probability measures on for , any set , real numbers , and a Boolean , this proposition means that there exists a length- code with a positive number of messages, encoding states , and positive semidefinite decoding matrices summing to the identity, with every decoder entry between words equal to zero if for some , such that
and the following additional conditions hold. For every , one can choose nonnegative weights summing to and a unitary matrix with columns , , so that . These choices satisfy , where
Furthermore,
and implies for every message . Here functional calculus defines the matrix functions; for density matrices is if , and otherwise the nonnegative part of , with ; it is for other arguments, and real conversion sends to . The definition assumes neither measurability of nor sign restrictions on ; it requires through the code structure, so it is false when . When , it imposes no idempotence requirement on the decoding matrices.
QAlgorithms.Papers.Independent.Renew46.P43.MeetsQuality
Let , and let be a source with distinct pure states on , where , indexed by , and a probability mass function on these indices; zero probabilities are allowed. Let be a code of length , with an integer compressed dimension , an assigned density matrix on for every word , and a decoder channel into . Here a density matrix is positive semidefinite with trace , and a channel means a map admitting a finite representation with . Write , , and define
An encoder extension is a channel from the uncompressed word space to satisfying for every word, including words of probability zero. Put and , and define , , and , where the extension acts on the second matrix factor. For any real and any of the four quality choices , the predicate holds precisely as follows: for arbitrary fidelity, ; for arbitrary distortion, ; for quantum fidelity, an encoder extension exists and ; for quantum entanglement, an encoder extension exists with . No restriction on is imposed, and length zero is excluded by the code’s required positivity.
QAlgorithms.Papers.Independent.Renew46.P43.MultipleCode.channel
For any natural numbers , finite type , source data assigning a positive local dimension and block labels to each party , and code for of length , let , , and denote its compressed dimensions, encoder maps, and decoder map. Such a code has ; its encoders and decoder admit finite Kraus representations with , and its decoder has zero entries between output arrays with different block labels at any party and position whenever its input is positive semidefinite. This definition assigns to a map on matrices indexed by arrays , : first form the matrix , indexed by compressed tuples , whose entries are
where is the matrix with a single in row , column , and zeros elsewhere; then return . This formula defines the map on every complex input matrix , without requiring to be a density matrix. If , each product over parties equals , and the tuple index sets are singletons.
QAlgorithms.Papers.Independent.Renew46.P43.MultipleCode.distortion
For natural numbers , a finite type , and source data , let each party have a positive dimension and a block-label function . The source also specifies a probability mass function on and a complex matrix on for each ; no purity, positivity, normalization, distinctness, or block condition on these matrices is assumed. A code has positive length , positive compressed dimensions , encoder channels from party ’s length- register to dimension , and a decoder channel back to all parties’ length- registers. Here a channel is a map admitting a finite representation with . For every positive semidefinite decoder input , the decoder additionally satisfies whenever for some party and position . Write , where the tensor product acts on matrix units by and extends linearly, and define the source word matrix by . The distortion is the real number
The probabilities here are the real-valued masses of the specified probability mass function. Zero parties are allowed, with empty products equal to ; although is quantified over all natural numbers, a code at cannot satisfy its positive-length field.
QAlgorithms.Papers.Independent.Renew46.P43.MultipleCode.fidelity
For any natural numbers , finite type , source data , and code for of length , write for the real value of the source probability mass at , and for its letter matrix indexed by tuples of local coordinates . The source’s letter matrices are arbitrary here: no purity, density-matrix, distinctness, or block-support hypothesis is imposed. The code has , positive compressed dimensions , channel encoders , and a channel decoder , where each channel has a finite Kraus representation with ; the decoder also has zero entries between differently labelled output blocks on positive semidefinite inputs. For a word , define its matrix , indexed by local-coordinate arrays , by . Define , where
and is the corresponding matrix unit. The declared fidelity is exactly the real number
In particular, the trace expression uses the decoded matrix multiplied by the word matrix, without an additional adjoint or normalization. No assertion that this number lies in is included. Zero-probability words have zero weight; is allowed and gives singleton array index sets and empty party products equal to , while is excluded by the code.
QAlgorithms.Papers.Independent.Renew46.P43.MultipleCode
For any natural number , finite type , source data , and natural number , this structure consists of the following data and conditions. The source supplies, for each , a positive dimension and a block label function , together with a probability mass function on and an arbitrary complex matrix indexed by for each letter in ; no validity condition on these letter matrices is assumed. A code requires , positive integers , encoder maps from matrices indexed by to matrices indexed by , and a decoder map from matrices indexed by to matrices indexed by the arrays , where . Each encoder and the decoder must admit a finite Kraus representation: a map has this property when there are finitely many rectangular complex matrices such that and for every input matrix . In addition, for every positive semidefinite input matrix and every pair of output arrays , the decoder satisfies
Thus no code of this type exists at . The number of parties may be zero, in which case the party-indexed requirements and the condition involving a differing block label are vacuous.
QAlgorithms.Papers.Independent.Renew46.P43.MultipleCode.rate
For any natural numbers , finite type , source data consisting of positive-dimensional local systems with block labels, a probability mass function on , and letter matrices, any code for of length , and any party , this definition assigns the real number
where is that party’s compressed dimension. The code requires and , channel encoders and decoder admitting finite trace-preserving Kraus representations, and decoder outputs that have zero entries between differently labelled blocks on positive semidefinite inputs. The rate uses only and ; in particular, gives rate zero. When , there is no party to which this definition can be applied, and is excluded by the code’s positive-length requirement.
QAlgorithms.Papers.Independent.Renew46.P43.MultipleData.Valid
For any natural number , any finitely enumerated type , and any data consisting of systems with positive dimensions and block labels , a probability mass function on , and complex letter matrices indexed by , validity means that all three following conditions hold: for every there exists a vector of Euclidean norm one such that for every ; the assignment is injective; and, for every , if for at least one party , then . These conditions apply even to letters of probability zero. If , the block condition is vacuous, every pure letter matrix is the scalar matrix , and injectivity therefore permits at most one letter.
QAlgorithms.Papers.Independent.Renew46.P43.MultipleData.average
For any natural number , any finitely enumerated type , and any data with systems of positive dimensions and block label functions, probability mass function on , and complex letter matrices indexed by , the average is the matrix
where each probability mass is converted to a real number and then used as a complex scalar. Letters of probability zero contribute zero. No validity assumption is required, so the matrices being averaged need not be pure, normalized, positive semidefinite, distinct, or restricted by the block labels. The definition includes , when the average is a matrix.
QAlgorithms.Papers.Independent.Renew46.P43.MultipleData.blockAverage
For any natural number , any finite type , any data consisting of systems for parties, a probability mass function on , and complex letter matrices , and any natural number , define a matrix as follows. Party 's system has a positive dimension and arbitrary block labels, and each letter matrix is indexed by configurations with . Write for the real probability assigned to , and set . On arrays and of valid party basis indices over positions, the defined matrix has entries
No positivity, normalization, purity, distinctness, or block condition on the letter matrices is assumed. When , this is the one-entry matrix with entry ; is also allowed.
QAlgorithms.Papers.Independent.Renew46.P43.MultipleData
For any natural number and any type equipped with a finite enumeration, this structure consists of a family of systems indexed by , each with a positive natural dimension and a block label function ; a probability mass function on ; and, for every , a complex matrix whose rows and columns are indexed by tuples . The probability masses are nonnegative and sum to one, but individual masses may be zero. No purity, density, distinctness, or block restriction is required of the matrices. The probability mass function prevents such data from existing when is empty. When , the tuple index set is a singleton, so each letter matrix is .
QAlgorithms.Papers.Independent.Renew46.P43.MultipleData.word
For any natural numbers , any finite type , and any data consisting of a system for each party , a probability mass function on , and a complex matrix for each , define the matrix associated with a word as follows. Party 's system has a positive dimension and a block label assigned to each basis index; each is indexed by configurations with . The resulting matrix is indexed by arrays and , where , , and , and its entries are
The probability law and block labels do not enter this formula, and no positivity, normalization, purity, or distinctness condition on the letter matrices is assumed. When , the indexing set has one element and the sole matrix entry is the empty product ; is also allowed.
QAlgorithms.Papers.Independent.Renew46.P43.NonstationaryCode.error
For a system of positive dimension with block labels , a sequence of nonempty measurable sets of positive semidefinite, trace-one matrices supported within those blocks, and a nonstationary code of positive length with a positive number of messages, let be its encoded matrix for message at position . Its decoding matrices , indexed by the messages and the additional outcome , are positive semidefinite, sum to the identity, and have zero entries between words whose block labels differ at any position. Define the encoded word matrix by . The error of is the real number
The maximum is over a nonempty finite set because ; the outcome does not count as successful decoding for any message.
QAlgorithms.Papers.Independent.Renew46.P43.NonstationaryCode
Let consist of a positive integer dimension and a block-label function . Let assign to every natural number a nonempty measurable set of complex matrices, each positive semidefinite with trace and with entry equal to zero whenever . For a natural number , a nonstationary code consists of a proof that , a positive natural number of messages, matrices for every and , and decoding matrices indexed by the message outcomes together with an additional outcome . These decoding matrices act on the space with basis indexed by words , are all positive semidefinite, and sum to the identity, including the outcome . For every outcome and every pair of basis words , the entry must be zero if there exists a position such that . No such code exists when .
QAlgorithms.Papers.Independent.Renew46.P43.PartyWords
For any natural numbers and any family of systems, where each system has a positive natural dimension and a block label function , this abbreviates the type
Thus an element assigns each party a word of length over its dimension indices; the block labels impose no restriction. If or , this type has exactly one element.
QAlgorithms.Papers.Independent.Renew46.P43.ProductData.Valid
For every natural number and every collection consisting of positive-dimensional systems with block-label functions , natural alphabet sizes , a joint probability mass function on alphabet tuples, and local complex matrices , this predicate means that every is positive; for every party and every alphabet symbol , there exists a complex vector with such that , and whenever ; and, for each fixed , equality implies . These requirements apply even to symbols having zero marginal probability under the joint law. When , all three requirements are vacuous.
QAlgorithms.Papers.Independent.Renew46.P43.ProductData
For each natural number , this structure consists of, for every , a system with a positive natural dimension and an arbitrary block-label function , a natural alphabet size , a probability mass function on the set of tuples with , and a complex matrix for every local alphabet symbol. The structure imposes no positivity, normalization, purity, block-support, or distinctness conditions on these matrices, and the joint probability law need not factor across parties. Alphabet positivity is not an explicit field, although existence of the probability law rules out an empty coordinate alphabet. The case is included: there are no local systems or letters, and the tuple space contains the single empty tuple.
QAlgorithms.Papers.Independent.Renew46.P43.ProductData.multiple
For every natural number and every collection of positive-dimensional systems with block labels, natural alphabet sizes , a probability mass function on tuples , and local complex matrices , this definition constructs multiple-party source data with the same systems and the same joint law , whose matrix for the global letter is indexed by basis tuples and has entries
Thus the letter matrix is the tensor product of the selected local matrices. No validity hypothesis on is required, and this definition asserts no additional matrix properties. For , the empty product is , so the unique global letter has the matrix .
QAlgorithms.Papers.Independent.Renew46.P43.PureSource.average
For natural numbers and a pure source with , , probability mass function on labels, and pairwise distinct matrices for unit vectors , its average is the complex matrix
where is the real value of the probability mass assigned to , regarded as a complex scalar in the sum. Zero-probability labels contribute zero.
QAlgorithms.Papers.Independent.Renew46.P43.PureSource
For natural numbers , a pure source consists of proofs that and , a probability mass function on , and a family of complex matrices . For every label , there exists a vector with Euclidean norm such that for all . The family is injective: implies . Labels may have probability zero; their matrices must still satisfy the purity and distinctness requirements. No such source exists when or .
QAlgorithms.Papers.Independent.Renew46.P43.PureSource.weight
For natural numbers , a pure source with , , probability mass function on labels, and pairwise distinct matrices for unit vectors , and any word , the weight is the real number
Here each probability is converted to its real value. Repeated labels are permitted, and any zero-probability label occurring in the word makes its weight zero. When , the unique empty word has weight .
QAlgorithms.Papers.Independent.Renew46.P43.PureSource.word
For natural numbers , a pure source with , , probability mass function on labels, and pairwise distinct matrices for unit vectors , and any word , its word matrix is indexed by functions and has entries
This definition uses the letter matrices regardless of the probabilities of their labels. When , there is one indexing function, and the resulting matrix has entry .
QAlgorithms.Papers.Independent.Renew46.P43.SideCode.disturbance
Let and let have positive classical alphabet sizes , quantum dimension with block labels , distinct pure states with and zero entries between different blocks, and joint probability masses summing to . Let be a side code of length , with positive message counts, encoders , and decoder POVMs indexed by classical word tuples and failure , with effects supported on matching block labels at every position. For , define , , and . Writing , the definition is
Here the square roots are given by matrix functional calculus, and the inner sum includes the failure outcome and every classical word tuple. The definition permits ; a side code cannot have .
QAlgorithms.Papers.Independent.Renew46.P43.SideCode.error
Let and let have positive classical alphabet sizes , quantum dimension with block labels , distinct pure states with supported within those blocks, indexed by for some , and joint probability masses summing to . Let be a length- side code, so , with positive message counts , encoders , and decoder POVMs on the quantum word space, indexed by classical word tuples and failure , whose effects have zero entries between word basis elements differing in any block label. For a joint word , put , , and . The definition is the real number
The sum ranges over every joint word, including words of zero probability; is allowed, with empty classical and message tuples.
QAlgorithms.Papers.Independent.Renew46.P43.SideCode
Let be any natural number and let consist of positive alphabet sizes for , a positive system dimension with block labels , a positive number of distinct matrices with and whenever , and a probability mass function on pairs with and . For a natural number , a value of this structure consists of a proof that ; positive message counts for all ; arbitrary encoding functions ; and, for every message tuple , matrices on indexed by outcomes that are either an extra outcome or a tuple of length- alphabet words, one for each . For each , every must be positive semidefinite and ; moreover, for every and basis words , the entry must vanish whenever there exists with . The structure imposes no error or success bound. It has no values for ; is allowed, in which case the sender and message tuples are empty and the outcome set still contains and the unique empty tuple of words.
QAlgorithms.Papers.Independent.Renew46.P43.SideCode.message
Let and let be a hybrid source with positive classical alphabet sizes , a positive quantum dimension and block labels , finitely many distinct normalized pure states supported within those blocks, and a joint probability mass function on classical tuples and pure-state labels. Let be a side code for of length : its existence requires ; it has positive message counts , encoders , and, for each message tuple , a POVM whose outcomes are all classical word tuples together with a failure outcome . Each POVM effect is positive semidefinite, the effects sum to the identity, and its entry is zero whenever some position has . For any classical word tuple , the definition returns
If , this is the unique empty message tuple; no such code exists when .
QAlgorithms.Papers.Independent.Renew46.P43.SideCode.rate
Let , let be a hybrid source with positive classical alphabet sizes, a quantum system of positive dimension with basis block labels, distinct normalized pure states supported within those blocks, and a joint probability mass function on classical tuples and pure-state labels. Let be a length- side code: it requires , has positive message counts and classical encoders for all , and has a decoder POVM for each message tuple, indexed by classical word tuples and failure, with effects supported on matching quantum block labels at every position. For any sender index , its rate is defined by
In particular, gives rate zero. The code’s positive-length requirement excludes division by zero; if , there is no sender index to supply.
QAlgorithms.Papers.Independent.Renew46.P43.SourceCode.distortion
For natural numbers and a source with positive alphabet size , positive state dimension , probability masses , and distinct pure letter states with , let be a code of positive length and positive compressed dimension . Its encoder assigns each word a positive semidefinite matrix of trace , and its decoder has a finite representation with . Set , define for length- basis words , and put . The code’s distortion is the real number
where the matrix square root is given by continuous functional calculus. Zero-probability words contribute zero, and is excluded by the code’s positive-length requirement.
QAlgorithms.Papers.Independent.Renew46.P43.SourceCode.fidelity
For natural numbers and a source with positive alphabet size , positive state dimension , probability masses , and distinct pure letter states with , let be a code of positive length and positive compressed dimension . Write for its encoded density matrix for word , and for its decoder, which has a finite representation with . For each word define and the matrix by , where are length- words over the basis indices. The code’s fidelity is the real number
Words of zero probability are included in the sum with weight zero; a code with is excluded by its required positive length.
QAlgorithms.Papers.Independent.Renew46.P43.SourceCode
For natural numbers , let be a source with , , a probability mass function on , and an injective assignment of distinct pure states on , where each for some vector of norm . A source code for of length consists of a proof that , a natural number , an assignment of a positive semidefinite complex matrix of trace to every word , and a map from complex matrices to matrices indexed by length- words over . The map must admit a finite Kraus representation: there exist a natural number and matrices from to such that and for every complex matrix . Thus this structure has no instances at .
QAlgorithms.Papers.Independent.Renew46.P43.SourceCode.rate
For natural numbers , let have positive alphabet size , positive dimension , a probability mass function, and distinct pure letter states represented by outer products of unit vectors. Let be a code for with , compressed dimension , an encoded density matrix for every length- source word, and a decoder admitting a finite Kraus representation with . Its rate is the real number
The positive-length requirement excludes division by zero; compressed dimension is allowed and gives rate zero.
QAlgorithms.Papers.Independent.Renew46.P43.SourceQuality
This defines a type with exactly four distinct alternatives, named arbitraryFidelity, quantumFidelity, quantumEntanglement, and arbitraryDistortion. Each alternative carries no additional data; this declaration assigns no mathematical condition or numerical value to any of them.
QAlgorithms.Papers.Independent.Renew46.P43.SourceRegionProperties
For any natural number and any set , this property means that is closed in the usual Euclidean topology, is convex over , and is upward closed coordinatewise: whenever and satisfy for every , then . The definition permits and does not require its elements to have nonnegative coordinates. It also includes , when the space of rate vectors has a single element and the coordinatewise comparison is vacuous.
QAlgorithms.Papers.Independent.Renew46.P43.StateChannel.capacity
For every intrinsic system of positive dimension , with block labels , and every state channel whose carrier is a nonempty measurable set of positive semidefinite, trace-one matrices satisfying when , its capacity is the real supremum
The integral defining is the matrix-valued integral, and the nonnegative integral takes values in . Here is defined to be if either argument is not positive semidefinite with trace ; otherwise it is when , and when it is
with the matrix functions defined by continuous functional calculus and the real logarithm assigned its total-function value . The conversion preserves finite nonnegative values and sends to ; it is performed before taking the real supremum.
QAlgorithms.Papers.Independent.Renew46.P43.StateChannel
For an intrinsic system , consisting of a natural-number dimension and a block-label function , a state channel consists of a nonempty measurable set of complex matrices, together with the requirement that every is positive semidefinite, has , and satisfies whenever .
QAlgorithms.Papers.Independent.Renew46.P43.TraceNonincreasing
Let and each consist of a positive natural-number dimension and a block-label function , respectively . Let be a complex-linear map between their complex matrix spaces that maps the identity to the identity and preserves the condition that entries between different blocks vanish. Assume also the positivity property included in : for every natural number , including , and every positive semidefinite matrix indexed by whose entry vanishes whenever , the matrix with entries , indexed by , is positive semidefinite. The proposition TraceNonincreasing says that every positive semidefinite matrix satisfying whenever obeys
This quantifies over matrices of arbitrary trace, including the zero matrix.
QAlgorithms.Papers.Independent.Renew46.P43.arbitrarySourceRegion
For any natural number , product data , and Boolean parameter , whose default value is false, this definition gives a set of real vectors . Write for party ’s alphabet size, for its system dimension, for its system block labels, for its letter matrices, and for the joint probability mass function in ; no validity hypothesis on the letter matrices is included. A vector belongs to the set exactly when there exists a code of length for every , with positive dimensions , trace-one positive semidefinite encodings , and a decoder having a finite Kraus representation with , such that for every positive semidefinite whenever some and satisfy , and such that the following limits hold. For each joint-letter word , define
and set
Then membership requires
All sums over range over the joint alphabet words of the indicated length, and the square root uses continuous functional calculus. The family includes a code at every positive length. The case is included, in which the rate convergence conditions over parties are vacuous.
QAlgorithms.Papers.Independent.Renew46.P43.changeSpectrum
For every natural number , every spectral resolution consisting of nonnegative weights , , summing to , and a unitary basis matrix , and every probability mass function on , this definition returns the spectral resolution with the same basis matrix and weights , the ordinary real probabilities of . Thus its associated state is . Zero probabilities are permitted. There is no explicit assumption , but neither supplied object can exist for .
QAlgorithms.Papers.Independent.Renew46.P43.classicalKLTerm
For arbitrary real numbers , with no nonnegativity or normalization assumptions, this defines an extended nonnegative real number by
Here finite nonnegative values are regarded as elements of , and the logarithm is the total real logarithm used in the code, including for negative arguments. The first branch takes precedence, so ; negative or are also included in the definition.
QAlgorithms.Papers.Independent.Renew46.P43.classicalSideRate
Let have a positive classical alphabet size , positive quantum dimension , block labels , a positive number of distinct unit-vector projectors satisfying across different block labels, and a probability mass function on its classical symbols and letter indices. For either Boolean value and any real number , the definition assigns an extended nonnegative real rate
where , regarded as an extended nonnegative real. A length- code has , , density-matrix encodings , and decoding channels ; each channel is a finite Kraus sum with . When , the encoding is independent of for each fixed . Here
The infimum of an empty set of admissible rates is . The definition places no restriction on , and all block lengths used in the limiting sequence are positive.
QAlgorithms.Papers.Independent.Renew46.P43.clonedCross
This defines data for two parties, indexed by . Each party has a system of dimension whose two basis indices both have block label , and an alphabet . The joint alphabet distribution assigns probability to each of and and probability to the other pairs. For either party and each alphabet symbol , the local letter is the matrix whose entry is if and otherwise.
QAlgorithms.Papers.Independent.Renew46.P43.clonedWheel
This definition specifies product source data for two parties, indexed by . Each party’s system has dimension and assigns block label to both basis indices; each party’s alphabet is . The joint probability mass function is obtained by choosing uniformly from this four element set and assigning the same letter to both parties: a pair has probability when and probability otherwise. For either party, letter is assigned the matrix , where
QAlgorithms.Papers.Independent.Renew46.P43.collectiveExponent
Let be a natural number, let have positive dimension and block labels , and let consist of a positive alphabet size and density matrices whose entries vanish between different block labels. Given a probability mass function on the alphabet and any real , put , where . This defines
Here ; is if , and otherwise is the nonnegative part of , divided by , with denoting real continuous functional calculus and . The entropy inequality is non-strict, is unrestricted, zero letter probabilities are allowed, and an empty feasible set has infimum .
QAlgorithms.Papers.Independent.Renew46.P43.complexOperatorNorm
For every finite type and complex matrix indexed by , this definition gives the operator norm of the continuous complex-linear map on with its Euclidean norm that sends to the vector with coordinates . Equivalently, it is . No assumption on is imposed; if is empty, the value is .
QAlgorithms.Papers.Independent.Renew46.P43.conditionalDivergence
For natural numbers , any probability mass function on , and arbitrary families of complex matrices, this defines
Here is zero if either matrix fails to be positive semidefinite with complex trace exactly one; if both are density matrices but , it is ; otherwise it is
where denotes real continuous functional calculus and the logarithm is total, with . The sum and products are in the extended nonnegative reals, in particular . No density assumption on is supplied. The existence of excludes ; is allowed, in which case every relative-bits term is zero.
QAlgorithms.Papers.Independent.Renew46.P43.conditionalExactProjector
For natural numbers , let each , for , specify nonnegative weights summing to and a unitary matrix on , and put , where is column of . Given a word and any array , this defines the matrix
where the tensor product has entries given by products of local entries. The weights specified by the do not enter this formula. The array need not be realizable, and the result is zero if no satisfies the displayed counts. When , the result is the one-dimensional identity if every entry of is zero, and zero otherwise. If , the supplied family requires ; if , the word cannot exist.
QAlgorithms.Papers.Independent.Renew46.P43.conditionalTypeState
For natural numbers , let each , for , specify nonnegative weights summing to and a unitary matrix on . Put and . Given a word , any array , and a symbol , let . This defines
No consistency requirement is imposed on , so in the second branch the matrix need not have trace . For an absent symbol, including every symbol when , the definition returns the original state regardless of . The supplied symbol and entail and .
QAlgorithms.Papers.Independent.Renew46.P43.conditionalTypes
For natural numbers and a word , this defines the finite set of all arrays obtained from a word by
The set removes duplicate arrays arising from different . When , it consists of the zero array. When , it is empty. A supplied word cannot exist when .
QAlgorithms.Papers.Independent.Renew46.P43.conditionalVarianceProjector
For natural numbers , suppose each has weights , , summing to , and a complex unitary matrix . For a word and any real , put and define by . The conditional variance projector is the matrix , indexed by functions , given by
All counts in the inequality are interpreted as real numbers. The definition permits and negative . When , its conditions reduce to . When , the unique empty function satisfies every condition, and the matrix is the identity because the product is empty. A word with requires , while fine resolutions with require .
QAlgorithms.Papers.Independent.Renew46.P43.constantProjector
For a natural number , let consist of nonnegative real weights indexed by , with , and a unitary complex matrix of size . For every natural number and real number , this definition gives the matrix indexed by words whose entries are
where counts the positions at which . Here is also the real probability assigned to by the law constructed from , and each factor comes from the matrix with entries . If , the unique empty word satisfies the condition and its empty product is , so is the one-dimensional identity matrix. If and , the sum is empty and . There is no such when , because its weights must sum to .
QAlgorithms.Papers.Independent.Renew46.P43.countTypes
For natural numbers , this defines the finite set of all functions occurring as symbol counts of a word :
Repeated occurrences of the same count function give only one element of this set. When , the set consists of the zero count function, including when ; when , there are no words and the set is empty.
QAlgorithms.Papers.Independent.Renew46.P43.countableEntropy
For any type and any function , countableEntropy is the extended nonnegative sum
No countability assumption on , nonnegativity assumption on , or requirement that its values sum to is imposed. The sum means the supremum of sums over finite subsets of ; it is for an empty index type and may be . The logarithm is total, with and for , and each summand is truncated below at zero.
QAlgorithms.Papers.Independent.Renew46.P43.cqAverage
For any measurable space , any finite type , any measure on , and any function , the defined average is the matrix-valued Bochner integral
There is no assumption that is a probability measure or that is measurable, integrable, positive semidefinite, or trace one. The integral uses the total Bochner-integral convention, giving the zero matrix when is not integrable. The finite index type may be empty.
QAlgorithms.Papers.Independent.Renew46.P43.cqInformation
For any measurable space , any finite type with decidable equality, any measure on , and any function , let be the Bochner integral, which is zero when is not integrable. The defined quantity is the extended nonnegative integral
For matrices , the integrand is zero unless both matrices are positive semidefinite with trace one; if both are density matrices, it is when , and otherwise is
where and the matrix functions use real continuous functional calculus. No probability, measurability, integrability, or density-matrix hypothesis is imposed on or ; the extended nonnegative integral remains defined without a measurability hypothesis and may be infinite. The type may be empty, in which case no matrix on it has trace one.
QAlgorithms.Papers.Independent.Renew46.P43.cqMeasuredInformation
For any types , with a measurable-space structure on and a finite enumeration and decidable equality on , let be any measure on , any function, and any matrix family. Set , using the Bochner integral, which is zero when is not integrable, and set and . The defined quantity is
where , interpreted as an extended nonnegative real. The sum is the extended nonnegative sum over all , and the integral is the extended nonnegative Lebesgue integral. No countability or nonemptiness assumption is imposed on , no probability assumption is imposed on , and no measurability, density-matrix, or POVM condition is imposed on or ; consequently and are not assumed nonnegative. The logarithms use the total real logarithm, including . If is empty, the defined quantity is zero.
QAlgorithms.Papers.Independent.Renew46.P43.divergenceTail
For every natural number and every extended nonnegative real number , this definition returns the real number
where is the real value of the finite extended number . In particular, when , the result is for finite and for ; when , it is for every .
QAlgorithms.Papers.Independent.Renew46.P43.empiricalWeight
For natural numbers , a word , and a letter , the empirical weight of is
with the count and denominator interpreted as real numbers. When , this value is , using the convention ; the argument requires .
QAlgorithms.Papers.Independent.Renew46.P43.entanglementSourceRegion
For any natural number , finite type , and source data , each party has a positive dimension and block-label function , while the source specifies a probability mass function on and complex letter matrices on the joint party register. Assume explicitly that for every party and every pair of its basis indices ; this supplied hypothesis is not otherwise used in the defining expression. No purity, positivity, normalization, or distinctness assumption is imposed on the letter matrices. The region consists of vectors admitting codes of every positive length , with positive compressed dimensions , local encoder channels , and a joint decoder channel . A channel means a map with finitely many Kraus matrices satisfying ; the decoder must output zero between basis indices that differ in any party’s block label at any position, for every positive semidefinite input. Let , where the tensor product tensors encoder images of matrix units and extends linearly. Put and define its length- product matrix by . Let be the continuous functional calculus of the real square-root function applied to , and define a matrix on two copies of the length- joint register by
The required real limits are
Here applies to each matrix block obtained by fixing the first-copy row and column indices. The functional calculus and the displayed expression are used even when is not a density matrix. Zero parties are allowed, with empty products equal to and the rate conditions then vacuous.
QAlgorithms.Papers.Independent.Renew46.P43.entropyConstant
For every natural number , the definition assigns the real number . This includes : the total real logarithm takes , so the value at , as at , is .
QAlgorithms.Papers.Independent.Renew46.P43.entropyProjector
For natural numbers , a family , , of spectral resolutions, and any real , write for the weights of , with , and for its unitary basis matrix. Set and , where is applied by continuous functional calculus, using the total logarithm with . The definition returns the complex matrix indexed by words whose entries are
An empty qualifying set gives the zero matrix. For , the unique empty word qualifies for every , and the result is the matrix with entry . For and , no word qualifies; for and , no such family of spectral resolutions exists.
QAlgorithms.Papers.Independent.Renew46.P43.eprSource
This defines data for two parties, each with a system of dimension whose two basis indices both have block label . The source label is uniform. For each label, the letter is the matrix with entries , where and has amplitude at , amplitude at , and amplitude at and .
QAlgorithms.Papers.Independent.Renew46.P43.eprSourceVector
For each , this defines a complex Euclidean vector indexed by functions . Its amplitude is when , is when , and is when . Thus, writing for the coordinate vector at the function with values , the vector is .
QAlgorithms.Papers.Independent.Renew46.P43.errorExponent
For every natural number , including , and every extended nonnegative real , this defines
In the last branch, is converted to its finite real value before taking the logarithm. Division is total: division by gives , so for every nonzero , while .
QAlgorithms.Papers.Independent.Renew46.P43.etaFunction
For every real number , this definition gives , where the real logarithm is total: , and for , . Thus , and negative arguments are included without any positivity hypothesis.
QAlgorithms.Papers.Independent.Renew46.P43.exactProjector
Let be a natural number and let specify nonnegative weights summing to and a unitary matrix on . For each , write for the matrix with entries . For any natural number and any function , this defines a matrix indexed by length- words over , with entries
The weights do not occur in this formula. No condition that is realizable is assumed: if no word has those counts, the matrix is zero. When , it is the one-dimensional identity if every , and zero otherwise. The assumptions defining cannot hold when .
QAlgorithms.Papers.Independent.Renew46.P43.exp2
For every real number , this defines , using real exponentiation; may be positive, zero, or negative.
QAlgorithms.Papers.Independent.Renew46.P43.familyEntropy
Let be a finite type with decidable equality, let each have positive dimension and a natural-number block-label function , and let have positive dimension and its own block-label function. Given complex-linear maps , an arbitrary , and any finite subset , this definition returns
where uses the total real continuous functional calculus and is indexed by tuples . Its entry is when for every , and is zero otherwise; is the row-, column- matrix unit, and is the list obtained from the universal finite set of the subtype of indices belonging to . The product follows that list’s order, with no commutativity assumption. No density or preservation hypotheses are imposed. In particular, for , this is the same entropy expression applied to the matrix , without an assumption that .
QAlgorithms.Papers.Independent.Renew46.P43.familyState
Let be any finite type with decidable equality, possibly empty. For each , let consist of a positive integer dimension and a natural-number block-label function ; let likewise have a positive dimension and a block-label function. Given complex-linear maps and an arbitrary matrix , this definition constructs a matrix indexed by tuples , with entries
Here is the matrix unit with entry in row , column , and is the list obtained by converting the universal finite set of into a list; the product follows that list’s order. Commutativity of the factors is not assumed. Neither density of nor positivity or other preservation properties of the maps are assumed. If is empty, the tuple index set has one element, the block condition is vacuous, and the resulting matrix has entry .
QAlgorithms.Papers.Independent.Renew46.P43.finiteN
Let be natural numbers, let have positive dimension and block labels , and let assign each of its letters a positive semidefinite, trace-one matrix that vanishes between unequal block labels. For any real , this definition returns the supremum in the natural numbers of the message counts for which there exists a positive-length- code with messages, words , and a positive semidefinite decoding family summing to the identity, including an outcome , such that each vanishes if any coordinate has unequal block labels and
If the set of message counts is nonempty and bounded, this is its largest element. The natural-number supremum is when that set is empty or unbounded; it does not return infinity. In particular, the value is for .
QAlgorithms.Papers.Independent.Renew46.P43.fullAlgebra
For every natural number and a proof that , this definition constructs a system of dimension whose block-label function assigns to every index in . Thus every complex matrix satisfies this system’s block-diagonality condition, since no two indices have different block labels. The case is included; cannot satisfy the required positivity hypothesis.
QAlgorithms.Papers.Independent.Renew46.P43.greedyBound
Let have positive dimension and block labels , let have positive alphabet size and density matrices with entries zero between unequal block labels, and let . For a probability mass function , write , , and
This defines
Here ; for density matrices, if , and otherwise it is the nonnegative part of , divided by , using real continuous functional calculus and . Empty infima are , an empty outer supremum is zero, and zero-probability terms contribute zero even for infinite divergence. No sign restriction on , positivity of every , or distinctness of the optimizing letters is assumed.
QAlgorithms.Papers.Independent.Renew46.P43.greedyExponent
Let have positive dimension and block labels , let be a family of density matrices with positive alphabet size and with entries zero between unequal block labels, let be any probability mass function on that alphabet, and let . Set , , and define
This declaration defines
Here , and, for density matrices, is unless ; when that inclusion holds it is the nonnegative part of , divided by . The functional calculus uses the total logarithm with . All infima, the supremum, and the minimum are in the extended nonnegative reals; empty inner feasible sets give , and zero probabilities multiply infinite divergences to zero. There are no sign restrictions on , and no distinctness requirement on .
QAlgorithms.Papers.Independent.Renew46.P43.halfRateRegion
This is the set of pairs satisfying and , with equality permitted in either coordinate.
QAlgorithms.Papers.Independent.Renew46.P43.highEntropyDivergence
For every finite type with decidable equality, every complex matrix , and every real , this defines
Matrix functions use continuous functional calculus. The quantity is defined to be if either argument is not a positive semidefinite matrix of trace . If both are density matrices, it is when , and otherwise is
where the real logarithm is total, with . No density matrix hypothesis is imposed on : if it fails that condition and the feasible set of is nonempty, the defined infimum is . An empty feasible set gives ; in particular, this happens when is empty.
QAlgorithms.Papers.Independent.Renew46.P43.highEntropyProjector
Let be a natural number and let specify nonnegative weights summing to and a unitary matrix on . For a natural number and a real number , write for the projector associated with column of , and let be the finite set of count functions realized by length- words over . This defines
where tensor products have entries given by products of the corresponding entries, with interpreted by continuous functional calculus, and real division by zero is zero. The threshold includes equality. The original weights do not enter this expression. For , the only count function is zero and its associated matrix inside is zero, so the result is the one-dimensional identity when and zero otherwise; itself cannot exist when .
QAlgorithms.Papers.Independent.Renew46.P43.hybridInformation
Let and be systems consisting of positive integer dimensions and block labels and . A matrix respects these labels when its -entry is zero whenever the corresponding labels differ. Let be complex linear and unital, preserve block-respecting matrices, and preserve products and conjugate transposes on such matrices; assume also that it is injective on those matrices and that every matrix amplification of sends positive semidefinite matrices whose entries vanish between different -blocks to positive semidefinite matrices. Let be any type, any family, and any matrix. Define and the restriction by when , and zero otherwise, where is the matrix unit. The defined quantity is
Here , viewed as an extended nonnegative real, and the square roots use the real continuous functional calculus. For any matrices , is zero unless both are positive semidefinite with trace one; for such density matrices it is if , and otherwise equals
with also interpreted by continuous functional calculus. No positivity, normalization, or measurement condition is imposed on or , and need not be countable or nonempty. Inverses are total, so ; a zero weight contributes zero even if the divergence is infinite.
QAlgorithms.Papers.Independent.Renew46.P43.identityEmbedding
For every intrinsic system , consisting of a positive integer dimension and a block label function , this defines an embedding from to itself with complex linear map . This map preserves matrices whose entries vanish between unequal block labels, sends the identity matrix to itself, and preserves positivity under every amplification: for every natural number , including zero, it leaves unchanged each positive semidefinite matrix indexed by pairs whose entries vanish whenever the labels differ. For all matrices whose entries vanish between unequal block labels, it preserves their product; for every such , it preserves its conjugate transpose. It is faithful on these matrices: if the images of such are equal, then .
QAlgorithms.Papers.Independent.Renew46.P43.identityOperation
For every intrinsic system , consisting of a positive integer dimension and a block label function , this defines an operation from to itself whose complex linear map is on all complex matrices. It preserves the condition whenever , and sends the identity matrix to itself. For every natural number , including , and every positive semidefinite matrix indexed by satisfying whenever , applying this map to each block leaves unchanged and hence positive semidefinite.
QAlgorithms.Papers.Independent.Renew46.P43.independentLaw
For every natural number , every family of natural alphabet sizes , indexed by , and every family of probability mass functions on , this definition gives the probability mass function on tuples whose mass is
The masses and product are taken in the extended nonnegative reals. The case is included: there is one empty tuple, and its mass is the empty product . If and some , the required probability mass function on that empty alphabet cannot be supplied.
QAlgorithms.Papers.Independent.Renew46.P43.individualExponent
Let be a natural number, let have positive dimension and block labels , and let be a finite channel, meaning and a family of positive semidefinite matrices of trace one satisfying whenever . For any probability mass function on the alphabet and any real , this defines
where . For density matrices , when , and otherwise equals the nonnegative part of , divided by , using the total logarithm with . The optimizing families need not have distinct letters. The entropy constraint is strict, has no sign restriction, an empty feasible family gives , and zero-probability terms contribute zero even when their divergence is infinite.
QAlgorithms.Papers.Independent.Renew46.P43.interior
For any types and , with finite and equipped with decidable equality, any family of complex matrices on , and any complex matrix on , this defines
For Hermitian , is obtained by applying the real square root to its eigenvalues, assigning zero to nonpositive eigenvalues; for non-Hermitian , . This is the possibly infinite sum of matrices, defined to be zero if the family is not summable. No finiteness or countability assumption is imposed on , and no positivity, normalization, or summability hypothesis is imposed on the matrices. Empty gives zero, and empty is allowed.
QAlgorithms.Papers.Independent.Renew46.P43.intrinsicAmplification
For any intrinsic systems with positive dimensions and their respective natural-number block-label functions, any complex-linear map , any natural number , and any complex matrix indexed by , the intrinsic amplification is the matrix indexed by defined by
The block-label functions impose no restrictions in this definition. The case is included and gives the unique matrix with empty index set.
QAlgorithms.Papers.Independent.Renew46.P43.intrinsicConditionalEntropy
For systems , each consisting of a positive integer dimension and an arbitrary natural-number block label on its coordinate indices, let and be complex-linear maps, and let be arbitrary. This definition returns , where, writing for the matrix unit with its sole nonzero entry in row , column ,
Here , with applied through the total real continuous functional calculus. No assumption requires to be a density matrix, requires the maps to preserve positivity, identity, multiplication, adjoints, or blocks, or requires their images to commute.
QAlgorithms.Papers.Independent.Renew46.P43.intrinsicMutualInformation
For any systems with positive integer dimensions and natural-number block-label functions , any complex-linear maps and , and any matrix , this defines the real number
where is the library’s total continuous functional calculus for , with for and . Writing and for matrix units in the indicated rows and columns, the matrices in this expression are
and
No hypothesis requires any of these matrices to be density matrices, requires or to preserve positivity, identity, products, or blocks, or requires their images to commute. The block labels of are unused.
QAlgorithms.Papers.Independent.Renew46.P43.intrinsicRestriction
For any systems , each consisting of a positive integer dimension and a block-label function , respectively , any complex-linear map , and any matrix , this defines a matrix by
where has entry in row , column , and zeros elsewhere. The trace here is complex-valued. The block labels of do not enter this formula. No positivity, normalization, or block condition on , and no positivity, unitality, or multiplicativity condition on , is assumed.
QAlgorithms.Papers.Independent.Renew46.P43.intrinsicSourceRate
Let have positive dimension and block labels , and let have a positive alphabet size , a probability mass function , and distinct pure density matrices with . For any Boolean parameter and any real , this defines an extended nonnegative real number as follows. For each , consider all codes with positive compressed dimension , arbitrary encoded density matrices for alphabet words of length , and a decoder with finitely many Kraus matrices satisfying . Require that whenever is positive semidefinite and some coordinate has . Put and require
If is true, additionally require a channel , meaning a map with a finite Kraus representation whose Kraus matrices satisfy the corresponding identity normalization, such that for every word ; if is false, there is no additional encoder-channel requirement. The defined value is
with the infimum and limit superior taken in , so an empty set of eligible codes has infimum . No range restriction on , and no block condition on the source letters, is assumed in this definition.
QAlgorithms.Papers.Independent.Renew46.P43.jointState
For any systems , each with a positive integer dimension and a natural-number block-label function , any complex-linear maps and , and any matrix , this defines a matrix indexed by pairs of indices from and , with entries
Here and are the respective matrix units, with the first subscript specifying the row. The multiplication order is exactly , and the trace is complex-valued. No density, positivity, normalization, commutation, or block-preservation assumptions are imposed on these inputs. The block labels of are unused.
QAlgorithms.Papers.Independent.Renew46.P43.letterOutputEntropy
For natural numbers , any probability mass function on , and any family of complex matrices , this defines the real number
The conversion gives the ordinary real probability . No Hermitian, positivity, or trace condition is imposed on ; the displayed entropy expression uses the total real continuous functional calculus, which returns zero for a non-Hermitian matrix. The dimension is allowed and gives value zero. The existence of excludes , and zero-probability letters contribute zero.
QAlgorithms.Papers.Independent.Renew46.P43.lowConditionalProjector
For natural numbers , let each , for , specify nonnegative weights summing to and a unitary matrix on , and put and . Given a word and , put , and let be the set of arrays realized by length- words over . For each such array define if , and otherwise. The definition is
Here , with interpreted by continuous functional calculus; tensor products have entries given by products, and real division by zero is zero. The threshold includes equality. When , every empirical weight is zero and the result is the one-dimensional identity if , and zero otherwise. A word cannot exist for , and if the supplied resolutions require .
QAlgorithms.Papers.Independent.Renew46.P43.lowEntropyDivergence
For any finite type with decidable equality, any complex matrix indexed by , and any real number , this defines
where for the continuous functional calculus with . The quantity is defined to be zero if either argument is not a density matrix; if both are density matrices, it is when , and otherwise equals
with matrix functions again interpreted by continuous functional calculus. There is no assumption that is a density matrix. An empty feasible set has infimum , in particular when is empty; if is not a density matrix and the feasible set is nonempty, the defined infimum is zero.
QAlgorithms.Papers.Independent.Renew46.P43.macReductionSource
Let be a two-sender channel with positive alphabet sizes , positive output dimension , block labels , and an output density matrix for every input pair, with entries zero whenever the row and column block labels differ. Let be arbitrary probability mass functions on the corresponding alphabets. Given a natural number , a family of matrices such that each for some unit vector , each when , and the map is injective, and given an arbitrary probability mass function on for each input pair , the definition constructs a hybrid source with two classical alphabets , quantum dimension , block labels , letter count , letters , and joint law
The supplied conditional laws are arbitrary; the definition itself imposes no decomposition identity relating them to . Individual probabilities may be zero.
QAlgorithms.Papers.Independent.Renew46.P43.measuredInformation
Let be arbitrary types, and let consist of a positive natural-number dimension and a block-label function . For arbitrary families of complex matrices and an arbitrary complex matrix , measuredInformation is
Finite branch values are regarded as extended nonnegative reals, and the sum is the supremum of its finite subsums, so it may be infinite and is zero if either index type is empty. The logarithm satisfies and for . Neither index type is required to be countable; no density, positivity, measurement normalization, commutativity, or block-support conditions are imposed on these matrices, and the block labels do not enter the value.
QAlgorithms.Papers.Independent.Renew46.P43.minimumChannelError
For any natural numbers , any system with positive dimension and block labels, any finite channel whose letter outputs are block respecting positive semidefinite matrices of trace , and any real , this defines
A code in this infimum must have , a positive number of messages, an arbitrary assignment of an input word to each message, and a measurement consisting of positive semidefinite matrices summing to the identity. Every measurement matrix has zero entry between output strings whose block labels differ at any position. Writing
the error is precisely
The word assignment need not be injective. There is no sign restriction on . If there is no qualifying code, the infimum is ; in particular, this is the value when , since codes require positive length.
QAlgorithms.Papers.Independent.Renew46.P43.minimumSourceRate
For natural numbers , let consist of a probability mass function on indices and distinct pure density matrices on , with and ; probabilities may be zero. For any quality choice , natural number , and real , the minimum source rate is the infimum in of over all codes satisfying the selected quality condition. Such a code requires , a compressed dimension , density matrices on for every length- source word, and a decoder channel to . Density matrices are positive semidefinite with trace ; channels are maps for finitely many matrices satisfying . To specify the quality conditions, set , ,
An encoder extension is a channel into with for every word, regardless of its probability. Set , let and , and put . The four conditions are respectively for arbitrary fidelity; for arbitrary distortion; existence of an encoder extension together with for quantum fidelity; and existence of an encoder extension with for quantum entanglement. The infimum need not be attained. If no qualifying code exists, the value is ; in particular, it is when , since no code of that length satisfies the required positivity. The parameter is unrestricted.
QAlgorithms.Papers.Independent.Renew46.P43.multipleMarginal
For any natural number , any family of systems, any complex matrix indexed by full configurations , and any subset , define a matrix indexed by configurations on . Each system supplies a positive dimension and block labels, and a full configuration satisfies . For configurations on , the defined entry is
where both sums range over all full configurations. No density-matrix or block condition on is assumed, and the block labels do not enter the formula. For , the sole entry is ; for equal to all parties, the matrix is . The case is included.
QAlgorithms.Papers.Independent.Renew46.P43.nonnegativeSumRegion
For every real number , this is the set of pairs satisfying , , and . The parameter may be zero or negative; when , the sum condition imposes no additional restriction beyond nonnegativity.
QAlgorithms.Papers.Independent.Renew46.P43.nonstationaryN
Let have positive dimension and block labels , and let , for every natural number , be a nonempty measurable set of positive semidefinite, trace-one matrices with zero entries between distinct blocks. For any natural number and any real number , the natural number is
Here such a code requires and , chooses a matrix for each message and position, and has positive semidefinite decoding matrices for the message outcomes and an additional outcome , summing to the identity. Every is zero whenever some position has , and its error is , where the tensor product has entries . This supremum is taken in the natural numbers: it is the largest element when the set is nonempty and bounded, and is when the set is empty or unbounded. In particular, .
QAlgorithms.Papers.Independent.Renew46.P43.observableJoint
Let be any finite type with decidable equality, including the empty type, and let be systems with positive finite dimensions and natural-number block labels . Let be a complex-linear map from matrices on to matrices on that preserves the identity and block-diagonal matrices, preserves multiplication and adjoints on block-diagonal matrices, and is injective there; for every finite amplification dimension, including zero, its entrywise amplification also preserves positivity on matrices whose entries vanish between different -block labels. For an arbitrary family of complex matrices on and an arbitrary complex matrix on , this definition returns the matrix indexed by with entries
Here means the result of applying the real square-root function by the continuous functional calculus used in the code. No positivity, normalization, or measurement assumptions are imposed on or ; if is empty, the resulting matrix has an empty index set.
QAlgorithms.Papers.Independent.Renew46.P43.partyMaps
For any natural number , any family of systems with positive dimensions and block labels, any natural number , any family of natural numbers , and any family of functions taking complex matrices indexed by -tuples of indices in to complex matrices, define a function on joint matrices by
Here and range over families of local words , the output indices satisfy , and denotes the matrix with entry at row , column , and elsewhere. The input is arbitrary, and the functions are not assumed linear, positive, or channels; the block labels are unused. The cases and are included, with the usual singleton sets of empty tuples and empty product . Each may be zero; if any is zero, the output indexing set is empty.
QAlgorithms.Papers.Independent.Renew46.P43.pmfEntropy
For every finite type and probability mass function on , let be the real value of the mass . This defines . Zero masses are allowed and contribute , using the total logarithm convention .
QAlgorithms.Papers.Independent.Renew46.P43.projectionEncoder
For every finite index type equipped with a finite enumeration, every natural number , and every complex matrix with rows indexed by and columns indexed by , this defines the map from complex matrices to complex matrices given, for every input matrix , by
where the quotient and scalar multiplication are over . There is no hypothesis that is an isometry or that is a density matrix, and the definition imposes no channel condition on this map. Empty and are included; division by zero is defined as zero, and for the output is the unique empty matrix.
QAlgorithms.Papers.Independent.Renew46.P43.purification
For any finite index type equipped with decidable equality and any complex matrix indexed by , let denote the result of applying the real square-root function to through continuous functional calculus. The definition returns the matrix indexed by whose entries are
Equivalently, for the vector . There is no assumption that is Hermitian, positive semidefinite, or trace one, and no normalization is performed; may be empty, in which case the returned matrix has no entries.
QAlgorithms.Papers.Independent.Renew46.P43.quantumSourceRegion
For any natural number , finite type , and source data , each party has a positive dimension and block labels , and specifies a probability mass function on and arbitrary complex letter matrices on the joint party register; no validity conditions on the letter matrices are assumed. For a Boolean parameter , defaulting to false, the defined region consists of exactly those vectors for which there is a code of length for every natural number . Such a code has positive compressed dimensions , local encoder channels , and a joint decoder channel ; every channel has a finite Kraus representation with . For every positive semidefinite input , the decoder output has zero entry if for some . Set , with the tensor product defined on matrix units by tensoring their encoder images and extending linearly, and let and . The required limits, all as , are
Here . The limits are ordinary real limits. The definition permits , interprets empty products as , and uses codes only at positive lengths; it imposes no additional coordinatewise condition on .
QAlgorithms.Papers.Independent.Renew46.P43.reliability
For any natural number , any system with positive dimension and block labels, any finite channel with block respecting density matrix outputs, and any real , this defines the extended nonnegative quantity
This is a limit inferior along the product of the filter on natural numbers and the filter approaching through strictly positive real . Here is the infimum of over length codes having a positive number of messages, arbitrary input words , and a positive semidefinite measurement summing to the identity and having zero entries whenever the row and column output strings differ in block label at some position; its error is
An empty code infimum is . Finally, , , and for finite positive . Thus only positive block lengths occur in this definition, and no restriction on is assumed.
QAlgorithms.Papers.Independent.Renew46.P43.sourceFe
For any finite index type equipped with decidable equality, any complex matrix indexed by , and any function from such matrices to such matrices, set using continuous functional calculus and define . For each , form the matrix with entries , and define . The returned real number is
Thus is applied separately to each block indexed by the first copy of . Neither a channel assumption nor linearity is required of , and no density-matrix assumption is required of ; the definition asserts no probability bounds. If is empty, the value is zero.
QAlgorithms.Papers.Independent.Renew46.P43.sourceRate
For natural numbers , let have distinct pure density matrices on , with and , and a probability mass function on their indices, allowing zero probabilities. For any of the four quality choices and any real , the source rate is
For completeness, a length- code here has , a compressed dimension , an assigned density matrix on for every word , and a decoder channel into . Density matrices are positive semidefinite with trace , and channels admit finite Kraus representations with . Write and . Its fidelity is , and its distortion is . An encoder extension is a channel satisfying for every word, including zero-probability words. With , , and , define . Qualification means for arbitrary fidelity, for arbitrary distortion, existence of an encoder extension and for quantum fidelity, or existence of an encoder extension with for quantum entanglement. An empty infimum is . The sequence uses all positive lengths ; the definition takes a limit superior and does not assert convergence or attainment, and is held fixed without a range restriction.
QAlgorithms.Papers.Independent.Renew46.P43.spectralMu
For any natural number and spectral data consisting of nonnegative real weights summing to and a complex unitary matrix, set and . This defines
The real probabilities of 's associated probability mass function equal , so consists precisely of the indices with . Thus the minimum excludes zero values, while the definition returns when every weight is or . No such exists for .
QAlgorithms.Papers.Independent.Renew46.P43.spectralN
For any natural number and spectral data consisting of nonnegative real weights summing to and a complex unitary matrix, this defines the natural number
Here the real probabilities of 's associated probability mass function equal . Equivalently, this counts the indices with ; weights equal to or are excluded, and the count is if there are no qualifying indices. No such exists for .
QAlgorithms.Papers.Independent.Renew46.P43.spectralTypeState
Let be a natural number and let specify nonnegative weights summing to and a unitary matrix on . For any natural number and any function , this defines
where is column of , and division is real division. The weights do not enter the formula. The function is arbitrary, so its entries need not sum to and the resulting matrix is not required to have trace . When , division by zero has value zero, and the defined matrix is zero for every . Such an cannot exist for .
QAlgorithms.Papers.Independent.Renew46.P43.sphereBound
For any natural number , any system consisting of a positive dimension and block labels , any finite channel with input letters and output matrices that are positive semidefinite, have trace , and satisfy whenever , and any real , this defines
where ranges over probability distributions on the letters, and ranges over finite channels with the same alphabet and system, so each is likewise a block respecting density matrix. Here
with matrix functions interpreted by continuous functional calculus. For density matrices , if ; otherwise it is
The logarithms use their total real definitions, including . The infimum of an empty feasible set is , and products with zero probability use extended nonnegative arithmetic, including . No restriction on is imposed.
QAlgorithms.Papers.Independent.Renew46.P43.sphereExponent
Let be a natural number, let have positive dimension and block labels , and let have positive alphabet size and density matrices whose entries vanish whenever their row and column block labels differ. For any real and any probability mass function on the alphabet, put . This defines
where . For density matrices , is if , and otherwise equals the nonnegative part of , divided by , using real continuous functional calculus and the total logarithm with . The information constraint is non-strict, is unrestricted, the optimizing letters need not be distinct, an empty feasible family gives , and zero-probability terms contribute zero even when their divergence is infinite.
QAlgorithms.Papers.Independent.Renew46.P43.sqrtInstrumentBranch
For arbitrary types , with finite and with decidable equality, any family , any matrix , and any , this defines the matrix
Here is the real continuous functional calculus: for a Hermitian matrix it applies the real square-root function to its eigenvalues, with negative eigenvalues mapped to zero; for a non-Hermitian matrix this functional calculus returns zero. No positivity, normalization, or completeness condition is imposed on , and need not be a density matrix. The finite type may be empty; need not be finite, although specifying requires an element of .
QAlgorithms.Papers.Independent.Renew46.P43.totalDisturbance
For any types and , with finite and equipped with decidable equality, any family of complex matrices on , any complex matrix on , and any distinguished label , this defines the real number
where . For Hermitian , applies the real square root to its eigenvalues, assigning zero to nonpositive eigenvalues; for non-Hermitian , . The sum is defined to be zero if its real-valued summands are not summable. No countability assumption on , or positivity or normalization assumption on or , is required. The label requires to have an element; may be empty.
QAlgorithms.Papers.Independent.Renew46.P43.universalProjector
For every pair of natural numbers and every real , this defines the matrix
on the complex Euclidean space indexed by words in , where is at and elsewhere and is orthogonal projection. The subspace is the complex span of the ranges of all matrices
where , , is a unitary matrix, counts occurrences of , and . Here , , by continuous functional calculus. The word counts must agree exactly with ; an empty indexing set gives . Both and are included: when , no probability weights exist and the projection is zero; when , the word space is one dimensional and the projection is the identity if at least one qualifying exists, and zero otherwise.
QAlgorithms.Papers.Independent.Renew46.P43.universalRange
For every pair of natural numbers , including , and every real , this defines a complex subspace of the Euclidean space with coordinates indexed by words : it is the complex linear span of all vectors , where is any vector in that space, are nonnegative reals summing to , is a unitary matrix, and
using continuous functional calculus. The matrix applied to is explicitly
where counts the positions of equal to . These are exact count equalities: the variance tolerance in the underlying definition is , so a choice of with incompatible counts contributes the zero matrix. For , the unique empty word satisfies all count conditions and the empty products are , so each qualifying contributes the identity on the one dimensional empty word space. For , no weights can sum to , and the defined span is the zero subspace, including when .
QAlgorithms.Papers.Independent.Renew46.P43.varianceConstant
This defines the real constant
There are no parameters or hypotheses.
QAlgorithms.Papers.Independent.Renew46.P43.varianceProjector
For any natural numbers , any real , and spectral data consisting of nonnegative real weights summing to and a complex unitary matrix , let for a word . This defines the matrix indexed by words whose entries are
The probabilities obtained from 's associated probability mass function are exactly the weights . No positivity assumption is imposed on ; if no word satisfies the displayed inequalities, the matrix is zero. When , the unique empty word satisfies all the inequalities, and the result is the matrix with entry , using the empty-product convention. No spectral data exist when .
QAlgorithms.Papers.Independent.Renew46.P43.varianceSet
For every finite type with decidable equality, every probability mass function on , every natural number , and every real number , let be the real value of and let . This defines the finite set of all words satisfying for every . There is no positivity assumption on , so negative values are included and can give an empty set. Symbols with or must have exactly occurrences. When , the set contains the unique empty word for every .
QAlgorithms.Papers.Independent.Renew46.P43.varianceTail
For every natural number , every spectral resolution consisting of nonnegative real weights with and a unitary complex matrix, and every real , put , let be the number of indices with , and let be the minimum of those positive , taking when there are none. The definition assigns the real value . There is no restriction on the sign of ; if , the value is . No such exists when , because its weights must sum to .
QAlgorithms.Papers.Independent.Renew46.P43.viewedEntropy
For any systems with positive integer dimensions and natural-number block-label functions , any complex-linear map , and any matrix , this defines the real number
Here is the matrix unit in row , column , and means the library’s total continuous functional calculus applied to , using its total real logarithm convention: for , and . No hypothesis requires or to be a density matrix, or requires to preserve positivity, identity, products, or blocks; the expression uses the total functional calculus even for such inputs. The block labels of are unused.
QAlgorithms.Papers.Independent.Renew46.P43.wheelQuantumOuter
This defines the set of all functions satisfying , , and , with equality permitted in every inequality.
QAlgorithms.Papers.Independent.Renew46.P43.wheelVector
For each , this definition gives a vector in , with coordinates ordered by , as follows:
QAlgorithms.Papers.Independent.Renew46.P43.wordConditionalEntropy
For natural numbers , let each letter have a fine resolution consisting of real weights , , with , and a complex unitary matrix of size . Write . For a word , its word conditional entropy is
where is evaluated by continuous functional calculus. If , every empirical weight is by division by zero, so the result is . If , a word exists only for ; if , the fine-resolution assumptions exclude .
QAlgorithms.Papers.Independent.Renew46.P43.wordTensor
For every natural number , every family of types , and every family of complex matrices indexed by , this defines a complex matrix indexed by tuples through . No finiteness, positivity, or normalization assumptions are imposed on these matrices or index types. When , the tuple type has one element and the empty product gives its sole matrix entry the value .
QAlgorithms.Papers.Independent.Renew46.P43.xIndices
For every natural number , this defines the finite set of all pairs , where and is Boolean, for which ; equivalently, it is . When , this set is empty.
QAlgorithms.Papers.Independent.Renew46.P43.yIndices
For every natural number , this defines the finite set of all pairs , where and is Boolean, for which ; equivalently, it is . When , this set is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.