Papers
arxiv:2603.19444
The Choi-Cholesky algorithm for completely positive maps
Published on Mar 19
Authors:
Abstract
We establish explicit means via which natural dilations of completely positive (CP) maps can be constructed à la Kraus's IInd representation theorem. To obtain this, we rely on the Choi-Jamioł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.
Get this paper in your agent:
hf papers read 2603.19444 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 1
Datasets citing this paper 0
No dataset linking this paper
Cite arxiv.org/abs/2603.19444 in a dataset README.md to link it from this page.
Spaces citing this paper 0
No Space linking this paper
Cite arxiv.org/abs/2603.19444 in a Space README.md to link it from this page.
Collections including this paper 0
No Collection including this paper
Add this paper to a collection to link it from this page.