Truncated moment sequences and a solution to the channel separability problem

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) $y$. 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 $n$ in the tms and on the size of the moment matrix $M_t(y)$ of order $t$. We exploit the algorithm to numerically investigate separability of families of 2-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 $N$, a criterion which remains inconclusive for Choi matrices with $N=0$.

11 pages, 2 figures

References in corpus (9)

• Quantum Process Tomography: Resource Analysis of Different Strategies
• A complete family of separability criteria
• Experimental Realization of Universal Geometric Quantum Gates with Solid-State Spins
• Testing Quantum Devices: Practical Entanglement Verification in Bipartite Optical Systems
• Entanglement-annihilating and entanglement-breaking channels
• Separability of Completely Symmetric States in Multipartite System
• Multipartite Entanglement Evolution Under Separable Operations
• An Experimentally Verified Approach to non-Entanglement-Breaking Channel Certification
• Optimal measurement strategies for fast entanglement detection

Cited by in corpus (3)

• Optimal Entanglement Certification from Moments of the Partial Transpose
• Semidefinite programming relaxations for quantum correlations
• A-unital Operations and Quantum Conditional Entropy