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

Chinese Physics Letters

Implementation of a Quantum Algorithm for Deutsch-Jozsa Problem with Improved Nuclear Magnetic Resonance Sequences

Yan Zhang, J. L. Luo, Xiao Li, Li-ping Fu, Qiu Jian-qing, Xizhi Zeng, Chaohui Ye

Published Sep 1, 1999• 2 citations
Publisher

Abstract

A quantum algorithm for Deutsch-Jozsa problem was implemented by nuclear magnetic resonance of benzene with heteronuclear decoupling during the readout period. It was demonstrated that decoupling can not only remove the undesired long-range couplings but also save the frequency space taken up by nuclear spins, which was expected to be important when scaling to large systems, and also to enhance the signal-to-noise ratio.

DOI
10.1088/0256-307x/16/9/026

Related papers

Implementation of adiabatic Deutsch-Jozsa algorithm by Nuclear Magnetic Resonance

Avik Mitra, Arindam Ghosh, Ranabir Das +2 more

Quantum adiabatic algorithms is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. The adiabatic Deutsch-Jozsa algorithm given be Saurya Das, Randy Kobes and Gabor Kunstatter [Phys. Rev. A. 65, 062301 (2002)], shows how the Deutsch-Jozsa algorithm can be implemented in N^{1/2} steps, where N=2^n and n is the number of qubits, using local adiabatic evolution. In this paper we report the experimental implementation of the adiabatic Deutsch-Jozsa algorithm in a two qubit quantum information processor by Nuclear Magnetic Resonance.

•Mar 5, 2005•0 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

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

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•52 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

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
A quantum algorithm for Deutsch-Jozsa problem was implemented by nuclear magnetic resonance of benzene with heteronuclear decoupling during the readout period. It was demonstrated that decoupling can not only remove the undesired long-range couplings but also save the frequency space taken up by nuclear spins, which was expected to be important when scaling to large systems, and also to enhance the signal-to-noise ratio.
Quantum adiabatic algorithms is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. The adiabatic Deutsch-Jozsa algorithm given be Saurya Das, Randy Kobes and Gabor Kunstatter [Phys. Rev. A. 65, 062301 (2002)], shows how the Deutsch-Jozsa algorithm can be implemented in N^{1/2} steps, where N=2^n and n is the number of qubits, using local adiabatic evolution. In this paper we report the experimental implementation of the adiabatic Deutsch-Jozsa algorithm in a two qubit quantum information processor by Nuclear Magnetic Resonance.
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.
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.
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.
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.
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.