§III.C: positive quantum capacity of all optimal qubit cloners
ProvedQAlgorithms.Papers.Independent.Support50.P01.cloner_capacity_positiveLet 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. All these optimal cloners satisfy
The general positivity statement does not require the unproved general conjugate-degradability conjecture.
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: all optimal cloners have positive capacity, without the general conjecture. -/
theorem cloner_capacity_positive (N M : ℕ) (hN : 1≤N) (hNM : N≤M) :
0 < quantumCapacity (receiverChannel (clonerDilation N M)) := 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 pair of natural numbers , define by
for , , and , using truncated natural-number subtraction, and put . Define
where acts on , , and with applied by continuous functional calculus. The tensor-power map sends a matrix unit to the matrix with entries , and the reference identity acts blockwise. Then . This includes ; neither nor block length is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.