The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Classical-communication cost in distributed quantum-information processing: A generalization of quantum-communication complexity
Open accessAbstract
We study the amount of classical communication needed for distributed quantum-information processing. In particular, we introduce the concept of ``remote preparation'' of a quantum state. Given an ensemble of states, Alice's task is to help Bob in a distant laboratory to prepare a state of her choice. We find several examples of an ensemble with an entropy S where the remote preparation can be done with a communication cost lower than the amount $(2S)$ required by standard teleportation. We conjecture that, for an arbitrary N-dimensional pure state, its remote preparation requires $2{\mathrm{log}}_{2}N$ bits of classical communication, as in standard teleportation.
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
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
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
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Concentrating partial entanglement by local operations
Bennett, C. H., Bernstein, H. J., Popescu, S., & Schumacher, B. (1996) · Physical Review A · doi:10.1103/physreva.53.2046 · Cited by 3,111
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Bennett, C. H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.722 · Cited by 2,961
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
Schumacher, B. (1995) · Physical Review A · doi:10.1103/physreva.51.2738 · Cited by 1,090
A 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
Quantum Information and Computation
Bennett, C. H. (1995) · Physics Today · doi:10.1063/1.881452 · Cited by 577
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
Cost of Exactly Simulating Quantum Entanglement with Classical Communication
Brassard, G., Cleve, R., & Tapp, A. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1874 · Cited by 245
Lo, H., & Popescu, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1459 · Cited by 104
Self-citationGeneral fidelity limit for quantum channels
Barnum, H., Fuchs, C. A., Jozsa, R., & Schumacher, B. W. (1996) · Physical Review A · doi:10.1103/physreva.54.4707 · Cited by 86
Cited by
Continuous-variable optical quantum-state tomography
Lvovsky, A. I., & Raymer, M. G. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.299 · Cited by 1,123
Distillation of secret key and entanglement from quantum states
Devetak, I., & Winter, A. (2005) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2004.1372 · Cited by 877
Quantum repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
Self-citationMeasures and applications of quantum correlations
Adesso, G., Bromley, T. R., & Cianciaruso, M. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/47/473001 · Cited by 385
Randomizing Quantum States: Constructions and Applications
Hayden, P., Leung, D., Shor, P. W., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1087-6 · Cited by 345
Metadata
- Authors
- Lo, H.-K.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2000-06-16
- Volume
- 62
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2086651839
- Cited by
- 671
- References
- 13
- FWCI
- 13.33
- 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
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.