Abstract
We consider the problem of separability of quantum channels via the Choi matrix representation given by the Choi-Jamiołkowski isomorphism. We explore three classes of separability across different cuts between systems and ancillae, and we provide a solution based on the mapping of the coordinates of the Choi state (in a fixed basis) to a truncated moment sequence (tms) . This results in an algorithm which gives a separability certificate using semidefinite programming. The computational complexity and the performance of it depend on the number of variables in the tms and on the size of the moment matrix of order . We exploit the algorithm to numerically investigate separability of families of two-qubit and single-qutrit channels; in the latter case we can provide an answer for examples explored earlier through the criterion based on the negativity , a criterion which remains inconclusive for Choi matrices with .
- Received 3 July 2020
- Accepted 15 October 2020
DOI:https://doi.org/10.1103/PhysRevA.102.052406
©2020 American Physical Society