§III.B: full Unruh-channel capacity series
OpenQAlgorithms.Papers.Independent.Support50.P01.unruh_capacityFor , let be the full Unruh channel of Eqs.(11),(12), with receiver , genuine environment , and the common flagged dilation of the cloning sectors with weights . Use the entire countable sums, bit entropies, and unrestricted entangled density inputs for every positive block length. Write for the regularized optimized coherent information of this channel. Then
The displayed series converges. Both full output entropy series converge for every normalized input to every positive finite block length , and such an input satisfies . The normalized maximally mixed one-use input attains capacity. This evaluates the actual infinite-output channel rather than a cutoff approximation.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P01
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel IsDegradable dilationPower maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)
open QAlgorithms.Papers.Independent.Information100.P08 (maximallyMixed)
open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {a b e c : ℕ}
/-- PDF p.7, Eqs.(11)–(13): full capacity series, entropy convergence and optimizer.
The standard-polylogarithm equality printed afterwards is deferred for its missing
factor 1/log(2); the preceding series is used exactly with bit logarithms. -/
theorem unruh_capacity (z : ℝ) (hz0 : 0<z) (hz1 : z<1) :
Summable (unruhSeriesTerm z) ∧
(∀ n : ℕ, 0<n → ∀ rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ,
IsDensityMatrix rho →
Summable (fun ks => vnEntropy (unruhReceiverBlock z ks rho)) ∧
Summable (fun ks => vnEntropy (unruhEnvironmentBlock z ks rho))) ∧
IsDensityMatrix unruhMixedInput ∧
unruhCapacity z = unruhCoherentInformation z unruhMixedInput ∧
unruhCapacity z = ∑' k : ℕ, unruhSeriesTerm z k ∧
(∀ n : ℕ, 0<n → ∀ rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ,
IsDensityMatrix rho → unruhCoherentInformation z rho ≤
(n : ℝ) * unruhCoherentInformation z unruhMixedInput) := by sorry
end QAlgorithms.Papers.Independent.Support50.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with , put and . For , define by
where , , and . For every positive natural number , every , and every density matrix indexed by , let and
Here a density matrix is positive semidefinite with trace one, partial traces sum diagonal indices of the discarded register, and uses continuous functional calculus. Define and . Then the scalar series is summable, and for every such positive and density matrix , both entropy families indexed by are summable. The matrix , indexed by one binary coordinate, is a density matrix, and
for every positive and every density matrix on binary coordinates. All sector indices include ; no assertion here is made for , , or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.