Theorem 1: regularized cq capacity
OpenQAlgorithms.Papers.Independent.Support50.P02.cq_regularizedLet be a completely positive, trace-preserving channel between finite, positive-dimensional complex quantum registers. Alice and Bob control separate inputs. Codes use independent sender preparations, local encoders, one joint memoryless channel and one joint decoder, with external references untouched and no free shared resources. Fidelity is squared Uhlmann fidelity, trace distance is the full trace norm, and entropies are in bits. Write and for the closed operational classical–quantum and quantum–quantum capacity regions, using joint output fidelity and nonnegative rates.
For a pure ensemble and an independent pure state , let . Write for von Neumann entropy in bits, , and .
Let be the union, over these inputs, of the rectangles , . The ensemble alphabet may be restricted to , with dimensions taken for . Then
This gives a regularized characterization rather than a finite computation or general single-letter formula.
Formalization Note Non-strict inequalities correct the printed strict inequalities before closure, so zero-capacity faces are retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P02
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Support50.P02
open QAlgorithms.Papers.Independent.Information100.P67
(squaredFidelity receiverChannel complementaryChannel IsDegradable)
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E R S I J : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype E] [DecidableEq E]
variable [Fintype R] [DecidableEq R] [Fintype S] [DecidableEq S]
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- Theorem 1, PDF pp.7–8, converse p.13. Boundary correction: the printed
strict rectangle inequalities are replaced by non-strict ones before closure,
retaining zero-capacity faces. The alphabet bound is included in the characterization. -/
theorem cq_regularized [Nonempty A] [Nonempty B] [Nonempty C]
(N : Superop (A × B) C) (hN : IsChannel N) :
cqMacCapacity N = closure (regularized (fun n => cqOne (macPower N n)
(some (min (Fintype.card (Fin n → A)) (Fintype.card (Fin n → C)) ^ 2 + 1)))) := by sorry
end QAlgorithms.Papers.Independent.Support50.P02
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite types with decidable equality, and let be a channel from matrices on to matrices on , meaning that for a finite family satisfying . Write , with input coordinates grouped as , write , and set , where is applied by continuous functional calculus. Then the default, generation, classical–quantum capacity equals the closure of all nonnegative for which there exist a positive integer , a finite ensemble of unit vectors on , with , , and
a positive integer , and a unit vector , such that, for
with the input reordered to place the reference first,
Subscripts denote partial traces onto the indicated output system, here . Zero ensemble weights are allowed; the weight-sum condition excludes an empty ensemble. The capacity on the left is itself the closure of nonnegative rates for which, for every , all sufficiently large positive blocklengths admit positive message and entanglement dimensions , with , , unit Alice inputs on , a unit Bob input on , and a decoding channel , whose average squared fidelity with is at least , after applying and deleting entries between distinct decoded message labels. Here has entries between and , and squared fidelity is . Thus the right-hand side uses an existential positive blocklength before taking closure, whereas the operational condition uses every sufficiently large blocklength.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.