Full noisy-entanglement-assisted capacity with the unassisted baseline
OpenQAlgorithms.Papers.Independent.Support50.P39.fullCapacityLet be a positive semidefinite density operator of trace one on two nonzero finite dimensional complex registers and , whose dimensions may differ. Alice and Bob receive arbitrarily many independent copies of this one fixed state for free. Alice may send quantum systems to Bob through a noiseless channel; there is no free classical communication or feedback. Arbitrary local CPTP encodings, ancillas, disposal, and joint decoding are allowed. Entropies use logarithms to base two.
Write for the operational supremum of classical bits per transmitted qubit: first choose integers and ; a block of channel uses sends a system of dimension and consumes copies. For each error tolerance and rate slack, all sufficiently large positive admit encoders for all -bit messages and one common decoder whose success is at least for every message. The normalized rate is , with vanishing error and arbitrarily small rate slack.
For every positive integer and every CPTP map with arbitrary positive finite output dimension, put . Write , , and . Quotients below range only over outputs with .
Let be the set of all these positive-entropy mutual-information quotients. Then
The set is nonempty and lies in , and the operational rate set is nonempty and bounded above. Every nonnegative rate strictly below the displayed value is achievable with some fixed finite chosen before the error and rate-slack limits. Conversely, for any fixed , every family of worst-message block codes with errors tending to zero has normalized rate eventually at most for each , even when its rates do not converge.
This is an operational capacity identity with finite near-optimal protocols; no maximizing block length or output dimension is required.
Formalization Note This is an explicit source correction. The baseline and exclusion of zero denominators repair Eqs. (3),(4) using the unassisted strategy and the compression argument in Eqs. (13),(15).
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P39
namespace QAlgorithms.Papers.Independent.Support50.P39
noncomputable section
open QAlgorithms
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- arXiv:quant-ph/0106080v3, PDF pp.1--3,6--8, Eqs. (3),(4),(6),(15).
Full operational noisy-entanglement-assisted capacity, with achievability below
the supremum and a converse for every reliable fixed-(d,n) block family.
CORRECTION: the printed Eq. (3) omits the unassisted baseline 1, and Eq. (4)
is undefined at S(A)=0. We optimize only positive-entropy quotients and take
max with 1. Product resources have ratio 0 and operational capacity 1.
No global optimizer in n or output dimension is asserted or assumed. -/
theorem fullCapacity {A B : Type*} [Fintype A] [Fintype B]
[DecidableEq A] [DecidableEq B] [Nonempty A] [Nonempty B]
(rho : Matrix (A × B) (A × B) ℂ) (hrho : IsDensityMatrix rho) :
(mutualRatios rho).Nonempty ∧ BddAbove (mutualRatios rho) ∧
(∀ r ∈ mutualRatios rho, 0 ≤ r ∧ r ≤ 2) ∧
(operationalRates rho).Nonempty ∧ BddAbove (operationalRates rho) ∧
denseCodingCapacity rho = max 1 (sSup (mutualRatios rho)) ∧
1 ≤ denseCodingCapacity rho ∧ denseCodingCapacity rho ≤ 2 ∧
(∀ R : ℝ, 0 ≤ R → R < max 1 (sSup (mutualRatios rho)) →
∃ d n : ℕ, 2 ≤ d ∧ 0 < n ∧ FixedRate rho d n R) ∧
(∀ d n : ℕ, 2 ≤ d → 0 < n →
∀ (m : ℕ → ℕ) (epsilon : ℕ → ℝ), ReliableFamily rho d n m epsilon →
∀ delta : ℝ, 0 < delta → ∃ K : ℕ, ∀ k : ℕ, K ≤ k → 0 < k →
(m k : ℝ) / ((k : ℝ)*Real.logb 2 d) ≤
max 1 (sSup (mutualRatios rho)) + delta) := by sorry
end
end QAlgorithms.Papers.Independent.Support50.P39
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be finite, nonempty types with decidable equality, and let be a complex matrix on that is positive semidefinite and has trace . For any matrix , write , where is applied by continuous functional calculus; write and for its partial traces over Bob and Alice, respectively. A channel from an index type to an index type means a map on matrices admitting a finite representation , with . For , let be the matrix on whose entries are ; applying a channel on Alice means applying it to each Alice matrix block with Bob's row and column fixed. Let be the set of all numbers
where and the output dimension are positive natural numbers, is a channel in the preceding matrix sense, and . To define the operational quantities, a block code with parameters and error consists of a channel for each -bit string , and positive semidefinite matrices on satisfying , such that
Say that is a fixed rate for if and, for every and every , there is such that every with admits an and such a block code satisfying . Let consist of those that are fixed rates for some and , and put , with the supremum taken in . The declaration asserts that is nonempty and bounded above, every satisfies , is nonempty and bounded above, and
Moreover, every real with is a fixed rate for some . Finally, for every , every pair of functions and such that, for each positive , and a block code with parameters and error exists, and such that , every admits for which
Message length is allowed; the code conditions on these functions impose no requirement at , and the positive-entropy condition excludes preprocessings with zero Alice entropy.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.