Product-input norm and entropy inequalities
ProvedQAlgorithms.Papers.Independent.Support50.P31.productInputBoundsLet be completely positive trace-preserving endomorphisms on two nonzero finite-dimensional complex Hilbert spaces. Let denote the maximum output Schatten -norm, with operator norm at infinity, and let denote minimum output von Neumann entropy in natural units. All optimizations range over density matrices. Then
These inequalities compare the unrestricted joint optimization, which allows entangled inputs, with product inputs.
Source correction. Equation (8) prints twice on its right side. The second occurrence is changed to , as used by the source's product-input explanation and subsequent calculation.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P31
noncomputable section
open Filter Asymptotics
open scoped ComplexConjugate ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P31
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P63 (schatten)
open QAlgorithms.Papers.Independent.Gap48.P03 (holevoQuantity)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
open QAlgorithms.Papers.Independent.Dependency50.P44 (tensorChannels)
/-- PDF p.4, (7)–(8). Printed (8) repeats Phi1; its second term is corrected
to Phi2 as required by the source's product-input argument. -/
theorem productInputBounds {I J : Type} [Fintype I] [DecidableEq I] [Nonempty I]
[Fintype J] [DecidableEq J] [Nonempty J]
(Phi : Superop I I) (Psi : Superop J J) (hPhi : IsChannel Phi) (hPsi : IsChannel Psi) :
(∀ p : ℝ≥0∞, 1 ≤ p → nuP p Phi * nuP p Psi ≤ nuP p (tensorSuperop Phi Psi)) ∧
nuH (tensorSuperop Phi Psi) ≤ nuH Phi + nuH Psi := by sorry
end QAlgorithms.Papers.Independent.Support50.P31
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, and let be maps on complex and matrices, respectively. Assume each has a finite Kraus representation satisfying . Define their tensor map by
For any of these maps , let be the supremum over positive semidefinite trace-one inputs of when , and of when ; let be the infimum over the same inputs of , where uses natural logarithms and . Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.