Data processing of testing divergence
OpenQAlgorithms.Papers.Independent.Support50.P20.testingDivergence_dataProcessingLet be normalized positive trace-class operators on a complex Hilbert space , let be another complex Hilbert space, and let be a complex-linear, completely positive, trace-preserving map from trace-class operators on to trace-class operators on . Complete positivity means positivity at every finite matrix amplification. For , the hypothesis-testing divergence in bits satisfies
Physical preprocessing therefore cannot improve distinguishability as measured by this divergence. The result includes infinite-dimensional spaces and infinite divergence, with no finite Kraus-rank restriction.
Formalization Note The source's CPM is read as physical trace-preserving preprocessing, as required by its proof that pulls a complete measurement back to a complete measurement.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P20
noncomputable section
open Filter
open scoped ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P20
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P13
(IsTraceClass IsPositive operatorTrace State)
open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
/-- PDF p.2, Property 2 and its proof: DPI for physical (CPTP) preprocessing
between arbitrary output Hilbert spaces, with all finite CP amplifications. -/
theorem testingDivergence_dataProcessing {I J K : Type*}
[NormedAddCommGroup K] [InnerProductSpace ℂ K] [CompleteSpace K]
(b : HilbertBasis I ℂ H) (d : HilbertBasis J ℂ K)
(rho sigma : State b) (Phi : (H →L[ℂ] H) → (K →L[ℂ] K))
(hPhi : IsHilbertCPTP b d Phi) (epsilon : ℝ)
(hZero : 0 ≤ epsilon) (hOne : epsilon < 1) :
hilbertTestingDivergence d epsilon (Phi rho.val.val) (Phi sigma.val.val) ≤
hilbertTestingDivergence b epsilon rho.val.val sigma.val.val := by sorry
end QAlgorithms.Papers.Independent.Support50.P20
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be complete complex inner-product spaces, let be arbitrary types, and let and be Hilbert bases of and . On either space, call trace-class when for some sequences with , and define its basis trace by , or analogously using . Let be trace-class operators on that are self-adjoint, have nonnegative real quadratic forms, and have trace . Let be a function from bounded complex-linear operators on to bounded complex-linear operators on , satisfying all of the following: it is additive and complex homogeneous on trace-class inputs; it maps every trace-class operator to a trace-class operator with ; and for every natural number , including , and every array of trace-class operators , if has imaginary part zero and nonnegative real part for every , then has those same two properties for every . For a basis , define
where an effect means that both and are bounded self-adjoint operators with nonnegative real quadratic forms; the infimum is in ; and , , for positive finite . For every real , the declaration asserts
in the extended reals. No continuity of the function , or finite-dimensionality or countability of either basis, is an additional hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.