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

CRC Press eBooks

NMR Quantum Computer

Mikio Nakahara

Published Mar 11, 2008• 0 citations
Publisher

Abstract

The NMR quantum computer is one of the most established systems among many physical realizations of a quantum computer. In spite of its peculiar character associated with mixed states and lack of scalability, it still works as a prototypical quantum computer with at most 10 qubits. We should point out that it is the only quantum computer commercially available at the time of writing this book. For these reasons, an NMR quantum computer is introduced as one of the first examples of a physical system on which we can execute small-scale quantum algorithms. Qubits in this realization are nuclei with spin 1/2. Molecules with a certain number of such nuclei are employed as a quantum register. The system is made of a macroscopic number (∼ 1020) of moleclues in thermal equilibrium, and we have to take care of these aspects in preparation of a state and measurements as explained in this chapter. Our exposition follows [1] and [2]. Other useful review is [3].

DOI
10.1201/9781420012293-19

Related papers

Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer

J. A. Jones, M. Mosca

Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance (NMR) can be used to implement small quantum computers using the spin states of nuclei in carefully chosen small molecules. Here we demonstrate the use of a NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch’s problem (distinguishing between constant and balanced functions). This is the first successful implementation of a quantum algorithm on any physical system.

arXiv:quant-ph/9801027•The Journal of Chemical Physics•Aug 1, 1998•406 citations

Modelling Molecular Technologies for Nuclear Magnetic Resonance Quantum Computing

Mario Simoni

Standard CMOS circuits are expected to be no longer able to satisfy nowadays demand for higher performances and lower power consumption. This commits to look for new solutions. Quantum computation, whose fundamental quantity of information is the qubit, is a thoroughly new way of thinking to electronics. There are at least two main reasons for which quantum computing is expected to broaden computation horizons. First, specific algorithms can be engineered, manipulating the probability amplitudes of different states, to exploit the quantum superposition principle and achieve high parallelism. Second, it is expected to be spontaneously suitable to simulate complex quantum physical systems, as large molecules. Quantum computing requires the cooperation of several scientific fields. The leading idea has been to highlight the operations and algorithms a quantum computer must be able to perform and, then, to propose a hardware solution, providing the rigorous physical treatment mandatory for a deep understanding and for an appropriate modelling, something which is hard to find in nowadays literature. Thus, the first chapters address the quantum algorithms, focusing on Grover's search algorithm and deriving, from fundamentals, the corresponding circuit. The latter is then described in Quantum Assembly (QASM), which can be seen as the quantum equivalent of VHDL, and simulated on IBM Q Experience. The following chapters deal with a possible physical implementation of quantum processors: the encoding of qubits on nuclear spins in diamagnetic molecules. When a static magnetic field is applied to a spin-1/2 nucleus, two well-defined energy eigenstates arise, as a result of the Zeeman effect. Each of them can be associated with a qubit eigenstate. Thanks to nuclear magnetic resonance principles, the probability with which one of the two eigenstates is measured can be handled by the superposition of a radio frequency field at the resonance frequency of the nucleus. This can be interpreted as a rotation of the spin, and so of the qubit, about the RF field and enables the execution of single qubit quantum gates, since they are simple rotations of the state vector. The two-qubit CNOT gate is obtained through the interaction of spins via J-coupling. Considering that these gates constitute a universal set, every quantum algorithm can theoretically be run on an NMR processor. Different nuclei have different resonant frequencies, but the addressing of a specific spin can be achieved also in homonuclear molecules, since the resonant frequency depends also on the nuclear environment (nuclear shielding). While unwanted J-couplings can be removed thanks to refocusing, spin decoherence and relaxation phenomena force an upper limit to the allowed timescale. A main advantage of NMR is that this timescale is long, even at room temperature. Conversely, scalability is still an issue. A simple heteronuclear MATLAB model, based on the relations derived from first principles in the thesis, is proposed to prove the feasibility of NMR quantum processors. The input technological parameters, as chemical shielding and J-coupling, can be computed resorting on ORCA, or obtained from experimental data. The model, able to run a universal set of quantum gates and simple algorithms, can be useful to find an optimal operating point as a compromise between molecule physical properties and the quantities which can be controlled by nowadays NMR instrumentation.

•Apr 1, 2020•0 citations

Implementation of Quantum Computing Techniques on NMR Systems

Anurag Pallaprolu

This document is submitted as a partial requirement for the course Quantum Information and Computing, BITS Pilani. The phenomenon of NMR can be used to generate spin states of nuclei and these can be used as qubits for computational purposes, the speciality being, an ensemble of molecules must be utilized. This allows for an exponentiation in the processing power of the computer. The document explains about the setup, measurement and initialization of an NMR quantum computer.

•Apr 1, 2014•0 citations

Liquid-State NMR Quantum Computer: Hamiltonian Formalism and Experiments

Yasushi Kondo, Mikio Nakahara, Shogo Tanimura

A quantum algorithm is represented as a unitary operator acting on a qubit space and is realized as a time development operator of a controlled quantum system. In a liquid-state NMR quantum computer, spins of nuclei in isolated molecules dissolved in a solvent work as qubits and they are controlled by radio frequency pulses. We reexamine the Hamiltonian describing the spin dynamics and formulate the principle of a liquid-state NMR quantum computer from the viewpoint of Hamiltonian dynamics. We executed the Deutsch-Jozsa algorithm and the Grover database search algorithm as well as a pseudopure state preparation with two-qubit homonucleus molecules to demonstrate the validity of our formalism. Finally we discuss whether a liquid-state NMR quantum computer currently fulfills the DiVincenzo criteria or not.

•Mar 1, 2006•5 citations

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

Introduction to NMR Quantum Information Processing

Raymond Laflamme, Emanuel H. Knill, David G. Cory +11 more

After a general introduction to nuclear magnetic resonance (NMR), we give the basics of implementing quantum algorithms. We describe how qubits are realized and controlled with RF pulses, their internal interactions, and gradient fields. A peculiarity of NMR is that the internal interactions (given by the internal Hamiltonian) are always on. We discuss how they can be effectively turned off with the help of a standard NMR method called ``refocusing''. Liquid state NMR experiments are done at room temperature, leading to an extremely mixed (that is, nearly random) initial state. Despite this high degree of randomness, it is possible to investigate QIP because the relaxation time (the time scale over which useful signal from a computation is lost) is sufficiently long. We explain how this feature leads to the crucial ability of simulating a pure (non-random) state by using ``pseudopure'' states. We discuss how the ``answer'' provided by a computation is obtained by measurement and how this measurement differs from the ideal, projective measurement of QIP. We then give implementations of some simple quantum algorithms with a typical experimental result. We conclude with a discussion of what we have learned from NMR QIP so far and what the prospects for future NMR QIP experiments are.

arXiv:quant-ph/0207172•Jul 30, 2002•65 citations
The NMR quantum computer is one of the most established systems among many physical realizations of a quantum computer. In spite of its peculiar character associated with mixed states and lack of scalability, it still works as a prototypical quantum computer with at most 10 qubits. We should point out that it is the only quantum computer commercially available at the time of writing this book. For these reasons, an NMR quantum computer is introduced as one of the first examples of a physical system on which we can execute small-scale quantum algorithms. Qubits in this realization are nuclei with spin 1/2. Molecules with a certain number of such nuclei are employed as a quantum register. The system is made of a macroscopic number (∼ 1020) of moleclues in thermal equilibrium, and we have to take care of these aspects in preparation of a state and measurements as explained in this chapter. Our exposition follows [1] and [2]. Other useful review is [3].
Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance (NMR) can be used to implement small quantum computers using the spin states of nuclei in carefully chosen small molecules. Here we demonstrate the use of a NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch’s problem (distinguishing between constant and balanced functions). This is the first successful implementation of a quantum algorithm on any physical system.
Standard CMOS circuits are expected to be no longer able to satisfy nowadays demand for higher performances and lower power consumption. This commits to look for new solutions. Quantum computation, whose fundamental quantity of information is the qubit, is a thoroughly new way of thinking to electronics. There are at least two main reasons for which quantum computing is expected to broaden computation horizons. First, specific algorithms can be engineered, manipulating the probability amplitudes of different states, to exploit the quantum superposition principle and achieve high parallelism. Second, it is expected to be spontaneously suitable to simulate complex quantum physical systems, as large molecules. Quantum computing requires the cooperation of several scientific fields. The leading idea has been to highlight the operations and algorithms a quantum computer must be able to perform and, then, to propose a hardware solution, providing the rigorous physical treatment mandatory for a deep understanding and for an appropriate modelling, something which is hard to find in nowadays literature. Thus, the first chapters address the quantum algorithms, focusing on Grover's search algorithm and deriving, from fundamentals, the corresponding circuit. The latter is then described in Quantum Assembly (QASM), which can be seen as the quantum equivalent of VHDL, and simulated on IBM Q Experience. The following chapters deal with a possible physical implementation of quantum processors: the encoding of qubits on nuclear spins in diamagnetic molecules. When a static magnetic field is applied to a spin-1/2 nucleus, two well-defined energy eigenstates arise, as a result of the Zeeman effect. Each of them can be associated with a qubit eigenstate. Thanks to nuclear magnetic resonance principles, the probability with which one of the two eigenstates is measured can be handled by the superposition of a radio frequency field at the resonance frequency of the nucleus. This can be interpreted as a rotation of the spin, and so of the qubit, about the RF field and enables the execution of single qubit quantum gates, since they are simple rotations of the state vector. The two-qubit CNOT gate is obtained through the interaction of spins via J-coupling. Considering that these gates constitute a universal set, every quantum algorithm can theoretically be run on an NMR processor. Different nuclei have different resonant frequencies, but the addressing of a specific spin can be achieved also in homonuclear molecules, since the resonant frequency depends also on the nuclear environment (nuclear shielding). While unwanted J-couplings can be removed thanks to refocusing, spin decoherence and relaxation phenomena force an upper limit to the allowed timescale. A main advantage of NMR is that this timescale is long, even at room temperature. Conversely, scalability is still an issue. A simple heteronuclear MATLAB model, based on the relations derived from first principles in the thesis, is proposed to prove the feasibility of NMR quantum processors. The input technological parameters, as chemical shielding and J-coupling, can be computed resorting on ORCA, or obtained from experimental data. The model, able to run a universal set of quantum gates and simple algorithms, can be useful to find an optimal operating point as a compromise between molecule physical properties and the quantities which can be controlled by nowadays NMR instrumentation.
A quantum algorithm is represented as a unitary operator acting on a qubit space and is realized as a time development operator of a controlled quantum system. In a liquid-state NMR quantum computer, spins of nuclei in isolated molecules dissolved in a solvent work as qubits and they are controlled by radio frequency pulses. We reexamine the Hamiltonian describing the spin dynamics and formulate the principle of a liquid-state NMR quantum computer from the viewpoint of Hamiltonian dynamics. We executed the Deutsch-Jozsa algorithm and the Grover database search algorithm as well as a pseudopure state preparation with two-qubit homonucleus molecules to demonstrate the validity of our formalism. Finally we discuss whether a liquid-state NMR quantum computer currently fulfills the DiVincenzo criteria or not.
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
After a general introduction to nuclear magnetic resonance (NMR), we give the basics of implementing quantum algorithms. We describe how qubits are realized and controlled with RF pulses, their internal interactions, and gradient fields. A peculiarity of NMR is that the internal interactions (given by the internal Hamiltonian) are always on. We discuss how they can be effectively turned off with the help of a standard NMR method called ``refocusing''. Liquid state NMR experiments are done at room temperature, leading to an extremely mixed (that is, nearly random) initial state. Despite this high degree of randomness, it is possible to investigate QIP because the relaxation time (the time scale over which useful signal from a computation is lost) is sufficiently long. We explain how this feature leads to the crucial ability of simulating a pure (non-random) state by using ``pseudopure'' states. We discuss how the ``answer'' provided by a computation is obtained by measurement and how this measurement differs from the ideal, projective measurement of QIP. We then give implementations of some simple quantum algorithms with a typical experimental result. We conclude with a discussion of what we have learned from NMR QIP so far and what the prospects for future NMR QIP experiments are.