Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Werner's cloner is trace preserving on the Bose sector

Proved
MixedCloning.Optimal.werner_trace_bose

by dmitry · Nov 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

quantum-cloningsymmetric-subspace

Let aaa be a finite set with D=∣a∣D=|a|D=∣a∣ elements and let n,k≥0n,k\ge0n,k≥0. Write Πj\Pi_jΠj​ for the orthogonal projector onto the symmetric subspace of (Ca)⊗j(\mathbb C^a)^{\otimes j}(Ca)⊗j, the average of the j!j!j! permutation operators, and d[j]=(j+D−1j)d[j]=\binom{j+D-1}{j}d[j]=(jj+D−1​) for its dimension. For every matrix XXX on (Ca)⊗n(\mathbb C^a)^{\otimes n}(Ca)⊗n, put ρ=ΠnXΠn\rho=\Pi_nX\Pi_nρ=Πn​XΠn​. Then

d[n]  tr⁡(Πn+k(ρ⊗I⊗k)Πn+k)  =  d[n+k]  tr⁡ρ.d[n]\;\operatorname{tr}\Big(\Pi_{n+k}\big(\rho\otimes I^{\otimes k}\big)\Pi_{n+k}\Big)\;=\;d[n+k]\;\operatorname{tr}\rho .d[n]tr(Πn+k​(ρ⊗I⊗k)Πn+k​)=d[n+k]trρ.

Equivalently, when D≥1D\ge1D≥1, Werner's cloning map

T(ρ)=d[n]d[n+k] Πn+k(ρ⊗I⊗k)Πn+kT(\rho)=\frac{d[n]}{d[n+k]}\,\Pi_{n+k}\big(\rho\otimes I^{\otimes k}\big)\Pi_{n+k}T(ρ)=d[n+k]d[n]​Πn+k​(ρ⊗I⊗k)Πn+k​

preserves the trace of every operator supported on the symmetric subspace.

This is Werner's check that the normalization of his cloner makes it trace preserving. It supplies the trace-one property of Werner's output in the bridge to Lemma 7 of the mixed-state cloning source, and it is the trace-preservation part of the PCT channel property.

Formalization Note Πj\Pi_jΠj​ is the platform function symProjector a j, the normalized sum of the permutation matrices permMatrix. The map ρ↦ρ⊗I⊗k\rho\mapsto\rho\otimes I^{\otimes k}ρ↦ρ⊗I⊗k is appendIdentity n k, which places the kkk identity factors on the last registers. The identity is stated multiplied out, without division.

Differences from the source:

  • encoding: density matrices on the Bose sector → ρ=ΠnXΠn\rho=\Pi_nX\Pi_nρ=Πn​XΠn​ for an arbitrary matrix XXX; reason: these are exactly the operators supported on the symmetric subspace, and both sides are linear in ρ\rhoρ
  • encoding: tr⁡T(ρ)=tr⁡ρ\operatorname{tr}T(\rho)=\operatorname{tr}\rhotrT(ρ)=trρ → the cross-multiplied identity; reason: it avoids division and remains meaningful when D=0D=0D=0
  • generalization: M>NM>NM>N → M=N+kM=N+kM=N+k with k≥0k\ge0k≥0; reason: the case k=0k=0k=0 is the trivial identity tr⁡(ΠnρΠn)=tr⁡ρ\operatorname{tr}(\Pi_n\rho\Pi_n)=\operatorname{tr}\rhotr(Πn​ρΠn​)=trρ
Preamble
import Definitions.Def_MixedCloning_Optimal_Model

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

/-- Werner [Wer98], arXiv:quant-ph/9804001 p.6, Eq. (3.3) and the paragraph after it: the cloner
`T(ρ) = (d[N]/d[M]) s_M (ρ ⊗ 1^{⊗(M-N)}) s_M` is trace preserving on the Bose sector. Stated
multiplied out (no division), for `ρ = Π_n X Π_n` with an arbitrary matrix `X`. -/
theorem werner_trace_bose {a : Type} [Fintype a] (n k : ℕ) (X : Op (Word a n)) :
    (symDimension (Fintype.card a) n : ℂ) *
        (symProjector a (n+k) * appendIdentity n k (symProjector a n * X * symProjector a n) *
          symProjector a (n+k)).trace =
      (symDimension (Fintype.card a) (n+k) : ℂ) *
        (symProjector a n * X * symProjector a n).trace := by sorry

end MixedCloning.Optimal
Source
R. F. Werner, Optimal cloning of pure states, Phys. Rev. A 58, 1827 (1998), arXiv:quant-ph/9804001, PDF p. 6: Eq. (3.3) and the paragraph following it, where the normalization of the cloning map is shown to make it trace preserving on the Bose sector; used for Lemma 7 in D. Grinko, M. Fanizza, T. Scharnhorst, J. Spilecki, Optimal cloning of mixed states, STOC 2027 submission #243, p. 11.

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