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:0705.1676 · Physical Review A

Thermal equilibrium as an initial state for quantum computation by NMR

Amr F. Fahmy, Raimund Marx, Wolfgang Bermel, Steffen J. Glaser

Published Aug 12, 2008• 23 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.78.022317

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

Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer

J. A. Jones, M. Mosca

Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance (NMR) can be used to implement small quantum computers using the spin states of nuclei in carefully chosen small molecules. Here we demonstrate the use of a NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch’s problem (distinguishing between constant and balanced functions). This is the first successful implementation of a quantum algorithm on any physical system.

arXiv:quant-ph/9801027•The Journal of Chemical Physics•Aug 1, 1998•399 citations

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

Simulation of NMR implementation of Deutsch-Jozsa algorithm

Varun Chappidi, Soumya Ganguly

Quantum Computation is slowly evolving as the next big innovation that would change the entire way we perceive the world around us. Even though many scientists are actively researching on it, one main hurdle is that a physical quantum computer is not readily available to everyone to work on. The present paper computationally simulates a quantum algorithm using nuclear magnetic resonance on four different kinds of molecules and shows that the spectra obtained are similar to the experimental results. Computational simulations like these would allow researchers to verify their quantum algorithms using NMR without actually having a physical device hence overcoming the hurdle.

IEEE International Advance Computing Conference•Feb 1, 2014•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
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.
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.
Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance (NMR) can be used to implement small quantum computers using the spin states of nuclei in carefully chosen small molecules. Here we demonstrate the use of a NMR quantum computer based on the pyrimidine base cytosine, and the implementation of a quantum algorithm to solve Deutsch’s problem (distinguishing between constant and balanced functions). This is the first successful implementation of a quantum algorithm on any physical system.
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.
Quantum Computation is slowly evolving as the next big innovation that would change the entire way we perceive the world around us. Even though many scientists are actively researching on it, one main hurdle is that a physical quantum computer is not readily available to everyone to work on. The present paper computationally simulates a quantum algorithm using nuclear magnetic resonance on four different kinds of molecules and shows that the spectra obtained are similar to the experimental results. Computational simulations like these would allow researchers to verify their quantum algorithms using NMR without actually having a physical device hence overcoming the hurdle.
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.