Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3.6), p. 13 — a Heisenberg channel on half of ∣ψ0,0⟩|\psi_{0,0}\rangle∣ψ0,0​⟩ gives ρRY=∑m,npm,n∣ψm,n⟩⟨ψm,n∣\rho_{RY} = \sum_{m,n} p_{m,n}|\psi_{m,n}\rangle\langle\psi_{m,n}|ρRY​=∑m,n​pm,n​∣ψm,n​⟩⟨ψm,n​∣

Proved
CerfCloning.Isotropic.eq_3_6

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

heisenberg-channelmaximally-entangled-statesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-channels

Let N≥1N \ge 1N≥1 and let pm,np_{m,n}pm,n​, m,n∈ZNm, n \in \mathbb Z_Nm,n∈ZN​, be real weights. Let Hp(ρ)=∑m,npm,n Um,n ρ Um,n†\mathcal H_p(\rho) = \sum_{m,n} p_{m,n}\, U_{m,n}\,\rho\, U_{m,n}^\daggerHp​(ρ)=∑m,n​pm,n​Um,n​ρUm,n†​ be the Heisenberg channel with these weights, where Um,nU_{m,n}Um,n​ are the error operators of Eq. (3.5). If the input XXX of the channel is maximally entangled with a reference RRR, i.e. the joint state is ∣ψ0,0⟩=∑j∣j⟩∣j⟩/N|\psi_{0,0}\rangle = \sum_j |j\rangle|j\rangle/\sqrt N∣ψ0,0​⟩=∑j​∣j⟩∣j⟩/N​, then the joint state of RRR and the output YYY is

ρRY=(idR⊗Hp)(∣ψ0,0⟩⟨ψ0,0∣)=∑m,npm,n ∣ψm,n⟩⟨ψm,n∣.\rho_{RY} = (\mathrm{id}_R \otimes \mathcal H_p)\big(|\psi_{0,0}\rangle\langle\psi_{0,0}|\big) = \sum_{m,n} p_{m,n}\, |\psi_{m,n}\rangle\langle\psi_{m,n}| .ρRY​=(idR​⊗Hp​)(∣ψ0,0​⟩⟨ψ0,0​∣)=m,n∑​pm,n​∣ψm,n​⟩⟨ψm,n​∣.

So a Heisenberg channel is characterized by the probability distribution of its error operators, read off as the weights of the maximally entangled states in ρRY\rho_{RY}ρRY​.

Formalization Note idR⊗Hp\mathrm{id}_R \otimes \mathcal H_pidR​⊗Hp​ is QAlgorithms.idTensorSuperop, with RRR the first factor.

Differences from the source:

  • generalization: pm,np_{m,n}pm,n​ a probability distribution (pm,n≥0p_{m,n} \ge 0pm,n​≥0, ∑m,npm,n=1\sum_{m,n} p_{m,n} = 1∑m,n​pm,n​=1) → any real weights pm,np_{m,n}pm,n​; reason: the identity is linear in ppp and holds for all real weights, so it specializes to the source's channel by adding the two conditions.
Preamble
import Mathlib
import Definitions.Def_CerfCloning_Isotropic_Model

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

theorem eq_3_6 (N : ℕ) [NeZero N] (p : Fin N → Fin N → ℝ) :
    idTensorSuperop (R := Fin N) (heisenbergChannel N p) (pureDensity (meState N 0 0)) =
      ∑ m, ∑ n, ((p m n : ℝ) : ℂ) • pureDensity (meState N m n) := by sorry
end CerfCloning.Isotropic
Source
Cerf, Asymmetric quantum cloning machines in any dimension, arXiv:quant-ph/9805024v2, p. 13, Eq. (3.6)
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