Sections 2.3–2.5 and 4.2–4.4: fidelity capacity equivalences
OpenQAlgorithms.Papers.Independent.Gap20.P07.fidelityCapacities_eqLet be a memoryless CPTP channel between nonzero complex Hilbert spaces. For each positive block length choose one CPTP code on a finite, nonzero logical space of dimension , and use as its rate. Define capacities by requiring, respectively, minimum normalized pure-state survival fidelity, the infimum of entanglement fidelity over density states, normalized Haar average fidelity, or entanglement fidelity of the maximally mixed state, to tend to one. All overlaps are squared. Then
Each capacity is the extended nonnegative supremum of positive rates. The mean criteria require selecting suitable logical subspaces; no dimension-independent norm bound for the original channel is asserted.
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 pp.4--5,13--18: all four fidelity capacity definitions coincide.
Average/channel fidelity require expurgation, not an original-channel norm bound. -/
theorem fidelityCapacities_eq {I J : Type} [Nonempty I] [Nonempty J]
(T : Operation I J) (hT : IsTraceClassChannel T) :
∀ c : FidelityCriterion, fidelityCapacity T c = 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 a channel in the following sense: trace-class coefficient matrices are those admitting with and ; preserves this class, is additive and complex homogeneous on it, and preserves density coefficient matrices after every finite ancillary identity extension. Here a density coefficient matrix has real nonnegative finite-coordinate quadratic forms and a summable real diagonal of sum , and an ancillary extension applies the map separately to ancillary coefficient blocks. Write for the infimum of the expansion sums, , and for the supremum of positive real such that, for every positive-integer sequence with and , the infimum over channel encoders and decoders of tends to zero. For each of four criteria , define as the supremum of positive real for which there are positive dimensions and channel encoders and decoders , acting on matrices, such that and the chosen fidelity of tends to . With , the criteria are: ; , where and is a matrix unit; the normalized Haar average of for ; and , where . Tensor powers apply maps independently to coordinate blocks. The assertion is . All capacity suprema use , with empty supremum ; dimensions and infinite capacities are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.