arXiv · 2407.13716
Understanding Christensen-Sinclair factorization via semidefinite programming
Abstract
We show that the Christensen-Sinclair factorization theorem, when the underlying Hilbert spaces are finite dimensional, is an instance of strong duality of semidefinite programming. This gives an elementary proof of the result and also provides an efficient algorithm to compute the Christensen-Sinclair factorization.
Explore related subjects
Keep this discovery
Francisco Escudero-Gutiérrez. 2024-07-18. Understanding Christensen-Sinclair factorization via semidefinite programming. https://arxiv.org/abs/2407.13716
Cite the original work for its findings. Save a collection to share your selection of sources.