Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1904.11043 · IEEE Transactions on Information Theory

Group Transference Techniques for the Estimation of the Decoherence Times and Capacities of Quantum Markov Semigroups

Ivan Bardet, Marius Junge, Nicholas D. LaRacuente, Cambyse Rouzé, Daniel Stilck França

Published Mar 12, 2021• 15 citations
arXivHTMLPDF

Abstract

Capacities of quantum channels and decoherence times both quantify the extent to which quantum information can withstand degradation by interactions with its environment. However, calculating capacities directly is known to be intractable in general. Much recent work has focused on upper bounding certain capacities in terms of more tractable quantities such as specific norms from operator theory. In the meantime, there has also been substantial recent progress on estimating decoherence times with techniques from analysis and geometry, even though many hard questions remain open. In this article, we introduce a class of continuous-time quantum channels that we called transferred channels, which are built through representation theory from a classical Markov kernel defined on a compact group. In particular, we study two subclasses of such kernels: Hörmander systems on compact Lie-groups and Markov chains on finite groups. Examples of transferred channels include the depolarizing channel, the dephasing channel, and collective decoherence channels acting on d qubits. Some of the estimates presented are new, such as those for channels that randomly swap subsystems. We then extend tools developed in earlier work by Gao, Junge and LaRacuente to transfer estimates of the classical Markov kernel to the transferred channels and study in this way different non-commutative functional inequalities. The main contribution of this article is the application of this transference principle to the estimation of decoherence time, of private and quantum capacities, of entanglement-assisted classical capacities as well as estimation of entanglement breaking times, defined as the first time for which the channel becomes entanglement breaking. Moreover, our estimates hold for non-ergodic channels such as the collective decoherence channels, an important scenario that has been overlooked so far because of a lack of techniques.

DOI
10.1109/tit.2021.3065452

Related papers

Quantum information theory and Fourier multipliers on quantum groups

Cédric Arhancet

In this paper, we compute the exact values of the minimum output entropy and the completely bounded minimal entropy of very large classes of quantum channels acting on matrix algebras $\mathrm{M}_n$. Our new and simple approach relies on the theory of locally compact quantum groups and our results use a new and precise description of bounded Fourier multipliers from $\mathrm{L}^1(\mathbb{G})$ into $\mathrm{L}^p(\mathbb{G})$ for $1 < p \leq \infty$ where $\mathbb{G}$ is a co-amenable locally compact quantum group and on the automatic completely boundedness of these multipliers that this description entails. Indeed, our approach even allows to use convolution operators on quantum hypergroups. This enable us to connect equally the topic of computation of entropies and capacities to subfactor planar algebras. We also give a upper bound of the classical capacity of each considered quantum channel which is already sharp in the commutative case. Quite surprisingly, we observe by direct computations that some Fourier multipliers identifies to direct sums of classical examples of quantum channels (as dephasing channel or depolarizing channels). Indeed, we show that the study of unital qubit channels can be seen as a part of the theory of Fourier multipliers on the von Neumann algebra of the quaternion group $\mathbb{Q}_8$. Unexpectedly, we also connect ergodic actions of (quantum) groups to this topic of computation, allowing some transference to other channels. We also connect the Quantum Harmonic analysis of Werner. Finally, we investigate entangling breaking and $\mathrm{PPT}$ Fourier multipliers and we characterize conditional expectations which are entangling breaking.

arXiv:2008.12019•Aug 27, 2020•0 citations

Quantum information theory via Fourier multipliers on quantum groups

Cédric Arhancet

In this paper, we compute the exact values of the minimum output entropy and the completely bounded minimal entropy of very large classes of quantum channels acting on matrix algebras Mn. Our new and simple approach relies on the theory of locally compact quantum groups and our results use a new and precise description of bounded Fourier multipliers from L1 (G) into Lp(G) for 1 < p< \infty where G is a co-amenable locally compact quantum group and on the automatic completely boundedness of these multipliers that this description entails. Indeed, our approach even allows to use convolution operators on quantum hypergroups. This enable us to connect equally the topic of computation of entropies and capacities to subfactor planar algebras. We also give a upper bound of the classical capacity of each considered quantum channel which is already sharp in the commutative case. Quite surprisingly, we observe by direct computations that some Fourier multipliers identifies to direct sums of classical examples of quantum channels (as dephasing channel or depolarizing channels). Indeed, we show that the study of unital qubit channels can be seen as a part of the theory of Fourier multipliers on the von Neumann algebra of the quaternion group Q8. Unexpectedly, we also connect ergodic actions of (quantum) groups to this topic of computation, allowing some transference to other channels. We also connect the Quantum Harmonic analysis of Werner. Finally, we investigate entangling breaking and PPT Fourier multipliers and we characterize conditional expectations which are entangling breaking.

•May 29, 2025•0 citations

Quantum Capacities and Entropy Production of Quantum Markov Chains

Alexander Müller‐Hermes

A basic question in quantum information theory is to quantify the optimal rate of transmitting quantum information via a given quantum channel using certain coding schemes. We study this question for discrete- and continuous-time quantum Markov processes. For continuous-time processes modeling a quantum memory we introduce new capacities where coding channels may be applied during the storage time. We prove upper bounds on these quantities by studying the entropy production of quantum Markov processes.

•Jan 1, 2015•0 citations

Quantum capacity analysis of multi-level amplitude damping channels

Stefano Chessa, Vittorio Giovannetti

Abstract Evaluating capacities of quantum channels is the first purpose of quantum Shannon theory, but in most cases the task proves to be very hard. Here, we introduce the set of Multi-level Amplitude Damping quantum channels as a generalization of the standard qubit Amplitude Damping Channel to quantum systems of finite dimension d . In the special case of d = 3, by exploiting degradability, data-processing inequalities, and channel isomorphism, we compute the associated quantum and private classical capacities for a rather wide class of maps, extending the set of models whose capacity can be computed known so far. We proceed then to the evaluation of the entanglement assisted quantum and classical capacities.

arXiv:2008.00477•Communications Physics•Feb 10, 2021•35 citations

Operator algebra approach to quantum capacities

Li Gao, Marius Junge, Nicholas D. LaRacuente

Using a suitable algebraic setup, we find new estimates of the quantum capacity and the potential quantum capacity for non-degradable channels obtained by random unitaries associated with a finite group. This approach can be generalized to quantum groups and uses new tools from operator algebras and interpolation of Rényi-type entropies. As an application, we obtain new estimates for the depolarizing channel in high dimension.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•0 citations

Capacities of Quantum Channels : Markovian Noise and Computational Aspects

Mostafa Taheri

This thesis studies the capacities of quantum channels under repeated noisy evolution, with a focus on the long-time behavior of classical and quantum information transmission. The main goal is to understand how much information can still be preserved or recovered when a quantum channel is applied many times, and to develop structural, analytic, and algorithmic tools for characterizing these capacities.The core results are presented in Chapter 2. First, the thesis investigates the infinite-time regime and shows that the asymptotic capacities of quantum channels are determined by the structure of their peripheral subspace. This leads to explicit characterizations of the infinite-time classical capacity and bounds on the infinite-time quantum capacity, together with results on additivity and extensions to more general settings. The thesis then studies the finite-time behavior for GNS-symmetric channels and proves explicit exponential convergence bounds, showing that the capacities approach their infinite-time values rapidly. In addition, algorithmic methods are developed for computing the peripheral structure and the associated capacity quantities efficiently.Chapter 3 explores a related optimization-based direction motivated by Sum-of-Squares methods and semidefinite programming. Using ideas inspired by separability and SDP hierarchies, this part investigates whether machine-learning-assisted ansatz discovery can help construct more efficient SOS certificates. Although this direction is not yet complete in the specific capacity setting, it provides promising intermediate results and suggests new computational approaches for related problems in quantum information theory. Overall, this thesis provides a structural and quantitative understanding of the long-time information-carrying capabilities of noisy quantum dynamical systems, while also opening new perspectives through optimization and machine-learning-based methods.

•Jul 15, 2026•0 citations
Capacities of quantum channels and decoherence times both quantify the extent to which quantum information can withstand degradation by interactions with its environment. However, calculating capacities directly is known to be intractable in general. Much recent work has focused on upper bounding certain capacities in terms of more tractable quantities such as specific norms from operator theory. In the meantime, there has also been substantial recent progress on estimating decoherence times with techniques from analysis and geometry, even though many hard questions remain open. In this article, we introduce a class of continuous-time quantum channels that we called transferred channels, which are built through representation theory from a classical Markov kernel defined on a compact group. In particular, we study two subclasses of such kernels: Hörmander systems on compact Lie-groups and Markov chains on finite groups. Examples of transferred channels include the depolarizing channel, the dephasing channel, and collective decoherence channels acting on d qubits. Some of the estimates presented are new, such as those for channels that randomly swap subsystems. We then extend tools developed in earlier work by Gao, Junge and LaRacuente to transfer estimates of the classical Markov kernel to the transferred channels and study in this way different non-commutative functional inequalities. The main contribution of this article is the application of this transference principle to the estimation of decoherence time, of private and quantum capacities, of entanglement-assisted classical capacities as well as estimation of entanglement breaking times, defined as the first time for which the channel becomes entanglement breaking. Moreover, our estimates hold for non-ergodic channels such as the collective decoherence channels, an important scenario that has been overlooked so far because of a lack of techniques.
In this paper, we compute the exact values of the minimum output entropy and the completely bounded minimal entropy of very large classes of quantum channels acting on matrix algebras Mn\mathrm{M}_nMn​. Our new and simple approach relies on the theory of locally compact quantum groups and our results use a new and precise description of bounded Fourier multipliers from L1(G)\mathrm{L}^1(\mathbb{G})L1(G) into Lp(G)\mathrm{L}^p(\mathbb{G})Lp(G) for 1<p≤∞1 < p \leq \infty1<p≤∞ where G\mathbb{G}G is a co-amenable locally compact quantum group and on the automatic completely boundedness of these multipliers that this description entails. Indeed, our approach even allows to use convolution operators on quantum hypergroups. This enable us to connect equally the topic of computation of entropies and capacities to subfactor planar algebras. We also give a upper bound of the classical capacity of each considered quantum channel which is already sharp in the commutative case. Quite surprisingly, we observe by direct computations that some Fourier multipliers identifies to direct sums of classical examples of quantum channels (as dephasing channel or depolarizing channels). Indeed, we show that the study of unital qubit channels can be seen as a part of the theory of Fourier multipliers on the von Neumann algebra of the quaternion group Q8\mathbb{Q}_8Q8​. Unexpectedly, we also connect ergodic actions of (quantum) groups to this topic of computation, allowing some transference to other channels. We also connect the Quantum Harmonic analysis of Werner. Finally, we investigate entangling breaking and PPT\mathrm{PPT}PPT Fourier multipliers and we characterize conditional expectations which are entangling breaking.
In this paper, we compute the exact values of the minimum output entropy and the completely bounded minimal entropy of very large classes of quantum channels acting on matrix algebras Mn. Our new and simple approach relies on the theory of locally compact quantum groups and our results use a new and precise description of bounded Fourier multipliers from L1 (G) into Lp(G) for 1 < p< \infty where G is a co-amenable locally compact quantum group and on the automatic completely boundedness of these multipliers that this description entails. Indeed, our approach even allows to use convolution operators on quantum hypergroups. This enable us to connect equally the topic of computation of entropies and capacities to subfactor planar algebras. We also give a upper bound of the classical capacity of each considered quantum channel which is already sharp in the commutative case. Quite surprisingly, we observe by direct computations that some Fourier multipliers identifies to direct sums of classical examples of quantum channels (as dephasing channel or depolarizing channels). Indeed, we show that the study of unital qubit channels can be seen as a part of the theory of Fourier multipliers on the von Neumann algebra of the quaternion group Q8. Unexpectedly, we also connect ergodic actions of (quantum) groups to this topic of computation, allowing some transference to other channels. We also connect the Quantum Harmonic analysis of Werner. Finally, we investigate entangling breaking and PPT Fourier multipliers and we characterize conditional expectations which are entangling breaking.
A basic question in quantum information theory is to quantify the optimal rate of transmitting quantum information via a given quantum channel using certain coding schemes. We study this question for discrete- and continuous-time quantum Markov processes. For continuous-time processes modeling a quantum memory we introduce new capacities where coding channels may be applied during the storage time. We prove upper bounds on these quantities by studying the entropy production of quantum Markov processes.
Abstract Evaluating capacities of quantum channels is the first purpose of quantum Shannon theory, but in most cases the task proves to be very hard. Here, we introduce the set of Multi-level Amplitude Damping quantum channels as a generalization of the standard qubit Amplitude Damping Channel to quantum systems of finite dimension d . In the special case of d = 3, by exploiting degradability, data-processing inequalities, and channel isomorphism, we compute the associated quantum and private classical capacities for a rather wide class of maps, extending the set of models whose capacity can be computed known so far. We proceed then to the evaluation of the entanglement assisted quantum and classical capacities.
This thesis studies the capacities of quantum channels under repeated noisy evolution, with a focus on the long-time behavior of classical and quantum information transmission. The main goal is to understand how much information can still be preserved or recovered when a quantum channel is applied many times, and to develop structural, analytic, and algorithmic tools for characterizing these capacities.The core results are presented in Chapter 2. First, the thesis investigates the infinite-time regime and shows that the asymptotic capacities of quantum channels are determined by the structure of their peripheral subspace. This leads to explicit characterizations of the infinite-time classical capacity and bounds on the infinite-time quantum capacity, together with results on additivity and extensions to more general settings. The thesis then studies the finite-time behavior for GNS-symmetric channels and proves explicit exponential convergence bounds, showing that the capacities approach their infinite-time values rapidly. In addition, algorithmic methods are developed for computing the peripheral structure and the associated capacity quantities efficiently.Chapter 3 explores a related optimization-based direction motivated by Sum-of-Squares methods and semidefinite programming. Using ideas inspired by separability and SDP hierarchies, this part investigates whether machine-learning-assisted ansatz discovery can help construct more efficient SOS certificates. Although this direction is not yet complete in the specific capacity setting, it provides promising intermediate results and suggests new computational approaches for related problems in quantum information theory. Overall, this thesis provides a structural and quantitative understanding of the long-time information-carrying capabilities of noisy quantum dynamical systems, while also opening new perspectives through optimization and machine-learning-based methods.