Lemma 1: complementary cloning channels are entanglement breaking
OpenQAlgorithms.Papers.Independent.Intakenext100.P49.cloningComplement_entanglementBreakingFor every integer , let be the complementary channel obtained by tracing out the receiver of the same isometry that defines . Its output dimension is . It is CPTP and entanglement breaking:
for every normalized bipartite density operator with qubit system and arbitrary positive finite reference . At the complement is the scalar trace map. This property identifies the complementary cloning family as entanglement breaking, without assuming separability as an input hypothesis.
Formalization Note The accepted predicate tests normalized pure states with an input-sized reference; for CPTP maps, Schmidt decomposition and convexity give the displayed formulation. The inconsistent Eq. (15) is not used to define the channel.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P49
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P49
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
open QAlgorithms.Papers.Independent.Support50.P01
(unruhSectorDilation unruhWeight unruhBlockDilation unruhBlockWeight
unruhReceiver unruhReceiverEntropy)
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel IsDegradable)
open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.QuditFidelity (depolarizingMap)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.4, Lemma 1: every genuine complementary cloning channel is
entanglement breaking, including the ell=2 trace map. -/
theorem cloningComplement_entanglementBreaking (k : ℕ) :
IsChannel (clonerComplement k) ∧
EntanglementBreaking (by omega) (by omega) (clonerComplement k) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P49
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , including , define a matrix , with indices starting at zero, by
Let . Then is a channel: there is a finite family of matrices such that and for every complex matrix . Moreover, for every unit vector , the matrix is a finite convex combination , where , , and each and is a positive semidefinite matrix of trace one on and , respectively.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.