The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Simple quantum computer
Open accessAbstract
We propose an implementation of a quantum computer to solve Deutsch's problem, which requires exponential time on a classical computer but only linear time with quantum parallelism. By using a dual-rail quantum-bit representation as a simple form of error correction, our machine can tolerate some amount of decoherence and still give the correct result with high probability. The design that we employ also demonstrates a signature for quantum parallelism which unambiguously distinguishes the desired quantum behavior from the merely classical. The experimental demonstration of our proposal using quantum optical components calls for the development of several key technologies common to single photonics.
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
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
Quantum tunnelling in a dissipative system
Caldeira, A. O., & Leggett, A. J. (1983) · Annals of Physics · doi:10.1016/0003-4916(83)90202-6 · Cited by 3,647
"Relative State" Formulation of Quantum Mechanics
Everett, H. (1957) · Reviews of Modern Physics · doi:10.1103/revmodphys.29.454 · Cited by 3,379
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
Quantum Statistical Properties of Radiation
Barton, G. (1974) · Physics Bulletin · doi:10.1088/0031-9112/25/3/024 · Cited by 2,556
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896
Quantum 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
Proceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · doi:10.1109/sfcs.1994 · Cited by 1,087
Reversible logic and quantum computers
Peres, A. (1985) · Physical Review A · doi:10.1103/physreva.32.3266 · Cited by 892
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Quantum-mechanical lossless beam splitter: SU(2) symmetry and photon statistics
Campos, R. A., Saleh, B. E. A., & Teich, M. C. (1989) · Physical Review A · doi:10.1103/physreva.40.1371 · Cited by 633
Preferred States, Predictability, Classicality and the Environment-Induced Decoherence
Zurek, W. H. (1993) · Progress of Theoretical Physics · doi:10.1143/ptp/89.2.281 · Cited by 525
Milburn, G. J. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.2124 · Cited by 440
Proc. 26th annual symposium on Foundations of computer science
Tarjan, R. E. (1985) · Cited by 267
Imamog¯lu, A., & Yamamoto, Y. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.210 · Cited by 176
Self-citationA quantum description of the beam splitter
Prasad, S., Scully, M. O., & Martienssen, W. (1987) · Optics Communications · doi:10.1016/0030-4018(87)90015-0 · Cited by 168
Nonlinear-interferometric generation of number-phase-correlated fermion states
Kitagawa, M., & Ueda, M. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.1852 · Cited by 101
Reversibility and Stability of Information Processing Systems
Zurek, W. H. (1984) · Physical Review Letters · doi:10.1103/physrevlett.53.391 · Cited by 92
Absolute efficiency and time-response measurement of single-photon detectors
Kwiat, P. G., Steinberg, A. M., Chiao, R. Y., et al. (1994) · Applied Optics · doi:10.1364/ao.33.001844 · Cited by 89
Multistable quantum systems: Information processing at microscopic levels
Obermayer, K., Mahler, G., & Haken, H. (1987) · Physical Review Letters · doi:10.1103/physrevlett.58.1792 · Cited by 35
Dissipation and noise immunity in computation, measurement, and communication
Landauer, R. W. (1989) · Journal of Statistical Physics · doi:10.1007/bf01044731 · Cited by 6
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
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
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516
“With the realization that computers that use the interference and superposition principles of quantum mechanics might be able to solve certain problems, including prime factorization, exponentially faster than classical computers [1], interest has been growing in the feasibility of these quantum computers, and several…”
Background
Metadata
- Authors
- Chuang, I. L., & Yamamoto, Y.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1995-11-01
- Volume
- 52
- Issue
- 5
- Pages
- 3489-3496
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2071090470
- Cited by
- 434
- References
- 21
- FWCI
- 14.84
- 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.