Implementation of a three-quantum-bit search algorithm
Abstract
We report the experimental implementation of Grover's quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of C-labeled CHFBr, in which the three weakly coupled spin-1/2 nuclei behave as the bits and are initialized, manipulated, and read out using magnetic resonance techniques. This quantum computation is made possible by the introduction of two techniques which significantly reduce the complexity of the experiment and by the surprising degree of cancellation of systematic errors which have previously limited the total possible number of quantum gates.
Cite
@article{arxiv.quant-ph/9910075,
title = {Implementation of a three-quantum-bit search algorithm},
author = {Lieven M. K. Vandersypen and Matthias Steffen and Mark H. Sherwood and Costantino S. Yannoni and Gregory Breyta and Isaac L. Chuang},
journal= {arXiv preprint arXiv:quant-ph/9910075},
year = {2009}
}
Comments
Published in Applied Physics Letters, vol. 76, no. 5, 31 January 2000, p.646-648, after minor revisions. (revtex, mypsfig2.sty, 3 figures)