Explicit SDPs for completely bounded norms
OpenQAlgorithms.Papers.Independent.Intakenext100.P98.completelyBoundedNorms_sdpLet and , where , and let be complex-linear. Suppose satisfy for every operator , with . For the output-first, unnormalized Choi matrix , construct
Let be the supremum of over with , and let be the infimum of over with . Then
A minimal Stinespring pair exists for the Hilbert–Schmidt adjoint , and this same construction applied to it has primal and dual values . Trace norm has no factor . At the zero map the minimal environment is allowed to have dimension zero.
These explicit programs express both completely bounded norms by finite-dimensional semidefinite optimization; the computational complexity claim is inventoried separately.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P98
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P98
/-- PDF pp.1,4,7--9: explicit SDP values are the SQUARED diamond norm.
Applying the construction to the adjoint gives the spectral variant.
Phi need not be positive, Hermiticity-preserving, or nonzero. -/
theorem completelyBoundedNorms_sdp {n m r : ℕ} (hn : 0 < n) (hm : 0 < m)
(Phi : (Matrix (Fin n) (Fin n) ℂ →ₗ[ℂ] Matrix (Fin m) (Fin m) ℂ)) (A B : (Matrix (Fin m × Fin r) (Fin n) ℂ))
(hpair : stinespringPairRepresents Phi A B) (hminimal : r = (watrousChoiMatrix Phi).rank) :
blockPrimalValue A B = (((stabilizedTraceNorm Phi) ^ 2 : ℝ) : EReal) ∧
blockDualValue A B = (((stabilizedTraceNorm Phi) ^ 2 : ℝ) : EReal) ∧
∃ (s : ℕ) (C D : (Matrix (Fin n × Fin s) (Fin m) ℂ)),
stinespringPairRepresents (superAdjoint Phi) C D ∧ s = (watrousChoiMatrix (superAdjoint Phi)).rank ∧
blockPrimalValue C D = (((cbSpectral Phi) ^ 2 : ℝ) : EReal) ∧
blockDualValue C D = (((cbSpectral Phi) ^ 2 : ℝ) : EReal) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P98
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers with and , let be any complex-linear map, and let be matrices satisfying, for every ,
where is the matrix unit and . To specify the asserted values, for any matrices , define as the extended-real supremum of over block matrices with diagonal blocks , , satisfying and ; define as the extended-real infimum of over block matrices with upper-left scalar and lower-right block , satisfying and , where . For any complex-linear map , put
where , and this supremum is taken in . The theorem asserts
as extended-real equalities, and also asserts that there exist a natural number and matrices such that
Here the map denoted is defined entrywise by ; is the quantity called the completely bounded spectral norm in the statement. No positivity or channel assumption is imposed on . Neither nor is required positive; zero-dimensional environments are included, with empty partial traces equal to zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.