Pith. sign in

A Sufficient Criterion for Divisibility of Quantum Channels

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We present a simple, dimension-independent criterion which guarantees that some quantum channel $\Phi$ is divisible, i.e. that there exists a non-trivial factorization $\Phi=\Phi_1\Phi_2$. The idea is to first define an "elementary" channel $\Phi_2$ and then to analyze when $\Phi\Phi_2^{-1}$ is completely positive. The sufficient criterion obtained this way -- which even yields an explicit factorization of $\Phi$ -- is that one has to find orthogonal unit vectors $x,x^\perp$ such that $\langle x^\perp|\mathcal K_\Phi\mathcal K_\Phi^\perp|x\rangle=\langle x|\mathcal K_\Phi\mathcal K_\Phi^\perp|x\rangle=\{0\}$ where $\mathcal K_\Phi$ is the Kraus subspace of $\Phi$ and $\mathcal K_\Phi^\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 $\Phi$ into in some sense "simple" channels. Finally, be aware that our techniques are not limited to the particular elementary channel we chose.

fields

math.RA 1

years

2024 1

verdicts

CONDITIONAL 1

representative citing papers

Generating Sets of Stochastic Matrices

math.RA · 2024-11-28 · conditional · novelty 6.0

For stochastic matrices of size 2x2 and 3x3, explicit generating sets are constructed, with worst-case factor count exactly 4 in dimension 2 and at most 20 in dimension 3.

citing papers explorer

Showing 1 of 1 citing paper.

  • Generating Sets of Stochastic Matrices math.RA · 2024-11-28 · conditional · none · ref 11 · internal anchor

    For stochastic matrices of size 2x2 and 3x3, explicit generating sets are constructed, with worst-case factor count exactly 4 in dimension 2 and at most 20 in dimension 3.