Corollary 3 / Eq.(23): classical capacity of the full Unruh channel
OpenQAlgorithms.Papers.Independent.Intakenext100.P49.unruh_classicalCapacityLet , , and . Let be the full countable flagged qubit-input Unruh channel. Its classical capacity, independently defined by regularized Holevo optimization over arbitrary finite ensembles and entangled positive-block-length inputs, is
Both infinite series converge separately, and the output entropies and optimization suprema satisfy the regularity assertions of Theorem 2. The zero summand uses . At only the identity sector has positive weight and the expression is bit. This gives the capacity of the full channel, with no finite cutoff or value assigned at .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P49
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P49
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
open QAlgorithms.Papers.Independent.Support50.P01
(unruhSectorDilation unruhWeight unruhBlockDilation unruhBlockWeight
unruhReceiver unruhReceiverEntropy)
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel IsDegradable)
open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.QuditFidelity (depolarizingMap)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.5, Corollary 3, Eq.(23): separately convergent signed series for
the independently regularized capacity; z=1 is excluded. -/
theorem unruh_classicalCapacity (z : ℝ) (_hz0 : 0 ≤ z) (_hz1 : z < 1) :
UnruhRegular z ∧ Summable (unruhFirstTerm z) ∧ Summable (unruhSecondTerm z) ∧
unruhClassicalCapacity z =
1 - (∑' k : ℕ, unruhFirstTerm z k) + (∑' k : ℕ, unruhSecondTerm z k) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P49
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with , including , define , and define by , where , , , , and , with zero-based indices. For , write , grouping receiver and environment coordinates separately, , and . Set
where uses continuous functional calculus, including on these unnormalized matrices. For any real-valued matrix function , let consist of over all finite probability ensembles of positive semidefinite trace-one matrices, and let . The conclusion includes these regularity assertions: for every and ; for every , the series defining is summable for every density matrix , and is nonempty and bounded above; is bounded above; and for all positive , all channels , and all , the series defining is summable for every density matrix , and is nonempty and bounded above. Here channels have finite Kraus representations with , and tensor products act on matrix units by tensoring their images. Furthermore, both real series on the right below are summable, and the specified regularized quantity satisfies
The finite inner sums include , with the total real logarithm convention , and powers at use .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.