6.19
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.smooth_data_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 arbitrary CPTP F on B and sub-unital CPTP E on A, both Hmin^ε and Hmax^ε of the actual output (E⊗F)(ρ) are at least the input entropy.
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.19
6.19, arXiv:1504.00233v5, PDF p.104. -/
theorem smooth_data_processing [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(r : paperMat (A × B)) (hr : paperSubnormalized r) (e : ℝ) (he : Radius r e)
(E : paperMat A →ₗ[ℂ] paperMat C) (F : paperMat B →ₗ[ℂ] paperMat D) (hE : paperCPTP E) (hF : paperCPTP F) (hu : paperBelow (E 1) 1) :
paperSmoothMin r e ≤ paperSmoothMin (paperTensorAction E F r) e ∧ paperSmoothMax r e ≤ paperSmoothMax (paperTensorAction E F 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 let . Let and be complex-linear maps. Assume each preserves the complex trace of every matrix and is completely positive in the following explicit sense: for every natural number , including , applying the map to each matrix block of any positive semidefinite matrix on , respectively , produces a positive semidefinite matrix. Assume also . Define on by
For positive semidefinite matrices set , with square roots from spectral functional calculus, and define . On a bipartition , let , , , and ; all extrema are extended-real, and , while otherwise . Then
using the bipartitions and , respectively; is allowed, while the radius hypothesis excludes zero trace.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.