Implementation of a Deutsch-like quantum algorithm utilizing entanglement at the two-qubit level, on an NMR quantum information processor

Abstract

We describe the experimental implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits using NMR. The algorithm solves a generalisation of the Deutsch problem and distinguishes between even and odd functions using fewer function calls than is possible classically. The manipulation of entangled states of the two qubits is essential here, unlike the Deutsch-Jozsa algorithm and the Grover's search algorithm for two bits.

4 pages, two eps figures

References in corpus (6)

• Quantum search without entanglement
• Quantum simulation of a three-body interaction Hamiltonian on an NMR quantum computer
• Efficient Refocussing of One Spin and Two Spin Interactions for NMR Quantum Computation
• Implementing quantum logic operations, pseudo-pure states and the Deutsch-Jozsa algorithm using non-commuting selective pulses in NMR
• Experimental Demonstration of Greenberger-Horne-Zeilinger Correlations Using Nuclear Magnetic Resonance
• Realization of logically labeled effective pure states for bulk quantum computation

Cited by in corpus (9)

• Quantum Computing with NMR
• Determining the parity of a permutation using an experimental NMR qutrit
• Efficient Quantum State Tomography for Quantum Information Processing using a two-dimensional Fourier Transform Technique
• Implementation of Conditional Phase Shift gate for Quantum Information Processing by NMR, using Transition-selective pulses
• Controlling NMR spin systems for quantum computation
• Nuclear magnetic resonance implementation of the Deutsch-Jozsa algorithm using different initial states
• Entangling capacity of global phases and implications for Deutsch-Jozsa algorithm
• Role of interference and entanglement in quantum neural processing
• Quantum Advantage in Identifying the Parity of Permutations with Certainty