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
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…”
BackgroundGottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Self-citationBulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Self-citationQuantum 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
Lounis, B., & Orrit, M. (2005) · Reports on Progress in Physics · doi:10.1088/0034-4885/68/5/r04 · Cited by 908
Scalable Photonic Quantum Computation through Cavity-Assisted Interactions
Duan, L.-M., & Kimble, H. J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.127902 · Cited by 881
Deterministic Generation of Single Photons from One Atom Trapped in a Cavity
McKeever, J., Boca, A., Boozer, A. D., Miller, R., Buck, J. R., Kuzmich, A., & Kimble, H. J. (2004) · Science · doi:10.1126/science.1095232 · Cited by 694
Preserving Coherence in Quantum Computation by Pairing Quantum Bits
Duan, L.-M., & Guo, G.-C. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.1953 · Cited by 554
Universal Computation by Multiparticle Quantum Walk
Childs, A. M., Gosset, D., & Webb, Z. (2013) · Science · doi:10.1126/science.1229957 · Cited by 456
Controlled Phase Shifts with a Single Quantum Dot
Fushman, I., Englund, D., Faraon, A., Stoltz, N., Petroff, P., & Vučković, J. (2008) · Science · doi:10.1126/science.1154643 · Cited by 443
Simulating quantum systems on a quantum computer
Zalka, C. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0162 · Cited by 390
Optical simulation of quantum logic
Cerf, N. J., Adami, C., & Kwiat, P. G. (1998) · Physical Review A · doi:10.1103/physreva.57.r1477 · Cited by 324
Bulk quantum computation with nuclear magnetic resonance: theory and experiment
Chuang, I. L., Gershenfeld, N., Kubinec, M. G., & Leung, D. W. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0170 · Cited by 316
Self-citationSingle-photon Kerr nonlinearities do not help quantum computation
Shapiro, J. H. (2006) · Physical Review A · doi:10.1103/physreva.73.062305 · Cited by 310
Multiphoton quantum optics and quantum state engineering
Dell’Anno, F., De Siena, S., & Illuminati, F. (2006) · Physics Reports · doi:10.1016/j.physrep.2006.01.004 · Cited by 310
Performance and structure of single-mode bosonic codes
Albert, V. V., Noh, K., Duivenvoorden, K., Young, D. J., Brierley, R. T., Reinhold, P., Vuillot, C., Li, L., Shen, C., Girvin, S. M., et al. (2018) · Physical Review A · doi:10.1103/physreva.97.032346 · Cited by 305
Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., et al. (2021) · Quantum · doi:10.22331/q-2021-02-04-392 · Cited by 302
Quantum Computers, Factoring, and Decoherence
Chuang, I. L., Laflamme, R., Shor, P. W., & Zurek, W. H. (1995) · Science · doi:10.1126/science.270.5242.1633 · Cited by 289
“fairly easy to verify. The quantum computer can therefore run until we find the correct factors. How much entropy is lost to the environment per step? Designs for quantum computers have been suggested[9, 10, 11, 12] and some possible difficulties investigated[13, 14]. Common to these designs is the model of a simple two…”
BackgroundSelf-citationSingle-Photon Generation from Stored Excitation in an Atomic Ensemble
Chou, C. W., Polyakov, S. V., Kuzmich, A., & Kimble, H. J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.213601 · Cited by 253
Polarization state of a biphoton: Quantum ternary logic
Burlakov, A. V., Chekhova, M. V., Karabutova, O. A., Klyshko, D. N., & Kulik, S. P. (1999) · Physical Review A · doi:10.1103/physreva.60.r4209 · Cited by 104
Experimental Nonlinear Sign Shift for Linear Optics Quantum Computation
Sanaka, K., Jennewein, T., Pan, J.-W., Resch, K., & Zeilinger, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.017902 · Cited by 78
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.