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/0105045

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

David C. Collins, K. W. Kim, William C. Holton, Hanna S. Gracz, Edward O. Stejskal

Published May 10, 2001• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0105045

Related papers

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

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

NMR tomography of the three-qubit Deutsch-Jozsa algorithm

Oliver Mangold, Andreas Heidebrecht, Michael Mehring

The optimized version of the Deutsch-Jozsa algorithm proposed by Collins et al. was implemented using the three $^{19}\mathrm{F}$ nuclear spins of 2,3,4-trifluoroaniline as qubits. To emulate the behavior of pure quantum-mechanical states pseudopure states of the ensemble were prepared prior to execution of the algorithm. Full tomography of the density matrix was employed to obtain detailed information about initial, intermediate, and final states. Information, thus obtained, was applied to optimize the pulse sequences used. It is shown that substantial improvement of the fidelity of the preparation may be achieved by compensating the effects caused by the different relaxation behavior of the different substates of the density matrix. All manipulations of the quantum states were performed under the conditions of unresolved spin-spin interactions.

Physical Review A•Oct 11, 2004•22 citations

Quantum computation using NMR

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

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.

•Nov 1, 2000•5 citations

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

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•107 citations
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 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.
The optimized version of the Deutsch-Jozsa algorithm proposed by Collins et al. was implemented using the three 19F^{19}\mathrm{F}19F nuclear spins of 2,3,4-trifluoroaniline as qubits. To emulate the behavior of pure quantum-mechanical states pseudopure states of the ensemble were prepared prior to execution of the algorithm. Full tomography of the density matrix was employed to obtain detailed information about initial, intermediate, and final states. Information, thus obtained, was applied to optimize the pulse sequences used. It is shown that substantial improvement of the fidelity of the preparation may be achieved by compensating the effects caused by the different relaxation behavior of the different substates of the density matrix. All manipulations of the quantum states were performed under the conditions of unresolved spin-spin interactions.
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 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) 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.