6.20
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.deterministic_processingAll 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 any deterministic f:X→Z on the classical register, both smooth entropies satisfy H^ε(ZA|B)_{f(ρ)}≤H^ε(XA|B)_ρ, with A retained and output blocks computed by summing preimages.
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.20
6.20, arXiv:1504.00233v5, PDF p.105. -/
theorem deterministic_processing [Nonempty X] [Nonempty Z] [Nonempty A] [Nonempty B] (r : paperMat ((X × A) × B))
(hr : paperSubnormalized r) (hc : ClassicalLeft (paperRegroup r)) (f : X → Z) (e : ℝ) (he : Radius r e) :
paperSmoothMin (classicalProcess f r) e ≤ paperSmoothMin r e ∧ paperSmoothMax (classicalProcess f r) e ≤ paperSmoothMax r e := 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 finite nonempty types with decidable equality. Let be a complex matrix on , with , where , and assume whenever . Let be any function, and let . Define the matrix on by
An empty preimage contributes zero. For positive semidefinite matrices set , using spectral functional calculus, and . For a matrix on , define , , , and , with extended-real extrema and , otherwise. Then
where uses the bipartition and uses . The function need not be injective or surjective, and is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.