A Sufficient Criterion for Divisibility of Quantum Channels
arXiv:2407.17103 · doi:10.1063/5.0231812
Abstract
We present a simple, dimension-independent criterion which guarantees that some quantum channel is divisible, i.e. that there exists a non-trivial factorization . The idea is to first define an "elementary" channel and then to analyze when is completely positive. The sufficient criterion obtained this way -- which even yields an explicit factorization of -- is that one has to find orthogonal unit vectors such that where is the Kraus subspace of and is its orthogonal complement. Of course, using linearity this criterion can be reduced to finitely many equalities. Generically, this division even lowers the Kraus rank which is why repeated application -- if possible -- results in a factorization of into in some sense "simple" channels. Finally, be aware that our techniques are not limited to the particular elementary channel we chose.
arXiv comment18 pages, submitted to J. Math. Phys
References in corpus (10)
- Entanglement and non-Markovianity of quantum evolutions
- Assessing non-Markovian dynamics
- On the degree of non-Markovianity of quantum evolution
- Dividing Quantum Channels
- On measures of non-Markovianity: divisibility vs. backflow of information
- A universal set of qubit quantum channels
- Parallel distinguishability of quantum operations
- Dissipative generators, divisible dynamical maps and Kadison-Schwarz inequality
- Which Bath-Hamiltonians Matter for Thermal Operations?
- Quantum dynamics is not strictly bidivisible