§6.1.4 (6.30)–(6.32): quantum guessing probability
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.quantum_guessingAll 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 is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and . The symbols and denote conditional min- and max-entropy, with values and at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies .
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).
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite types with decidable equality, and let be a matrix on for each , with and ; the individual matrices need not have trace , and all may be zero. Form the matrix on by
For a matrix on a product , define its extended-real quantity
where means . There exists a family of matrices on such that for every , , and, writing
one has
Moreover, for every other family with . The function sends a real number to its nonnegative part in ; , , and for finite . Suprema defining are taken in the extended reals, so the zero-matrix case is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.