Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.1.4 (6.30)–(6.32): quantum guessing probability

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.quantum_guessing

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here FFF is squared algebraic fidelity, F∗F_*F∗​ is squared generalized fidelity, P=1−F∗P=\sqrt{1-F_*}P=1−F∗​​ is purified distance, and Δ(ρ,τ)=max⁡0≤M≤I∣Tr⁡((ρ−τ)M)∣\Delta(\rho,\tau)=\max_{0\le M\le I}|\operatorname{Tr}((\rho-\tau)M)|Δ(ρ,τ)=max0≤M≤I​∣Tr((ρ−τ)M)∣. The symbols Hmin⁡H_{\min}Hmin​ and Hmax⁡H_{\max}Hmax​ denote conditional min- and max-entropy, with values +∞+\infty+∞ and −∞-\infty−∞ at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies 0≤ε<Tr⁡ρ0\le\varepsilon<\sqrt{\operatorname{Tr}\rho}0≤ε<Trρ​.

For CQ input blocks ρ_B(x), exp(−Hmin(X|B))=max_{POVM M}Σ_x Tr M_xρ_B(x), with an attaining POVM. The same measurement produces a classical Y for which Hmin(X|Y)=Hmin(X|B).

2−Hmin⁡(X∣B)ρ=max⁡{Mx} POVM∑xTr⁡(MxρB(x)),Hmin⁡(X∣Y)M(ρ)=Hmin⁡(X∣B)ρ.2^{-H_{\min}(X|B)_\rho}=\max_{\{M_x\}\text{ POVM}}\sum_x\operatorname{Tr}(M_x\rho_B(x)),\qquad H_{\min}(X|Y)_{\mathcal M(\rho)}=H_{\min}(X|B)_\rho.2−Hmin​(X∣B)ρ​={Mx​} POVMmax​x∑​Tr(Mx​ρB​(x)),Hmin​(X∣Y)M(ρ)​=Hmin​(X∣B)ρ​.

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
noncomputable section

open Filter

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P07

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J A B C D X Y Z : Type*}

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

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

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z]

/-- NODE paper:1504.00233#6.guessing
§6.1.4 (6.30)–(6.32): quantum guessing probability, arXiv:1504.00233v5, PDF p.97. -/
theorem quantum_guessing [Nonempty X] [Nonempty B] (r : X → paperMat B)
    (hr : ∀ x, (r x).PosSemidef) (ht : (∑ x, (r x).trace.re) ≤ 1) :
    ∃ M : X → paperMat B, IsPOVM M ∧ ENNReal.ofReal (guessObjective r M) = expE (-paperHmin (paperCqState r)) ∧
      (∀ N : X → paperMat B, IsPOVM N → guessObjective r N ≤ guessObjective r M) ∧
      paperHmin (paperMeasuredJoint r M) = paperHmin (paperCqState r) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 97, §6.1.4 (6.30)–(6.32): quantum guessing probability
Read-back

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

Let X,BX,BX,B be nonempty finite types with decidable equality, and let rxr_xrx​ be a matrix on BBB for each x∈Xx\in Xx∈X, with rx⪰0r_x\succeq0rx​⪰0 and ∑xRe⁡tr⁡rx≤1\sum_x\operatorname{Re}\operatorname{tr}r_x\le1∑x​Retrrx​≤1; the individual matrices need not have trace 111, and all may be zero. Form the matrix RRR on X×BX\times BX×B by

R(x,b),(x′,b′)={(rx)bb′x=x′,0x≠x′.R_{(x,b),(x',b')}= \begin{cases} (r_x)_{bb'}&x=x',\\ 0&x\ne x'. \end{cases}R(x,b),(x′,b′)​={(rx​)bb′​0​x=x′,x=x′.​

For a matrix QQQ on a product U×VU\times VU×V, define its extended-real quantity

Hmin⁡(Q)=sup⁡{ℓ∈R:∃s⪰0, Re⁡tr⁡s≤1, Q⪯2−ℓ(1U⊗s)},H_{\min}(Q)= \sup\left\{\ell\in\mathbb R: \exists s\succeq0,\ \operatorname{Re}\operatorname{tr}s\le1,\ Q\preceq 2^{-\ell}(1_U\otimes s)\right\},Hmin​(Q)=sup{ℓ∈R:∃s⪰0, Retrs≤1, Q⪯2−ℓ(1U​⊗s)},

where Q⪯TQ\preceq TQ⪯T means T−Q⪰0T-Q\succeq0T−Q⪰0. There exists a family of matrices MxM_xMx​ on BBB such that Mx⪰0M_x\succeq0Mx​⪰0 for every xxx, ∑xMx=1B\sum_xM_x=1_B∑x​Mx​=1B​, and, writing

G(r,M)=∑xRe⁡tr⁡(Mxrx),J(x,y),(x′,y′)={Re⁡tr⁡(Myrx)(x,y)=(x′,y′),0otherwise,G(r,M)=\sum_x\operatorname{Re}\operatorname{tr}(M_xr_x), \qquad J_{(x,y),(x',y')}= \begin{cases} \operatorname{Re}\operatorname{tr}(M_y r_x)&(x,y)=(x',y'),\\ 0&\text{otherwise}, \end{cases}G(r,M)=x∑​Retr(Mx​rx​),J(x,y),(x′,y′)​={Retr(My​rx​)0​(x,y)=(x′,y′),otherwise,​

one has

ofReal⁡(G(r,M))=Exp⁡2(−Hmin⁡(R)),Hmin⁡(J)=Hmin⁡(R).\operatorname{ofReal}(G(r,M))=\operatorname{Exp}_2(-H_{\min}(R)), \qquad H_{\min}(J)=H_{\min}(R).ofReal(G(r,M))=Exp2​(−Hmin​(R)),Hmin​(J)=Hmin​(R).

Moreover, G(r,N)≤G(r,M)G(r,N)\le G(r,M)G(r,N)≤G(r,M) for every other family Nx⪰0N_x\succeq0Nx​⪰0 with ∑xNx=1B\sum_xN_x=1_B∑x​Nx​=1B​. The function ofReal⁡\operatorname{ofReal}ofReal sends a real number to its nonnegative part in [0,∞][0,\infty][0,∞]; Exp⁡2(+∞)=+∞\operatorname{Exp}_2(+\infty)=+\inftyExp2​(+∞)=+∞, Exp⁡2(−∞)=0\operatorname{Exp}_2(-\infty)=0Exp2​(−∞)=0, and Exp⁡2(h)=ofReal⁡(2h)\operatorname{Exp}_2(h)=\operatorname{ofReal}(2^h)Exp2​(h)=ofReal(2h) for finite hhh. Suprema defining Hmin⁡H_{\min}Hmin​ are taken in the extended reals, so the zero-matrix case is included.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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