§6: alternative cq pentagons and second corner
OpenQAlgorithms.Papers.Independent.Support50.P02.cq_pentagonsLet 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 nonnegative pairs satisfying
Then
On each such state, the sum bound also equals . Whenever , the second corner belongs to . This records both the alternative characterization and its operational nonnegative second corner.
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]
/-- Alternative cq pentagons and their second corner, PDF pp.30–31.
All terms use one ensemble and independent Bob state; the corner is operational
only when its quantum coordinate is nonnegative. -/
theorem cq_pentagons [Nonempty A] [Nonempty B] [Nonempty C]
(N : Superop (A × B) C) (hN : IsChannel N) :
cqMacCapacity N = closure (regularized (fun n => cqPentagons (macPower N n))) ∧
(∀ D : CQMacData A B, D.classical N + D.conditionalCoherent N =
D.sideClassical N + D.coherent N) ∧
(∀ D : CQMacData A B, 0 ≤ D.coherent N →
(D.sideClassical N, D.coherent N) ∈ cqMacCapacity 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
Let be nonempty finite types with decidable equality, and let be a channel, meaning a map with a finite Kraus representation and . For any positive blocklength , any finite ensemble of unit vectors on , with nonnegative weights summing to one, any positive integer , and any unit vector on , define
with references placed first, and define
Here , the subscript means tracing out the reference and retaining , and for applied by continuous functional calculus. The declaration asserts all three of the following: the default, generation, classical–quantum capacity is the closure of the nonnegative pairs for which some positive and some such data satisfy
for every such choice of data at blocklength , ; and, for every such choice at , implies belongs to that capacity. There is no ensemble-size bound in these assertions. The capacity itself is the closure of nonnegative rates for which, for every , every sufficiently large positive blocklength admits positive integers with , , unit Alice source vectors indexed by , a unit Bob source on , and a decoding channel , with average squared fidelity at least against , after transmission and removal of entries between different decoded message labels. The matrix has entries between and ; squared fidelity means .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.