Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pure-blank two-register unitaries do not attain the standard bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P97.standard_bound_nonattainment

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 s,b∈Hs,b\in Hs,b∈H be arbitrary unit vectors. Put ρ1=I/d\rho_1=I/dρ1​=I/d and ρ2=∣s⟩⟨s∣\rho_2=|s\rangle\langle s|ρ2​=∣s⟩⟨s∣. For every unitary VVV acting on HA⊗HBH_A\otimes H_BHA​⊗HB​ only, use the same pure blank ∣b⟩⟨b∣|b\rangle\langle b|∣b⟩⟨b∣ for both labels and define ρ~j=V(ρj⊗∣b⟩⟨b∣)V†\widetilde\rho_j=V(\rho_j\otimes|b\rangle\langle b|)V^\daggerρ​j​=V(ρj​⊗∣b⟩⟨b∣)V†. The joint-output relative error is strictly above the standard bound:

D(ρ~1,ρ1⊗ρ1)+D(ρ~2,ρ2⊗ρ2)D(ρ1⊗ρ1,ρ2⊗ρ2)>f−f21+f2.\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)}>f-\frac{f^2}{\sqrt{1+f^2}}.D(ρ1​⊗ρ1​,ρ2​⊗ρ2​)D(ρ​1​,ρ1​⊗ρ1​)+D(ρ​2​,ρ2​⊗ρ2​)​>f−1+f2​f2​.

This rules out saturation under P1–P2 for the specified maximally mixed/pure pairs. The claim concerns no discarded environment and imposes no conclusion on general mixed-ancilla cloners.

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.5, §V, P1--P2: a unitary on `H tensor H` with a common pure
blank cannot attain Eq. (22) for `{I/d, |s><s|}`. No environment is
silently discarded, and no assertion about general cloners is made. -/
theorem standard_bound_nonattainment {d : ℕ} (hd : 1 < d)
    (s blank : EuclideanSpace ℂ (Fin d)) (hs : IsState s) (hblank : IsState blank)
    (V : Matrix.unitaryGroup (Fin d × Fin d) ℂ) :
    let rho1 : Matrix (Fin d) (Fin d) ℂ := (1 / (d : ℂ)) • 1
    let rho2 := pureDensity s
    let out := fun rho : Matrix (Fin d) (Fin d) ℂ =>
      (V : Matrix _ _ ℂ) * Matrix.kronecker rho (pureDensity blank) * (V : Matrix _ _ ℂ)ᴴ
    standardBound (rootFidelity rho1 rho2) <
      relativeError (out rho1) (out rho2)
        (Matrix.kronecker rho1 rho1) (Matrix.kronecker rho2 rho2) := 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. 5, §V, P1–P2 and the following paragraph
Read-back

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

For every natural number d>1d>1d>1, every pair of vectors s,b∈Cds,b\in\mathbb C^ds,b∈Cd with ∥s∥=∥b∥=1\|s\|=\|b\|=1∥s∥=∥b∥=1, and every unitary matrix VVV on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd, set ρ1=Id/d\rho_1=I_d/dρ1​=Id​/d, ρ2=ss†\rho_2=ss^\daggerρ2​=ss†, and O(ρ)=V(ρ⊗bb†)V†O(\rho)=V(\rho\otimes bb^\dagger)V^\daggerO(ρ)=V(ρ⊗bb†)V†, where vv†vv^\daggervv† has entries vivj‾v_i\overline{v_j}vi​vj​​. For positive semidefinite matrices define

F(ρ,σ)=Re⁡tr⁡ρ σ ρ,D(ρ,σ)=1−F(ρ,σ)2,F(\rho,\sigma)=\operatorname{Re}\operatorname{tr} \sqrt{\sqrt{\rho}\,\sigma\,\sqrt{\rho}}, \qquad D(\rho,\sigma)=\sqrt{1-F(\rho,\sigma)^2},F(ρ,σ)=Retrρ​σρ​​,D(ρ,σ)=1−F(ρ,σ)2​,

using positive semidefinite matrix square roots. Writing f=F(ρ1,ρ2)f=F(\rho_1,\rho_2)f=F(ρ1​,ρ2​), the assertion is the strict inequality

f−f21+f2<D ⁣(O(ρ1),ρ1⊗ρ1)+D ⁣(O(ρ2),ρ2⊗ρ2)D ⁣(ρ1⊗ρ1,ρ2⊗ρ2).f-\frac{f^2}{\sqrt{1+f^2}} < \frac{ D\!\left(O(\rho_1),\rho_1\otimes\rho_1\right) + D\!\left(O(\rho_2),\rho_2\otimes\rho_2\right)} {D\!\left(\rho_1\otimes\rho_1,\rho_2\otimes\rho_2\right)}.f−1+f2​f2​<D(ρ1​⊗ρ1​,ρ2​⊗ρ2​)D(O(ρ1​),ρ1​⊗ρ1​)+D(O(ρ2​),ρ2​⊗ρ2​)​.

Thus the numerator is the unweighted sum of the two distances. The dimension restriction excludes d=0d=0d=0 and d=1d=1d=1.

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