A Sufficient Criterion for Divisibility of Quantum Channels
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 =12. The idea is to first define an "elementary" channel 2 and then to analyze when 2-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 such that x| K K|x= x| K K|x=\0\ where K is the Kraus subspace of and K 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.