Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact restricted CPTP criterion

Proved
QAlgorithms.Papers.Independent.Extend50.P05.restricted_channel_criterion

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥2d\ge2d≥2, α,β∈R\alpha,\beta\in\mathbb Rα,β∈R and γ∈C\gamma\in\mathbb Cγ∈C. In the input-first three-qudit basis let ui=∑a∣a,a,i⟩u_i=\sum_a|a,a,i\rangleui​=∑a​∣a,a,i⟩, vi=∑a∣a,i,a⟩v_i=\sum_a|a,i,a\ranglevi​=∑a​∣a,i,a⟩, A=∑i∣ui⟩⟨ui∣A=\sum_i|u_i\rangle\langle u_i|A=∑i​∣ui​⟩⟨ui​∣, B=∑i∣vi⟩⟨vi∣B=\sum_i|v_i\rangle\langle v_i|B=∑i​∣vi​⟩⟨vi​∣, and R=∑i∣vi⟩⟨ui∣R=\sum_i|v_i\rangle\langle u_i|R=∑i​∣vi​⟩⟨ui​∣. The operator C=αA+βB+γR+γ‾R∗C=\alpha A+\beta B+\gamma R+\overline\gamma R^*C=αA+βB+γR+γ​R∗ is the unnormalized Choi matrix of a complex-linear CPTP map if and only if

d(α+β)+2Re⁡γ=1,∣γ∣2≤αβ.d(\alpha+\beta)+2\operatorname{Re}\gamma=1, \qquad |\gamma|^2\le\alpha\beta.d(α+β)+2Reγ=1,∣γ∣2≤αβ.

Positivity and nonnegativity of α,β\alpha,\betaα,β are not assumed as additional hypotheses.

This is the exact scalar test for the four-operator restricted family.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P05
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise

open MeasureTheory

namespace QAlgorithms.Papers.Independent.Extend50.P05

open QAlgorithms.Papers.Independent.Information100.P34 (choi)

open QAlgorithms.Papers.Independent.Information100.P60 (isotropic)

open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF p.9, Eq.(7): an iff for an actual CPTP Choi matrix; positivity is a conclusion.
The preceding displayed determinant omits a positive factor d^2-1, which leaves Eq.(7) unchanged. -/
theorem restricted_channel_criterion (d : ℕ) (hd : 2 ≤ d)
    (alpha beta : ℝ) (gamma : ℂ) :
    (∃ T : Superop (Fin d) (CloningOutputs d 2),
      IsChannel T ∧ choi T = restrictedChoi d alpha beta gamma) ↔
      (d : ℝ) * (alpha + beta) + 2 * gamma.re = 1 ∧
      Complex.normSq gamma ≤ alpha * beta := by sorry

end QAlgorithms.Papers.Independent.Extend50.P05

end
Source
A geometrical description of the universal 1→21 \to 21→2 asymmetric quantum cloning region, arXiv:2106.09655v1, PDF p. 9, Unnumbered restricted CPTP criterion, Eq. (7)
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number d≥2d\ge2d≥2, real numbers α,β\alpha,\betaα,β, and complex number γ\gammaγ, define vectors on triples (a,b,c)∈{0,…,d−1}3(a,b,c)\in\{0,\ldots,d-1\}^3(a,b,c)∈{0,…,d−1}3 by ui(a,b,c)=1u_i(a,b,c)=1ui​(a,b,c)=1 exactly when a=ba=ba=b and c=ic=ic=i, and vi(a,b,c)=1v_i(a,b,c)=1vi​(a,b,c)=1 exactly when a=ca=ca=c and b=ib=ib=i, with both vectors zero elsewhere. Put

A=∑iuiui†,B=∑ivivi†,C=∑iviui†,Jα,β,γ=αA+βB+γC+γ‾C†.A=\sum_i u_i u_i^\dagger,\qquad B=\sum_i v_i v_i^\dagger,\qquad C=\sum_i v_i u_i^\dagger,\qquad J_{\alpha,\beta,\gamma} =\alpha A+\beta B+\gamma C+\overline\gamma C^\dagger.A=i∑​ui​ui†​,B=i∑​vi​vi†​,C=i∑​vi​ui†​,Jα,β,γ​=αA+βB+γC+γ​C†.

There exists a channel TTT from d×dd\times dd×d matrices to matrices indexed by pairs (b,c)(b,c)(b,c) whose Choi matrix is Jα,β,γJ_{\alpha,\beta,\gamma}Jα,β,γ​ if and only if

d(α+β)+2Re⁡γ=1and∣γ∣2≤αβ.d(\alpha+\beta)+2\operatorname{Re}\gamma=1 \quad\text{and}\quad |\gamma|^2\le\alpha\beta.d(α+β)+2Reγ=1and∣γ∣2≤αβ.

Here a channel means a map T(X)=∑jKjXKj†T(X)=\sum_jK_jXK_j^\daggerT(X)=∑j​Kj​XKj†​ for some finite family satisfying ∑jKj†Kj=Id\sum_jK_j^\dagger K_j=I_d∑j​Kj†​Kj​=Id​, and its Choi matrix is defined by

J(T)(a,b,c),(a′,b′,c′)=T(Eaa′)(b,c),(b′,c′),J(T)_{(a,b,c),(a',b',c')} =T(E_{aa'})_{(b,c),(b',c')},J(T)(a,b,c),(a′,b′,c′)​=T(Eaa′​)(b,c),(b′,c′)​,

where Eaa′E_{aa'}Eaa′​ has a single 111 in position (a,a′)(a,a')(a,a′).

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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