dorsal/arxiv
View SchemaImplementation of a three-quantum-bit search algorithm
| Authors | Lieven M. K. Vandersypen, Matthias Steffen, Mark H. Sherwood, Costantino S. Yannoni, Gregory Breyta, Isaac L. Chuang |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9910075 |
| URL | https://arxiv.org/abs/quant-ph/9910075 |
| DOI | 10.1063/1.125846 |
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.
{
"annotation_id": "cc7dff62-5b21-42a3-ba14-04509c9a3d43",
"date_created": "2026-03-02T18:02:47.524000Z",
"date_modified": "2026-03-02T18:02:47.524000Z",
"file_hash": "e19260f6fbc962b9cee32067157ca132b793220cceed4ac37bf4ee37f906fbb3",
"private": false,
"record": {
"abstract": "We report the experimental implementation of Grover\u0027s quantum search\nalgorithm on a quantum computer with three quantum bits. The computer consists\nof molecules of $^{13}$C-labeled CHFBr$_2$, in which the three weakly coupled\nspin-1/2 nuclei behave as the bits and are initialized, manipulated, and read\nout using magnetic resonance techniques. This quantum computation is made\npossible by the introduction of two techniques which significantly reduce the\ncomplexity of the experiment and by the surprising degree of cancellation of\nsystematic errors which have previously limited the total possible number of\nquantum gates.",
"arxiv_id": "quant-ph/9910075",
"authors": [
"Lieven M. K. Vandersypen",
"Matthias Steffen",
"Mark H. Sherwood",
"Costantino S. Yannoni",
"Gregory Breyta",
"Isaac L. Chuang"
],
"categories": [
"quant-ph"
],
"doi": "10.1063/1.125846",
"title": "Implementation of a three-quantum-bit search algorithm",
"url": "https://arxiv.org/abs/quant-ph/9910075"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "6cc8ab41-6157-4dd5-a37a-c8cc5775d345",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}