Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section IV.B: amplitude-damping bound for independent phase/amplitude errors

Open
QAlgorithms.Papers.Independent.Support50.P07.independentPauli_privateCapacity_bound

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

prove2quantum

Let 0≤q≤1/20\le q\le1/20≤q≤1/2 and define Nq(ρ)=(1−q(2−q))ρ+q(1−q)XρX+q2YρY+q(1−q)ZρZ\mathcal N_q(\rho)=(1-q(2-q))\rho+q(1-q)X\rho X+q^2Y\rho Y+q(1-q)Z\rho ZNq​(ρ)=(1−q(2−q))ρ+q(1−q)XρX+q2YρY+q(1−q)ZρZ. Set γq=4q(1−q)\gamma_q=4q(1-q)γq​=4q(1−q) and f(γ)=max⁡t∈[0,1][H(t(1−γ))−H(tγ)]f(\gamma)=\max_{t\in[0,1]}[H(t(1-\gamma))-H(t\gamma)]f(γ)=maxt∈[0,1]​[H(t(1−γ))−H(tγ)]. Then

Cp(Nq)≤f(γq).C_p(\mathcal N_q)\le f(\gamma_q).Cp​(Nq​)≤f(γq​).

All quantum registers are finite and nonzero, states have trace one, pure vectors have norm one, and entropy and logarithms are in bits. Operational private capacities use memoryless powers, positive blocklengths and message counts, uniform messages, arbitrary mixed block inputs, and normalized decoding POVMs. A code is good when its joint decoded message/environment state has full trace norm less than the error from a perfectly correlated uniform pair tensor its actual common environment marginal. Rates use every positive error and rate slack at all sufficiently large blocklengths. Symmetric assistance allows one arbitrary finite symmetric channel per block without charging its dimension.

This result supplies a capacity identity or bound for the channel family and resource model stated above.

The exact decomposition is retained: with R=(I+iX)/2R=(I+iX)/\sqrt2R=(I+iX)/2​ and γ=4q(1−q)\gamma=4q(1-q)γ=4q(1−q),

Nq(ρ)=12RAD⁡γ(R†ρR)R†+12RXAD⁡γ(XR†ρRX)XR†.\mathcal N_q(\rho)=\tfrac12R\operatorname{AD}_\gamma(R^\dagger\rho R)R^\dagger+\tfrac12RX\operatorname{AD}_\gamma(XR^\dagger\rho RX)XR^\dagger.Nq​(ρ)=21​RADγ​(R†ρR)R†+21​RXADγ​(XR†ρRX)XR†.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P07
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Support50.P07

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
    dilationPower idealJoint maximumCoherentInformation)

open QAlgorithms.Papers.Independent.Claimed50.P24 (productDilation)

open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation)

variable {A B E C D F : Type}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype E] [DecidableEq E] [Fintype C] [DecidableEq C]

variable [Fintype D] [DecidableEq D] [Fintype F] [DecidableEq F]

/-- Section IV.B, PDF p.6, SOURCE DOMAIN CORRECTION: the printed rotated damping
identity uses sqrt((1-2q)^2)=1-2q, so only its q<=1/2 branch is transcribed. At q=1
it would identify conjugation by Y with the identity. The exact equal mixture is
retained, with R=(I+iX)/sqrt(2)=exp(i*pi*X/4). No all-q relabeling is assumed. -/
theorem independentPauli_privateCapacity_bound [Nonempty E]
    (U : Matrix (Fin 2 × E) (Fin 2) ℂ)
    (hU : IsIsometry U) (q : ℝ) (hq : q ∈ Set.Icc 0 (1 / 2))
    (hmap : receiverChannel U = independentPauliChannel q) :
    let rot : Matrix (Fin 2) (Fin 2) ℂ :=
      (Real.sqrt 2 : ℂ)⁻¹ • (1 + Complex.I • pauliMatrices 1)
    independentPauliChannel q = (fun rho =>
      (1 / 2 : ℂ) •
        (rot * amplitudeDampingChannel (4 * q * (1 - q)) (rotᴴ * rho * rot) * rotᴴ) +
      (1 / 2 : ℂ) •
        (rot * pauliMatrices 1 *
          amplitudeDampingChannel (4 * q * (1 - q))
            (pauliMatrices 1 * rotᴴ * rho * rot * pauliMatrices 1) *
          pauliMatrices 1 * rotᴴ)) ∧
    fullTracePrivateCapacity U ≤ dampingBound (4 * q * (1 - q)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P07

end
Source
The private classical capacity with a symmetric side channel and its application to quantum cryptography, arXiv:0705.3838v1, PDF p. 6, Section IV.B: amplitude-damping bound for independent phase/amplitude errors
Read-back

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

Let EEE be a finite, nonempty type with decidable equality, let U:C2→C2⊗CEU:\mathbb C^2\to\mathbb C^2\otimes\mathbb C^EU:C2→C2⊗CE satisfy U†U=I2U^\dagger U=I_2U†U=I2​, and let q∈[0,12]q\in[0,\tfrac12]q∈[0,21​]. With

X=(0110),Y=(0−ii0),Z=(100−1),X=\begin{pmatrix}0&1\\1&0\end{pmatrix},\quad Y=\begin{pmatrix}0&-i\\i&0\end{pmatrix},\quad Z=\begin{pmatrix}1&0\\0&-1\end{pmatrix},X=(01​10​),Y=(0i​−i0​),Z=(10​0−1​),

define

Pq(ρ)=(1−q)2ρ+q(1−q)XρX+q2YρY+q(1−q)ZρZ,\mathcal P_q(\rho)=(1-q)^2\rho+q(1-q)X\rho X+q^2Y\rho Y+q(1-q)Z\rho Z,Pq​(ρ)=(1−q)2ρ+q(1−q)XρX+q2YρY+q(1−q)ZρZ,

and assume that Tr⁡E(UρU†)=Pq(ρ)\operatorname{Tr}_E(U\rho U^\dagger)=\mathcal P_q(\rho)TrE​(UρU†)=Pq​(ρ) for every matrix ρ\rhoρ. Put γ=4q(1−q)\gamma=4q(1-q)γ=4q(1−q), R=(I+iX)/2R=(I+iX)/\sqrt2R=(I+iX)/2​, and define

Aγ(ρ)=K0ρK0†+K1ρK1†,K0=(1001−γ),K1=(0γ00).\mathcal A_\gamma(\rho)=K_0\rho K_0^\dagger+K_1\rho K_1^\dagger,\qquad K_0=\begin{pmatrix}1&0\\0&\sqrt{1-\gamma}\end{pmatrix},\quad K_1=\begin{pmatrix}0&\sqrt\gamma\\0&0\end{pmatrix}.Aγ​(ρ)=K0​ρK0†​+K1​ρK1†​,K0​=(10​01−γ​​),K1​=(00​γ​0​).

Define Ptr(U)P_{\mathrm{tr}}(U)Ptr​(U) as the real supremum of rates r≥0r\ge0r≥0 such that, for every ε>0\varepsilon>0ε>0 and s>0s>0s>0, there is an integer n0>0n_0>0n0​>0 such that every n≥n0n\ge n_0n≥n0​ admits M>0M>0M>0, input density matrices ρm\rho_mρm​, and a receiver measurement Qj≥0Q_j\ge0Qj​≥0, ∑jQj=I\sum_jQ_j=I∑j​Qj​=I, for which r−s≤log⁡2M/nr-s\le\log_2M/nr−s≤log2​M/n and

∥Ω−1M∑m∣m,m⟩⟨m,m∣⊗Tr⁡m,jΩ∥1<ε.\left\|\Omega-\frac1M\sum_m|m,m\rangle\langle m,m|\otimes\operatorname{Tr}_{m,j}\Omega\right\|_1<\varepsilon.​Ω−M1​m∑​∣m,m⟩⟨m,m∣⊗Trm,j​Ω​1​<ε.

Here density means positive semidefinite of trace 111, ∥T∥1=Tr⁡T†T\|T\|_1=\operatorname{Tr}\sqrt{T^\dagger T}∥T∥1​=TrT†T​, and Ω\OmegaΩ has zero entries between distinct classical labels and blocks

Ω(m,j,e),(m,j,e′)=1M∑b,c(Qj)c,b(U⊗nρm(U⊗n)†)(b,e),(c,e′).\Omega_{(m,j,e),(m,j,e')}=\frac1M\sum_{b,c}(Q_j)_{c,b} (U^{\otimes n}\rho_m(U^{\otimes n})^\dagger)_{(b,e),(c,e')}.Ω(m,j,e),(m,j,e′)​=M1​b,c∑​(Qj​)c,b​(U⊗nρm​(U⊗n)†)(b,e),(c,e′)​.

Let

D(γ)=sup⁡t∈[0,1][H2(t(1−γ))−H2(tγ)],D(\gamma)=\sup_{t\in[0,1]}\bigl[H_2(t(1-\gamma))-H_2(t\gamma)\bigr],D(γ)=t∈[0,1]sup​[H2​(t(1−γ))−H2​(tγ)],

where H2(x)=[−xlog⁡x−(1−x)log⁡(1−x)]/log⁡2H_2(x)=[-x\log x-(1-x)\log(1-x)]/\log2H2​(x)=[−xlogx−(1−x)log(1−x)]/log2, with 0log⁡0=00\log0=00log0=0. The assertion is both the following equality of maps on all matrices and the following capacity bound:

Pq(ρ)=12R Aγ(R†ρR) R†+12RX Aγ(XR†ρRX) XR†,Ptr(U)≤D(γ).\mathcal P_q(\rho)= \frac12R\,\mathcal A_\gamma(R^\dagger\rho R)\,R^\dagger+ \frac12RX\,\mathcal A_\gamma(XR^\dagger\rho RX)\,XR^\dagger, \qquad P_{\mathrm{tr}}(U)\le D(\gamma).Pq​(ρ)=21​RAγ​(R†ρR)R†+21​RXAγ​(XR†ρRX)XR†,Ptr​(U)≤D(γ).

The endpoints q=0q=0q=0 and q=12q=\tfrac12q=21​, hence γ=0\gamma=0γ=0 and γ=1\gamma=1γ=1, are included.

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