Christensen-Sinclair factorization via semidefinite programming
Year: 2025
Type: article
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.
Author: Francisco Escudero-Gutiérrez
Institutions: Centrum Wiskunde & Informatica, QuSoft
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,230
OpenAlex ID: W4408427398
