Quantum fixed-error strong converse with corrected logarithm
OpenQAlgorithms.Papers.Independent.Support50.P38.theorem21Let be finite nonempty, a probability law, and density matrices on a fixed finite nonzero-dimensional Hilbert space. Let be the minimum positive code dimension over all visible maps into normalized code states followed by a linear completely positive trace-preserving decoder, with no shared randomness and -average half trace norm error at most against . Write
where is von Neumann entropy in bits. For every fixed ,
This is the quantum strong converse lower bound.
Source correction. The printed theorem omits the logarithm. Its definition of as a dimension, the exponential bound in its proof, and Question 24 require .
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P38
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P38
open scoped BigOperators Matrix ComplexConjugate
open Filter
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Frontier30.P12 (IsStochastic)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)
attribute [local instance] Classical.propDecidable
/-- Theorem 21, PDF pp.10–11: quantum fixed-error strong converse.
SOURCE CORRECTION: insert log_2 before M. The printed display omits log, although p.10
defines M as dim C, p.11 proves an exponential dimension bound, and Question 24 includes log.
The p.11 success-prefactor inversion is also a proof typo and is not assumed here. -/
theorem theorem21 {A B : Type} [Fintype A] [Fintype B] [DecidableEq B]
[Nonempty A] [Nonempty B] (p : A → ℝ) (rho : A → Matrix B B ℂ)
(hp : IsLaw p) (hrho : ∀ a, QAlgorithms.IsDensityMatrix (rho a))
(error : ℝ) (he : 0 < error) (he1 : error < 1) :
labelInformation p rho ≤ Filter.liminf (quantumSizeRate p rho error) atTop := by sorry
end QAlgorithms.Papers.Independent.Support50.P38
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types, with decidable equality on . Let be nonnegative with , and let every complex matrix be positive semidefinite with trace . For every real with ,
Here , where is applied by functional calculus using the total logarithm with . For each block length , is the infimum in of the positive integers for which one can assign a positive semidefinite, trace-one matrix to every word , and choose a map
for some natural number and complex matrices with rows indexed by and columns indexed by , such that
The trace norm is . The encoder must assign a density matrix even to words of zero source probability. The natural-number infimum is if its defining set is empty; the rate sequence uses only positive block lengths .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.