Proposition 10 — sample complexity of the PCT cloner
ProvedMixedCloning.Optimal.proposition_10p2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-cloningsample-complexity
Let , and be integers. Let be any RPC for these dimensions and any state on the -copy purification space. The resulting completed PCT map is a channel and, for every state of rank at most ,
For every , every such therefore attains fidelity at least . The paper writes ; its proof yields constant . 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.