dorsal/arxiv
View SchemaROM-based quantum computation: Experimental explorations using Nuclear Magnetic Resonance, and future prospects
| Authors | D. R. Sypher, I. M. Brereton, H. M. Wiseman, B. L. Hollis, B. C. Travaglione |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0112127 |
| URL | https://arxiv.org/abs/quant-ph/0112127 |
| DOI | 10.1103/PhysRevA.66.012306 |
| Journal | Phys. Rev. A 66, 012306 (2002). |
Abstract
ROM-based quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less ``magical'', and being more suited to implementing space-efficient computation (i.e. computation using the minimum number of writable qubits). Here we consider a number of small (one and two-qubit) quantum algorithms illustrating different aspects of ROM-based QC. They are: (a) a one-qubit algorithm to solve the Deutsch problem; (b) a one-qubit binary multiplication algorithm; (c) a two-qubit controlled binary multiplication algorithm; and (d) a two-qubit ROM-based version of the Deutsch-Jozsa algorithm. For each algorithm we present experimental verification using NMR ensemble QC. The average fidelities for the implementation were in the ranges 0.9 - 0.97 for the one-qubit algorithms, and 0.84 - 0.94 for the two-qubit algorithms. We conclude with a discussion of future prospects for ROM-based quantum computation. We propose a four-qubit algorithm, using Grover's iterate, for solving a miniature ``real-world'' problem relating to the lengths of paths in a network.
{
"annotation_id": "001c86ce-7d53-4515-86b9-c9a21bc03152",
"date_created": "2026-03-02T18:01:49.022000Z",
"date_modified": "2026-03-02T18:01:49.022000Z",
"file_hash": "461cf9ea8a95f549271d08671d0619800063127a64ec5e5429e75ba9a7de08bb",
"private": false,
"record": {
"abstract": "ROM-based quantum computation (QC) is an alternative to oracle-based QC. It\nhas the advantages of being less ``magical\u0027\u0027, and being more suited to\nimplementing space-efficient computation (i.e. computation using the minimum\nnumber of writable qubits). Here we consider a number of small (one and\ntwo-qubit) quantum algorithms illustrating different aspects of ROM-based QC.\nThey are: (a) a one-qubit algorithm to solve the Deutsch problem; (b) a\none-qubit binary multiplication algorithm; (c) a two-qubit controlled binary\nmultiplication algorithm; and (d) a two-qubit ROM-based version of the\nDeutsch-Jozsa algorithm. For each algorithm we present experimental\nverification using NMR ensemble QC. The average fidelities for the\nimplementation were in the ranges 0.9 - 0.97 for the one-qubit algorithms, and\n0.84 - 0.94 for the two-qubit algorithms. We conclude with a discussion of\nfuture prospects for ROM-based quantum computation. We propose a four-qubit\nalgorithm, using Grover\u0027s iterate, for solving a miniature ``real-world\u0027\u0027\nproblem relating to the lengths of paths in a network.",
"arxiv_id": "quant-ph/0112127",
"authors": [
"D. R. Sypher",
"I. M. Brereton",
"H. M. Wiseman",
"B. L. Hollis",
"B. C. Travaglione"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.66.012306",
"journal_ref": "Phys. Rev. A 66, 012306 (2002).",
"title": "ROM-based quantum computation: Experimental explorations using Nuclear Magnetic Resonance, and future prospects",
"url": "https://arxiv.org/abs/quant-ph/0112127"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "b3123bc5-8260-4384-8d01-8b91c85f6af8",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}