dorsal/arxiv
View SchemaA quantum Fourier transform algorithm
| Authors | Chris Lomont |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0404060 |
| URL | https://arxiv.org/abs/quant-ph/0404060 |
Abstract
Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds given earlier. Exact bounds are given for the number of qubits needed to achieve a desired tolerance, allowing simulation of the algorithm.
{
"annotation_id": "fa430bdb-67d5-4c2a-980f-e7e049e297b8",
"date_created": "2026-03-02T18:02:06.329000Z",
"date_modified": "2026-03-02T18:02:06.329000Z",
"file_hash": "258e578ed4f93f0bdf0a611d5c0940d56450ff62bc6eebb19d41b122012a03fe",
"private": false,
"record": {
"abstract": "Algorithms to compute the quantum Fourier transform over a cyclic group are\nfundamental to many quantum algorithms. This paper describes such an algorithm\nand gives a proof of its correctness, tightening some claimed performance\nbounds given earlier. Exact bounds are given for the number of qubits needed to\nachieve a desired tolerance, allowing simulation of the algorithm.",
"arxiv_id": "quant-ph/0404060",
"authors": [
"Chris Lomont"
],
"categories": [
"quant-ph",
"cs.DS"
],
"title": "A quantum Fourier transform algorithm",
"url": "https://arxiv.org/abs/quant-ph/0404060"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "fd649d4f-4928-4259-950a-c32504ada7e4",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}