§III.C: coherent information tends to zero with diverging M/N
OpenQAlgorithms.Papers.Independent.Support50.P01.cloner_singleUse_asymptoticsLet be integers. Let be the specified optimal universal qubit cloner on , with receiver support and environment dimension . Its common dilation on normalized occupation kets is exactly Eqs.(21),(22). Write , for coherent information in bits, for its supremum over all density inputs, and for its regularization over all positive block lengths and arbitrary entangled block inputs. For each fixed , is nonincreasing on integers . If integer sequences obey and , then
This is a limit of maximized single-use information, not an unproved limit for general regularized capacities.
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.11: fixed-N monotonicity and the divergent-ratio limit concern optimized
single-use information, not the unknown general regularized capacity. -/
theorem cloner_singleUse_asymptotics :
(∀ N : ℕ, 1≤N → AntitoneOn (fun M => maximumCoherentInformation (clonerDilation N M))
{M : ℕ | N≤M}) ∧
(∀ N M : ℕ → ℕ, (∀ t, 1≤N t ∧ N t≤M t) →
Tendsto (fun t => (M t : ℝ)/(N t : ℝ)) atTop atTop →
Tendsto (fun t => maximumCoherentInformation (clonerDilation (N t) (M t))) atTop (nhds 0)) := 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 natural numbers , let have entries
with , , , and natural-number subtraction truncated at zero. Define
where acts on , the two partial traces remove the second and first output factors, and for applied by continuous functional calculus. The assertion has two parts: for every fixed , if , then ; and for every pair of sequences satisfying for every , if , with the quotient taken in , then as . The monotonicity is non-strict, and the sequence conclusion is conditional on divergence of the ratio.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.