Quantum whole-key reduction
OpenQAlgorithms.Papers.Independent.Intakenext100.P77.quantum_whole_string_boundLet , let have a normalized finite distribution, and let be jointly independent finite random variables. Let be a normalized finite-dimensional density matrix for every . For any finite POVM , let denote its classical outcome. Define
for positive-probability disclosures , optimizing separately over all finite POVMs . Then
Normalized ensembles make each supremum nonempty and bounded by the corresponding entropy. No optimal measurement must attain its supremum; the statement applies to every whole-key measurement.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P77
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P77
open scoped BigOperators ComplexConjugate ComplexOrder
open QAlgorithms
-- The repair instruction authorizes imports of pinned accepted definitions.
-- These are definitions only; no imported paper theorem is used here.
open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)
open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon)
open QAlgorithms.Papers.Independent.Information100.P39 (pushLaw)
open QAlgorithms.Papers.Independent.Support50.P16 (trivialMeasurement)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Appendix H.2, PDF p.25, Eq.(33): any whole-key POVM is bounded by the
maximum separately optimized conditional information. No optimal POVM need
attain any accessible-information supremum. -/
theorem quantum_whole_string_bound {X Q : Type} [Fintype X] [Fintype Q]
[DecidableEq Q] {m : ℕ} (hm : 1 ≤ m) {A : Fin m → Type}
[∀ i, Fintype (A i)] (p : Law X) (rho : X → Matrix Q Q ℂ)
(hrho : ∀ x, IsDensityMatrix (rho x))
(key : (i : Fin m) → X → A i) (hind : JointIndependent p.prob key)
(M : Measurement Q) :
classicalMutualInfo (measuredWeights p.prob rho M) (fun z i => key i z.1) Prod.snd ≤
m * quantumDisclosureMaximum p.prob rho key := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P77
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite types, with decidable equality on , let , and let be finite for every . Let be nonnegative with total mass one, and let be a positive semidefinite complex matrix indexed by with for every , including labels of zero weight. Let , and assume that for every tuple , . Choose any measurement with a positive number of effects , each positive semidefinite and satisfying , and set . For any finite weights , define mutual information by the sum of the marginal Shannon entropies minus the joint Shannon entropy, with and . For and each value with , define on that fibre and zero elsewhere, and define
Then
Thus each conditional accessible information permits its own finite measurement. The outer maximum is defined as zero if its collection is empty; under the stated assumptions that collection is nonempty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.