Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3.9), p. 14 — tracing (3.8) over BBB and CCC: ρRA=∑m,n∣αm,n∣2∣ψm,n⟩⟨ψm,n∣\rho_{RA} = \sum_{m,n}|\alpha_{m,n}|^2|\psi_{m,n}\rangle\langle\psi_{m,n}|ρRA​=∑m,n​∣αm,n​∣2∣ψm,n​⟩⟨ψm,n​∣

Proved
CerfCloning.Isotropic.eq_3_9

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

heisenberg-cloning-machinemaximally-entangled-statesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1partial-trace

Let N≥1N \ge 1N≥1, let αm,n∈C\alpha_{m,n} \in \mathbb Cαm,n​∈C for m,n∈ZNm, n \in \mathbb Z_Nm,n∈ZN​, and let ∣Ψ⟩RA;BC=∑m,nαm,n ∣ψm,n⟩RA ∣ψm,N−n⟩BC|\Psi\rangle_{RA;BC} = \sum_{m,n} \alpha_{m,n}\, |\psi_{m,n}\rangle_{RA}\, |\psi_{m,N-n}\rangle_{BC}∣Ψ⟩RA;BC​=∑m,n​αm,n​∣ψm,n​⟩RA​∣ψm,N−n​⟩BC​ be the double-ME state of Eq. (3.8) of four NNN-level systems R,A,B,CR, A, B, CR,A,B,C. Then tracing over BBB and CCC leaves a mixture of maximally entangled states of RRR and AAA:

ρRA=Tr⁡BC∣Ψ⟩⟨Ψ∣=∑m,n=0N−1∣αm,n∣2 ∣ψm,n⟩⟨ψm,n∣.\rho_{RA} = \operatorname{Tr}_{BC} |\Psi\rangle\langle\Psi| = \sum_{m,n=0}^{N-1} |\alpha_{m,n}|^2\, |\psi_{m,n}\rangle\langle\psi_{m,n}| .ρRA​=TrBC​∣Ψ⟩⟨Ψ∣=m,n=0∑N−1​∣αm,n​∣2∣ψm,n​⟩⟨ψm,n​∣.

By Eq. (3.6), output AAA of the cloner described by ∣Ψ⟩|\Psi\rangle∣Ψ⟩ is therefore the Heisenberg channel with error probabilities pm,n=∣αm,n∣2p_{m,n} = |\alpha_{m,n}|^2pm,n​=∣αm,n​∣2.

Formalization Note ∣Ψ⟩|\Psi\rangle∣Ψ⟩ is a function on ((R,A),(B,C))((R,A),(B,C))((R,A),(B,C)) and ρRA(x,y)=∑zΨ(x,z) Ψ(y,z)‾\rho_{RA}(x,y) = \sum_z \Psi(x,z)\,\overline{\Psi(y,z)}ρRA​(x,y)=∑z​Ψ(x,z)Ψ(y,z)​.

Differences from the source:

  • generalization: amplitudes with ∑m,n∣αm,n∣2=1\sum_{m,n}|\alpha_{m,n}|^2 = 1∑m,n​∣αm,n​∣2=1 → arbitrary complex amplitudes; reason: the identity is homogeneous of degree two in α\alphaα and holds without normalization; adding it gives the source's statement.
Preamble
import Mathlib
import Definitions.Def_CerfCloning_Isotropic_Model

open scoped Matrix ComplexOrder BigOperators
open QAlgorithms
Formal statement
namespace CerfCloning.Isotropic

theorem eq_3_9 (N : ℕ) [NeZero N] (α : Fin N → Fin N → ℂ) :
    reducedRA (hcmState N α) =
      ∑ m, ∑ n, ((‖α m n‖ ^ 2 : ℝ) : ℂ) • pureDensity (meState N m n) := by sorry
end CerfCloning.Isotropic
Source
Cerf, Asymmetric quantum cloning machines in any dimension, arXiv:quant-ph/9805024v2, p. 14, Eqs. (3.8)–(3.9)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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