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

Physical Review A

Approaching five-bit NMR quantum computing

Raimund Marx, Amr F. Fahmy, John M. Myers, Wolfgang Bermel, Steffen J. Glaser

Published Jun 15, 2000• 106 citations
Publisher

Abstract

Nuclear-magnetic-resonance (NMR) quantum computation is a fruitful arena in which to develop and demonstrate an enhanced capability for quantum control over molecular systems, regardless of the prospects, which may be limited, for building a quantum computer superior to a conventional computer for any computing task. We demonstrate a five-bit NMR quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism, an example of the Deutsch-Jozsa problem. Its construction draws on the recognition of the sufficiency of linear coupling along a chain of nuclear spins, the synthesis of a suitably coupled molecule containing four distinct nuclear species, and the use of a multichannel spectrometer. Radio-frequency pulse sequences are described to execute controlled-NOT gates on two adjoining spins while leaving the other three spins essentially unaffected.

DOI
10.1103/physreva.62.012310

Related papers

Realization of a 5-bit NMR Quantum Computer Using a New Molecular Architecture

Raimund Marx, Fahmy, A. F., Myers, J. M. +2 more

We demonstrate a five-bit nuclear-magnetic-resonance quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism. Its construction draws on the recognition of the sufficiency of linear coupling along a chain of nuclear spins, the synthesis of a suitably coupled molecule, and the use of a multi-channel spectrometer.

arXiv:quant-ph/9905087•May 25, 1999•10 citations

Chemical engineering of an NMR quantum computer

Raimund Marx, Amr F. Fahmy, John M. Myers +2 more

The realization of a five-qubit nuclear-magnetic-resonance quantum computer is reported, from the design and synthesis of a suitable molecule through the implementation of pulse sequences on a multi-channel spectrometer. The quantum computer is shown to distinguish between balanced and constant functions on four bits, making use of quantum parallelism.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 13, 2000•4 citations

An implementation of the Deutsch-Jozsa algorithm on a three-qubit NMR quantum computer

N Linden H Barjat R Freeman

A new approach to the implementation of a quantum computer by high-resolution nuclear magnetic resonance (NMR) is described. The key feature is that two or more line-selective radio-frequency pulses are applied simultaneously. A three-qubit quantum computer has been investigated using the 400 MHz NMR spectrum of the three coupled protons in 2,3-dibromopropanoic acid. It has been employed to implement the Deutsch-Jozsa algorithm for distinguishing between constant and balanced functions. The extension to systems containing more coupled spins is straightforward and does not require a more protracted experiment.

arXiv:quant-ph/9808039•Aug 21, 1998•0 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

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•40 citations

Rapid solution of problems by nuclear-magnetic-resonance quantum computation

John M. Myers, Amr F. Fahmy, Steffen J. Glaser +1 more

We offer an improved method for using a nuclear-magnetic-resonance quantum computer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the application of the NMRQC are an exponential diminishment of density-matrix elements with the number of bits, threatening weak signal levels; and the high cost of preparing a suitable starting state. A third obstacle is a heretofore unnoticed restriction on measurement operators available for use by a NMRQC. Variations on the function classes of the Deutsch-Jozsa problem are introduced, both to extend the range of problems advantageous for quantum computation and to escape all three obstacles to the use of a NMRQC. At the cost of an extra work bit and a polynomial increase in the number of gate operations required, the method solves the Deutsch-Jozsa problem while avoiding an exponential loss of the signal, preparation of a pseudopure state, and temporal averaging.

arXiv:quant-ph/0007043•Physical Review A•Feb 6, 2001•20 citations
Nuclear-magnetic-resonance (NMR) quantum computation is a fruitful arena in which to develop and demonstrate an enhanced capability for quantum control over molecular systems, regardless of the prospects, which may be limited, for building a quantum computer superior to a conventional computer for any computing task. We demonstrate a five-bit NMR quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism, an example of the Deutsch-Jozsa problem. Its construction draws on the recognition of the sufficiency of linear coupling along a chain of nuclear spins, the synthesis of a suitably coupled molecule containing four distinct nuclear species, and the use of a multichannel spectrometer. Radio-frequency pulse sequences are described to execute controlled-NOT gates on two adjoining spins while leaving the other three spins essentially unaffected.
A new approach to the implementation of a quantum computer by high-resolution nuclear magnetic resonance (NMR) is described. The key feature is that two or more line-selective radio-frequency pulses are applied simultaneously. A three-qubit quantum computer has been investigated using the 400 MHz NMR spectrum of the three coupled protons in 2,3-dibromopropanoic acid. It has been employed to implement the Deutsch-Jozsa algorithm for distinguishing between constant and balanced functions. The extension to systems containing more coupled spins is straightforward and does not require a more protracted experiment.
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.
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.
We offer an improved method for using a nuclear-magnetic-resonance quantum computer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the application of the NMRQC are an exponential diminishment of density-matrix elements with the number of bits, threatening weak signal levels; and the high cost of preparing a suitable starting state. A third obstacle is a heretofore unnoticed restriction on measurement operators available for use by a NMRQC. Variations on the function classes of the Deutsch-Jozsa problem are introduced, both to extend the range of problems advantageous for quantum computation and to escape all three obstacles to the use of a NMRQC. At the cost of an extra work bit and a polynomial increase in the number of gate operations required, the method solves the Deutsch-Jozsa problem while avoiding an exponential loss of the signal, preparation of a pseudopure state, and temporal averaging.