§V.C, Proposition 1: no universal quadratic-logarithmic bound
ProvedQAlgorithms.Papers.Independent.Gap48.P40.noQuadraticLogarithmicBoundAll matrices act on a complex Hilbert space of positive finite dimension . A state is positive semidefinite with trace one. All logarithms are natural, and denotes support-aware Umegaki relative entropy, with value when support containment fails. For every real , there are and such that the commuting qubit states and satisfy
Thus no universal positive constant gives the proposed quadratic-logarithmic bound.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P40
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder Topology Matrix.Norms.L2Operator
open Filter MeasureTheory Asymptotics
open QAlgorithms
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P50 (IsUINorm)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P60 (copies)
open QAlgorithms.Papers.Independent.Information100.P44 (Mat)
namespace QAlgorithms.Papers.Independent.Gap48.P40
/-- PDF p.5, Proposition 1: commuting qubit witnesses disprove every positive
universal quadratic-logarithmic constant. The proof's (2-p-q)^2 typo is not used. -/
theorem noQuadraticLogarithmicBound (r : ℝ) (hr : 0 < r) :
∃ p q : ℝ, 0 ≤ p ∧ p ≤ 1 ∧ 0 < q ∧ q < 1 / 2 ∧
let rho : Mat 2 := Matrix.diagonal ![(p : ℂ), ((1 - p : ℝ) : ℂ)]
let sigma : Mat 2 := Matrix.diagonal ![(q : ℂ), ((1 - q : ℝ) : ℂ)]
relativeEntropy rho sigma >
((r * ((rho - sigma) ^ 2).trace.re * |Real.log (minEigenvalue sigma)| : ℝ) : EReal) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P40
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real , there exist real numbers with and such that, for the two diagonal matrices and , their relative entropy satisfies
Here is the natural logarithm, and
The comparison is in the extended real numbers, with the real right-hand side embedded there. The factors on the right arise from and the smallest eigenvalue of , which is . The endpoints and are permitted, with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.