Data processing of the operational Hoeffding exponent
OpenQAlgorithms.Papers.Independent.Intakethird100.P04.hoeffding_data_processingLet be arbitrary density operators on a complex Hilbert space , and let be a trace-preserving completely positive linear map from trace-class operators on to trace-class operators on a complex Hilbert space . For a pair , write and . Define as the supremum of over all sequences of bounded effects on the completed tensor powers for which has an existing extended limit and . Logarithms are natural and . For every ,
The statement expresses monotonicity of the operational testing tradeoff under a physical channel, including infinite exponents. It imposes no restriction on relative to relative entropy.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P04
noncomputable section
open Filter
open scoped ENNReal NNReal BigOperators ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakethird100.P04
attribute [local instance] Classical.propDecidable Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
open QAlgorithms.Papers.Independent.Dependency50.P13
(State operatorTrace relativeEntropy)
open QAlgorithms.Papers.Independent.Support50.P20
(Effect traceAcceptance IsHilbertCPTP BlockHilbert blockBasis)
open QAlgorithms.Papers.Independent.Frontier18.P18 (boundedOperator)
variable {H K : Type*}
variable [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
variable [NormedAddCommGroup K] [InnerProductSpace ℂ K] [CompleteSpace K]
/-- Remark 2, PDF p.7, (30): operational data processing for every r>0.
CPTP is on full trace class, with no dimension or Kraus-rank bound. No restriction
relative to D and no assumption of conversion formula (29) are introduced. -/
theorem hoeffding_data_processing {I J : Type}
(b : HilbertBasis I ℂ H) (d : HilbertBasis J ℂ K)
(rho sigma : State b)
(Phi : (H →L[ℂ] H) → (K →L[ℂ] K)) (hPhi : IsHilbertCPTP b d Phi)
(r : ℝ) (hr : 0 < r) :
hoeffdingB d (Phi rho.val.val) (Phi sigma.val.val) r ≤
hoeffdingB b rho.val.val sigma.val.val r := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be complete complex inner-product spaces, let be arbitrary types, and let and be Hilbert bases of and . Write . An operator is called trace class here if there are sequences with and for every ; it is positive if and for every . Let be positive trace-class operators on with . Let be a function from bounded complex-linear operators on to those on , assumed additive and complex homogeneous on trace-class operators, mapping trace-class operators to trace-class operators and preserving their complex traces, and preserving positivity of every finite operator block: for every and trace-class block , if is real and nonnegative for every , the same holds after applying entrywise. For every real , the assertion is , with defined as follows. For , put , with its canonical basis , and let be the chosen bounded operator whose coefficients are , taking the zero operator if no bounded operator has these coefficients. Define . A test is a bounded operator for which both and are positive in the sense just specified. Then is the supremum, in the extended real line, of all numbers for which there is a sequence of such tests satisfying
Here may be any extended real number, the logarithm is the extended natural logarithm with , and uses the same construction with . The supremum of an empty defining set is . The sums marked use the total summation convention, returning zero when the family is not summable. No countability, separability, or nonzero-dimension assumption is imposed; if the stated normalized states do not exist, there are no instances of these hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.