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/9910015 · Physical Review A

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

Jae‐Hyun Kim, Jae‐Seung Lee, Soonchil Lee, Chaejoon Cheong

Published Jul 19, 2000• 62 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.62.022312

Related papers

Nuclear magnetic resonance implementation of the Deutsch–Jozsa algorithm using different initial states

Vladimir L. Ermakov, B. M. Fung

The Deutsch–Jozsa algorithm distinguishes constant functions from balanced functions with a single evaluation. In the first part of the work, we present simulations of the nuclear magnetic resonance application of the Deutsch–Jozsa algorithm to a 3-spin system for all possible balanced functions. Three different kinds of initial states are considered: a thermal state, a pseudopure state, and a pair (difference) of pseudopure states. Then, simulations of several balanced functions and the two constant functions of a 5-spin system are described. Finally, corresponding experimental spectra obtained by using a 16-frequency pulse to create an input equivalent to either a constant function or a balanced function are presented, and the results are compared with those obtained from computer simulations.

arXiv:quant-ph/0304058•The Journal of Chemical Physics•May 29, 2003•9 citations

Thermal equilibrium as an initial state for quantum computation by NMR

Amr F. Fahmy, Raimund Marx, Wolfgang Bermel +1 more

An experimental implementation of an ensemble quantum algorithm is presented in which the thermal state is used as an initial state of the algorithm. More specifically, we use four active qubits to demonstrate the solution of the Deutsch-Jozsa problem using a nuclear magnetic resonance quantum computer. For the implemented algorithm the number of molecules in the NMR sample is irrelevant to the number of qubits available to an NMR quantum computer, and the initial state is chosen to be the state of thermal equilibrium, thereby avoiding the preparation of pseudopure states and the resulting exponential loss of signal as the number of qubits increases. As expected, measured spectra demonstrate a clear distinction between constant and balanced functions.

arXiv:0705.1676•Physical Review A•Aug 12, 2008•24 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

Realization of Seven-qubit Deutsch-Jozsa Algorithm on NMR Quantum Computer

Wei Da-xiu

Recent years, remarkable progresses in experimental realization of quantum information have been made, especially based on nuclear magnetic resonance (NMR) theory. In all quantum algorithms, Deutsch-Jozsa algorithm has been widely studied. It can be realized on NMR quantum computer and also can be simplified by using the Cirac's scheme. In this paper, at first the principle of Deutsch-Jozsa quantum algorithm is analyzed, then we implement the seven-qubit Deutsch-Jozsa algorithm on NMR quantum computer.

Yuanzihe wuli pinglun•Jan 1, 2002•0 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•3 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
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.
The Deutsch–Jozsa algorithm distinguishes constant functions from balanced functions with a single evaluation. In the first part of the work, we present simulations of the nuclear magnetic resonance application of the Deutsch–Jozsa algorithm to a 3-spin system for all possible balanced functions. Three different kinds of initial states are considered: a thermal state, a pseudopure state, and a pair (difference) of pseudopure states. Then, simulations of several balanced functions and the two constant functions of a 5-spin system are described. Finally, corresponding experimental spectra obtained by using a 16-frequency pulse to create an input equivalent to either a constant function or a balanced function are presented, and the results are compared with those obtained from computer simulations.
An experimental implementation of an ensemble quantum algorithm is presented in which the thermal state is used as an initial state of the algorithm. More specifically, we use four active qubits to demonstrate the solution of the Deutsch-Jozsa problem using a nuclear magnetic resonance quantum computer. For the implemented algorithm the number of molecules in the NMR sample is irrelevant to the number of qubits available to an NMR quantum computer, and the initial state is chosen to be the state of thermal equilibrium, thereby avoiding the preparation of pseudopure states and the resulting exponential loss of signal as the number of qubits increases. As expected, measured spectra demonstrate a clear distinction between constant and balanced functions.
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.
Recent years, remarkable progresses in experimental realization of quantum information have been made, especially based on nuclear magnetic resonance (NMR) theory. In all quantum algorithms, Deutsch-Jozsa algorithm has been widely studied. It can be realized on NMR quantum computer and also can be simplified by using the Cirac's scheme. In this paper, at first the principle of Deutsch-Jozsa quantum algorithm is analyzed, then we implement the seven-qubit Deutsch-Jozsa algorithm on NMR quantum computer.
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.
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.