The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Conditional Quantum Dynamics and Logic Gates
Open accessAbstract
Quantum logic gates provide fundamental examples of conditional quantum dynamics. They could form the building blocks of general quantum information processing systems which have recently been shown to have many interesting nonclassical properties. We describe a simple quantum logic gate, the quantum controlled-NOT, and analyze some of its applications. We discuss two possible physical realizations of the gate, one based on Ramsey atomic interferometry and the other on the selective driving of optical resonances of two subsystems undergoing a dipole-dipole interaction.
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
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
Self-citationSimulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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 theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Self-citationQuantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270
Self-citationFeynman, R. P. (1985) · Optics News · doi:10.1364/on.11.2.000011 · Cited by 1,023
Teleportation of quantum states
Vaidman, L. (1994) · Physical Review A · doi:10.1103/physreva.49.1473 · Cited by 892
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Proceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365747 · Cited by 593
Maximal violation of Bell inequalities for mixed states
Braunstein, S. L., Mann, A., & Revzen, M. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3259 · Cited by 456
Brune, M., Nussenzveig, P., Schmidt-Kaler, F., Bernardot, F., Maali, A., Raimond, J. M., & Haroche, S. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.3339 · Cited by 251
Stochastic dynamics of individual quantum systems: Stationary rate equations
Teich, W. G., & Mahler, G. (1992) · Physical Review A · doi:10.1103/physreva.45.3300 · Cited by 55
Structural basis of multistationary quantum systems. I. Effective single-particle dynamics
Obermayer, K., Teich, W. G., & Mahler, G. (1988) · Physical Review B · doi:10.1103/physrevb.37.8096 · Cited by 48
Cited by
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
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
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
Self-citationPolynomial-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
Separability of mixed states: necessary and sufficient conditions
Horodecki, M., Horodecki, P., & Horodecki, R. (1996) · Physics Letters A · doi:10.1016/s0375-9601(96)00706-2 · Cited by 3,649
Metadata
- Authors
- Barenco, A., Deutsch, D., Ekert, A., & Jozsa, R.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1995-05-15
- Volume
- 74
- Issue
- 20
- Pages
- 4083-4086
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2054388650
- Cited by
- 971
- References
- 13
- FWCI
- 49.79
- 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.