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

International Conference on Information and Communication Technology Convergence (ICTC)

Classical Capacity Regions for Generalized Pauli Channels

Junaid ur Rehman, Kyesan Lee, Hyundong Shin

Published Oct 20, 2021• 0 citations
Publisher

Abstract

Computing the classical capacity of arbitrary quantum channels is a computationally expensive task. We first review a recently proposed lower bound on the classical capacity of the generalized Pauli channel. Then, we evaluate another recent result that upper bounds the classical capacity of quantum channels. These two bounds together allow us to characterize the capacity regions for generalized Pauli channels. We present numerical examples and propose some future works.

DOI
10.1109/ictc52510.2021.9620220

Related papers

Classical capacity of generalized Pauli channels

Katarzyna Siudzińska

Abstract Finding the classical capacity of a quantum channel is not easy, yet we are able to analytically calculate this capacity for new channels. We analyze the bounds of the Holevo capacity and classical capacity for the generalized Pauli channels. In particular, by generalizing earlier results for the Weyl channels, we obtain the lower and upper bounds of the Holevo capacity and show that, if these bounds coincide, the Holevo capacity is weakly additive. We also prove the weak additivity of the lower bound. Two new examples of the generalized Pauli channels with known classical capacity are presented. Finally, we relate the change rate of the classical capacity to the P-divisibility of Pauli channels.

arXiv:1908.03917•Journal of Physics A Mathematical and Theoretical•Aug 25, 2020•19 citations

Capacities of the covariant Pauli channel

Abbas Poshtvan, Vahid Karimipour

We study four well-known capacities of a two-parameter family of qubit Pauli channels. These are the channels that are covariant under the $\text{SO}(2)$ group and contain the depolarizing channel as a special case. We find exact expressions for the classical capacity and entanglement-assisted capacities, and analytically determine the regions where the quantum capacity of the channel vanishes. We then use a flag extension to find upper bound for the quantum capacity and private capacity of these channels in the entire region of parameter space and also obtain the lower bound for the quantum capacity by calculating the single-shot quantum capacity numerically. In conjunction with previous results on depolarizing channels, our result is one step forward for determining the capacities of the full Pauli channel.

arXiv:2206.06106•Physical Review A•Dec 8, 2022•7 citations

Potential Capacities of Quantum Channels

Andreas Winter, Dong Yang

We introduce potential capacities of quantum channels in an operational way and provide upper bounds for these quantities, which quantify the ultimate limit of usefulness of a channel for a given task in the best possible context. Unfortunately, except for a few isolated cases, potential capacities seem to be as hard to compute as their plain analogues. We thus study upper bounds on some potential capacities. For the classical capacity, we give an upper bound in terms of the entanglement of formation. To establish a bound for the quantum and private capacity, we first lift the channel to a Hadamard channel and then prove that the quantum and private capacity of a Hadamard channel is strongly additive, implying that for these channels, potential and plain capacity are equal. Employing these upper bounds, we show that if a channel is noisy, however close it is to the noiseless channel, then it cannot be activated into the noiseless channel by any other contextual channel; this conclusion holds for all the three capacities. We also discuss the so-called environment-assisted quantum capacity, because we are able to characterize its potential version.

arXiv:1505.00907•IEEE Transactions on Information Theory•Jan 21, 2016•39 citations

Lower bounds on the nonzero capacity of Pauli channels

Jesse Fern, K. Birgitta Whaley

We study encodings that give the best-known thresholds for the nonzero capacity of quantum channels, i.e., the upper bound for correctable noise, using an entropic approach to calculation of the threshold values. Our results show that Pauli noise is correctable up to the hashing bound. For a depolarizing channel, this approach allows one to achieve a nonzero capacity for a fidelity (probability of no error) of $f=0.808\phantom{\rule{0.2em}{0ex}}70$.

arXiv:0708.1597•Physical Review A•Dec 19, 2008•70 citations

Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions

Jon Yard, Patrick M. Hayden, Igor Devetak

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multiletter characterizations of two different two-dimensional capacity regions. The first region comprises the rates at which it is possible for one sender to send classical information, while the other sends quantum information. The second region consists of the rates at which each sender can send quantum information. For each region, we give an example of a channel for which the corresponding region has a single-letter description. One of our examples relies on a new result proved here, perhaps of independent interest, stating that the coherent information over any degradable channel is concave in the input density operator. We conclude with connections to other work and a discussion on generalizations where each user simultaneously sends classical and quantum information.

arXiv:quant-ph/0501045•IEEE Transactions on Information Theory•Jun 16, 2008•125 citations

Detecting Lower Bounds to Quantum Channel Capacities

Chiara Macchiavello, Massimiliano Federico Sacchi

We propose a method to detect lower bounds to quantum capacities of a noisy quantum communication channel by means of a few measurements. The method is easily implementable and does not require any knowledge about the channel. We test its efficiency by studying its performance for most well-known single-qubit noisy channels and for the generalized Pauli channel in an arbitrary finite dimension.

arXiv:1510.00219•Physical Review Letters•Apr 6, 2016•24 citations
Computing the classical capacity of arbitrary quantum channels is a computationally expensive task. We first review a recently proposed lower bound on the classical capacity of the generalized Pauli channel. Then, we evaluate another recent result that upper bounds the classical capacity of quantum channels. These two bounds together allow us to characterize the capacity regions for generalized Pauli channels. We present numerical examples and propose some future works.
Abstract Finding the classical capacity of a quantum channel is not easy, yet we are able to analytically calculate this capacity for new channels. We analyze the bounds of the Holevo capacity and classical capacity for the generalized Pauli channels. In particular, by generalizing earlier results for the Weyl channels, we obtain the lower and upper bounds of the Holevo capacity and show that, if these bounds coincide, the Holevo capacity is weakly additive. We also prove the weak additivity of the lower bound. Two new examples of the generalized Pauli channels with known classical capacity are presented. Finally, we relate the change rate of the classical capacity to the P-divisibility of Pauli channels.
We study four well-known capacities of a two-parameter family of qubit Pauli channels. These are the channels that are covariant under the SO(2)\text{SO}(2)SO(2) group and contain the depolarizing channel as a special case. We find exact expressions for the classical capacity and entanglement-assisted capacities, and analytically determine the regions where the quantum capacity of the channel vanishes. We then use a flag extension to find upper bound for the quantum capacity and private capacity of these channels in the entire region of parameter space and also obtain the lower bound for the quantum capacity by calculating the single-shot quantum capacity numerically. In conjunction with previous results on depolarizing channels, our result is one step forward for determining the capacities of the full Pauli channel.
We introduce potential capacities of quantum channels in an operational way and provide upper bounds for these quantities, which quantify the ultimate limit of usefulness of a channel for a given task in the best possible context. Unfortunately, except for a few isolated cases, potential capacities seem to be as hard to compute as their plain analogues. We thus study upper bounds on some potential capacities. For the classical capacity, we give an upper bound in terms of the entanglement of formation. To establish a bound for the quantum and private capacity, we first lift the channel to a Hadamard channel and then prove that the quantum and private capacity of a Hadamard channel is strongly additive, implying that for these channels, potential and plain capacity are equal. Employing these upper bounds, we show that if a channel is noisy, however close it is to the noiseless channel, then it cannot be activated into the noiseless channel by any other contextual channel; this conclusion holds for all the three capacities. We also discuss the so-called environment-assisted quantum capacity, because we are able to characterize its potential version.
We study encodings that give the best-known thresholds for the nonzero capacity of quantum channels, i.e., the upper bound for correctable noise, using an entropic approach to calculation of the threshold values. Our results show that Pauli noise is correctable up to the hashing bound. For a depolarizing channel, this approach allows one to achieve a nonzero capacity for a fidelity (probability of no error) of f=0.80870f=0.808\phantom{\rule{0.2em}{0ex}}70f=0.80870.
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multiletter characterizations of two different two-dimensional capacity regions. The first region comprises the rates at which it is possible for one sender to send classical information, while the other sends quantum information. The second region consists of the rates at which each sender can send quantum information. For each region, we give an example of a channel for which the corresponding region has a single-letter description. One of our examples relies on a new result proved here, perhaps of independent interest, stating that the coherent information over any degradable channel is concave in the input density operator. We conclude with connections to other work and a discussion on generalizations where each user simultaneously sends classical and quantum information.