pith. sign in

arxiv: quant-ph/9910075 · v2 · submitted 1999-10-16 · 🪐 quant-ph

Implementation of a three-quantum-bit search algorithm

classification 🪐 quant-ph
keywords quantumalgorithmbitscomputerimplementationpossiblesearchtechniques
0
0 comments X
read the original 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 $^{13}$C-labeled CHFBr$_2$, 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.