Lemma 13 — permutation symmetrization preserves overlap
ProvedMixedCloning.Optimal.lemma_13p2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-cloningsample-complexity
Let and . For every channel from to copies of , there is a channel invariant under independent input and output register permutations. For every rank- orthogonal projector , setting , one has
The minimum overlap over all these projectors and the Haar-average overlap are equal for and . Invariance is required on every operator, including non-product inputs. This justifies restricting the lower-bound analysis to permutation-invariant channels.
Differences from the source:
- generalization: the section uses m=n+k → arbitrary n,m ≥ 0; reason: the displayed symmetrization identity holds for every pair of tensor powers, including zero copies
Preamble
import Definitions.Def_MixedCloning_Optimal_Schur noncomputable section open Matrix MeasureTheory open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
Formal statement
namespace MixedCloning.Optimal
attribute [local instance] Classical.propDecidable Classical.decEq
theorem lemma_13 (d r n m : ℕ) (hr : 1 ≤ r) (hrd : r ≤ d)
(C : Cloner d n m) (hC : QAlgorithms.IsChannel C) :
∃ Cbar : Cloner d n m, QAlgorithms.IsChannel Cbar ∧ PermInvariant d n m Cbar ∧
(∀ P : Op (Fin d), IsProjector r P → overlap d r n m Cbar P = overlap d r n m C P) ∧
minimumOverlap d r n m Cbar = minimumOverlap d r n m C ∧
averageOverlap d r n m Cbar = averageOverlap d r n m C := by sorry
end MixedCloning.Optimal
Source
Dmitry Grinko, Marco Fanizza, Thilo Scharnhorst, Jack Spilecki, Optimal cloning of mixed states, STOC 2027 submission #243 (October 2026), p. 17, Lemma 13
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.