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

Quantum Information Theory: Classical Communication Over Quantum Channels

John A. Cortese

Published Feb 18, 2004• 4 citations
Publisher

Abstract

This thesis studies classical communication over quantum channels. Chapter 1 describes an algebraic technique which extends several previously known qubit channel capacity results to the qudit quantum channel case. Chapter 2 derives a formula for the relative entropy function of two qubit density matrices in terms of their Bloch vectors. The application of the Bloch vector relative entropy formula to the determination of Holevo-Schumacher-Westmoreland (HSW) capacities for qubit quantum channels is discussed. Chapter 3 outlines several numerical simulation results which support theoretical conclusions and conjectures discussed in Chapters 1 and 2. Chapter 4 closes the thesis with comments, examples and discussion on the additivity of Holevo Chi and the HSW channel capacity.

DOI
10.7907/v68w-yk95

Related papers

Relative Entropy and Single Qubit Holevo-Schumacher-Westmoreland Channel Capacity

John A. Cortese

The relative entropy description of Holevo-Schumacher-Westmoreland (HSW) classical channel capacity is applied to single qubit channels. A simple formula for the relative entropy of qubit density matrices in the Bloch sphere representation is derived. This formula is combined with the King-Ruskai-Szarek-Werner qubit channel ellipsoid picture to analyze several unital and non-unital qubit channels in detail. An alternate proof that the optimal HSW signalling states for single qubit unital channels are those states with the minimum channel output entropy is presented. The derivation is based on the symmetries of the qubit relative entropy formula and the King-Ruskai-Szarek-Werner qubit channel ellipsoid picture. A proof is given that the average output density matrix of any set of optimal HSW signalling states for a (qubit or non-qubit) quantum channel is unique.

arXiv:quant-ph/0207128•Jul 22, 2002•5 citations

A general formula for the classical capacity of a general quantum channel

M. Hayashi, H. Nagaoka

We derive a general formula of the channel capacity for any (classical-) quantum channel. It can be regarded as a quantum version of Verdu and Han's result (see IEEE Trans. Inform. Theory, vol.40, p.1147-57, 1994). Our results contain Holevo's (see IEEE Trans. Inform. Theory, vol.44, p.269-73, 1998) and Schumacher and Westmoreland's (see Phys. Rev. A, vol.56, p.131-8, 1997) results as the stationary and memoryless case.

arXiv:quant-ph/0206186•IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2003•12 citations

Classical Information Capacities of Some Single Qubit Quantum Noisy Channels

Xian-Ting Liang

By using the Holevo–Schumacher–Westmoreland theorem and through solving eigenvalues of states out from the quantum noisy channels directly, or with the help of the Bloch sphere representation, or Stokes parametrization representation, we investigate the classical information capacities of some well-known quantum noisy channels.

Communications in Theoretical Physics•May 15, 2003•37 citations

Classical Information Capacities of Some Single Qubit Quantum Noisy Channels

LINGXian-Ting

By using the Holevo-Schumacher-Westmoreland theorem and through solving eigenvalues of states out from the quantum noisy channels directly, or with the help of the Bloch sphere representation, or Stokes parametrization representation, we investigate the classical information capacities of some well-known quantum noisy channels.

理论物理通讯：英文版•Jan 1, 2003•0 citations

The Information-carrying capacity of certain quantum channels

Ciara Morgan

In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.

arXiv:1007.2723•Irish Mathematical Society Bulletin•Jan 1, 2010•1 citation

Quantum channel noise and channel capacity

E. Desurvire

This chapter introduces the notion of noisy quantum channels , and the different types of “quantum noise” that affect qubit messages passed through such channels. The main types of noisy channel reviewed here are the depolarizing , bit-flip , phase-flip , and bit-phase-flip channels. Then the quantum channel capacity χ is defined through the Holevo–Schumacher–Westmoreland (HSW) theorem. Such a theorem can conceptually be viewed as the elegant quantum counterpart of Shannon's (noisy) channel coding theorem , which was described in Chapter 13. Here, I shall not venture into the complex proof of the HSW theorem but only provide a background illustrating the similarity with its classical counterpart. The resemblance with the channel capacity χ and the Holevo bound , as described in Chapter 21, and with the classical mutual information H ( X ; Y ), as described in Chapter 5, are both discussed. For advanced reference, a hint is provided as to the meaning of the still not fully explored concept of quantum coherent information . Several examples of quantum channel capacity, derived from direct applications of the HSW theorem, along with the solution of the maximization problem, are provided. Noisy quantum channels The notion of “noisiness” in a classical communication channel was first introduced in Chapter 12, when describing channel entropy . Such a channel can be viewed schematically as a probabilistic relation between two random sources, X for the originator, and Y for the recipient.

Cambridge University Press eBooks•Feb 19, 2009•0 citations
This thesis studies classical communication over quantum channels. Chapter 1 describes an algebraic technique which extends several previously known qubit channel capacity results to the qudit quantum channel case. Chapter 2 derives a formula for the relative entropy function of two qubit density matrices in terms of their Bloch vectors. The application of the Bloch vector relative entropy formula to the determination of Holevo-Schumacher-Westmoreland (HSW) capacities for qubit quantum channels is discussed. Chapter 3 outlines several numerical simulation results which support theoretical conclusions and conjectures discussed in Chapters 1 and 2. Chapter 4 closes the thesis with comments, examples and discussion on the additivity of Holevo Chi and the HSW channel capacity.
The relative entropy description of Holevo-Schumacher-Westmoreland (HSW) classical channel capacity is applied to single qubit channels. A simple formula for the relative entropy of qubit density matrices in the Bloch sphere representation is derived. This formula is combined with the King-Ruskai-Szarek-Werner qubit channel ellipsoid picture to analyze several unital and non-unital qubit channels in detail. An alternate proof that the optimal HSW signalling states for single qubit unital channels are those states with the minimum channel output entropy is presented. The derivation is based on the symmetries of the qubit relative entropy formula and the King-Ruskai-Szarek-Werner qubit channel ellipsoid picture. A proof is given that the average output density matrix of any set of optimal HSW signalling states for a (qubit or non-qubit) quantum channel is unique.
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is, the capacity which is achieved by encoding the output states from a source into codewords comprised of states taken from ensembles of non-entangled states and sending them over copies of the quantum channel. Using the "single-letter" formula proved independently by Holevo and by Schumacher and Westmoreland we obtain the product-state capacity of the qubit quantum amplitude-damping channel, which is determined by a transcendental equation in a single real variable and can be solved numerically. We demonstrate that the product-state capacity of this channel can be achieved using a minimal ensemble of non-orthogonal pure states. Next we consider the classical capacity of two quantum channels with memory, namely a periodic channel with quantum depolarising channel branches and a convex combination of quantum channels. We prove that the classical capacity for each of the classical memory channels mentioned above is, in fact, equal to the respective product-state capacities. For those channels this means that the classical capacity is achieved without the use of entangled input-states. Next we introduce the channel coding theorem for memoryless quantum channels, providing a known proof by Winter for the strong converse of the theorem. We then consider the strong converse to the channel coding theorem for a periodic quantum channel.
This chapter introduces the notion of noisy quantum channels , and the different types of “quantum noise” that affect qubit messages passed through such channels. The main types of noisy channel reviewed here are the depolarizing , bit-flip , phase-flip , and bit-phase-flip channels. Then the quantum channel capacity χ is defined through the Holevo–Schumacher–Westmoreland (HSW) theorem. Such a theorem can conceptually be viewed as the elegant quantum counterpart of Shannon's (noisy) channel coding theorem , which was described in Chapter 13. Here, I shall not venture into the complex proof of the HSW theorem but only provide a background illustrating the similarity with its classical counterpart. The resemblance with the channel capacity χ and the Holevo bound , as described in Chapter 21, and with the classical mutual information H ( X ; Y ), as described in Chapter 5, are both discussed. For advanced reference, a hint is provided as to the meaning of the still not fully explored concept of quantum coherent information . Several examples of quantum channel capacity, derived from direct applications of the HSW theorem, along with the solution of the maximization problem, are provided. Noisy quantum channels The notion of “noisiness” in a classical communication channel was first introduced in Chapter 12, when describing channel entropy . Such a channel can be viewed schematically as a probabilistic relation between two random sources, X for the originator, and Y for the recipient.