Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Optimal Werner-state fidelity on the NPT branch and its boundary

Open
QAlgorithms.Papers.Independent.Intakethird100.P43.werner_fidelity

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All operators act on a finite bipartite space Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd in a fixed product basis. Write Γ=T2\Gamma=T_2Γ=T2​ for Bob's partial transpose and Pm=∣ψm⟩⟨ψm∣P_m=|\psi_m\rangle\langle\psi_m|Pm​=∣ψm​⟩⟨ψm​∣, where ∣ψm⟩=m−1/2∑i∣ii⟩|\psi_m\rangle=m^{-1/2}\sum_i|ii\rangle∣ψm​⟩=m−1/2∑i​∣ii⟩. A density operator is positive semidefinite with complex trace exactly one. An admissible PPT map is complex-linear, positive and trace preserving, and ΓoutTΓin\Gamma_{\rm out}T\Gamma_{\rm in}Γout​TΓin​ is positive on every positive operator. A PPT channel is additionally completely positive; complete positivity of the transpose-conjugated map is not required. Fidelity means the overlap tr⁡(PmT(ρ))\operatorname{tr}(P_m T(\rho))tr(Pm​T(ρ)).

Let d,m≥2d,m\ge2d,m≥2 be independent integers and 1/2≤p≤11/2\le p\le11/2≤p≤1. Let FFF swap the two local factors, P±=(I±F)/2P_\pm=(I\pm F)/2P±​=(I±F)/2, r±=d(d±1)/2r_\pm=d(d\pm1)/2r±​=d(d±1)/2, and

ρ(p)=(1−p)P+r++pP−r−.\rho(p)=(1-p)\frac{P_+}{r_+}+p\frac{P_-}{r_-}.ρ(p)=(1−p)r+​P+​​+pr−​P−​​.

Let PnegP_{\rm neg}Pneg​ be the negative spectral projector of ρ(p)Γ\rho(p)^\Gammaρ(p)Γ and set A=(I−2PnegΓ)/mA=(I-2P_{\rm neg}^\Gamma)/mA=(I−2PnegΓ​)/m. Then AAA is admissible and its isotropic PPT channel TAT_ATA​ attains the maximal fidelity FmF_mFm​, optimized over all admissible positive PPT maps:

tr⁡(ρ(p)A)=tr⁡(PmTA(ρ(p)))=Fm(ρ(p))=∥ρ(p)Γ∥1m=d−2+4pmd.\operatorname{tr}(\rho(p)A)=\operatorname{tr}(P_mT_A(\rho(p)))=F_m(\rho(p))=\frac{\|\rho(p)^\Gamma\|_1}m=\frac{d-2+4p}{md}.tr(ρ(p)A)=tr(Pm​TA​(ρ(p)))=Fm​(ρ(p))=m∥ρ(p)Γ∥1​​=mdd−2+4p​.

Here ∥⋅∥1\|\cdot\|_1∥⋅∥1​ is the trace norm. At p=1/2p=1/2p=1/2, the negative projector is zero and A=I/mA=I/mA=I/m. This gives an attained optimum, also attained by a channel.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P43
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P43

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P04
  (gamma copies bellProjector negativeProjector werner)

open QAlgorithms.Papers.Independent.Information100.P30 (IsPositiveMap)

/-- PDF p.3, (8)–(9): Werner optimality, with independent input and output dimensions.
SOURCE CORRECTION: (8) prints 0<=p<=1, but (9)'s value is valid only for p>=1/2.
We restrict to 1/2<=p<=1, as required by the preceding NPT construction; at p=1/2
P_neg=0 and A=I/m is used directly. At d=m=2,p=0 the printed value is zero,
contradicting the achievable product-state overlap 1/2. The PDF has no extra /m on
Tr[A rho(p)]. Independent moderation of this correction is required. -/
theorem werner_fidelity (d m : ℕ) (hd : 2 ≤ d) (hm : 2 ≤ m)
    (p : ℝ) (hp : 1/2 ≤ p) (hpone : p ≤ 1) :
    let rho := werner d p
    let A := negativeSpaceWitness rho m 2
    RainsFeasibleEffect m A ∧ IsPositiveConjugatePPTChannel (isotropicPreparation m A) ∧
      effectProb A rho = traceNorm (gamma rho) / (m : ℝ) ∧
      effectProb (bellProjector m) (isotropicPreparation m A rho) = traceNorm (gamma rho) / (m : ℝ) ∧
      traceNorm (gamma rho) / (m : ℝ) = ((d : ℝ) - 2 + 4*p) / ((m : ℝ)*d) ∧
      IsGreatest (positivePPTFidelityValues rho m) (traceNorm (gamma rho) / (m : ℝ)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P43

end
Source
Distillability via protocols respecting the positivity of partial transpose, arXiv:quant-ph/0104095v2, PDF p. 3, Eqs. (8)–(9) and optimality sentence
Read-back

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

For every pair of natural numbers d,m≥2d,m\ge2d,m≥2 and every real p∈[1/2,1]p\in[1/2,1]p∈[1/2,1], including both endpoints, let S(a,b),(a′,b′)S_{(a,b),(a',b')}S(a,b),(a′,b′)​ be one if a=b′a=b'a=b′ and b=a′b=a'b=a′, and zero otherwise, and set

P0=I+S2,P1=I−P0,ρ=2(1−p)d(d+1)P0+2pd(d−1)P1.P_0=\frac{I+S}{2},\qquad P_1=I-P_0,\qquad \rho=\frac{2(1-p)}{d(d+1)}P_0+\frac{2p}{d(d-1)}P_1.P0​=2I+S​,P1​=I−P0​,ρ=d(d+1)2(1−p)​P0​+d(d−1)2p​P1​.

Define (ΓX)(a,b),(a′,b′)=X(a,b′),(a′,b)(\Gamma X)_{(a,b),(a',b')}=X_{(a,b'),(a',b)}(ΓX)(a,b),(a′,b′)​=X(a,b′),(a′,b)​, let Q=1(−∞,0)(Γρ)Q=\mathbf1_{(-\infty,0)}(\Gamma\rho)Q=1(−∞,0)​(Γρ) be the matrix obtained by functional calculus from the indicator of strictly negative eigenvalues, and set A=(I−2ΓQ)/mA=(I-2\Gamma Q)/mA=(I−2ΓQ)/m. Let PmP_mPm​ have entry 1/m1/m1/m when both row and column pairs have equal components and zero otherwise, and define Pm(A)(X)=tr⁡(X(I−A))(I−Pm)/(m2−1)+tr⁡(XA)Pm\mathcal P_m(A)(X)=\operatorname{tr}(X(I-A))(I-P_m)/(m^2-1)+\operatorname{tr}(XA)P_mPm​(A)(X)=tr(X(I−A))(I−Pm​)/(m2−1)+tr(XA)Pm​. Then AAA is Hermitian and AAA, I−AI-AI−A, I−mΓAI-m\Gamma AI−mΓA, and I+mΓAI+m\Gamma AI+mΓA are positive semidefinite. The map Pm(A)\mathcal P_m(A)Pm​(A) is positive, trace preserving, completely positive, and has ΓPm(A)(ΓX)≥0\Gamma\mathcal P_m(A)(\Gamma X)\ge0ΓPm​(A)(ΓX)≥0 for every X≥0X\ge0X≥0, where complete positivity requires preservation of positivity under blockwise extension by every finite identity map, including auxiliary size zero. Moreover,

Re⁡tr⁡(Aρ)=Re⁡tr⁡ ⁣(PmPm(A)(ρ))=∥Γρ∥1m=d−2+4pmd,∥Y∥1=Re⁡tr⁡Y†Y.\operatorname{Re}\operatorname{tr}(A\rho) =\operatorname{Re}\operatorname{tr}\!\bigl(P_m\mathcal P_m(A)(\rho)\bigr) =\frac{\|\Gamma\rho\|_1}{m} =\frac{d-2+4p}{md}, \qquad \|Y\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Y^\dagger Y}.Retr(Aρ)=Retr(Pm​Pm​(A)(ρ))=m∥Γρ∥1​​=mdd−2+4p​,∥Y∥1​=RetrY†Y​.

This value is the greatest element of the set of numbers Re⁡tr⁡(PmT(ρ))\operatorname{Re}\operatorname{tr}(P_mT(\rho))Retr(Pm​T(ρ)) as TTT ranges over all complex-linear maps to matrices indexed by {0,…,m−1}2\{0,\ldots,m-1\}^2{0,…,m−1}2 that are positive, preserve every matrix’s trace, and satisfy ΓT(ΓX)≥0\Gamma T(\Gamma X)\ge0ΓT(ΓX)≥0 for every X≥0X\ge0X≥0: the value belongs to this set and bounds every member above, without any complete-positivity requirement on the maps defining the set.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me