A Sufficient Criterion for Divisibility of Quantum Channels
Frederik vom Ende

TL;DR
This paper introduces a simple, dimension-independent criterion for determining when a quantum channel can be factorized into simpler channels, facilitating analysis and potential simplification of quantum processes.
Contribution
The authors develop a new criterion based on Kraus subspaces that guarantees divisibility of quantum channels and provides explicit factorizations, advancing understanding of quantum channel structure.
Findings
Criterion is dimension-independent and explicit
Can reduce Kraus rank through repeated factorization
Applicable to various elementary 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 . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
