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

Quantum computation using NMR

Kavita Dorai, T. S. Mahesh, Arvind Arvind, Anil Kumar

Published Nov 1, 2000• 5 citations
OpenAlex

Abstract

This article reviews recent work done by us an some initial steps towards the implementation of quantum computation using liquid state NMR. We describe how special kinds of states required for such computation (called pseudo-pure states) can be created from a thermal ensemble of spins. We demonstrate the implementation of several quantum logic gates through one- and two-dimensional NMR methods, using transition- and spin- selective pulses. Finally, we discuss the implementation of the Deutsch-Jozsa algorithm using NMR.

Related papers

Quantum Computing by Two-Dimensional NMR using Spin- and Transition-Selective Pulses

T. S. Mahesh, Kavita Dorai, Arvind +1 more

Quantum computing using two-dimensional NMR has recently been described using scalar coupling evolution technique [J. Chem. Phys.,109,10603 (1998)]. In the present paper, we describe two-dimensional NMR quantum computing with the help of selective pulses. A number of logic gates are implemented using two and three qubits with one extra observer spin. Some many-in-one gates (or Portmanteau gates) are implemented. Toffoli gate (or AND/NAND gate) and OR/NOR gates are implemented on three qubits. Deutsch-Jozsa quantum algorithm for one and two qubits, using one extra work qubit, has also been implemented using selective pulses after creating a coherent superposition state, in the two-dimensional methodology.

arXiv:quant-ph/0006123•Jun 27, 2000•1 citation

Implementing quantum-logic operations, pseudopure states, and the Deutsch-Jozsa algorithm using noncommuting selective pulses in NMR

Kavita Dorai, Arvind, Anil Kumar

We demonstrate experimentally the usefulness of selective pulses in NMR to perform quantum computation. Three different techniques based on selective pulse excitations have been proposed to prepare a spin system in a pseudopure state. We describe the design of ``portmanteau'' gates using the selective manipulation of level populations. A selective pulse implementation of the Deutsch-Jozsa algorithm for two and three-qubit quantum computers is demonstrated.

arXiv:quant-ph/9906027•Physical Review A•Mar 15, 2000•88 citations

Implementation of two‐qubit and three‐qubit quantum computers using liquid‐state nuclear magnetic resonance

Dorothea Golze, Maik Icker, Stefan T. A. Berger

Abstract The field of quantum computing has grown rapidly in the last years. Most realizations of quantum computers were done on liquid‐state NMR quantum computers so far. We present in a didactic approach how to build small NMR quantum computers with two and three qubits. The two‐qubit quantum computer was implemented on α‐D‐methylglucose using 13C spins, whereas the three‐qubit quantum computer was implemented on 4‐bromo‐1,1,2‐trifluoro‐1‐butene using 19F spins. We describe in detail how to initialize these systems by generating pseudo‐pure states. For initialization, we used the spatial averaging method, which has the advantage that it can be easily understood by product operators. Furthermore, the implementation of quantum logic gate operations will be presented. © 2012 Wiley Periodicals, Inc. Concepts Magn Reson Part A 40: 25–37, 2012.

Concepts in Magnetic Resonance Part A•Jan 1, 2012•7 citations

Orchestrating an NMR quantum computation: the N=3 Deutsch-Jozsa algorithm

David C. Collins, K. W. Kim, William C. Holton +2 more

A detailed description of the development of a three qubit NMR realization of the Deutsch-Jozsa algorithm [Collins et.al., Phys. Rev. A 62, 022304 (2000)] is provided. The theoretical and experimental techniques used for the reduction of the algorithm's evolution steps into a sequence of NMR pulses are discussed at length. This includes the description of general pulse sequence compilation techniques, various schemes for indirectly coupled gate realizations, experimental pulse parameterization techniques and bookkeeping methods for pulse phases.

arXiv:quant-ph/0105045•May 10, 2001•0 citations

Ensemble quantum computing by NMR spectroscopy: product operators, pseudopure states, and an implementation of quantum error correction

Timothy F. Havel, Shyamal S. Somaroo, David G. Cory

Quantum computers are able to operate on coherent superpositions of states, and to isolate a single global property of the set of computed quantities via interference. In principle, this permits them to solve certain problems exponentially faster thana classical computer, but not one has yet succeeded in implementing a true quantum computer on more than two quantum bits. Recently, however, it has been found that an ensemble of independent and identical quantum computers can perform mots of the same feats than a single quantum computer could, while at the same time bringing massive classical parallelism to bear on its computations. Such an ensemble quantum computer can be realized, to a limited extent, by nuclear magnetic resonance (NMR) spectroscopy on ordinary liquids at room temperature and pressure. This simple implementation depends on special kinds of mixed states, called pseudo-pure states, whose preparation entails a loss of signal that is exponential in the number of spins. While this would appear to limit such an implementation to ca. 8-10 spins in the foreseeable future, NMR spectroscopy has now permitted the first experimental demonstrations of all the basic features of quantum computing. We claim, moreover, that the product operator formalism, on which the theory of NM R spectroscopy is based, provides an efficient framework within which to analyze algorithms and decoherence effects in quantum computing more generally. This is illustrated by presenting our recent experimentally implementation of a quantum error correcting code.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 6, 1998•0 citations

Liquid Nuclear Magnetic Resonance Implementation of Quantum Computation in Subspace

Yao Xi-Wei, Xue Fei, Pang Wen-Min +3 more

Based on the logical labelling method, we prepare an effective pure state in a subsystem of a three spin system via liquid nuclear magnetic resonance technique. Then with this subspace effective pure state we implement the Deutsch–Jozsa algorithm. The tomography for the subspace effective pure state and the corresponding spectrum of the output for the Deutsch–Jozsa algorithm agree with theoretical predictions, which shows that we have successfully implemented the Deutsch–Jozsa algorithm in a subsystem of a nuclear spin system and demonstrated a subspace quantum computation.

Chinese Physics Letters•Jul 21, 2006•6 citations
This article reviews recent work done by us an some initial steps towards the implementation of quantum computation using liquid state NMR. We describe how special kinds of states required for such computation (called pseudo-pure states) can be created from a thermal ensemble of spins. We demonstrate the implementation of several quantum logic gates through one- and two-dimensional NMR methods, using transition- and spin- selective pulses. Finally, we discuss the implementation of the Deutsch-Jozsa algorithm using NMR.
Quantum computing using two-dimensional NMR has recently been described using scalar coupling evolution technique [J. Chem. Phys.,109,10603 (1998)]. In the present paper, we describe two-dimensional NMR quantum computing with the help of selective pulses. A number of logic gates are implemented using two and three qubits with one extra observer spin. Some many-in-one gates (or Portmanteau gates) are implemented. Toffoli gate (or AND/NAND gate) and OR/NOR gates are implemented on three qubits. Deutsch-Jozsa quantum algorithm for one and two qubits, using one extra work qubit, has also been implemented using selective pulses after creating a coherent superposition state, in the two-dimensional methodology.
Abstract The field of quantum computing has grown rapidly in the last years. Most realizations of quantum computers were done on liquid‐state NMR quantum computers so far. We present in a didactic approach how to build small NMR quantum computers with two and three qubits. The two‐qubit quantum computer was implemented on α‐D‐methylglucose using 13C spins, whereas the three‐qubit quantum computer was implemented on 4‐bromo‐1,1,2‐trifluoro‐1‐butene using 19F spins. We describe in detail how to initialize these systems by generating pseudo‐pure states. For initialization, we used the spatial averaging method, which has the advantage that it can be easily understood by product operators. Furthermore, the implementation of quantum logic gate operations will be presented. © 2012 Wiley Periodicals, Inc. Concepts Magn Reson Part A 40: 25–37, 2012.
A detailed description of the development of a three qubit NMR realization of the Deutsch-Jozsa algorithm [Collins et.al., Phys. Rev. A 62, 022304 (2000)] is provided. The theoretical and experimental techniques used for the reduction of the algorithm's evolution steps into a sequence of NMR pulses are discussed at length. This includes the description of general pulse sequence compilation techniques, various schemes for indirectly coupled gate realizations, experimental pulse parameterization techniques and bookkeeping methods for pulse phases.
Quantum computers are able to operate on coherent superpositions of states, and to isolate a single global property of the set of computed quantities via interference. In principle, this permits them to solve certain problems exponentially faster thana classical computer, but not one has yet succeeded in implementing a true quantum computer on more than two quantum bits. Recently, however, it has been found that an ensemble of independent and identical quantum computers can perform mots of the same feats than a single quantum computer could, while at the same time bringing massive classical parallelism to bear on its computations. Such an ensemble quantum computer can be realized, to a limited extent, by nuclear magnetic resonance (NMR) spectroscopy on ordinary liquids at room temperature and pressure. This simple implementation depends on special kinds of mixed states, called pseudo-pure states, whose preparation entails a loss of signal that is exponential in the number of spins. While this would appear to limit such an implementation to ca. 8-10 spins in the foreseeable future, NMR spectroscopy has now permitted the first experimental demonstrations of all the basic features of quantum computing. We claim, moreover, that the product operator formalism, on which the theory of NM R spectroscopy is based, provides an efficient framework within which to analyze algorithms and decoherence effects in quantum computing more generally. This is illustrated by presenting our recent experimentally implementation of a quantum error correcting code.
Based on the logical labelling method, we prepare an effective pure state in a subsystem of a three spin system via liquid nuclear magnetic resonance technique. Then with this subspace effective pure state we implement the Deutsch–Jozsa algorithm. The tomography for the subspace effective pure state and the corresponding spectrum of the output for the Deutsch–Jozsa algorithm agree with theoretical predictions, which shows that we have successfully implemented the Deutsch–Jozsa algorithm in a subsystem of a nuclear spin system and demonstrated a subspace quantum computation.