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 Journal of Quantum Information

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

Masahito Hayashi

Published Apr 30, 2024• 1 citation
Publisher

Abstract

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.
DOI
10.1142/s0219749924400069

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 Cramero-Rao approach, and quantum estimation with the group covariant approach. This paper addresses these three topics.

arXiv:2404.16550•Apr 25, 2024•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•204 citations

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•108 citations

Coding theorem and strong converse for quantum channels

Andreas Winter

We present a new proof of Holevo's (1973, 1977) coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfwitz's (1964) combinatorial approach using types of sequences. As a byproduct of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new proof of Holevo's information bound.

arXiv:1409.2536•IEEE Transactions on Information Theory•Jan 1, 1999•450 citations

An Introduction to Error-Correcting Codes: From Classical to Quantum

Hsun‐Hsien Chang

This report surveys quantum error-correcting codes. As Preskill claimed, 21st century would be the golden age of quantum error correction. Quantum channels behave differently from classical channels, so researchers face difficulties in developing robust quantum codes. Fortunately, the classical error control methods have been well developed. If we can learn many lessons from classical coding theory, we can expedite the development of quantum codes. Scientists have discovered that quantum error correction shares many concepts with classical counterpart. Both quantum and classical coding schemes add redundancy to information to protect against noises. They also have similar conditions for error detectability and correctability.

arXiv:quant-ph/0602157•Feb 18, 2006•4 citations

Random matrix techniques in quantum information theory

Benoı̂t Collins, Ion Nechita

The purpose of this review is to present some of the latest developments using random techniques, and in particular, random matrix techniques in quantum information theory. Our review is a blend of a rather exhaustive review and of more detailed examples—coming mainly from research projects in which the authors were involved. We focus on two main topics, random quantum states and random quantum channels. We present results related to entropic quantities, entanglement of typical states, entanglement thresholds, the output set of quantum channels, and violations of the minimum output entropy of random channels.

arXiv:1509.04689•Journal of Mathematical Physics•Dec 10, 2015•110 citations
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.
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 report surveys quantum error-correcting codes. As Preskill claimed, 21st century would be the golden age of quantum error correction. Quantum channels behave differently from classical channels, so researchers face difficulties in developing robust quantum codes. Fortunately, the classical error control methods have been well developed. If we can learn many lessons from classical coding theory, we can expedite the development of quantum codes. Scientists have discovered that quantum error correction shares many concepts with classical counterpart. Both quantum and classical coding schemes add redundancy to information to protect against noises. They also have similar conditions for error detectability and correctability.
The purpose of this review is to present some of the latest developments using random techniques, and in particular, random matrix techniques in quantum information theory. Our review is a blend of a rather exhaustive review and of more detailed examples—coming mainly from research projects in which the authors were involved. We focus on two main topics, random quantum states and random quantum channels. We present results related to entropic quantities, entanglement of typical states, entanglement thresholds, the output set of quantum channels, and violations of the minimum output entropy of random channels.