The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Optimal local implementation of nonlocal quantum gates
Open accessAbstract
We investigate the minimal resources that are required in the local implementation of nonlocal quantum gates in a distributed quantum computer. Both classical communication requirements and entanglement consumption are investigated. We present general statements on the minimal resource requirements and present optimal procedures for a number of important gates, including controlled-NOT (CNOT) and Toffoli gates. We show that one bit of classical communication in each direction is both necessary and sufficient for the nonlocal implementation of the quantum CNOT, while in general two bits in each direction is required for the implementation of a general two-bit quantum gate. In particular, the state swapper requires this maximum classical communication overhead. Extensions of these ideas to multiparty gates are presented.
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
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651
Experimental issues in coherent quantum-state manipulation of trapped atomic ions
Wineland, D. J., Monroe, C., Itano, W. M., Leibfried, D., King, B. E., & Meekhof, D. M. (1998) · Journal of Research of the National Institute of Standards and Technology · doi:10.6028/jres.103.019 · Cited by 1,497
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
Conditions for a class of entanglement transformations
Nielsen, M. A. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.436 · Cited by 1,036
Distributed quantum computation over noisy channels
Cirac, J. I., Ekert, A. K., Huelga, S. F., & Macchiavello, C. (1999) · Physical Review A · doi:10.1103/physreva.59.4249 · Cited by 666
Entanglement of Pure States for a Single Copy
Vidal, G. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1046 · Cited by 422
Teleportation, entanglement and thermodynamics in the quantum world
Plenio, M. B., & Vedral, V. (1998) · Contemporary Physics · doi:10.1080/001075198181766 · Cited by 306
Self-citationMinimal Conditions for Local Pure-State Entanglement Manipulation
Jonathan, D., & Plenio, M. B. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1455 · Cited by 217
Self-citationVedral, V., & Plenio, M. B. (1998) · Progress in Quantum Electronics · doi:10.1016/s0079-6727(98)00004-4 · Cited by 189
Self-citationBarenco, A. (1996) · Contemporary Physics · doi:10.1080/00107519608217543 · Cited by 159
Decoherence limits to quantum computation using trapped ions
Plenio, M. B., & Knight, P. L. (1997) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1997.0109 · Cited by 123
Self-citationRealistic lower bounds for the factorization time of large numbers on a quantum computer
Plenio, M. B., & Knight, P. L. (1996) · Physical Review A · doi:10.1103/physreva.53.2986 · Cited by 113
Self-citationDecoherence Bounds on Quantum Computation with Trapped Ions
Hughes, R., James, D. F. V., Knill, E. H., Laflamme, R., & Petschek, A. G. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.3240 · Cited by 106
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
Baumgratz, T., Cramer, M., & Plenio, M. B. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.140401 · Cited by 2,741
Self-citationColloquium: Quantum coherence as a resource
Streltsov, A., Adesso, G., & Plenio, M. B. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.041003 · Cited by 1,794
Self-citationMultiparty entanglement in graph states
Hein, M., Eisert, J., & Briegel, H. J. (2004) · Physical Review A · doi:10.1103/physreva.69.062311 · Cited by 915
Self-citationQuantum 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
Metadata
- Authors
- Eisert, J., Jacobs, K., Papadopoulos, P., & Plenio, M. B.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2000-10-19
- Volume
- 62
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2029658458
- Cited by
- 415
- References
- 18
- FWCI
- 14.58
- Type
- journal article
- Language
- en
- Open access
- bronze
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.