Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2, quantum/classical error comparison

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.quantumClassicalComparison

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

prove2quantum

Let p,qp,qp,q be the spectral-pair laws associated with density operators ρ,σ\rho,\sigmaρ,σ. For every orthogonal projector PPP and positive weights η0,η1\eta_0,\eta_1η0​,η1​, without requiring their sum to be one,

η0Tr⁡(Pρ)+η1Tr⁡((I−P)σ)≥12inf⁡0≤ϕ≤1∑ij[η0pijϕij+η1qij(1−ϕij)].\eta_0\operatorname{Tr}(P\rho)+\eta_1\operatorname{Tr}((I-P)\sigma)\ge\frac12\inf_{0\le\phi\le1}\sum_{ij}[\eta_0p_{ij}\phi_{ij}+\eta_1q_{ij}(1-\phi_{ij})].η0​Tr(Pρ)+η1​Tr((I−P)σ)≥21​0≤ϕ≤1inf​ij∑​[η0​pij​ϕij​+η1​qij​(1−ϕij​)].

The infimum ranges over every randomized classical test. This transfers classical converse bounds to joint quantum tests.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P45

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology

open QAlgorithms.Papers.Independent.Information100.P07
  (support positivePart positiveProjection IsProjection)

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

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)

open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

/-- arXiv:0708.4282v1, PDF pp.10,11,12: Proposition 2, quantum/classical error comparison. -/
theorem quantumClassicalComparison (rho sigma : Mat I)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (D : SpectralPair rho sigma) (P : Mat I) (hP : IsProjection P)
    (a b : ℝ) (ha : 0 < a) (hb : 0 < b) :
    (1/2 : ℝ) * sInf (Set.range (classicalError (spectralP D) (spectralQ D) a b)) ≤
      bayesError rho sigma P a b := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 10, Proposition 2, quantum/classical error comparison
Read-back

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

For every finite index type III with decidable equality, every positive semidefinite complex matrices ρ,σ\rho,\sigmaρ,σ indexed by III with trace one, every unitary matrices U,VU,VU,V and nonnegative families λ,μ:I→R\lambda,\mu:I\to\mathbb Rλ,μ:I→R satisfying ρ=Udiag⁡(λ)U†\rho=U\operatorname{diag}(\lambda)U^\daggerρ=Udiag(λ)U† and σ=Vdiag⁡(μ)V†\sigma=V\operatorname{diag}(\mu)V^\daggerσ=Vdiag(μ)V†, every Hermitian idempotent matrix PPP, and every positive real numbers a,ba,ba,b, set pij=λi∣(U†V)ij∣2p_{ij}=\lambda_i|(U^\dagger V)_{ij}|^2pij​=λi​∣(U†V)ij​∣2 and qij=μj∣(U†V)ij∣2q_{ij}=\mu_j|(U^\dagger V)_{ij}|^2qij​=μj​∣(U†V)ij​∣2. Then

12inf⁡f:I×I→[0,1](a∑i,jpijfij+b∑i,jqij(1−fij))≤a Re⁡tr⁡(Pρ)+b Re⁡tr⁡((1−P)σ).\frac12\inf_{f:I\times I\to[0,1]} \left( a\sum_{i,j}p_{ij}f_{ij} +b\sum_{i,j}q_{ij}(1-f_{ij}) \right) \leq a\,\operatorname{Re}\operatorname{tr}(P\rho) +b\,\operatorname{Re}\operatorname{tr}((1-P)\sigma).21​f:I×I→[0,1]inf​(ai,j∑​pij​fij​+bi,j∑​qij​(1−fij​))≤aRetr(Pρ)+bRetr((1−P)σ).

There is no assumption that a+b=1a+b=1a+b=1. The density hypotheses exclude an empty III.

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