Papers
Topics
Authors
Recent
Search
2000 character limit reached

Capacities of highly Markovian divisible quantum channels

Published 14 Apr 2025 in quant-ph, cs.IT, and math.IT | (2504.10436v1)

Abstract: We analyze information transmission capacities of quantum channels acting on $d$-dimensional quantum systems that are highly Markovian divisible, i.e., channels of the form \begin{equation*} \Phi = \underbrace{\Psi\circ \Psi \circ \ldots \circ \Psi}{l \,\operatorname{times}} \end{equation*} with $l \geq \gamma d2 \log d$ for some constant $\gamma=\gamma(\Psi)$ that depends on the spectral gap of the dividing channel $\Psi$. We prove that capacities of such channels are approximately strongly additive and can be efficiently approximated in terms of the structure of their peripheral spaces. Furthermore, the quantum and private classical capacities of such channels approximately coincide and approximately satisfy the strong converse property. We show that these approximate results become exact for the corresponding zero-error capacities when $l \geq d2$. To prove these results, we show that for any channel $\Psi$, the classical, private classical, and quantum capacities of $\Psi\infty$, which is its so-called asymptotic part, satisfy the strong converse property and are strongly additive. In the zero-error case, we introduce the notion of the stabilized non-commutative confusability graph of a quantum channel and characterize its structure for any given channel.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.