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

arXiv:quant-ph/9808039

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

N Linden H Barjat R Freeman

Published Aug 21, 1998• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/9808039

Related papers

Implementation of the refined Deutsch-Jozsa algorithm on a three-bit NMR quantum computer

Jae‐Hyun Kim, Jae‐Seung Lee, Soonchil Lee +1 more

We implemented the refined Deutsch-Jozsa algorithm on a three-bit nuclear magnetic resonance quantum computer. All of the balanced and constant functions were realized exactly. The results agree well with theoretical predictions and clearly distinguish the balanced functions from constant functions. Efficient refocusing schemes were proposed for the soft z pulse and J coupling, and it is shown that the thermal equilibrium state gives the same answer as the pure state for this algorithm.

arXiv:quant-ph/9910015•Physical Review A•Jul 19, 2000•54 citations

Approaching five-bit NMR quantum computing

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

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.

Physical Review A•Jun 15, 2000•106 citations

Quantum entanglement in the NMR implementation of the Deutsch-Jozsa algorithm

Arvind, *, Kavita Dorai, Anil Kumar

A scheme to execute an \\eta-bit Deutsch-Jozsa (DJ) algorithm using \\eta qubits has been implemented for up to three qubits on an NMR quantum computer. For the one- and the two-bit Deutsch problem, the qubits do not get entangled, and the NMR implementation is achieved without using spin-spin interactions. It is for the three-bit case, that the manipulation of entangled states becomes essential. The interactions through scalar J-couplings in NMR spin systems have been exploited to implement entangling transformations required for the three bit DJ algorithm.

•May 1, 2001•13 citations

Use of quadrupolar nuclei for quantum-information processing by nuclear magnetic resonance: Implementation of a quantum algorithm

Ranabir Das, Anil Kumar

Physical implementation of quantum-information processing by liquid-state nuclear magnetic resonance, using weakly coupled spin-$\frac{1}{2}$ nuclei of a molecule, is well established. Nuclei with $\mathrm{spin}>1/2$ oriented in liquid-crystalline matrices is another possibility. Such systems have multiple qubits per nuclei and large quadrupolar couplings resulting in well separated lines in the spectrum. So far, creation of pseudopure states and logic gates has been demonstrated in such systems using transition selective radio-frequency pulses. In this paper we report two developments. First, we implement a quantum algorithm that needs coherent superposition of states. Second, we use evolution under quadrupolar coupling to implement multiqubit gates. We implement the Deutsch-Jozsa algorithm on a spin-$\frac{3}{2}$ (2 qubit) system. The controlled-NOT operation needed to implement this algorithm has been implemented here by evolution under the quadrupolar Hamiltonian. To the best of our knowledge, this method has been implemented for the first time in quadrupolar systems. Since the quadrupolar coupling is several orders of magnitude greater than the coupling in weakly coupled spin-$\frac{1}{2}$ nuclei, the gate time decreases, increasing the clock speed of the quantum computer.

arXiv:quant-ph/0306100•Physical Review A•Sep 10, 2003•54 citations

A Nuclear Magnetic Resonance Implementation of a Classical Deutsch-Jozsa Algorithm

Alastair A. Abbott, Matthias Bechmann, Cristian S. Calude +1 more

Nuclear magnetic resonance (NMR) has been widely used as a demonstrative medium for showcasing the ability for quantum computations to outperform classical ones. A large number of such experiments performed have been implementations of the Deutsch-Jozsa algorithm. It is known, however, that in some cases the Deutsch-Jozsa problem can be solved classically using as many queries to the black-box as in the quantum solution. In this paper we describe experiments in which we take the contrasting approach of using NMR as a classical computing medium, treating the nuclear spin vectors classically and utilising an alternative embedding of bits into the physical medium. This allows us to determine the actual Boolean function computed by the black-box for the n=1,2 cases, as opposed to only the nature (balanced or constant) as conventional quantum algorithms do. Discussion of these experiments leads to some clarification of the complications surrounding the comparison of different quantum algorithms, particularly black-box type algorithms.

arXiv:1110.0177•Oct 2, 2011•1 citation

NMR quantum computation with indirectly coupled gates

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

An NMR realization of a two-qubit quantum gate which processes quantum information indirectly via couplings to a spectator qubit is presented in the context of the Deutsch-Jozsa algorithm. This enables a successful comprehensive NMR implementation of the Deutsch-Jozsa algorithm for functions with three argument bits and demonstrates a technique essential for multi-qubit quantum computation.

arXiv:quant-ph/9910006•Physical Review A•Jul 12, 2000•53 citations
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.
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 scheme to execute an \\eta-bit Deutsch-Jozsa (DJ) algorithm using \\eta qubits has been implemented for up to three qubits on an NMR quantum computer. For the one- and the two-bit Deutsch problem, the qubits do not get entangled, and the NMR implementation is achieved without using spin-spin interactions. It is for the three-bit case, that the manipulation of entangled states becomes essential. The interactions through scalar J-couplings in NMR spin systems have been exploited to implement entangling transformations required for the three bit DJ algorithm.
Physical implementation of quantum-information processing by liquid-state nuclear magnetic resonance, using weakly coupled spin-12\frac{1}{2}21​ nuclei of a molecule, is well established. Nuclei with spin>1/2\mathrm{spin}>1/2spin>1/2 oriented in liquid-crystalline matrices is another possibility. Such systems have multiple qubits per nuclei and large quadrupolar couplings resulting in well separated lines in the spectrum. So far, creation of pseudopure states and logic gates has been demonstrated in such systems using transition selective radio-frequency pulses. In this paper we report two developments. First, we implement a quantum algorithm that needs coherent superposition of states. Second, we use evolution under quadrupolar coupling to implement multiqubit gates. We implement the Deutsch-Jozsa algorithm on a spin-32\frac{3}{2}23​ (2 qubit) system. The controlled-NOT operation needed to implement this algorithm has been implemented here by evolution under the quadrupolar Hamiltonian. To the best of our knowledge, this method has been implemented for the first time in quadrupolar systems. Since the quadrupolar coupling is several orders of magnitude greater than the coupling in weakly coupled spin-12\frac{1}{2}21​ nuclei, the gate time decreases, increasing the clock speed of the quantum computer.
Nuclear magnetic resonance (NMR) has been widely used as a demonstrative medium for showcasing the ability for quantum computations to outperform classical ones. A large number of such experiments performed have been implementations of the Deutsch-Jozsa algorithm. It is known, however, that in some cases the Deutsch-Jozsa problem can be solved classically using as many queries to the black-box as in the quantum solution. In this paper we describe experiments in which we take the contrasting approach of using NMR as a classical computing medium, treating the nuclear spin vectors classically and utilising an alternative embedding of bits into the physical medium. This allows us to determine the actual Boolean function computed by the black-box for the n=1,2 cases, as opposed to only the nature (balanced or constant) as conventional quantum algorithms do. Discussion of these experiments leads to some clarification of the complications surrounding the comparison of different quantum algorithms, particularly black-box type algorithms.