arXiv · 2603.19444
The Choi-Cholesky algorithm for completely positive maps
Abstract
We establish explicit means via which natural dilations of completely positive (CP) maps can be constructed \`a la Kraus's IInd representation theorem. To obtain this, we rely on the Choi-Jamio{\l}kowski correspondence and develop a Cholesky algorithm for bi-partite systems. This enables a canonical construction of adjoint actions which recover the behaviour of the original CP-maps. Our results hold under separability assumptions and the requirement that the maps are completely bounded and preserve the subideal of finite rank operators.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Raj Dahya. 2026-03-19. The Choi-Cholesky algorithm for completely positive maps. https://arxiv.org/abs/2603.19444
Cite the original work for its findings. Save a collection to share your selection of sources.