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:1810.05160 · Physical Review A

Regularized maximal fidelity of the generalized Pauli channels

Katarzyna Siudzińska

Published Jan 23, 2019• 7 citations
arXivHTMLPDF

Abstract

We consider the asymptotic regularization of the maximal fidelity for the generalized Pauli channels, which is a problem similar to the classical channel capacity. In particular, we find the exact formulas for the extremal channel fidelities and the maximal output $\ensuremath{\infty}$-norm. For wide classes of channels, we show that these quantities are weakly multiplicative. Finally, we find the regularized maximal fidelity for the channels satisfying the time-local master equations.

DOI
10.1103/physreva.99.012340

Related papers

Regularized maximum pure-state input-output fidelity of a quantum channel

Moritz Ernst, Rochus Klesse

As a toy model for the capacity problem in quantum information theory we investigate finite and asymptotic regularizations of the maximum pure-state input-output fidelity $F(\mathcal{N})$ of a general quantum channel $\mathcal{N}$. We show that the asymptotic regularization $\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{F}(\mathcal{N})$ is lower bounded by the maximum output $\ensuremath{\infty}$-norm ${\ensuremath{\nu}}_{\ensuremath{\infty}}(\mathcal{N})$ of the channel. For $\mathcal{N}$ being a Pauli channel, we find that both quantities are equal.

arXiv:1708.06660•Physical Review A•Dec 19, 2017•5 citations

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

Almost all Pauli Channels have non-zero quantum capacities

Xiaoyu Chen, Li-zhen Jiang

Quantum transmission rate may be improved by using input of entangled state instead of product state for Pauli channel. Using GHZ state as input for the depolarizing channel (a special Pauli channel), the channel fidelity of non-zero quantum capacity was improved from> 0.81071 to> 0.80944. We will introduce orthogonal and complete code basis to evaluate the coherent information per channel use when the input is the maximal mixture of stabilizer codewords. In the code basis, the output density matrix is diagonal, the joint output is block diagonal. The coherent information is worked out by counting the weights of error operators. Quantum capacity is analytically proved to be non-zero for all values of channel fidelity except

•Sep 24, 2009•0 citations

Engineering Classical Capacity of Generalized Pauli Channels with Admissible Memory Kernels

Katarzyna Siudzińska, Arpan Das, Anindita Bera

In this paper, we analyze the classical capacity of the generalized Pauli channels generated via memory kernel master equations. For suitable engineering of the kernel parameters, evolution with non-local noise effects can produce dynamical maps with a higher capacity than a purely Markovian evolution. We provide instructive examples for qubit and qutrit evolution. Interestingly, similar behavior is not observed when analyzing time-local master equations.

arXiv:2109.10152•Entropy•Oct 21, 2021•6 citations

On some additivity problems in quantum information theory

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity", and the "maximal output purity". All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture.

arXiv:math-ph/0003002•Mar 4, 2000•125 citations

Additivity/Multiplicativity Communication Channels

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Feb 24, 2006•0 citations
We consider the asymptotic regularization of the maximal fidelity for the generalized Pauli channels, which is a problem similar to the classical channel capacity. In particular, we find the exact formulas for the extremal channel fidelities and the maximal output \ensuremath∞\ensuremath{\infty}\ensuremath∞-norm. For wide classes of channels, we show that these quantities are weakly multiplicative. Finally, we find the regularized maximal fidelity for the channels satisfying the time-local master equations.
As a toy model for the capacity problem in quantum information theory we investigate finite and asymptotic regularizations of the maximum pure-state input-output fidelity F(N)F(\mathcal{N})F(N) of a general quantum channel N\mathcal{N}N. We show that the asymptotic regularization $\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{F}(\mathcal{N})$ is lower bounded by the maximum output $\ensuremath{\infty}$-norm ${\ensuremath{\nu}}_{\ensuremath{\infty}}(\mathcal{N})$ of the channel. For N\mathcal{N}N being a Pauli channel, we find that both quantities are equal.
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.
Quantum transmission rate may be improved by using input of entangled state instead of product state for Pauli channel. Using GHZ state as input for the depolarizing channel (a special Pauli channel), the channel fidelity of non-zero quantum capacity was improved from> 0.81071 to> 0.80944. We will introduce orthogonal and complete code basis to evaluate the coherent information per channel use when the input is the maximal mixture of stabilizer codewords. In the code basis, the output density matrix is diagonal, the joint output is block diagonal. The coherent information is worked out by counting the weights of error operators. Quantum capacity is analytically proved to be non-zero for all values of channel fidelity except
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity", and the "maximal output purity". All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture.
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.