Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Maximal survival probability is stable under an ideal ancilla

Proved
QAlgorithms.Papers.Independent.Support50.P31.selfFidelityIdealChannel

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let Φ\PhiΦ be a completely positive trace-preserving endomorphism on the operators of a nonzero finite-dimensional complex Hilbert space HHH. Define its maximal survival probability by

ν♭(Φ)=sup⁡∥ψ∥=1⟨ψ,Φ(∣ψ⟩⟨ψ∣)ψ⟩.\nu_\flat(\Phi) =\sup_{\|\psi\|=1}\langle\psi,\Phi(|\psi\rangle\langle\psi|)\psi\rangle .ν♭​(Φ)=∥ψ∥=1sup​⟨ψ,Φ(∣ψ⟩⟨ψ∣)ψ⟩.

For the identity channel on any nonzero finite-dimensional ancillary space AAA,

ν♭(Id⁡A⊗Φ)=ν♭(Φ).\nu_\flat(\operatorname{Id}_A\otimes\Phi)=\nu_\flat(\Phi).ν♭​(IdA​⊗Φ)=ν♭​(Φ).

The joint supremum allows all unit vectors in A⊗HA\otimes HA⊗H, including entangled vectors. Equal input and output algebras are part of the endomorphism assumption. This is maximal survival probability, rather than minimal, average, or entanglement fidelity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P31
Formal statement
noncomputable section

open Filter Asymptotics

open scoped ComplexConjugate ENNReal

namespace QAlgorithms.Papers.Independent.Support50.P31

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

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

open QAlgorithms.Papers.Independent.Gap48.P03 (holevoQuantity)

open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)

open QAlgorithms.Papers.Independent.Dependency50.P44 (tensorChannels)

/-- PDF pp.6–7, (13): stability of maximal survival probability, for an endomorphism.
This is not a minimal or average gate fidelity. Ideal register is written first. -/
theorem selfFidelityIdealChannel {I J : Type} [Fintype I] [DecidableEq I] [Nonempty I]
    [Fintype J] [DecidableEq J] [Nonempty J] (Phi : Superop I I) (hPhi : IsChannel Phi) :
    nuFlat (idTensorSuperop (R := J) Phi) = nuFlat Phi := by sorry

end QAlgorithms.Papers.Independent.Support50.P31

end
Source
On some additivity problems in quantum information theory, arXiv:math-ph/0003002v2, PDF p. 6, §3, equation (13): stability of maximal self-fidelity
Read-back

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

Let I,JI,JI,J be finite nonempty types with decidable equality, and let Φ\PhiΦ be a map on complex I×II\times II×I matrices admitting a finite Kraus representation Φ(X)=∑jAjXAj†\Phi(X)=\sum_jA_jXA_j^\daggerΦ(X)=∑j​Aj​XAj†​ with ∑jAj†Aj=I\sum_jA_j^\dagger A_j=I∑j​Aj†​Aj​=I. Define Φ^\widehat\PhiΦ on matrices indexed by J×IJ\times IJ×I by Φ^(X)(a,i),(b,j)=Φ(Xa,b)i,j\widehat\Phi(X)_{(a,i),(b,j)}=\Phi(X^{a,b})_{i,j}Φ(X)(a,i),(b,j)​=Φ(Xa,b)i,j​, where Xk,la,b=X(a,k),(b,l)X^{a,b}_{k,l}=X_{(a,k),(b,l)}Xk,la,b​=X(a,k),(b,l)​. For any such map Θ\ThetaΘ, define

νflat(Θ)=sup⁡∥v∥2=1Re⁡tr⁡ ⁣(vv† Θ(vv†)),\nu_{\mathrm{flat}}(\Theta) =\sup_{\|v\|_2=1}\operatorname{Re}\operatorname{tr}\!\left(vv^\dagger\,\Theta(vv^\dagger)\right),νflat​(Θ)=∥v∥2​=1sup​Retr(vv†Θ(vv†)),

with vvv ranging over the Euclidean complex vector space on the input index type of Θ\ThetaΘ. Then νflat(Φ^)=νflat(Φ)\nu_{\mathrm{flat}}(\widehat\Phi)=\nu_{\mathrm{flat}}(\Phi)νflat​(Φ)=νflat​(Φ).

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · 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