Article

NMR experimental realization of seven-qubit DJ algorithm and controlled phase-shift gates with improved precision

Chinese Science Bulletin (Impact Factor: 1.32). 01/2003; 48(3):239-243. DOI: 10.1007/BF03183290

ABSTRACT In this study, we report the experimental realization of seven-qubit Deutsch-Jozsa (D-J) algorithm and controlled phase-shift
gates with improved precision using liquid state nuclear magnetic resonance (NMR). The experimental results have shown that
transformationsU

f
in the seven-qubit D-J algorithm have been implemented with different pulse sequences, and whetherf is constant or balanced is determined by using only a single function call (U

f
). Furthermore, we propose an experimental method to measure and correct the error in the controlled phase-shift gate that
is simple and feasible in experiments, and can have precise phase shifts. These may offer the possibility of surmounting the
difficulties of low signal-to-noise ratio (SNR) in multi-qubit NMR quantum computers, more complicated experimental techniques,
and the increase of gate errors due to using a large number of imperfect selective pulses. These are also applied to more
complicated quantum algorithms with more qubits, such as quantum Fourier transformation and Shor’s algorithm.

0 Bookmarks
 · 
30 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Despite early experimental tests of the Deutsch-Jozsa (DJ) algorithm, there have been only a very few nontrivial balanced functions tested for register number n>3. In this paper, we experimentally demonstrate the DJ algorithm in four- and five-qubit homonuclear spin systems by the nuclear-magnetic-resonance technique, by which we encode the one function evaluation into a long shaped pulse with the application of the gradient ascent algorithm. Our work, dramatically reducing the accumulated errors due to gate imperfections and relaxation, demonstrates a better implementation of the DJ algorithm.
    Physical Review A 10/2011; 84(4). · 3.04 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: DNA computation (DNAC) has been proposed to solve the satisfiability (SAT) problem due to operations in parallel on extremely large numbers of strands. This paper attempts to treat the DNA-based bio-molecular solution for the SAT problem from the quantum mechanical perspective with a purpose to explore the relationship between DNAC and quantum computation (QC). To achieve this goal, it first builds up the correspondence of operations between QC and DNAC. Then it gives an example for the case of two variables and three clauses for details of this theory. It also demonstrates a three-qubit experiment for solving the simplest SAT problem with a single variable on a liquid-state nuclear magnetic resonance ensemble to verify this theory. Some discussions are made for the potential application and for further exploration of the present work.
    Chinese Physics B 01/2010; 18(12):5173. · 1.15 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: 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.
    10/2011;