Diamond norm as an infimum over Stinespring pairs
OpenQAlgorithms.Papers.Independent.Intakenext100.P98.stinespring_spectralNorm_infimumLet and , , and let be any complex-linear map. For every finite positive-dimensional environment , consider all pairs satisfying for every . Then
The norms on are spectral norms. The infimum ranges over all such pairs, without a minimal-rank restriction and without claiming attainment. The zero map admits the zero pair in a one-dimensional environment.
This characterizes the completely bounded trace norm through dilation operators. Watrous gives a new SDP-duality proof of the result previously treated in KSV02 and Pau02.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P98
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P98
/-- PDF pp.12--13, Theorem 5, reproved after KSV02 and Pau02:
a genuine infimum over every Stinespring pair, with no assertion of attainment. -/
theorem stinespring_spectralNorm_infimum {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
(Phi : (Matrix (Fin n) (Fin n) ℂ →ₗ[ℂ] Matrix (Fin m) (Fin m) ℂ)) :
IsGLB (stinespringProducts Phi) (stabilizedTraceNorm Phi) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P98
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For positive natural numbers and any complex-linear map , define and
where the amplified map applies to each block indexed by the first tensor factor, and need not be Hermitian or positive. Then is the greatest real lower bound of all products obtained from a positive natural number and matrices satisfying for every . Here is the Euclidean operator norm, is conjugate transpose, and . Explicitly, is at most every such product, and every real number at most all such products is at most ; attainment of the lower bound is not asserted. No channel assumption is imposed on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.