Interpolation for completely positive maps: numerical solutions

MaRDI QIDQ4685152zbMATH OpenFDO

Authors Călin-Grigore Ambrozie, Aurelian Gheondea

Publication date 5 October 2018

Full work available at URL https://arxiv.org/abs/1401.8239

zbMATH Keywords

Choi matrixinterpolationquantum channelsemidefinite programming

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Spectrum, resolvent (47A10) Numerical linear algebra (65F99) Numerical methods for variational inequalities and related problems (65K15) Semidefinite programming (90C22) Applications of mathematical programming (90C90)

Abstract: We present certain techniques to find completely positive maps between matrix algebras that take prescribed values on given data. To this aim we describe a semidefinite programming approach and another convex minimization method supported by a numerical example.

Recommendations

• An interpolation problem for completely positive maps on matrix algebras: solvability and parametrization
• Interpolation by completely positive maps
• On Birkhoff's theorem for doubly stochastic completely positive maps of matrix algebras
• Completely positive interpolations of compact, trace-class and Schatten-\(p\) class operators
• Interpolations of entanglement breaking channels and equivalent conditions for completely positive maps

Cited in

(4)

• Interpolated Poincaré map and application to mixing problems
• Complexity of interpolation and related problems in positive calculi
• An interpolation problem for completely positive maps on matrix algebras: solvability and parametrization
• The linear interpolation problem for totally positive matrices

This page was built for publication: Interpolation for completely positive maps: numerical solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685152)