Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Eq.(36), Methods IV.C: exact amplitude-damping simulation error

Open
QAlgorithms.Papers.Independent.Intakethird100.P49.amplitude_damping_simulation_error

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

prove2quantum

Let p∈[0,1]p\in[0,1]p∈[0,1], integer M≥2M\ge2M≥2, and let ξM\xi_MξM​ be the standard qubit PBT number. For the actual channel Ep\mathcal E_pEp​ with excited state ∣1⟩|1\rangle∣1⟩ decaying to ∣0⟩|0\rangle∣0⟩, set EpM=Ep∘Γ2,M\mathcal E_p^M=\mathcal E_p\circ\Gamma_{2,M}EpM​=Ep​∘Γ2,M​. Its unhalved diamond error is

∥Ep−EpM∥⋄=ξM(1−p2+1−p).\|\mathcal E_p-\mathcal E_p^M\|_\diamond=\xi_M\left(\frac{1-p}{2}+\sqrt{1-p}\right).∥Ep​−EpM​∥⋄​=ξM​(21−p​+1−p​).

This makes the channel-specific bound computable. The supporting Choi calculation corrects the second diagonal in printed Eq. (59) from (1−p)ξM(1-p)\xi_M(1−p)ξM​ to (1−p)ξM/4(1-p)\xi_M/4(1−p)ξM​/4, as required by the Kraus action and unit trace; independent moderation of this correction is pending.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P49
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P49

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder BigOperators

attribute [local instance] Classical.propDecidable Classical.decEq

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

open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)

open QAlgorithms.Papers.Independent.Information100.P71 (diamond AdaptiveTest adaptiveInput adaptiveAccept)

open QAlgorithms.Papers.Independent.Bridge50.P25
  (LOCCOn normalizedChannelChoi TwoWayGenerationCode TwoWayChannelProtocol
   generationCodeError twoWayGenerationCapacity sendChannelRegister StateFunctional
   IsDimensionChangingLOCCMonotone privateStateInPartyOrder)

open QAlgorithms.Papers.Independent.Support50.P07 (amplitudeDampingChannel)

/-- PDF p.7, (36), Methods p.9: actual diamond simulation error.
Source correction in supporting (59): printed second diagonal (1-p)*xi
must be (1-p)*xi/4, as forced by applying (33) to (57) and unit trace.
This correction requires independent moderation. -/
theorem amplitude_damping_simulation_error (M : ℕ) (hM : 2 ≤ M)
    (p : ℝ) (hp : p ∈ Set.Icc 0 1) :
    diamond (fun X => amplitudeDampingChannel p X -
      simulated (amplitudeDampingChannel p) M X) = dampingSimulationError M p := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P49

end
Source
Fundamental limits to quantum channel discrimination, arXiv:1803.02834v4, PDF p. 7, Eq.(36), Methods IV.C: exact amplitude-damping simulation error
Read-back

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

For every natural number M≥2M\ge2M≥2 and real number p∈[0,1]p\in[0,1]p∈[0,1], let

Ap(X)=(1001−p)X(1001−p)+(0p00)X(00p0).\mathcal A_p(X)= \begin{pmatrix}1&0\\0&\sqrt{1-p}\end{pmatrix} X \begin{pmatrix}1&0\\0&\sqrt{1-p}\end{pmatrix} + \begin{pmatrix}0&\sqrt p\\0&0\end{pmatrix} X \begin{pmatrix}0&0\\\sqrt p&0\end{pmatrix}.Ap​(X)=(10​01−p​​)X(10​01−p​​)+(00​p​0​)X(0p​​00​).

Construct the qubit port map PM\mathcal P_MPM​ by setting Si[(x,a),(y,b)]=121{x=ai, y=bi, aj=bj ∀j≠i}S_i[(x,a),(y,b)]=\frac12\mathbf1_{\{x=a_i,\ y=b_i,\ a_j=b_j\ \forall j\ne i\}}Si​[(x,a),(y,b)]=21​1{x=ai​, y=bi​, aj​=bj​ ∀j=i}​, S=∑iSiS=\sum_iS_iS=∑i​Si​, R=f(S)R=f(S)R=f(S) with f(t)=(t)−1f(t)=(\sqrt t)^{-1}f(t)=(t​)−1 and f(0)=0f(0)=0f(0)=0, and Qi=RSiR+M−1(I−RSR)Q_i=RS_iR+M^{-1}(I-RSR)Qi​=RSi​R+M−1(I−RSR); on X⊗Φ2⊗MX\otimes\Phi_2^{\otimes M}X⊗Φ2⊗M​, where Φ2=12∑x,y∣x,x⟩⟨y,y∣\Phi_2=\frac12\sum_{x,y}|x,x\rangle\langle y,y|Φ2​=21​∑x,y​∣x,x⟩⟨y,y∣, contract the input and first halves against QiQ_iQi​, retain second-half port iii, and sum over iii. Write νM=1−Re⁡(PM(∣0⟩⟨1∣)0,1)\nu_M=1-\operatorname{Re}(\mathcal P_M(|0\rangle\langle1|)_{0,1})νM​=1−Re(PM​(∣0⟩⟨1∣)0,1​), and define

Δ2(F)=sup⁡∥X∥1≤1∥(id⁡2⊗F)(X)∥1,∥X∥1=Re⁡tr⁡X†X,\Delta_2(\mathcal F)= \sup_{\|X\|_1\le1}\|(\operatorname{id}_2\otimes\mathcal F)(X)\|_1, \qquad \|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X},Δ2​(F)=∥X∥1​≤1sup​∥(id2​⊗F)(X)∥1​,∥X∥1​=RetrX†X​,

where XXX ranges over all matrices on two qubits. Then the error of the composed simulation is exactly

Δ2(Ap−Ap∘PM)=νM(1−p2+1−p).\Delta_2(\mathcal A_p-\mathcal A_p\circ\mathcal P_M) =\nu_M\left(\frac{1-p}{2}+\sqrt{1-p}\right).Δ2​(Ap​−Ap​∘PM​)=νM​(21−p​+1−p​).

The parameter values p=0p=0p=0 and p=1p=1p=1 are included.

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