Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 10 — sample complexity of the PCT cloner

Proved
MixedCloning.Optimal.proposition_10

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, n≥1n\ge1n≥1 and k≥0k\ge0k≥0 be integers. Let RRR be any RPC for these dimensions and τ\tauτ any state on the (n+k)(n+k)(n+k)-copy purification space. The resulting completed PCT map is a channel and, for every state ρ\rhoρ of rank at most rrr,

F(CPCT(ρ⊗n),ρ⊗(n+k))≥1−krdn.F(C_{\mathrm{PCT}}(\rho^{\otimes n}),\rho^{\otimes(n+k)})\ge1-\frac{krd}{n}.F(CPCT​(ρ⊗n),ρ⊗(n+k))≥1−nkrd​.

For every ε>0\varepsilon>0ε>0, every such n≥⌈krd/ε⌉n\ge\lceil krd/\varepsilon\rceiln≥⌈krd/ε⌉ therefore attains fidelity at least 1−ε1-\varepsilon1−ε. The paper writes O(krd/ε)O(krd/\varepsilon)O(krd/ε); its proof yields constant 111. This is the upper-bound component of sample optimality.

Differences from the source:

  • encoding: Werner map on the symmetric subspace → Werner map extended by a fixed output state on the orthogonal complement; reason: the extension is a total channel and agrees with the printed map on random purifications
  • generalization: the PCT channel specified in Figures 1 and 7 → every channel satisfying the RPC specification and every complementary output state; reason: their action agrees on every tensor-power input, so the printed PCT guarantee follows
  • encoding: n = O(krd/ε) → every n ≥ 1 with n ≥ ⌈krd/ε⌉, with fidelity ≥ 1−krd/n; reason: the proof on p. 16 supplies the explicit constant 1
  • generalization: cloning k additional copies with k ≥ 1 → k ≥ 0; reason: the k=0 construction also obeys the printed estimate
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 proposition_10 (d r n k : ℕ) (hd : 1 ≤ d) (hr : 1 ≤ r) (hrd : r ≤ d)
    (hn : 1 ≤ n)
    (R : QAlgorithms.Superop (Word (Fin d) n) (Word (Fin d × Fin r) n))
    (hR : IsRPC d r n R) (tau : Op (Word (Fin d × Fin r) (n+k))) (htau : IsState tau) :
    Clones d r n k ((k : ℝ)*r*d/n) (pct d r n k R tau) ∧
    ∀ eps : ℝ, 0 < eps → Nat.ceil ((k : ℝ)*r*d/eps) ≤ n →
      Clones d r n k eps (pct d r n k R tau) := 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. 16, Proposition 10; proof and Figure 7
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