Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Dahya, Raj
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2603.19444
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915917209796608
author Dahya, Raj
author_facet Dahya, Raj
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2603_19444
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle The Choi-Cholesky algorithm for completely positive maps
Dahya, Raj
Functional Analysis
Mathematical Physics
81R15, 46L07, 47C15, 47A20
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.
title The Choi-Cholesky algorithm for completely positive maps
topic Functional Analysis
Mathematical Physics
81R15, 46L07, 47C15, 47A20
url https://arxiv.org/abs/2603.19444