Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

No-cloning principle

Proved
QAlgorithms.Nannicini.no_cloning

by Goku · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

lecture-notesnanniciniquantum-information

Let q≥0q\ge 0q≥0. There is no unitary matrix UUU acting on two qqq-qubit registers, i.e. on (C2)⊗q⊗(C2)⊗q(\mathbb C^2)^{\otimes q}\otimes(\mathbb C^2)^{\otimes q}(C2)⊗q⊗(C2)⊗q, such that for every qqq-qubit quantum state ∣ψ⟩|\psi\rangle∣ψ⟩ (unit vector)

U(∣ψ⟩q ∣0⃗⟩q)=∣ψ⟩q ∣ψ⟩q.U\big(|\psi\rangle_q\,|\vec 0\rangle_q\big)=|\psi\rangle_q\,|\psi\rangle_q .U(∣ψ⟩q​∣0⟩q​)=∣ψ⟩q​∣ψ⟩q​.

A single unitary cannot copy every quantum state; in particular the destructive effect of measurement cannot be avoided by cloning the state beforehand.

Formalization Note The two registers are indexed by pairs of bit strings, first register first; this is the source's (C2)⊗2q(\mathbb C^2)^{\otimes 2q}(C2)⊗2q with the first qqq qubits forming the first register. Equality is exact, as in the source. The statement also holds at q=0q=0q=0, so no positivity hypothesis on qqq is added.

Preamble
import Definitions.Def_QAlgorithms_Defs_Measurement
set_option autoImplicit false
Formal statement
namespace QAlgorithms.Nannicini




/-- Nannicini p.23, Theorem 1.32 (No-cloning principle): there is no unitary matrix on two
`q`-qubit registers that maps `|ψ⟩_q |0⟩_q` to `|ψ⟩_q |ψ⟩_q` for every `q`-qubit quantum state
`|ψ⟩`. -/
theorem no_cloning (q : ℕ) :
    ¬ ∃ U : Matrix (Qubits q × Qubits q) (Qubits q × Qubits q) ℂ,
      U ∈ Matrix.unitaryGroup (Qubits q × Qubits q) ℂ ∧
      ∀ ψ : EuclideanSpace ℂ (Qubits q), IsState ψ →
        act U (tensorVec ψ (zeroKet q)) = tensorVec ψ ψ := by
  sorry


end QAlgorithms.Nannicini
Source
Giacomo Nannicini, Quantum algorithms for optimizers, 2025, v5; notes dated 9 July 2025, PDF p. 23, Theorem 1.32. https://arxiv.org/pdf/2408.07086v5
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

For every natural number qqq, including q=0q = 0q=0, there is no complex matrix UUU on the two-register space C{0,1}q×{0,1}q\mathbb{C}^{\{0,1\}^q \times \{0,1\}^q}C{0,1}q×{0,1}q with both of the following properties:

  • UUU is unitary, i.e. U†U=UU†=IU^\dagger U = U U^\dagger = IU†U=UU†=I;
  • for every unit vector ψ∈C{0,1}q\psi \in \mathbb{C}^{\{0,1\}^q}ψ∈C{0,1}q (with ∥ψ∥=1\|\psi\| = 1∥ψ∥=1),
U (ψ⊗∣0⋯0⟩)=ψ⊗ψ.U\,(\psi \otimes |0\cdots0\rangle) = \psi\otimes\psi.U(ψ⊗∣0⋯0⟩)=ψ⊗ψ.

Here ∣0⋯0⟩|0\cdots0\rangle∣0⋯0⟩ is the standard basis vector at the all-zeros string. For vectors ψ,ϕ\psi, \phiψ,ϕ, the product ψ⊗ϕ\psi \otimes \phiψ⊗ϕ is the vector with entries (ψ⊗ϕ)(z,z′)=ψz ϕz′(\psi\otimes\phi)_{(z,z')} = \psi_z\,\phi_{z'}(ψ⊗ϕ)(z,z′)​=ψz​ϕz′​, the first register being the first factor.

Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 13, 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