© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:quant-ph/0007043 · Physical Review A

Rapid solution of problems by nuclear-magnetic-resonance quantum computation

John M. Myers, Amr F. Fahmy, Steffen J. Glaser, Raimund Marx

Published Feb 6, 2001• 20 citations

Abstract

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.

DOI: 10.1103/physreva.63.032302

Related papers

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

Nuclear magnetic resonance quantum computing exploiting the pure spin state of para hydrogen

Patrick Hübler, Joachim Bargon, Steffen J. Glaser

Nuclear magnetic resonance (NMR) is well-suited to implement quantum algorithms experimentally. However, there are serious problems associated with the noisy mixed initial state that is described by the thermal equilibrium density operator of NMR spectroscopy. Here we present a new strategy to dramatically increase the sensitivity of a NMR quantum computing experiment. Para hydrogen can be used to prepare a density operator in a suitable molecule that is very close to a pure state, an improvement on the order of 104 compared to “conventional” NMR quantum computing. Our strategy is demonstrated experimentally solving the Deutsch–Jozsa problem based on para hydrogen and Vaska’s complex.

The Journal of Chemical Physics•Aug 8, 2000•38 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

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

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

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

N Linden H Barjat R Freeman

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.

arXiv:quant-ph/9808039•Aug 21, 1998•0 citations

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.

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.

Nuclear magnetic resonance (NMR) is well-suited to implement quantum algorithms experimentally. However, there are serious problems associated with the noisy mixed initial state that is described by the thermal equilibrium density operator of NMR spectroscopy. Here we present a new strategy to dramatically increase the sensitivity of a NMR quantum computing experiment. Para hydrogen can be used to prepare a density operator in a suitable molecule that is very close to a pure state, an improvement on the order of 104 compared to “conventional” NMR quantum computing. Our strategy is demonstrated experimentally solving the Deutsch–Jozsa problem based on para hydrogen and Vaska’s complex.

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.

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.

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.