Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (1.1) = (3.21), pp. 2, 15 — every isotropic cloner obeys πa+2Nπaπb+πb≥1\pi_a + \frac2N\sqrt{\pi_a\pi_b} + \pi_b \ge 1πa​+N2​πa​πb​​+πb​≥1, and every point of the ellipse is attained

Proved
CerfCloning.Isotropic.no_cloning_inequality

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

depolarizing-channelno-cloningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-cloningtradeoff

Let N≥2N \ge 2N≥2. A 1→21 \to 21→2 isotropic cloner of an NNN-level system with depolarizing fractions πa,πb∈R\pi_a, \pi_b \in \mathbb Rπa​,πb​∈R is a quantum channel TTT (completely positive and trace preserving) from operators on the NNN-level input to operators on A⊗BA \otimes BA⊗B, two NNN-level outputs, whose two outputs emerge from depolarizing channels: for every operator ρ\rhoρ,

Tr⁡BT(ρ)=πaN(Tr⁡ρ) 1+(1−πa) ρ,Tr⁡AT(ρ)=πbN(Tr⁡ρ) 1+(1−πb) ρ,\operatorname{Tr}_B T(\rho) = \frac{\pi_a}{N}(\operatorname{Tr}\rho)\,\mathbb 1 + (1-\pi_a)\,\rho, \qquad \operatorname{Tr}_A T(\rho) = \frac{\pi_b}{N}(\operatorname{Tr}\rho)\,\mathbb 1 + (1-\pi_b)\,\rho ,TrB​T(ρ)=Nπa​​(Trρ)1+(1−πa​)ρ,TrA​T(ρ)=Nπb​​(Trρ)1+(1−πb​)ρ,

i.e. copy AAA is the input replaced by a random state with probability πa\pi_aπa​, and copy BBB with probability πb\pi_bπb​. Write a=πaa = \sqrt{\pi_a}a=πa​​ and b=πbb = \sqrt{\pi_b}b=πb​​.

  1. No-cloning inequality. Every isotropic cloner satisfies
a2+2N ab+b2  =  πa+2Nπaπb+πb  ≥  1.a^2 + \frac{2}{N}\, ab + b^2 \;=\; \pi_a + \frac{2}{N}\sqrt{\pi_a}\sqrt{\pi_b} + \pi_b \;\ge\; 1 .a2+N2​ab+b2=πa​+N2​πa​​πb​​+πb​≥1.
  1. Tightness. For all πa,πb≥0\pi_a, \pi_b \ge 0πa​,πb​≥0 with πa+2Nπaπb+πb=1\pi_a + \frac2N\sqrt{\pi_a}\sqrt{\pi_b} + \pi_b = 1πa​+N2​πa​​πb​​+πb​=1 there is an isotropic cloner with depolarizing fractions πa\pi_aπa​ and πb\pi_bπb​.

So the region of (πa,πb)(\sqrt{\pi_a}, \sqrt{\pi_b})(πa​​,πb​​) inside the ellipse a2+2Nab+b2=1a^2 + \frac2N ab + b^2 = 1a2+N2​ab+b2=1, which would represent close-to-perfect cloning, is forbidden by quantum mechanics, and the ellipse itself is the exact boundary of what isotropic cloners achieve (the paper attains it with isotropic Heisenberg cloning machines). For N=2N = 2N=2 this is the qubit no-cloning inequality; as N→∞N \to \inftyN→∞ the ellipse tends to the line πa+πb=1\pi_a + \pi_b = 1πa​+πb​=1.

Formalization Note A channel is a finite family of Kraus operators KiK_iKi​ with ∑iKi†Ki=1\sum_i K_i^\dagger K_i = \mathbb 1∑i​Ki†​Ki​=1 (QAlgorithms.IsChannel), which in finite dimension is exactly a completely positive trace-preserving map. The first factor of the output space is AAA. The output conditions are imposed on every matrix ρ\rhoρ; for a linear map that is the same as imposing them on all density matrices, or on all pure states. No sign condition is put on πa,πb\pi_a, \pi_bπa​,πb​ in clause 1: complete positivity of the output channels forces πa,πb≥0\pi_a, \pi_b \ge 0πa​,πb​≥0, so Real.sqrt returns the paper's aaa and bbb. For N≥2N \ge 2N≥2 the fractions are determined by the channel.

Differences from the source:

  • encoding: an NNN-dimensional quantum state, NNN unrestricted → hypothesis 2≤N2 \le N2≤N; reason: at N=1N = 1N=1 the depolarizing fraction is not determined by the channel (every fraction gives the identity map), so the identity channel would be an isotropic cloner with πa=πb=0\pi_a = \pi_b = 0πa​=πb​=0; the paper never considers N=1N = 1N=1, where there is nothing to clone.
  • reading: "the domain … inside a particular ellipse … is forbidden" for "all isotropic cloning machines", "cloners whose outputs emerge from (distinct) depolarizing channels" (abstract, p. 2) → clause 1 for every quantum channel X→A⊗BX \to A\otimes BX→A⊗B whose two outputs are depolarizing; reason: this is the paper's own definition of an isotropic cloner and its claim on p. 2; the derivation in §III C runs inside the Heisenberg cloning machines, but the claim is stated for all isotropic cloners, and the narrower class would make the inequality a restatement of the ellipse (3.20).
  • reading: "It is a tight inequality … which is saturated with the HCMs" → clause 2: every point of the ellipse with πa,πb≥0\pi_a, \pi_b \ge 0πa​,πb​≥0 is attained by some isotropic cloner; reason: tightness and saturation are existence claims; the paper's witness for the point (a,b)(a, b)(a,b), a,b≥0a, b \ge 0a,b≥0, is the HCM (3.8) with a^=b\hat a = ba^=b, which the statement does not name.
  • generalization: πa=a2\pi_a = a^2πa​=a2, πb=b2\pi_b = b^2πb​=b2 with a,ba, ba,b real and positive → πaπb\sqrt{\pi_a}\sqrt{\pi_b}πa​​πb​​ via Real.sqrt, and the hypotheses πa,πb≥0\pi_a, \pi_b \ge 0πa​,πb​≥0 in clause 2; reason: the same numbers for a,b>0a, b > 0a,b>0; clause 2 also covers the two endpoints (πa,πb)=(1,0)(\pi_a, \pi_b) = (1, 0)(πa​,πb​)=(1,0) and (0,1)(0, 1)(0,1) of the ellipse, so it contains the paper's claim; in clause 1 nonnegativity follows from complete positivity.
  • encoding: outputs depolarizing on input states → on every matrix ρ\rhoρ; reason: a channel is linear and density matrices span all matrices, so the conditions are equivalent.
Preamble
import Mathlib
import Definitions.Def_CerfCloning_Isotropic_Model

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

theorem no_cloning_inequality (N : ℕ) [NeZero N] (hN : 2 ≤ N) :
    (∀ (T : Superop (Fin N) (Fin N × Fin N)) (pa pb : ℝ), IsIsotropicCloner N T pa pb →
        1 ≤ pa + 2 / (N : ℝ) * (Real.sqrt pa * Real.sqrt pb) + pb) ∧
    (∀ pa pb : ℝ, 0 ≤ pa → 0 ≤ pb → pa + 2 / (N : ℝ) * (Real.sqrt pa * Real.sqrt pb) + pb = 1 →
        ∃ T : Superop (Fin N) (Fin N × Fin N), IsIsotropicCloner N T pa pb) := by sorry
end CerfCloning.Isotropic
Source
Cerf, Asymmetric quantum cloning machines in any dimension, arXiv:quant-ph/9805024v2, abstract p. 1, p. 2, Eq. (1.1), and p. 15, Eq. (3.21)
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