The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Fundamentals of quantum information theory
Open accessAbstract
Abstract In this paper we give a self-contained introduction to the conceptional and mathematical foundations of quantum information theory. In the first part we introduce the basic notions like entanglement, channels, teleportation, etc. and their mathematical description. The second part is focused on a presentation of the quantitative aspects of the theory. Topics discussed in this context include: entanglement measures, channel capacities, relations between both, additivity and continuity properties and asymptotic rates of quantum operations. Finally, we give an overview on some recent developments and open questions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Entanglement of Formation of an Arbitrary State of Two Qubits
Wootters, W. K. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.2245 · Cited by 8,290
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Proposed Experiment to Test Local Hidden-Variable Theories
Clauser, J. F., Horne, M. A., Shimony, A., & Holt, R. A. (1969) · Physical Review Letters · doi:10.1103/physrevlett.23.880 · Cited by 7,573
Experimental quantum teleportation
Bouwmeester, D., Pan, J.-W., Mattle, K., Eibl, M., Weinfurter, H., & Zeilinger, A. (1997) · Nature · doi:10.1038/37539 · Cited by 5,545 · cited 3×
“rst successful “teleportation” of a photon [24,22] and the implementation of “dense coding” [115]; cf.”
BackgroundA single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 2×
“Approximate cloning By virtue of the no-cloning theorem [173], it is impossible to produce M perfect copies of a d-level quantum system if N ¡M input systems in the common (unknown) state ⊗N are given.”
BackgroundMethod
Cited by
Quantum information and relativity theory
Peres, A., & Terno, D. R. (2004) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.93 · Cited by 699
Concepts of quantum non-Markovianity: A hierarchy
Li, L., Hall, M. J. W., & Wiseman, H. M. (2018) · Physics Reports · doi:10.1016/j.physrep.2018.07.001 · Cited by 353
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
Tema con variazioni: quantum channel capacity
Kretschmann, D., & Werner, R. F. (2004) · New Journal of Physics · doi:10.1088/1367-2630/6/1/026 · Cited by 123
The Information-Disturbance Tradeoff and the Continuity of Stinespring's Representation
Kretschmann, D., Schlingemann, D., & Werner, R. F. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.917696 · Cited by 122
Metadata
- Authors
- Keyl, M.
- Venue
- Physics Reports
- Publisher
- Elsevier BV
- Published
- 2002-10
- Volume
- 369
- Issue
- 5
- Pages
- 431-548
- ISSN
- 0370-1573 (ISSN-L)
- OpenAlex
- W2112149114
- Cited by
- 303
- References
- 41
- FWCI
- 15.72
- Type
- journal article
- Language
- en
- Open access
- green
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: Fundamentals of quantum information theory. https://app.cochat.ai/papers/10.1016/s0370-1573(02)00266-1
- The paper
- Keyl, M. (2002). Fundamentals of quantum information theory. Physics Reports. https://doi.org/10.1016/s0370-1573(02)00266-1
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.
