1998/04/24 by Leonard J. Schulman, Umesh Vazirani, Schulman, Leonard J. +1 · 4 citations
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum and electron transport phenomena #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/9804060
16 pages, no figures. An updated "extended abstract" of this paper appears in Proc. 31'st ACM STOC (Symp. Theory of Computing), 322-329, 1999
arxiv created 1998/04/24 · openalex publication_date 1998/04/24 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Nuclear magnetic resonance offers an appealing prospect for implementation of quantum computers, because of the long coherence times associated with nuclear spins, and extensive laboratory experience in manipulating the spins with radio frequency pulses. Existing proposals, however, suffer from a signal-to-noise ratio that decays exponentially in the number of qubits in the quantum computer. This places a severe limit on the size of the computations that can be performed by such a computer; estimates of that limit are well within the range in which a conventional computer taking exponentially more steps would still be practical. We give an NMR implementation in which the signal-to-noise ratio depends only on features of NMR technology, not the size of the computer. This provides a means for NMR computation techniques to scale to sizes at which the exponential speedup enables quantum computation to solve problems beyond the capabilities of classical computers.