§7.5: alphabet cardinality sufficiency
OpenQAlgorithms.Papers.Independent.Support50.P02.alphabet_sufficientLet 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 .
Put . Every such ensemble can be replaced by a pure ensemble on at most letters, keeping Bob's pure pair fixed and preserving both and . If , the average Alice input can also be preserved; otherwise the average Charlie output can be preserved. Consequently,
This makes the alphabet optimization finite-dimensional while retaining the same one-use region.
Formalization Note The replacement may use new pure states. The corrected connected domain is the image of all pure inputs, rather than a fixed finite family.
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]
/-- Alphabet sufficiency, §7.5, PDF p.36, also Theorem 1 p.8.
Corrected domain: replacement points may be NEW pure states from the continuous
image of ALL pure inputs. The printed finite-family simplex argument does not
justify same-support sparsification. The smaller-input branch preserves average
INPUT; the smaller-output branch preserves average output. Bob's pure pair stays fixed. -/
theorem alphabet_sufficient [Nonempty A] [Nonempty B] [Nonempty C]
(N : Superop (A × B) C) (hN : IsChannel N) :
cqOne N none = cqOne N (some (min (Fintype.card A) (Fintype.card C) ^ 2 + 1)) ∧
(∀ D : CQMacData A B, ∃ P : PureEnsemble A,
P.count ≤ min (Fintype.card A) (Fintype.card C) ^ 2 + 1 ∧
let Dnew : CQMacData A B := { D with ensemble := P }
Dnew.classical N = D.classical N ∧
Dnew.conditionalCoherent N = D.conditionalCoherent N ∧
(if Fintype.card A ≤ Fintype.card C then pureEnsembleAverage P = pureEnsembleAverage D.ensemble
else traceLeft (Dnew.averageOutput N) = traceLeft (D.averageOutput N))) := by sorry
end QAlgorithms.Papers.Independent.Support50.P02
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For arbitrary nonempty finite types , each with decidable equality, and every map on complex matrices from to of the form for finitely many matrices satisfying , put . Consider data consisting of a finite ensemble of unit vectors on , with nonnegative real weights summing to one, a positive integer , and a unit vector on , where . Define
with the input factors reordered to put the reference first, and with for the continuous functional calculus of . First, the set of nonnegative pairs for which some such data satisfy and is unchanged if the ensemble is required to have at most entries. Second, for every particular , there exists a finite ensemble of unit vectors on , with , , and at most entries, such that replacing only the ensemble of by , retaining and , gives data satisfying
If , including equality, the replacement also satisfies ; if , it instead satisfies . Ensemble size counts all listed entries, including entries of weight zero; an empty ensemble cannot have weights summing to one.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.