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

WORLD SCIENTIFIC eBooks

Alexander S. Holevo’s researches in quantum information theory in 20th century

Masahito Hayashi

Published Aug 1, 2025• 0 citations
Publisher

Abstract

This Chapter reviews Holevo’s contributions to quantum information theory during the 20 century. At that time, he mainly studied three topics, classical-quantum channel coding, quantum estimation with Craméro–Rao approach and quantum estimation with the group covariant approach. This Chapter addresses these three topics.
DOI
10.1142/9789819806607_0003

Related papers

Alexander S. Holevo’s researches in quantum information theory in 20th century

Masahito Hayashi

This paper reviews Holevo’s contributions to quantum information theory during the 20 century. At that time, he mainly studied three topics, classical-quantum channel coding, quantum estimation with Craméro–Rao approach and quantum estimation with the group covariant approach. This paper addresses these three topics.

arXiv:2404.16550•International Journal of Quantum Information•Apr 30, 2024•1 citation

Coding Theorems of Quantum Information Theory

Andreas Winter

Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information transmission via quantum channels we give a new proof of the coding theorem, and prove the strong converse, even under the extended model of nonstationary channels. As a by-product we obtain a new proof of the famous Holevo bound. Then multi-user systems are investigated, and the capacity region for the quantum multiple access channel is determined. The last chapter contains a preliminary discussion of some models of compression of correlated quantum sources, and a proposal for a program to obtain operational meaning for quantum conditional entropy. An appendix features the introduction of a notation and calculus of entropy in quantum systems.

arXiv:quant-ph/9907077•Jul 24, 1999•143 citations

Introduction to Quantum Information Theory

Sándor Imre, László Gyöngyösi

This chapter summarizes the definitions and formulas of quantum information theory. Quantum information processing exploits the quantum nature of information. It resolve still open scientific problems and expand the boundaries of classical computation and communications systems. The chapter discusses the properties of density matrices, quantum entropy function, quantum mutual information, and quantum conditional entropy. It also discusses the measurement of the entanglement in quantum states. The chapter describes the encoding of quantum states and the meaning of Holevo information. It focuses on the quantum noiseless channel coding theorem and the compression of quantum information. The chapter explains the functions that play an important role in the computation of quantum informational distance. Controlled Vocabulary Terms channel coding; information theory; optical information processing; quantum communication; quantum cryptography

Wiley eBooks•Nov 30, 2012•8 citations

The Longer Term: Quantum Information Processing and Communication

Philippe Jorrand

Information is physical. Today’s information processing and communication are classical: they are based upon the laws of Newton’s and Maxwell’s classical physics. This assertion holds all the way, from commercial computers and networks, up to their most abstract models, e.g. Turing machines. Research in quantum information was born some twenty five years ago, with the encounter of two major scientific achievements of the 20th century, namely quantum physics and information sciences. A technological motivation for that is an extrapolation of Moore’s law which seems to indicate that the amount of matter needed for one bit will be reduced to one particle sometimes before year 2020. A deeper, scientific driving force of this interdisciplinary research is that of looking for the consequences of having computation and communication based directly upon the laws of quantum physics, i.e. our current ultimate knowledge of the world of elementary particles, as described by quantum mechanics. Breakthroughs in cryptography, communications, information theory and algorithmics have shown that this transplantation from classical to quantum has far reaching consequences, both quantitative and qualitative, and opens new avenues for research within the foundations of computer science and physics. The principles 388 and most striking results and hot topics of this promising way of encoding, processing and communicating information are briefly introduced in this chapter from a mostly computer science point of view, with detailed examples in algorithmics and in cryptography. At the end of the chapter, a short list of some significant articles, textbooks and reports on quantum information are suggested for further reading.

•May 8, 2019•0 citations

Multi-parameter estimation beyond quantum Fisher information

Rafał Demkowicz-Dobrzański, Wojciech Górecki, Mădălin Guţǎ

Abstract This review aims at gathering the most relevant quantum multi-parameter estimation methods that go beyond the direct use of the quantum Fisher information concept. We discuss in detail the Holevo Cramér–Rao bound, the quantum local asymptotic normality approach as well as Bayesian methods. Even though the fundamental concepts in the field have been laid out more than forty years ago, a number of important results have appeared much more recently. Moreover, the field drew increased attention recently thanks to advances in practical quantum metrology proposals and implementations that often involve estimation of multiple parameters simultaneously. Since the topics covered in these review are spread in the literature and often served in a very formal mathematical language, one of the main goals of this review is to provide a largely self-contained work that allows the reader to follow most of the derivations and get an intuitive understanding of the interrelations between different concepts using a set of simple yet representative examples involving qubit and Gaussian shift models.

arXiv:2001.11742•Journal of Physics A Mathematical and Theoretical•Apr 30, 2020•223 citations

Quantum Information Theory: Classical Communication Over Quantum Channels

John A. Cortese

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.

•Feb 18, 2004•4 citations
Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information transmission via quantum channels we give a new proof of the coding theorem, and prove the strong converse, even under the extended model of nonstationary channels. As a by-product we obtain a new proof of the famous Holevo bound. Then multi-user systems are investigated, and the capacity region for the quantum multiple access channel is determined. The last chapter contains a preliminary discussion of some models of compression of correlated quantum sources, and a proposal for a program to obtain operational meaning for quantum conditional entropy. An appendix features the introduction of a notation and calculus of entropy in quantum systems.
This chapter summarizes the definitions and formulas of quantum information theory. Quantum information processing exploits the quantum nature of information. It resolve still open scientific problems and expand the boundaries of classical computation and communications systems. The chapter discusses the properties of density matrices, quantum entropy function, quantum mutual information, and quantum conditional entropy. It also discusses the measurement of the entanglement in quantum states. The chapter describes the encoding of quantum states and the meaning of Holevo information. It focuses on the quantum noiseless channel coding theorem and the compression of quantum information. The chapter explains the functions that play an important role in the computation of quantum informational distance. Controlled Vocabulary Terms channel coding; information theory; optical information processing; quantum communication; quantum cryptography
Information is physical. Today’s information processing and communication are classical: they are based upon the laws of Newton’s and Maxwell’s classical physics. This assertion holds all the way, from commercial computers and networks, up to their most abstract models, e.g. Turing machines. Research in quantum information was born some twenty five years ago, with the encounter of two major scientific achievements of the 20th century, namely quantum physics and information sciences. A technological motivation for that is an extrapolation of Moore’s law which seems to indicate that the amount of matter needed for one bit will be reduced to one particle sometimes before year 2020. A deeper, scientific driving force of this interdisciplinary research is that of looking for the consequences of having computation and communication based directly upon the laws of quantum physics, i.e. our current ultimate knowledge of the world of elementary particles, as described by quantum mechanics. Breakthroughs in cryptography, communications, information theory and algorithmics have shown that this transplantation from classical to quantum has far reaching consequences, both quantitative and qualitative, and opens new avenues for research within the foundations of computer science and physics. The principles 388 and most striking results and hot topics of this promising way of encoding, processing and communicating information are briefly introduced in this chapter from a mostly computer science point of view, with detailed examples in algorithmics and in cryptography. At the end of the chapter, a short list of some significant articles, textbooks and reports on quantum information are suggested for further reading.
Abstract This review aims at gathering the most relevant quantum multi-parameter estimation methods that go beyond the direct use of the quantum Fisher information concept. We discuss in detail the Holevo Cramér–Rao bound, the quantum local asymptotic normality approach as well as Bayesian methods. Even though the fundamental concepts in the field have been laid out more than forty years ago, a number of important results have appeared much more recently. Moreover, the field drew increased attention recently thanks to advances in practical quantum metrology proposals and implementations that often involve estimation of multiple parameters simultaneously. Since the topics covered in these review are spread in the literature and often served in a very formal mathematical language, one of the main goals of this review is to provide a largely self-contained work that allows the reader to follow most of the derivations and get an intuitive understanding of the interrelations between different concepts using a set of simple yet representative examples involving qubit and Gaussian shift models.
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.