A Sufficient Criterion for Divisibility of Quantum Channels

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 ΦΦ₂^-1 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 x,x^perp such that langle x^perp|mathcal K_Φmathcal K_Φ^perp|xrangle=langle x|mathcal K_Φmathcal K_Φ^perp|xrangle=\{0\} where mathcal K_Φ is the Kraus subspace of Φ and mathcal K_Φ^perp 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.