Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (3.7), p. 13 — (1⊗Um,n)∣ψ0,0⟩=∣ψm,n⟩(\mathbb 1 \otimes U_{m,n})|\psi_{0,0}\rangle = |\psi_{m,n}\rangle(1⊗Um,n​)∣ψ0,0​⟩=∣ψm,n​⟩

Proved
CerfCloning.Isotropic.eq_3_7

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

maximally-entangled-statesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationweyl-operators

Let N≥1N \ge 1N≥1, let ∣ψm,n⟩|\psi_{m,n}\rangle∣ψm,n​⟩ be the maximally entangled states of Eq. (3.1) and Um,n=∑ke2πi kn/N∣k+m⟩⟨k∣U_{m,n} = \sum_k e^{2\pi i\, kn/N}|k+m\rangle\langle k|Um,n​=∑k​e2πikn/N∣k+m⟩⟨k∣ the error operators of Eq. (3.5). For all m,n∈ZNm, n \in \mathbb Z_Nm,n∈ZN​, applying Um,nU_{m,n}Um,n​ to the second system only maps ∣ψ0,0⟩|\psi_{0,0}\rangle∣ψ0,0​⟩ to ∣ψm,n⟩|\psi_{m,n}\rangle∣ψm,n​⟩:

(1⊗Um,n) ∣ψ0,0⟩=∣ψm,n⟩.(\mathbb 1 \otimes U_{m,n})\,|\psi_{0,0}\rangle = |\psi_{m,n}\rangle .(1⊗Um,n​)∣ψ0,0​⟩=∣ψm,n​⟩.

This is the correspondence between the N2N^2N2 error operators of a Heisenberg channel and the N2N^2N2 maximally entangled states, which turns a Heisenberg channel acting on half of ∣ψ0,0⟩|\psi_{0,0}\rangle∣ψ0,0​⟩ into a mixture of the states ∣ψm,n⟩|\psi_{m,n}\rangle∣ψm,n​⟩.

Formalization Note 1⊗Um,n\mathbb 1 \otimes U_{m,n}1⊗Um,n​ is the Kronecker product of matrices with the untouched system as the first factor, applied to ∣ψ0,0⟩|\psi_{0,0}\rangle∣ψ0,0​⟩ as a coordinate vector.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_CerfCloning_Isotropic_Model

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

theorem eq_3_7 (N : ℕ) [NeZero N] (m n : Fin N) :
    (Matrix.kronecker (1 : Matrix (Fin N) (Fin N) ℂ) (weyl N m n)) *ᵥ
        (meState N 0 0 : Fin N × Fin N → ℂ) =
      (meState N m n : Fin N × Fin N → ℂ) := by sorry
end CerfCloning.Isotropic
Source
Cerf, Asymmetric quantum cloning machines in any dimension, arXiv:quant-ph/9805024v2, p. 13, Eq. (3.7)
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