Alexander Semenovich Holevo (Russian: Алекса́ндр Семéнович Хóлево,[1] also spelled as Kholevo and Cholewo) is a Soviet and Russian mathematician, one of the pioneers of quantum information science.
Alexander Holevo | |
|---|---|
 | |
| Born | 2 September 1943 |
| Nationality | Russian |
| Alma mater | Moscow Institute of Physics and Technology |
| Known for | Holevo's theorem |
| Scientific career | |
| Fields | Mathematician |
| Institutions | Steklov Mathematical Institute, Moscow State University, Moscow Institute of Physics and Technology |
| Doctoral advisor | Yuri Anatolievich Rozanov |
Biography
editSteklov Mathematical Institute, Moscow, since 1969. He graduated from Moscow Institute of Physics and Technology in 1966, defended a PhD Thesis in 1969 and a Doctor of Science Thesis in 1975. Since 1986 A.S. Holevo is a Professor (Moscow State University and Moscow Institute of Physics and Technology).[2]
Research
editA.S. Holevo made substantial contributions in the mathematical foundations of quantum theory, quantum statistics and quantum information theory. In 1973 he obtained an upper bound for the amount of classical information that can be extracted from an ensemble of quantum states by quantum measurements (this result is known as Holevo's theorem). A.S. Holevo developed the mathematical theory of quantum communication channels, the noncommutative theory of statistical decisions, he proved coding theorems in quantum information theory and revealed the structure of quantum Markov semigroups and measurement processes. A.S. Holevo is the author of about one-hundred and seventy published works, including five monographs.[3]
Honours and awards
edit- Andrey Markov Prize of Russian Academy of Sciences (1997)[2][4]
- Prizes for the best scientific achievements of Russian Academy of Sciences (1992, 1995, 2008)[2]
- Quantum Communication Award (1996)[5]
- Alexander von Humboldt Research Award (1999).[6]
- Invited Speaker of the International Congress of Mathematicians, Madrid (2006)[7]
- Claude E. Shannon Award (2016)[8]
Bibliography
edit- Holevo, A. S. (1973). "Bounds for the quantity of information transmitted by a quantum communication channel". Problems of Information Transmission. 9 (3): 177–183.
- Holevo, A. S. (1978). "Studies in general theory of statistical decisions". Proc. Steklov Math. Inst. 124. Steklov Mathematical Institute.
- Holevo, A. S. (1982). Probabilistic and statistical aspects of quantum theory. North Holland. ISBN 0-444-86333-8.[9][10] 2011 pbk edition
- Holevo, A. S. (2001). "Statistical structure of quantum theory". Lect. Notes Phys. Monographs. Lecture Notes in Physics Monographs. 67. Springer. doi:10.1007/3-540-44998-1. ISBN 3-540-42082-7.
- Holevo, A. S. (2013). Quantum systems, channels, information. De Gruyter. ISBN 978-3-11-027325-0.
See also
editReferences
edit- ^ Name and transliteration as given by "Holevo, Alexander Semenovich". Mathnet. Steklov Mathematical Institute RAS. Retrieved 2024-04-10.
- ^ a b c "Holevo Alexander Semenovich on Russian informational portal Math-Net". Retrieved 13 January 2014.
- ^ "Homepage of Alexander S. Holevo". Retrieved 13 January 2014.
- ^ "Andrey Markov Award". Retrieved 13 January 2014.
- ^ "Quantum Communication Award". Retrieved 13 January 2014.
- ^ "Alexander von Humboldt Foundation". Archived from the original on 4 August 2016. Retrieved 13 January 2014.
- ^ Holevo, Alexander S. (2006). "The additivity problem in quantum information theory". In: Proceedings of the International Congress of Mathematicians (Madrid, 2006). Vol. 3. pp. 999–1018.
- ^ "Claude E. Shannon Award".
- ^ Ballentine, Leslie E. (1984). "Review of Probabilistic and Statistical Aspects of Quantum Theory by A. S. Holevo". Physics Today. 37 (2): 64. doi:10.1063/1.2916093. ISSN 0031-9228.
- ^ Gudder, S. P. (1985). "Book Review: Probabilistic and statistical aspects of quantum theory". Bulletin of the American Mathematical Society. 13 (1): 80–86. doi:10.1090/S0273-0979-1985-15378-9. ISSN 0273-0979.
 | This article about a Russian mathematician is a stub. You can help Wikipedia by expanding it. |