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• 22 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•9 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•50 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

The structure of degradable quantum channels

Toby S. Cubitt, Mary Beth Ruskai, Graeme Smith

Degradable quantum channels are among the only channels whose quantum and private classical capacities are known. As such, determining the structure of these channels is a pressing open question in quantum information theory. We give a comprehensive review of what is currently known about the structure of degradable quantum channels, including a number of new results as well as alternate proofs of some known results. In the case of qubits, we provide a complete characterization of all degradable channels with two dimensional output, give a new proof that a qubit channel with two Kraus operators is either degradable or anti-degradable, and present a complete description of anti-degradable unital qubit channels with a new proof. For higher output dimensions we explore the relationship between the output and environment dimensions (dB and dE, respectively) of degradable channels. For several broad classes of channels we show that they can be modeled with an environment that is “small” in the sense of ΦC. Such channels include all those with qubit or qutrit output, those that map some pure state to an output with full rank, and all those which can be represented using simultaneously diagonal Kraus operators, even in a non-orthogonal basis. Perhaps surprisingly, we also present examples of degradable channels with “large” environments, in the sense that the minimal dimension dE>dB. Indeed, one can have dE>14dB2. These examples can also be used to give a negative answer to the question of whether additivity of the coherent information is helpful for establishing additivity for the Holevo capacity of a pair of channels. In the case of channels with diagonal Kraus operators, we describe the subclasses that are complements of entanglement breaking channels. We also obtain a number of results for channels in the convex hull of conjugations with generalized Pauli matrices. However, a number of open questions remain about these channels and the more general case of random unitary channels.

arXiv:0802.1360•Journal of Mathematical Physics•Oct 1, 2008•124 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.
Degradable quantum channels are among the only channels whose quantum and private classical capacities are known. As such, determining the structure of these channels is a pressing open question in quantum information theory. We give a comprehensive review of what is currently known about the structure of degradable quantum channels, including a number of new results as well as alternate proofs of some known results. In the case of qubits, we provide a complete characterization of all degradable channels with two dimensional output, give a new proof that a qubit channel with two Kraus operators is either degradable or anti-degradable, and present a complete description of anti-degradable unital qubit channels with a new proof. For higher output dimensions we explore the relationship between the output and environment dimensions (dB and dE, respectively) of degradable channels. For several broad classes of channels we show that they can be modeled with an environment that is “small” in the sense of ΦC. Such channels include all those with qubit or qutrit output, those that map some pure state to an output with full rank, and all those which can be represented using simultaneously diagonal Kraus operators, even in a non-orthogonal basis. Perhaps surprisingly, we also present examples of degradable channels with “large” environments, in the sense that the minimal dimension dE>dB. Indeed, one can have dE>14dB2. These examples can also be used to give a negative answer to the question of whether additivity of the coherent information is helpful for establishing additivity for the Holevo capacity of a pair of channels. In the case of channels with diagonal Kraus operators, we describe the subclasses that are complements of entanglement breaking channels. We also obtain a number of results for channels in the convex hull of conjugations with generalized Pauli matrices. However, a number of open questions remain about these channels and the more general case of random unitary channels.