Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Standard mixed-state cloning with a common ancilla

Open
QAlgorithms.Papers.Independent.Intakenext100.P97.standard_cloning_lowerBound

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

prove2quantum

All states are positive semidefinite, trace-one matrices, including pure and rank-deficient states. Write F(ρ,σ)F(\rho,\sigma)F(ρ,σ) for squared Uhlmann fidelity, f=F(ρ1,ρ2)f=\sqrt{F(\rho_1,\rho_2)}f=F(ρ1​,ρ2​)​, and D(ρ,σ)=1−F(ρ,σ)=sin⁡Δ(ρ,σ)D(\rho,\sigma)=\sqrt{1-F(\rho,\sigma)}=\sin\Delta(\rho,\sigma)D(ρ,σ)=1−F(ρ,σ)​=sinΔ(ρ,σ).

Let H=CdH=\mathbb C^dH=Cd with d>1d>1d>1 and let ρ1≠ρ2\rho_1\ne\rho_2ρ1​=ρ2​ be two density operators on HHH. The auxiliary register EEE is arbitrary finite dimensional, with no dimension bound. For density operators Υj\Upsilon_jΥj​ on HB⊗EH_B\otimes EHB​⊗E, where HB=HH_B=HHB​=H, fix one unitary VVV on HA⊗HB⊗EH_A\otimes H_B\otimes EHA​⊗HB​⊗E for both labels. Set ρ~j=Tr⁡E[V(ρj⊗Υj)V†]\widetilde\rho_j=\operatorname{Tr}_E[V(\rho_j\otimes\Upsilon_j)V^\dagger]ρ​j​=TrE​[V(ρj​⊗Υj​)V†], ϕ=F(Υ1,Υ2)\phi=\sqrt{F(\Upsilon_1,\Upsilon_2)}ϕ=F(Υ1​,Υ2​)​, and

R=D(ρ~1,ρ1⊗ρ1)+D(ρ~2,ρ2⊗ρ2)D(ρ1⊗ρ1,ρ2⊗ρ2).R=\frac{D(\widetilde\rho_1,\rho_1\otimes\rho_1)+D(\widetilde\rho_2,\rho_2\otimes\rho_2)}{D(\rho_1\otimes\rho_1,\rho_2\otimes\rho_2)}.R=D(ρ1​⊗ρ1​,ρ2​⊗ρ2​)D(ρ​1​,ρ1​⊗ρ1​)+D(ρ​2​,ρ2​⊗ρ2​)​.

The initial state factors between the input and the whole ancilla; the ancilla may be mixed and correlated across BBB and EEE. Distinct inputs ensure a positive denominator.

If both labels use the same normalized ancillary state Υ1=Υ2=Υ\Upsilon_1=\Upsilon_2=\UpsilonΥ1​=Υ2​=Υ, then

R≥f−f21+f2.R\ge f-\frac{f^2}{\sqrt{1+f^2}}.R≥f−1+f2​f2​.

This is the standard-cloning bound for arbitrary mixed input states. The common ancilla need not be pure or factor between blank and environment.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P97
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Intakenext100.P97

open QAlgorithms.Papers.Independent.Information100.P67
  (squaredFidelity sineDistance receiverChannel)

open QAlgorithms.Papers.Independent.Dependency50.P48 (densityPower)

/-- PDF p.4, §IV, Eq. (22). Standard cloning uses the same normalized
ancilla for both labels; the blank and environment need not be independent. -/
theorem standard_cloning_lowerBound {d : ℕ} (hd : 1 < d)
    {E : Type*} [Fintype E] [DecidableEq E] [Nonempty E]
    (rho1 rho2 : Matrix (Fin d) (Fin d) ℂ)
    (tau : Matrix (Fin d × E) (Fin d × E) ℂ)
    (V : Matrix.unitaryGroup ((Fin d × Fin d) × E) ℂ)
    (hrho1 : IsDensityMatrix rho1) (hrho2 : IsDensityMatrix rho2)
    (htau : IsDensityMatrix tau) (hdistinct : rho1 ≠ rho2) :
    standardBound (rootFidelity rho1 rho2) ≤ oneToTwoError rho1 rho2 tau tau V := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P97

end
Source
Lower bound on the relative error of mixed-state cloning and related operations, arXiv:quant-ph/0208159v2, PDF p. 4, §IV, Eq. (22)
Read-back

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

Let d>1d>1d>1 be a natural number, let EEE be a finite nonempty type with decidable equality, let ρ1≠ρ2\rho_1\ne\rho_2ρ1​=ρ2​ be positive semidefinite complex d×dd\times dd×d matrices of trace 111, let τ\tauτ be a positive semidefinite matrix of trace 111 on {0,…,d−1}×E\{0,\ldots,d-1\}\times E{0,…,d−1}×E, and let VVV be any unitary on ({0,…,d−1}2)×E(\{0,\ldots,d-1\}^{2})\times E({0,…,d−1}2)×E. Define

F(X,Y)=Re⁡tr⁡X YX,s(X,Y)=1−F(X,Y)2,f=F(ρ1,ρ2),F(X,Y)=\operatorname{Re}\operatorname{tr}\sqrt{\sqrt X\,Y\sqrt X}, \quad s(X,Y)=\sqrt{1-F(X,Y)^2}, \quad f=F(\rho_1,\rho_2),F(X,Y)=RetrX​YX​​,s(X,Y)=1−F(X,Y)2​,f=F(ρ1​,ρ2​),

and Oi=Tr⁡E[V(ρi⊗τ)V†]O_i=\operatorname{Tr}_E[V(\rho_i\otimes\tau)V^\dagger]Oi​=TrE​[V(ρi​⊗τ)V†], where partial trace sums entries with equal last-register coordinates. The theorem asserts

f−f21+f2≤s(O1,ρ1⊗ρ1)+s(O2,ρ2⊗ρ2)s(ρ1⊗ρ1,ρ2⊗ρ2).f-\frac{f^2}{\sqrt{1+f^2}} \le \frac{s(O_1,\rho_1\otimes\rho_1)+s(O_2,\rho_2\otimes\rho_2)} {s(\rho_1\otimes\rho_1,\rho_2\otimes\rho_2)}.f−1+f2​f2​≤s(ρ1​⊗ρ1​,ρ2​⊗ρ2​)s(O1​,ρ1​⊗ρ1​)+s(O2​,ρ2​⊗ρ2​)​.

The same τ\tauτ and VVV are used for both inputs. Matrix square roots use real continuous functional calculus, and any quotient with zero denominator is zero.

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

    Confirmed by the moderator at approval.

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