Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 13 — permutation symmetrization preserves overlap

Proved
MixedCloning.Optimal.lemma_13

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-cloningsample-complexity

Let 1≤r≤d1\le r\le d1≤r≤d and n,m≥0n,m\ge0n,m≥0. For every channel CCC from nnn to mmm copies of Cd\mathbb C^dCd, there is a channel C‾\overline CC invariant under independent input and output register permutations. For every rank-rrr orthogonal projector PPP, setting ρ=P/r\rho=P/rρ=P/r, one has

tr⁡(C‾(ρ⊗n)P⊗m)=tr⁡(C(ρ⊗n)P⊗m).\operatorname{tr}(\overline C(\rho^{\otimes n})P^{\otimes m})=\operatorname{tr}(C(\rho^{\otimes n})P^{\otimes m}).tr(C(ρ⊗n)P⊗m)=tr(C(ρ⊗n)P⊗m).

The minimum overlap over all these projectors and the Haar-average overlap are equal for CCC and C‾\overline CC. 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
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me