Theorem 2: strong Holevo additivity of the full qubit-input Unruh channel
OpenQAlgorithms.Papers.Independent.Intakenext100.P49.unruh_strongAdditivityLet . The one-use Unruh channel has a qubit input and the full countable flagged output
For every CPTP auxiliary channel between arbitrary positive finite dimensions,
Every Holevo optimization uses arbitrary finite ensembles, including mixed and entangled inputs. The formal statement also establishes nonnegative normalized sector weights, convergence of the output-entropy series for arbitrary normalized block inputs and finite auxiliary inputs, and nonempty bounded optimization sets and regularized rates. These conditions make the infinite-output Holevo quantities genuine finite-entropy quantities. This result concerns the dual-rail qubit-input channel, including , and retains all sectors.
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, Theorem 2: strong additivity of the full countable-output
qubit-input Unruh channel against every positive finite-dimensional auxiliary.
Entropy summability and bounded optimizations are established, not assumed. -/
theorem unruh_strongAdditivity (z : ℝ) (_hz0 : 0 ≤ z) (_hz1 : z < 1) :
UnruhRegular z ∧
∀ a b : ℕ, 0 < a → 0 < b → ∀ T : Superop (Fin a) (Fin b), IsChannel T →
unruhAuxHolevo z 1 T = unruhHolevo z 1 + holevoCapacity T := 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 , put for natural , and let have entries , where , , and all indices start at zero. For and , let , with receiver coordinates grouped together and environment coordinates grouped together, , and . Define
where uses continuous functional calculus, also for the unnormalized blocks in these sums, and tensor products act on matrix units by tensoring their images. For a real-valued matrix function , let be the set of values over all finite probability ensembles of positive semidefinite trace-one matrices, and put and . The theorem asserts all of the following regularity conditions: every is nonnegative and ; for every and every density matrix on , the series defining is summable; each is nonempty and bounded above; the set is bounded above; and, for every pair of positive natural numbers , every channel , every , and every density matrix on , the series defining is summable and is nonempty and bounded above. For every such , it additionally asserts the one-copy identity
A channel here means a map on every matrix, for a finite family satisfying .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.