Cited by 1,528Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Bulk Spin-Resonance Quantum Computation

Gershenfeld, Neil A., Chuang, Isaac L.·1997·Science

Abstract

Quantum computation remains an enormously appealing but elusive goal. It is appealing because of its potential to perform superfast algorithms, such as finding prime factors in polynomial time, but also elusive because of the difficulty of simultaneously manipulating quantum degrees of freedom while preventing environmentally induced decoherence. A new approach to quantum computing is introduced based on the use of multiple-pulse resonance techniques to manipulate the small deviation from equilibrium of the density matrix of a macroscopic ensemble so that it appears to be the density matrix of a much lower dimensional pure state. A complete prescription for quantum computing is given for such a system.

Integrity signals

Registry

Crossref · 10.1126/science.275.5298.350

Cites

34 of 34 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Prototype quantum computers that store and process information on individual atoms have already been demonstrated.

    “Although an Avogadro scale computer that can act on 10 23 bits might seem implausible, prototype quantum computers that store and process information on individual atoms have already been demonstrated 64 -65 , 76 -80 .”

    From Ultimate physical limits to computation (2000) · cites this paper as [77]

  • Recently constructed quantum microcomputers use one quantum degree of freedom for each bit and operate at the Heisenberg limit Δt = π hbar/2ΔE for the time needed to flip a bit.

    “The laws of physics do not require redundancy to perform logical operations: recently constructed quantum microcomputers use one quantum degree of freedom for each bit and operate at the Heisenberg limit ∆ t = π ¯ h/ 2∆ E for the time needed to flip a bit 64 -65 , 76 -80 .”

    From Ultimate physical limits to computation (2000) · cites this paper as [77]

  • Contemporary quantum microcomputers constructed using nuclear magnetic resonance operate at the limits of speed and memory space described above.

    “In fact, contemporary quantum 'microcomputers' such as those constructed using nuclear magnetic resonance 76 -80 do indeed operate at the limits of speed and memory space described above.”

    From Ultimate physical limits to computation (2000) · cites this paper as [77]

  • Only two methods have been used to demonstrate quantum logic gates: ion traps and nuclear magnetic resonance (NMR).

    “only two methods have been used to demonstrate quantum logic gates: ion traps, 3, 4 and nuclear magnetic resonance (NMR). 5, 6”
  • Nuclear spins are particularly good quantum bits because of their natural isolation from the environment, and their use for quantum computation is possible by applying NMR techniques in an unconventional manner.

    “because of their natural isolation from the environment, nuclear spins are particularly good 'quantum bits' 16 , and their use for quantum computation is possible by applying nuclear magnetic resonance (NMR) techniques in an unconventional manner 17-19 .”

    From Experimental realization of a quantum algorithm (1998) · cites this paper as [16]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Gershenfeld, N. A., & Chuang, I. L.
Affiliations
  • MIT Media Lab (US)
  • University of California, Santa Barbara (US)
Venue
Science
Published
1997-01-17
Volume
275
Issue
5298
Pages
350-356
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W2096551755
Cited by
1,528
References
34
Citations by year
2026: 5 · 2025: 18 · 2024: 18 · 2023: 22 · 2022: 26 · 2021: 18 · 2020: 36 · 2019: 33 · 2018: 28 · 2017: 31 · 2016: 42 · 2015: 48 · 2014: 29 · 2013: 35 · 2012: 37
FWCI
119.70
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, decoherence, density matrix, 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