Abstract and Sections 2–7: equivalent quantum capacity definitions
OpenQAlgorithms.Papers.Independent.Gap20.P07.capacityVariationsLet be a CPTP channel between nonzero complex Hilbert spaces, with independent memoryless uses, arbitrary CPTP coding, and no initial shared entanglement. Let be the supremum of positive rates in Definition 2.1, measured in qubits per use, using the full completely bounded trace norm. Then
The terms denote, respectively, minimum pure-state fidelity, worst-case entanglement fidelity, Haar average fidelity, maximally mixed source fidelity, ordinary induced trace-norm error, sporadic block lengths, some positive exponential error exponent, QAEP entropy sources, exponentially bounded source dimensions with a source-dependent growth constant, entanglement generation from arbitrary normalized inputs, isometric encoding, and unrestricted finite forward messages per block. Each is an extended nonnegative supremum. Also for every operational measurement-and-preparation channel ; every positive admits all-block codes with error at most for some ; and
Here uses eventual full-cb error at most . These are equalities of capacities, without asserting endpoint achievability. Zero-error and unconstrained entropy capacities are exceptions. This result identifies the qualified equivalence asserted in the abstract.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
noncomputable section
open Filter MeasureTheory
open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap20.P07
open QAlgorithms
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)
open QAlgorithms.Papers.Independent.Frontier30.P14
(Operation isometryCoeff conjugateKernel)
open QAlgorithms.Papers.Independent.Claimed50.P35
(stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
transpose transposeBound TraceLinear tracePair MeasurePrepare)
open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)
/-- PDF p.1 and Sections 2--7: the qualified abstract claim, excluding the
rejected exact-zero-error and unconstrained entropy variants. The capacities,
not endpoint sets of achievable rates, coincide. -/
theorem capacityVariations {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) :
(∀ c : FidelityCriterion, fidelityCapacity T c = qubitReferenceCapacity T) ∧
sporadicCapacity T = qubitReferenceCapacity T ∧
ordinaryCapacity T = qubitReferenceCapacity T ∧
exponentialCapacity T = qubitReferenceCapacity T ∧
sourceEntropyCapacity T QuantumSource.QAEP = qubitReferenceCapacity T ∧
sourceEntropyCapacity T QuantumSource.ExponentialDimension = qubitReferenceCapacity T ∧
variableSourceGenerationCapacity T = qubitReferenceCapacity T ∧
isometricCapacity T = qubitReferenceCapacity T ∧
instrumentForwardCapacity T (fun _ _ => True) = qubitReferenceCapacity T ∧
(∀ {K L : Type} [Nonempty K] [Nonempty L] (S : Operation K L),
IsTraceClassChannel S → MeasurePrepare S →
qubitReferenceCapacity (traceClassTensorMap T S) = qubitReferenceCapacity T) ∧
(∀ R : ℝ, 0 < R → ENNReal.ofReal R < qubitReferenceCapacity T → ExponentialReliable T R) ∧
Tendsto (finiteErrorCapacity T) (𝓝[>] (0 : ℝ)) (𝓝 (qubitReferenceCapacity T)) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be arbitrary nonempty types and let map complex coefficient matrices on to those on . The following definitions specify the hypotheses and capacities in the assertion. Write , with coordinate vectors ; a coefficient matrix is trace class when it has an expansion , with and , and write for the infimum of these sums in , with value if there is no expansion. A density coefficient matrix is trace class, has real nonnegative quadratic forms for every finite and every , and has summable real diagonal entries whose sum is . Call a map a channel when it preserves trace class, is additive and complex homogeneous on trace-class inputs, and, for every , its extension
takes every density coefficient matrix on to a density coefficient matrix; assume is such a channel. Define \|\Phi\|_*=\sup_{q\ge0}\sup_{\text{\(X trace class},,\nu(X)\le1}\nu((\Phi\otimes\mathrm{id}_q)X)). Tensor powers act independently on coordinates by successive application to coefficient blocks; the zeroth power is the identity on the one-dimensional register indexed by the empty function. For positive integers , let be the infimum of over channels of the required input and output types. Let be the supremum of positive real such that, for every positive-integer sequence with and , one has ; all capacity suprema here are in , with empty supremum . A finite block code of length and dimension consists of channels and , understood as maps on coefficient matrices, with effective map and error . For finite matrices put , , and
where is the matrix unit. The four fidelity values are respectively the infimum of over unit vectors ; the infimum of over positive semidefinite trace-one ; the Haar average of , with and normalized Haar-distributed ; and , where . For any one of these four criteria , let be the supremum of positive admitting codes of length , positive dimension , , and fidelity value tending to . Let instead use the existence of positive-integer sequences , with , , and . Let use codes of length and the same dimension-rate condition as , with . Say is exponentially reliable when there exist and codes at every length , of dimension , whose errors are eventually at most ; is the supremum of positive such . A source is a sequence of positive dimensions and density matrices ; its entropy rate is , interpreted in , where is defined by functional calculus with . It is reliable if codes of length and dimension have . For a property , let be the supremum of positive for which a reliable source satisfying has . The source property QAEP means there is a finite with such that, for every , the mass tends to , where is the spectral indicator of ; exponential dimension means . Let use the dimension-rate condition of , arbitrary unit vectors , and . Let use the fourth fidelity criterion, additionally requiring every encoder to have an isometry whose coefficient matrix satisfies for every trace-class . Let allow at each length an arbitrary positive finite number of encoder branches , each trace-class preserving and complex linear on trace-class inputs and satisfying for every finite-ancilla density , for some and density ; require to be a channel, give each branch its own channel decoder , and require the sum of the fourth fidelity values of to tend to , with the same dimension-rate condition. Finally, replaces the vanishing-error requirement in by eventual . With this notation the theorem asserts
It also asserts that for every pair of nonempty types and every channel having the following measure-and-prepare representation: there exist a measurable outcome space , bounded positive operator effects with , finite measures satisfying on measurable , probability laws for density inputs satisfying , and output densities with measurable coefficients, such that every coefficient of is the integrable average . Here the tensor map is literally . No countability assumptions are imposed on the nonempty index types; code dimensions may equal , capacities may be infinite, and the final limit uses strictly positive .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.