Using nuclear magnetic resonance techniques with a solution of chloroform molecules we implement Grover's search algorithm for a system with four states. By performing a tomographic reconstruction of the density matrix during the computation good agreement is seen between theory and experiment. This provides the first complete experimental demonstration of loading an initial state into a quantum computer, performing a computation requiring fewer steps than on a classical computer, and then reading out the final state.Using nuclear magnetic resonance techniques with a solution of chloroform molecules we implement Grover's search algorithm for a system with four states. By performing a tomographic reconstruction of the density matrix during the computation good agreement is seen between theory and experiment. This provides the first complete experimental demonstration of loading an initial state into a quantum computer, performing a computation requiring fewer steps than on a classical computer, and then reading out the final state.

Physical Review LettersApr 13, 1998701 citations

Implementation of the Quantum Fourier Transform

Yaakov S. Weinstein, Marco A. Pravia, Evan M. Fortunato +2 more

A quantum Fourier transform (QFT) has been implemented on a three qubit nuclear magnetic resonance (NMR) quantum computer to extract the periodicity of an input state. Implementation of a QFT provides a first step towards the realization of Shor's factoring and other quantum algorithms. The experimental implementation of the QFT on a periodic state is presented along with a quantitative measure of its efficiency measured through state tomography. Experimentally realizing the QFT is a clear demonstration of the ability of NMR to control quantum systems.A quantum Fourier transform (QFT) has been implemented on a three qubit nuclear magnetic resonance (NMR) quantum computer to extract the periodicity of an input state. Implementation of a QFT provides a first step towards the realization of Shor's factoring and other quantum algorithms. The experimental implementation of the QFT on a periodic state is presented along with a quantitative measure of its efficiency measured through state tomography. Experimentally realizing the QFT is a clear demonstration of the ability of NMR to control quantum systems.

arXiv:quant-ph/9906059Physical Review LettersFeb 26, 2001289 citations

Experimental NMR realization of a generalized quantum search algorithm

G.L. Long, Haiyang Yan, Y.S. Li +8 more

arXiv:quant-ph/0009059Physics Letters AJul 1, 200145 citations

On the quantum information processing in nuclear magnetic resonance quantum computing experiments

Eduardo Ribeiro de Azevêdo, Fábio Aurélio Bonk, Édson Luiz Gea Vidoto +5 more

ResumosJan 1, 20030 citations

Experimental realization of a target-accepting quantum search by NMR

Jae‐Hyun Kim, Jae‐Seung Lee, Soonchil Lee

With a three-bit nuclear magnetic resonance quantum computer, we have experimentally realized a quantum search algorithm that can take a desired function value (or target) t as its input and give the corresponding function argument ${x}_{0}$ such that ${f(x}_{0})=t$ as a result. The function value is not retrieved from an existing table, but evaluated by the search algorithm in the manner of a typical algorithmic search. A single-query version of the quantum search algorithm is used to search for one of two function arguments.With a three-bit nuclear magnetic resonance quantum computer, we have experimentally realized a quantum search algorithm that can take a desired function value (or target) t as its input and give the corresponding function argument ${x}_{0}$ such that ${f(x}_{0})=t$ as a result. The function value is not retrieved from an existing table, but evaluated by the search algorithm in the manner of a typical algorithmic search. A single-query version of the quantum search algorithm is used to search for one of two function arguments.

Physical Review AApr 24, 20029 citations

{x}_{0}

such that

{f(x}_{0})=t

as a result. The function value is not retrieved from an existing table, but evaluated by the search algorithm in the manner of a typical algorithmic search. A single-query version of the quantum search algorithm is used to search for one of two function arguments.