Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; the references it cites are not checked yet.

A Survey on Quantum Channel Capacities

Open access
Gyongyosi, Laszlo, Imre, Sandor, Nguyen, Hung Viet · 2018 · IEEE Communications Surveys & Tutorials

Abstract

Quantum information processing exploits the quantum nature of information. It offers fundamentally new solutions in the field of computer science and extends the possibilities to a level that cannot be imagined in classical communication systems. For quantum communication channels, many new capacity definitions were developed in comparison to classical counterparts. A quantum channel can be used to realize classical information transmission or to deliver quantum information, such as quantum entanglement. Here we review the properties of the quantum communication channel, the various capacity measures and the fundamental differences between the classical and quantum channels.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/comst.2017.2786748

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

The citation lists are queued

They are fetched later and appear here then.

References 485 · Cited by 337

Research works printed but not linked: 82

  1. king, 2009, Remark on the Additivity Conjecture for The Quantum Depolarizing Channel
  2. king, 2007, Properties of conjugate channels with applications to additivity and multiplicativity, Markov Processes Related Fields, 13, 391
  3. galambos, 2010, Modeling the superdense coding in satellite-satellite and ground-satellite communications, Proc Of the 10th Asian Conf on Quantum Inf Sci, 205
  4. giovannetti, 2004, Classical capacity of free-space optical communication, Quantum Inf Comput, 4, 489
  5. king, 2003, Maximal p-norms of entanglement breaking channels, Quantum Inf Comput, 3, 186
  6. kullback, 1987, Letter to the editor: The Kullback–Leibler distance, Amer Stat, 41, 340
  7. kullback, 1959, Information Theory and Statistics
  8. gordon, 1964, Noise at optical frequencies; information theory, Proc Int School Phys Enrico Fermi Quant Electron Coherent Light, 156
  9. goodman, 2004, Handbook of Discrete and Computational Geometry
  10. grössing, 1988, Quantum cellular automata, Complex Syst, 2, 197
  11. griffiths, 1995, Introduction to Quantum Mechanics
  12. gottesman, 2002, An Introduction to Quantum Error Correction Quantum Computation A Grand Mathematical Challenge for the Twenty-First Century and the Millennium, 221
  13. evans, 2007, Error correction optimisation in the presence of X/Z asymmetry, ArXiv
  14. levitin, 1969, On the quantum measure of the amount of information, Proc 4th All Union Conf Inf Theory (Russian), 111
  15. 2010, MEMS shown to enable quantum computing
  16. gyongyosi, 2011, Quantum cryptographic protocols and quantum security, Cryptography Protocols Design and Applications
  17. gyongyosi, 2011, Cellular automata, Quantum Cellular Automata Controlled Self-Organizing Networks
  18. worboys, 2004, GIS A Computing Perspective
  19. 2011, Sample Records for Quantum Computer Development From WorldWideScience org
  20. oto, 2004, Computational geometry on 1-qubit quantum states, Proc 4th Int Symp Voronoi Diagrams Sci Eng, 145
  21. hagar, 2017, Quantum computing, The Stanford Encyclopedia of Philosophy
  22. oi, 2001, The geometry of single-qubit maps, eprint quantph/0106035v1
  23. voronoi, 1907, Nouvelles applications des parametres continusa la theorie des formes quadratiques. Premier M’emoire: Sur quelques propri’et’es des formes quadratiques positives parfaites, J reine angew Math, 133, 97
  24. watrous, 2006, Lecture Notes in Quantum Computation
  25. petz, 2008, Quantum Information Theory and Quantum Statistics
  26. perez-delgado, 2005, Models of quantum cellular automata, Phys Rev A, 76
  27. holevo, 1973, Information theoretical aspects of quantum measurements, Problems Inf Transm, 9, 31
  28. holevo, 1975, Bounds for the quantity of information transmitted by a quantum communication channel, Problems Inf Transm, 9, 177
  29. helstrom, 1976, Quantum Detection and Estimation Theory
  30. datta, 2004, On a sufficient condition for additivity in quantum information theory, Problems Inf Transm, 41, 9
  31. horn, 1986, Matrix Analysis
  32. dirac, 1982, The Principles of Quantum Mechanics
  33. duan, 2009, Superactivation of zero-error capacity of noisy quantum channels, eprint arXiv 0906 2527
  34. imre, 2005, Quantum Computing and Communications—An Engineering Approach
  35. imre, 2013, Advanced Quantum Communications?An Engineering Approach
  36. 2017, Idquantique
  37. janardan, 2004, Design and manufacturing, Handbook of Discrete and Computational Geometry
  38. isham, 1999, Modern Differential Geometry for Physicists, 187
  39. chen, 2007, On K-Median and K-Means Clustering in Metric and Euclidean Spaces and Their Applications
  40. cormen, 2001, Introduction to Algorithms
  41. cornwell, 1997, The Theory of Groups An Introduction
  42. aluru, 2005, Quadtrees and octrees, Handbook of Data Structures and Applications
  43. amari, 2000, Methods of information geometry, Translations of Mathematical Monographs, 191
  44. karp, 1988, Optical Channels Fibers Clouds Water and the Atmosphere
  45. amosov, 2000, On some additivity problems in quantum information theory, Problems Inf Transm, 36, 305
  46. csiszar, 1981, Information Theory Coding Theorems for Discrete Memoryless Systems
  47. asano, 2006, Angular Voronoi diagram with applications, Proc 3rd Int Symp Voronoi Diagrams in Science and Engineering, 32
  48. kobayashi, 2009, General Scheme for Perfect Quantum Network Coding with Free Classical Communication, 622
  49. hayashi, 2007, Quantum Network Coding, 610
  50. yeung, 2002, A first course in information theory, Information Technology Transmission Processing and Storage
  51. nielsen, 2007, On Bregman Voronoi diagrams, Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA), 746
  52. von neumann, 1996, Mathematical Foundations of Quantum Mechanics
  53. von neumann, 1966, Theory of Self-Reproducing Automata
  54. banerjee, 2005, Clustering with Bregman divergences, J Mach Learn Res, 6, 1705
  55. shor, 2002, The quantum channel capacity and coherent information, Lecture Notes MSRI Workshop on Quantum Computation, 10
  56. ackermann, 2008, Clustering for metric and non-metric distance measures, Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA), 799
  57. agarwal, 2007, State of the union (of geometric objects): A review, Computational Geometry
  58. agarwal, 2004, Handbook of Discrete and Computational Geometry
  59. schumacher, 1999, Characterizations of classical and quantum communication processes, Chaos Solitons Fractals, 10, 1719
  60. miller, 2006, Synthesis of quantum multiple-valued circuits, J Multiple-Valued Logic Soft Computing, 12, 431
  61. bern, 1999, Mesh generation, Handbook of Computational Geometry
  62. berger, 1971, Rate Distortion Theory A Mathematical Basis for Data Compression
  63. bohm, 1989, Quantum Theory
  64. mcevoy, 2004, Introducing Quantum Theory
  65. 10.1103/PhysRevA.57.4153 · DOI · Paper page
  66. schumacher, 1995, Sending classical bits via quantum bits, Ann New York Acad Sci, 755, 698, 10.1111/j.1749-6632.1995.tb39011.x · DOI
  67. 10.1088/0953-4075/36/3/319 · DOI
  68. sakurai, 1994, Modern Quantum Mechanics
  69. buckley, 1988, A Divide-and-Conquer Algorithm for Computing 4-Dimensional Convex Hulls, 333, 113
  70. bures, 1969, An extension of Kakutani’s theorem on infinite product measures to the tensor product of semifinite w*-algebras, Trans Amer Math Soc, 135, 199
  71. preskill, 2015, Lecture Notes for Physics 229 Quantum Information and Computation
  72. preskill, 2015, Lecture Notes for Physics 229 Quantum Information and Computation, 322
  73. moore, 1965, Cramming more components onto integrated circuits, Electronics, 38, 114
  74. 10.1038/nphoton.2010.213 · DOI · Paper page
  75. 2010, Quantum Communication in Random Networks
  76. 2010, Researchers Convert Quantum Signals to Telecom Wavelengths Increase Memory Times
  77. 2006, Single-Photon Source May Meet the Needs of Quantum Communication Systems
  78. 2010, Quantum Memory for Communication Networks of the Future
  79. ohya, 1997, On capacities of quantum channels, Probab Math Stat, 17, 170
  80. nielsen, 2007, Bregman Voronoi diagrams: Properties, Proc ACM-SIAM Symp Discrete Algorithms (SODA), 1
  81. nock, 2005, Fitting the smallest enclosing Bregman ball, Proc ECML, 649
  82. nielsen, 2000, Quantum Computation and Quantum Information

Metadata

Authors
Gyongyosi, L., Imre, S., & Nguyen, H. V.
Affiliations
  • Budapest University of Technology and Economics (HU)
  • University of Southampton (GB)
Venue
IEEE Communications Surveys & Tutorials
Published
2018
Volume
20
Issue
2
Pages
1149-1205
ISSN
  • 1553-877X (ISSN-L)
  • 2373-745X
OpenAlex
W2782413938
Cited by
337
References
485
Citations by year
2026: 24 · 2025: 70 · 2024: 47 · 2023: 34 · 2022: 32 · 2021: 39 · 2020: 44 · 2019: 33 · 2018: 14
FWCI
18.05
Type
journal article
Language
en
Open access
Locations
  • IEEE Communications Surveys & Tutorials (publishedVersion, cc-by)
  • ePrints Soton (University of Southampton) (acceptedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • European Research Council through the Advanced Fellow Grant
  • Royal Society’s Wolfson Research Merit Award
  • Engineering and Physical Sciences Research Council (EP/L018659/1)
  • Hungarian Scientific Research Fund (OTKA K-112125)
  • National Research Development and Innovation Office of Hungary (2017-1.2.1-NKP-2017-00001)
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum channel capacity, quantum channels, quantum information, capacity measures, quantum entanglement, quantum information transfer

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Survey on Quantum Channel Capacities. https://app.cochat.ai/papers/10.1109/comst.2017.2786748
The paper
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018). A Survey on Quantum Channel Capacities. IEEE Communications Surveys & Tutorials. https://doi.org/10.1109/comst.2017.2786748

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.