Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.2, equations (24)–(25): quantum Fano inequality

Proved
QAlgorithms.Papers.Independent.Support50.P41.quantumFano

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

prove2quantum

Let Φ\PhiΦ be a complex-linear completely positive trace-preserving map on a ddd-dimensional system, d≥1d\ge1d≥1, and let ψ\psiψ be any normalized purification of a density matrix ρ\rhoρ. Write Fe=⟨ψ∣(id⊗Φ)(∣ψ⟩⟨ψ∣)∣ψ⟩F_e=\langle\psi|(\mathrm{id}\otimes\Phi)(|\psi\rangle\langle\psi|)|\psi\rangleFe​=⟨ψ∣(id⊗Φ)(∣ψ⟩⟨ψ∣)∣ψ⟩ and SeS_eSe​ for the entropy of this joint output. Entropies and hhh are in bits. For d≥2d\ge2d≥2,

Se≤h(Fe)+(1−Fe)log⁡2(d2−1),Se≤1+2(1−Fe)log⁡2d.S_e\le h(F_e)+(1-F_e)\log_2(d^2-1),\qquad S_e\le1+2(1-F_e)\log_2d.Se​≤h(Fe​)+(1−Fe​)log2​(d2−1),Se​≤1+2(1−Fe​)log2​d.

For d=1d=1d=1, Fe=1F_e=1Fe​=1 and Se=0S_e=0Se​=0. This relates entanglement preservation to entropy exchange.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P41

open QAlgorithms

open QAlgorithms.Entanglement (IsCompletelyPositive)

open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)

open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)

open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)

open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)

open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)

open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.

local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _

/-- PDF pp.26--27, (24)--(25): quantum Fano inequality; the singleton branch avoids log zero. -/
theorem quantumFano {d a : ℕ} [NeZero d]
    (Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
    (hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace)
    (rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
    (psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi) :
    (d = 1 → purificationFidelity psi Phi = 1 ∧ entropyExchange Phi rho = 0) ∧
    (2 ≤ d → entropyExchange Phi rho ≤ binEntropy2 (purificationFidelity psi Phi) +
      (1 - purificationFidelity psi Phi) * Real.logb 2 ((d : ℝ)^2 - 1)) ∧
    entropyExchange Phi rho ≤ 1 + 2*(1-purificationFidelity psi Phi)*Real.logb 2 d := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 27, §6.2, equations (24)–(25): quantum Fano inequality
Read-back

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

Let d≥1d\ge1d≥1 and a≥0a\ge0a≥0 be integers, and let Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C) be complex linear, trace preserving on every matrix, and completely positive, meaning that id⁡r⊗Φ\operatorname{id}_r\otimes\Phiidr​⊗Φ preserves positive semidefiniteness for every integer r≥0r\ge0r≥0. Let ρ\rhoρ be positive semidefinite with tr⁡ρ=1\operatorname{tr}\rho=1trρ=1, and let ψ∈Ca⊗Cd\psi\in\mathbb C^a\otimes\mathbb C^dψ∈Ca⊗Cd satisfy ∥ψ∥=1\|\psi\|=1∥ψ∥=1 and ∑iψijψik‾=ρjk\sum_i\psi_{ij}\overline{\psi_{ik}}=\rho_{jk}∑i​ψij​ψik​​=ρjk​. Write Pψ=ψψ†P_\psi=\psi\psi^\daggerPψ​=ψψ†, F=Re⁡(ψ†(id⁡a⊗Φ)(Pψ)ψ)F=\operatorname{Re}\bigl(\psi^\dagger(\operatorname{id}_a\otimes\Phi)(P_\psi)\psi\bigr)F=Re(ψ†(ida​⊗Φ)(Pψ​)ψ), and E=S((id⁡d⊗Φ)(Pcρ))E=S((\operatorname{id}_d\otimes\Phi)(P_{c_\rho}))E=S((idd​⊗Φ)(Pcρ​​)), where cρc_\rhocρ​ is the canonical purification with coefficients (cρ)ij=(ρ)ji(c_\rho)_{ij}=(\sqrt{\rho})_{ji}(cρ​)ij​=(ρ​)ji​, expressed through the fixed enumeration of the input basis, and S(X)=−Re⁡tr⁡(g(X))S(X)=-\operatorname{Re}\operatorname{tr}(g(X))S(X)=−Retr(g(X)) for the spectral function g(t)=tlog⁡2tg(t)=t\log_2tg(t)=tlog2​t, with g(0)=0g(0)=0g(0)=0. Here id⁡⊗Φ\operatorname{id}\otimes\Phiid⊗Φ applies Φ\PhiΦ separately to each block indexed by the reference basis. Then d=1d=1d=1 implies F=1F=1F=1 and E=0E=0E=0; d≥2d\ge2d≥2 implies

E≤h2(F)+(1−F)log⁡2(d2−1);E\le h_2(F)+(1-F)\log_2(d^2-1);E≤h2​(F)+(1−F)log2​(d2−1);

and in every case E≤1+2(1−F)log⁡2dE\le1+2(1-F)\log_2dE≤1+2(1−F)log2​d, where h2(t)=[−tlog⁡t−(1−t)log⁡(1−t)]/log⁡2h_2(t)=[-t\log t-(1-t)\log(1-t)]/\log2h2​(t)=[−tlogt−(1−t)log(1−t)]/log2, with zero logarithmic terms interpreted as zero. Although a=0a=0a=0 is quantified over, no unit vector ψ\psiψ exists in that case.

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