Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IBM Systems Journal

Toward a table-top quantum computer

Yael G. Maguire, Edward S. Boyden, Neil Gershenfeld

Published Jan 1, 2000• 17 citations
Publisher

Abstract

To investigate the scaling issues for quantum computation using thermalized ensembles of spins, we are building a rudimentary quantum computer using nuclear magnetic resonance (NMR). We discuss the experimental issues facing the scalability of this technique including the number of qubits, issues of classical versus quantum behavior, and polarization. Due to the weak signals measured in NMR, the most significant challenge to practical devices is polarization enhancement. We present the architecture for a simple NMR spectrometer that is table-top, low-cost, and software-radio driven using commodity electronics and unconventional permanent magnet designs. Optimizations specific to using this machine as a computational device, such as probe design, compilation, and on-line control, are discussed.

DOI
10.1147/sj.393.0823

Related papers

Toward a personal quantum computer

Henry Chong

The realization of nuclear magnetic resonance (NMR) as a means to perform useful quantum computations has warranted a detailed discussion regarding the physics and instrumentation underlying the construction of a NMR quantum computer to facilitate the design of a desktop quantum computer. A brief overview of classical mechanics, quantum mechanics, and statistical mechanics is presented with Newton’s first law as a starting point. A correspondence between an initially postulated classical magnetic moment model and first principles will be made, and methods for the measurement and interpretation of macroscopically manifest observables are discussed. An introduction to quantum computation will delineate the elements required for computation in analogy to those required for conventional digital computation. The advantages afforded through the use of quantum computational algorithms are discussed, and the employment of NMR to perform quantum computations is presented. Design considerations for the instrumentation necessary to observe NMR with the cost and physical constraints of a desktop apparatus are reviewed. Low-noise and radio-frequency (RF) instrumentation design needs and constraints are explained in the context of refining sensitivity and frequency resolution requirements of an NMR spectrometer. Experimental considerations for the use of physical processes to enhance sensitivity and spectral resolution are also described. Results from a desktop NMR spectrometer is presented with a prescription for future progress. Thesis Supervisor: Neil A. Gershenfeld Title: Director, Physics and Media Group, MIT Media Laboratory

•Jan 1, 1997•0 citations

Scalable NMR Quantum Computation

Leonard J. Schulman, Umesh V. Vazirani

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.

arXiv:quant-ph/9804060•Apr 24, 1998•70 citations

A prototype quantum computer using nuclear spins in liquid solution

James S. Harris, Isaac L. Chuang, Matthias Steffen

Quantum computers can potentially solve real and relevant mathematical and physical problems that are intractable using classical machines. However, the experimental realization of quantum computers represents a significant challenge, because several opposing experimental requirements must be met. A set of coupled quantum bits must be manipulated and measured while coherently retaining entangled quantum states. Yet the manipulation and measurement processes almost inevitably lead to the decay of these fragile states. This thesis work takes significant steps towards building a practical quantum computer using nuclear spins and liquid state nuclear magnetic resonance (NMR) techniques. I present experimental results for proof of principle of quantum computing in a series of small implementations of quantum algorithms, culminating in the implementation of an adiabatic quantum optimization algorithm. The performance of adiabatic algorithms compared with classical optimization methods is unknown, but small quantum computers could provide crucial insight into answering this question. Furthermore, adiabatic algorithms also shed new light on the usefulness of quantum resources for computational tasks and hence they represent an important class of algorithms. The second part of this thesis presents several methods developed for improving the control over NMR quantum computing experiments. Even though liquid state NMR quantum computers have well known and accepted scaling limitations, the developed tools are of general use. I will show how several tools are directly transferable to two other implementations of quantum computers; one using optical methods and the other using loops of superconducting material. This work provides insight into what is needed to build a practical quantum computer, and delivers several tools and techniques that will be useful in future large-scale implementations of quantum computers.

•Jan 1, 2003•1 citation

Improved algorithmic cooling for scalable NMR quantum computers

Alexei Kaltchenko

The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices. To achieve scalability, one needs a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. In quantum computing terminology, such spin-half states are (almost) pure qubit states. Producing highly polarized spins (almost pure qubit states) out of non-polarized spins (non-pure qubit states) is sometimes called "purification". From a thermodynamic point of view, purification can be viewed as cooling spins to a very low temperature. In this preliminary work, we study the optimality of purification as a tradeoff between the number of cooled spins and the closeness of their quantum state to the ideal pure state.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 5, 2006•0 citations

Can a Quantum Computer Simulate Nuclear Magnetic Resonance Spectra Better than a Classical One?

Keith R. Fratus, Nicklas Enenkel, Sebastian Zanker +3 more

The simulation of the spectra measured in nuclear magnetic resonance (NMR) spectroscopy experiments is a computationally non-trivial problem which, due to its natural interpretation as a quantum spin problem, maps in a straightforward way to a quantum computer. As such, it represents a problem for which such a device may provide some practical advantage over traditional computing methods. In order to understand the extent to which such problems may indeed provide examples of useful quantum advantage, it is important to understand the limitations of existing classical simulation methods. In this work, we benchmark our own classical solver designed to study such problems. This solver uses a clustering approximation to achieve a resource scaling which is linear in the total number of nuclear spins in a given molecule, for a fixed cluster size. The success of such an approximation would present a stark repudiation to the common claim that such problems require an exponential scaling of resources, the very claim which makes simulating an NMR spectra a candidate for quantum advantage. Our benchmarking results indicate that our approximation performs well throughout, and even somewhat beyond, the more typical experimental regimes. We discuss what implications this may have for future efforts to demonstrate quantum advantage in the context of NMR.

arXiv:2508.06448•Aug 8, 2025•13 citations

NMR quantum computing - lessons for the future

Lieven M. K. Vandersypen, Isaac L. Chuang

Future physical implementations of large-scale quantum computers will face significant practical challenges. Many useful lessons can be drawn from present results with Nuclear Magnetic Resonance realizations of controllable two, three, five, and seven qubit quantum systems. We summarize various experimental methods and theoretical procedures learned in this work which will be of considerable value in building and testing quantum processors with a wide variety of physical systems.

Quantum Information and Computation•Dec 1, 2001•2 citations
To investigate the scaling issues for quantum computation using thermalized ensembles of spins, we are building a rudimentary quantum computer using nuclear magnetic resonance (NMR). We discuss the experimental issues facing the scalability of this technique including the number of qubits, issues of classical versus quantum behavior, and polarization. Due to the weak signals measured in NMR, the most significant challenge to practical devices is polarization enhancement. We present the architecture for a simple NMR spectrometer that is table-top, low-cost, and software-radio driven using commodity electronics and unconventional permanent magnet designs. Optimizations specific to using this machine as a computational device, such as probe design, compilation, and on-line control, are discussed.
The realization of nuclear magnetic resonance (NMR) as a means to perform useful quantum computations has warranted a detailed discussion regarding the physics and instrumentation underlying the construction of a NMR quantum computer to facilitate the design of a desktop quantum computer. A brief overview of classical mechanics, quantum mechanics, and statistical mechanics is presented with Newton’s first law as a starting point. A correspondence between an initially postulated classical magnetic moment model and first principles will be made, and methods for the measurement and interpretation of macroscopically manifest observables are discussed. An introduction to quantum computation will delineate the elements required for computation in analogy to those required for conventional digital computation. The advantages afforded through the use of quantum computational algorithms are discussed, and the employment of NMR to perform quantum computations is presented. Design considerations for the instrumentation necessary to observe NMR with the cost and physical constraints of a desktop apparatus are reviewed. Low-noise and radio-frequency (RF) instrumentation design needs and constraints are explained in the context of refining sensitivity and frequency resolution requirements of an NMR spectrometer. Experimental considerations for the use of physical processes to enhance sensitivity and spectral resolution are also described. Results from a desktop NMR spectrometer is presented with a prescription for future progress. Thesis Supervisor: Neil A. Gershenfeld Title: Director, Physics and Media Group, MIT Media Laboratory
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.
Quantum computers can potentially solve real and relevant mathematical and physical problems that are intractable using classical machines. However, the experimental realization of quantum computers represents a significant challenge, because several opposing experimental requirements must be met. A set of coupled quantum bits must be manipulated and measured while coherently retaining entangled quantum states. Yet the manipulation and measurement processes almost inevitably lead to the decay of these fragile states. This thesis work takes significant steps towards building a practical quantum computer using nuclear spins and liquid state nuclear magnetic resonance (NMR) techniques. I present experimental results for proof of principle of quantum computing in a series of small implementations of quantum algorithms, culminating in the implementation of an adiabatic quantum optimization algorithm. The performance of adiabatic algorithms compared with classical optimization methods is unknown, but small quantum computers could provide crucial insight into answering this question. Furthermore, adiabatic algorithms also shed new light on the usefulness of quantum resources for computational tasks and hence they represent an important class of algorithms. The second part of this thesis presents several methods developed for improving the control over NMR quantum computing experiments. Even though liquid state NMR quantum computers have well known and accepted scaling limitations, the developed tools are of general use. I will show how several tools are directly transferable to two other implementations of quantum computers; one using optical methods and the other using loops of superconducting material. This work provides insight into what is needed to build a practical quantum computer, and delivers several tools and techniques that will be useful in future large-scale implementations of quantum computers.
The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices. To achieve scalability, one needs a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. In quantum computing terminology, such spin-half states are (almost) pure qubit states. Producing highly polarized spins (almost pure qubit states) out of non-polarized spins (non-pure qubit states) is sometimes called "purification". From a thermodynamic point of view, purification can be viewed as cooling spins to a very low temperature. In this preliminary work, we study the optimality of purification as a tradeoff between the number of cooled spins and the closeness of their quantum state to the ideal pure state.
The simulation of the spectra measured in nuclear magnetic resonance (NMR) spectroscopy experiments is a computationally non-trivial problem which, due to its natural interpretation as a quantum spin problem, maps in a straightforward way to a quantum computer. As such, it represents a problem for which such a device may provide some practical advantage over traditional computing methods. In order to understand the extent to which such problems may indeed provide examples of useful quantum advantage, it is important to understand the limitations of existing classical simulation methods. In this work, we benchmark our own classical solver designed to study such problems. This solver uses a clustering approximation to achieve a resource scaling which is linear in the total number of nuclear spins in a given molecule, for a fixed cluster size. The success of such an approximation would present a stark repudiation to the common claim that such problems require an exponential scaling of resources, the very claim which makes simulating an NMR spectra a candidate for quantum advantage. Our benchmarking results indicate that our approximation performs well throughout, and even somewhat beyond, the more typical experimental regimes. We discuss what implications this may have for future efforts to demonstrate quantum advantage in the context of NMR.