§III.A: the 1→2 universal cloner is also degradable
ProvedQAlgorithms.Papers.Independent.Support50.P01.cloner12_degradableLet 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. In the case there are input-independent CPTP maps and on the entire three-dimensional receiver support such that
Thus the specified cloner is both ordinarily and conjugately degradable. Compression to the symmetric support avoids treating a non-trace-preserving projection on the full two-qubit space as a channel.
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.6: ordinary and conjugate degradability, on the compressed symmetric receiver.
The CPTP witness is trace preserving on its entire three-dimensional domain. -/
theorem cloner12_degradable :
IsDegradable (clonerDilation 1 2) ∧ ConjugateDegradable (clonerDilation 1 2) := by sorry
end QAlgorithms.Papers.Independent.Support50.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let have
with all other entries zero, and write and . Then , there exists a channel satisfying for every matrix , and there exists a possibly different channel between the same matrix spaces satisfying for every matrix . Each channel is required to have a finite Kraus representation with ; denotes ordinary transpose.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.