Theorem 1: conjugate degradability of two cloning families
ProvedQAlgorithms.Papers.Independent.Support50.P01.cloningFamilies_conjugateDegradableLet 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. The two families satisfy
Each assertion supplies one CPTP witness for the entire input operator space. The identity case is included.
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 pp.8–10, Theorem 1: both proven cloning families, retaining the M=1 identity case. -/
theorem cloningFamilies_conjugateDegradable :
(∀ N : ℕ, 1≤N → ConjugateDegradable (clonerDilation N (N+1))) ∧
(∀ M : ℕ, 1≤M → ConjugateDegradable (clonerDilation 1 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 natural numbers , let be the matrix
where , , and ; subtractions in factorial arguments are natural-number subtractions, truncated at zero. Write and for the partial traces over the second and first output factors, respectively. The assertion is that, for every , satisfies and admits a map with for every complex input matrix , and that the same holds for for every . In each case, must have a finite Kraus representation , for some natural number , with ; the transpose is the ordinary transpose. The choices of may depend on the family parameter. The second family includes , whose environment has dimension one.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.