Unnumbered main result: Hadamard CQE single-letterization
OpenQAlgorithms.Papers.Independent.Gap20.P04.hadamardCQELet be a CPTP channel on nonzero finite-dimensional registers, with receiver and environment obtained by tracing the same Stinespring isometry. Optimize over all finite classical labels , probability distributions, and normalized pure conditional states on a finite reference and input . For the resulting state, write , , , and , with entropy in bits. Rates are nonnegative, and denotes consumed ebits. The capacity regions are the closures of positive-blocklength scaled unions in Section III; their one-use unions have no added closure.
If the complementary channel is entanglement-breaking, then
Here a single common ensemble must satisfy all three constraints , , and . This identifies the full positive-consumption capacity region by one channel use.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P04
open QAlgorithms
open QAlgorithms.Papers.Independent.Claimed50.P24
(Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
dephasingDilation dephasingGamma cloningDilation)
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel dilationPower)
open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)
open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)
open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)
open scoped BigOperators Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I B E J D F : Type}
variable [Fintype I] [Fintype B] [Fintype E]
variable [Fintype J] [Fintype D] [Fintype F]
variable [DecidableEq I] [DecidableEq B] [DecidableEq E]
variable [DecidableEq J] [DecidableEq D] [DecidableEq F]
variable [Nonempty I] [Nonempty B] [Nonempty E]
variable [Nonempty J] [Nonempty D] [Nonempty F]
/-- PDF pp.1,9,11,16: Hadamard CQE single-letterization, consumption convention. -/
theorem hadamardCQE (U : Dilation I B E) (hU : PhysicalDilation U) (hH : Hadamard U) :
capacityCQE U = oneCQE U := by sorry
end QAlgorithms.Papers.Independent.Gap20.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, and let be a complex matrix with rows indexed by and columns indexed by . Assume , together with the explicit nonemptiness conditions on these three types. Define and , where partial traces sum over the indicated coordinate. Assume also that , after identifying its input and output types with finite index sets, has the following property: for every norm-one vector on a reference copy of and , the matrix is a finite convex combination , where , , and every is positive semidefinite with trace one. For any such dilation , define as follows: a triple belongs to precisely when all its coordinates are nonnegative and there exist positive integers , probabilities with , and norm-one vectors . Set , , and
where , with the matrix function evaluated by continuous functional calculus and . Writing , , and , the required inequalities are , , and . The theorem asserts
The closure is in the usual topology, zero probabilities are permitted in the ensembles, and the union uses only positive block lengths.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.