The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Classical information capacity of a quantum channel
Abstract
We consider the transmission of classical information over a quantum channel. The channel is defined by an ``alphabet'' of quantum states, e.g., certain photon polarizations, together with a specified set of probabilities with which these states must be sent. If the receiver is restricted to making separate measurements on the received ``letter'' states, then the Kholevo theorem implies that the amount of information transmitted per letter cannot be greater than the von Neumann entropy H of the letter ensemble. In fact the actual amount of transmitted information will usually be significantly less than H. We show, however, that if the sender uses a block coding scheme consisting of a choice of code words that respects the a priori probabilities of the letter states, and the receiver distinguishes whole words rather than individual letters, then the information transmitted per letter can be made arbitrarily close to H and never exceeds H. This provides a precise information-theoretic interpretation of von Neumann entropy in quantum mechanics. We apply this result to ``superdense'' coding, and we consider its extension to noisy channels. \textcopyright{} 1996 The American Physical Society.
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.
Integrity signals
Registry
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.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Bennett, C. H., & Wiesner, S. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2881 · Cited by 5,470
Quantum detection and estimation theory
Helstrom, C. W. (1969) · Journal of Statistical Physics · doi:10.1007/bf01007479 · Cited by 3,776
Quantum cryptography using any two nonorthogonal states
Bennett, C. H. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3121 · Cited by 3,028
Quantum cryptography without Bell’s theorem
Bennett, C. H., Brassard, G., & Mermin, N. D. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.557 · Cited by 2,460
Quantum Detection and Estimation Theory
(1976) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6017-5 · Cited by 2,426
Wehrl, A. (1978) · Reviews of Modern Physics · doi:10.1103/revmodphys.50.221 · Cited by 1,963
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Schumacher, B. (1995) · Physical Review A · doi:10.1103/physreva.51.2738 · Cited by 1,090
Self-citationA complete classification of quantum ensembles having a given density matrix
Hughston, L. P., Jozsa, R., & Wootters, W. K. (1993) · Physics Letters A · doi:10.1016/0375-9601(93)90880-9 · Cited by 649
Self-citationOptimal detection of quantum information
Peres, A., & Wootters, W. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.66.1119 · Cited by 355
Self-citationPractical quantum cryptography based on two-photon interferometry
Ekert, A. K., Rarity, J. G., Tapster, P. R., & Massimo Palma, G. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.1293 · Cited by 340
A New Proof of the Quantum Noiseless Coding Theorem
Jozsa, R., & Schumacher, B. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552191 · Cited by 304
Self-citationNeumark's theorem and quantum inseparability
Peres, A. (1990) · Foundations of Physics · doi:10.1007/bf01883517 · Cited by 166
Lower bound for accessible information in quantum mechanics
Jozsa, R., Robb, D., & Wootters, W. K. (1994) · Physical Review A · doi:10.1103/physreva.49.668 · Cited by 159
Self-citationEnsemble-Dependent Bounds for Accessible Information in Quantum Mechanics
Fuchs, C. A., & Caves, C. M. (1994) · Physical Review Letters · doi:10.1103/physrevlett.73.3047 · Cited by 93
Research works printed but not linked: 4
- C. H. Bennett, 1984, Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Bangalore, India
- J. P. Gordon, 1964, Quantum Electronics and Coherent Light, Proceedings of the International School of Physics ``Enrico Fermi,'' Course XXXI
- A. S. Kholevo, 1973, Probl. Inf. Transm. (USSR), 9, 177
- A. S. Kholevo, 1973, Probl. Peredachi Inf., 9, 110
Cited by
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
The capacity of the quantum channel with general signal states
Holevo, A. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651037 · Cited by 1,176
The role of relative entropy in quantum information theory
Vedral, V. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.197 · Cited by 1,166
Quantum nonlocality without entanglement
Bennett, C. H., DiVincenzo, D. P., Fuchs, C. A., Mor, T., Rains, E., Shor, P. W., Smolin, J. A., & Wootters, W. K. (1999) · Physical Review A · doi:10.1103/physreva.59.1070 · Cited by 1,130
Self-citation
Metadata
- Authors
- Hausladen, P., Jozsa, R., Schumacher, B., Westmoreland, M., & Wootters, W. K.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1996-09-01
- Volume
- 54
- Issue
- 3
- Pages
- 1869-1876
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2085163160
- Cited by
- 498
- References
- 17
- FWCI
- 20.19
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.