A Potentially Realizable Quantum Computer
Abstract
Arrays of weakly coupled quantum systems might compute if subjected to a sequence of electromagnetic pulses of well-defined frequency and length. Such pulsed arrays are true quantum computers: Bits can be placed in superpositions of 0 and 1, logical operations take place coherently, and dissipation is required only for error correction. Operated with frequent error correction, such a system functions as a parallel digital computer. Operated in a quantum-mechanically coherent manner, such a device functions as a general-purpose quantum-mechanical micromanipulator, capable of both creating any desired quantum state of the array and transforming that state in any desired way.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Quantum communication over short distances through an unmodulated spin chain has been studied in detail, and an expression for the fidelity of quantum state has been obtained.
“Quantum communication over short distances through an unmodulated spin chain has been studied in detail, and an expression for the fidelity of quantum state has been obtained [9].”
From Perfect State Transfer in Quantum Spin Networks (2004) · cites this paper as [9]
A wide variety of physical systems-ranging from nearest neighbor Ising models to quantum electrodynamics and conformal field theories-are known to be computationally universal.
“Although computational universality might at first seem to be a stringent demand on a physical system, a wide variety of physical systems - ranging from nearest neighbor Ising models 52 to quantum electrodynamics 84 and conformal field theories 86 - are known to be computationally universal 51 -53 , 55 -65 .”
From Ultimate physical limits to computation (2000) · cites this paper as [52]
It is expected that, as in Lloyd's work, suitable external fields can induce any arbitrary two-spin unitary operation, although no detailed protocol is worked out.
“It is expected that, as in the work of Lloyd [15], it is possible with suitable external fields to induce any arbitrary two-spin unitary operation in Eq. (2.1), although I have not worked out a detailed protocol for this.”
From Two-bit gates are universal for quantum computation (1995) · cites this paper as [15]
The polymer computer has the disadvantage that the interaction Hamiltonian between the spins can never be turned off, which makes control of the phase of the quantum state particularly ungainly.
“The polymer computer has the disadvantage that the interaction Hamiltonian between the spins can never be turned off. This does not necessarily lead to insuperable problems, but it makes the control of the phase of the quantum state particularly ungainly.”
From Two-bit gates are universal for quantum computation (1995) · cites this paper as [15]
In the polymer computer, unitary operations can go on in parallel, although the ability to address specific pairs of spins is lost.
“Another advantage of the polymer computer is that the unitary operations can go on in parallel, although the ability to address specific pairs of spins is lost.”
From Two-bit gates are universal for quantum computation (1995) · cites this paper as [15]
In the polymer computer, not just two-bit but also three-bit local operations can be executed, but this is not a crucial advantage.
“In the polymer computer, not just two-bit but also three-bit local operations can be executed (but this is not a crucial advantagesee the next section).”
From Two-bit gates are universal for quantum computation (1995) · cites this paper as [15]
In the polymer computer, the interaction Hamiltonian between spins is more controlled because it depends only on the local environment in the crystal.
“One obvious advantage of the polymer computer is that the interaction Hamiltonian between the spins is more controlled, since it depends only on the local environment in the crystal.”
From Two-bit gates are universal for quantum computation (1995) · cites this paper as [15]
The D-J algorithm, as improved by Cleve et al. and Tapp, allows a quantum computer to determine whether f(x) is constant or balanced using only one function call.
“In contrast, the D-J algorithm, as improved by R. Cleve, et al. 20 and Alain Tapp, allows a quantum computer to determine whether f ( x ) is constant or balanced using only one function call.”
From Experimental realization of a quantum algorithm (1998) · cites this paper as [20]
Cites
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654 · see citing works
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · see citing works
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 · see citing works
Feynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770 · see citing works
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244 · see citing works
Quantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402 · see citing works
Structural basis of multistationary quantum systems. II. Effective few-particle dynamics
Teich, W. G., Obermayer, K., & Mahler, G. (1988) · Physical Review B · doi:10.1103/physrevb.37.8111 · Cited by 64 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · see citing works
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 · see citing works
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840 · see citing works
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 · see citing works
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 · see citing works
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779 · see citing works
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733 · see citing works
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263 · see citing works
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · see citing works
Self-citationGood 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 · see citing works
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651 · see citing works
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586 · see citing works
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528 · see citing works
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 · see citing works
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284 · see citing works
Perfect State Transfer in Quantum Spin Networks
Christandl, M., Datta, N., Ekert, A., & Landahl, A. J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.187902 · Cited by 1,179 · see citing works
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120 · see citing works
Self-citationTwo-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069 · see citing works
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
Abrams, D. S., & Lloyd, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2586 · Cited by 745 · see citing works
Self-citationExperimental realization of a quantum algorithm
Chuang, I. L., Vandersypen, L. M. K., Zhou, X., Leung, D. W., & Lloyd, S. (1998) · Nature · doi:10.1038/30181 · Cited by 604 · see citing works
Self-citationSemiclassical Fourier Transform for Quantum Computation
Griffiths, R. B., & Niu, C.-S. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.3228 · Cited by 431 · see citing works
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 · see citing works
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 · see citing works
Efficient networks for quantum factoring
Beckman, D., Chari, A. N., Devabhaktuni, S., & Preskill, J. (1996) · Physical Review A · doi:10.1103/physreva.54.1034 · Cited by 268 · see citing works
Quantum Computing with an Always-On Heisenberg Interaction
Benjamin, S. C., & Bose, S. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.247901 · Cited by 190 · see citing works
Quantum Simulations on a Quantum Computer
Somaroo, S., Tseng, C. H., Havel, T. F., Laflamme, R., & Cory, D. G. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.5381 · Cited by 180 · see citing works
A review of Quantum Cellular Automata
Farrelly, T. (2020) · Quantum · doi:10.22331/q-2020-11-30-368 · Cited by 138 · see citing works
Envisioning a Quantum Supercomputer
Lloyd, S. (1994) · Science · doi:10.1126/science.263.5147.695 · Cited by 60 · see citing works
Self-citationWiesner, K. (2009) · Encyclopedia of Complexity and Systems Science · doi:10.1007/978-0-387-30440-3_426 · Cited by 19 · see citing works
A #QuantumComputerArchitecture Tweetstorm
Van Meter, R. (2019) · Zenodo · doi:10.5281/zenodo.3496597 · Cited by 3 · see citing works
- Authors
- Lloyd, S.
- Affiliations
- Los Alamos National Laboratory (US)
- Corresponding author
- Lloyd, Seth
- ORCID
- Lloyd, Seth
- Venue
- Science
- Published
- 1993-09-17
- Volume
- 261
- Issue
- 5128
- Pages
- 1569-1571
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W1974875620
- Cited by
- 649
- References
- 7
- Citations by year
- 2026: 9 · 2025: 14 · 2024: 12 · 2023: 14 · 2022: 11 · 2021: 6 · 2020: 12 · 2019: 4 · 2018: 11 · 2017: 21 · 2016: 12 · 2015: 13 · 2014: 10 · 2013: 9 · 2012: 19
- FWCI
- 32.37
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum computing, superposition, error correction, energy dissipation, quantum state manipulation
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
