dorsal/arxiv
View SchemaAn approximate Fourier transform useful in quantum factoring
| Authors | D. Coppersmith |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0201067 |
| URL | https://arxiv.org/abs/quant-ph/0201067 |
Abstract
We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is currently under investigation by Peter Shor. (1994 IBM Internal Report)
{
"annotation_id": "f8c05cdd-8905-49b2-b228-8a5b2ec7be0b",
"date_created": "2026-03-02T18:01:49.578000Z",
"date_modified": "2026-03-02T18:01:49.578000Z",
"file_hash": "07ec55225de13870d41fa002f3f44726238abe78d25eac7c498faa34bd9be1b8",
"private": false,
"record": {
"abstract": "We define an approximate version of the Fourier transform on $2^L$ elements,\nwhich is computationally attractive in a certain setting, and which may find\napplication to the problem of factoring integers with a quantum computer as is\ncurrently under investigation by Peter Shor. (1994 IBM Internal Report)",
"arxiv_id": "quant-ph/0201067",
"authors": [
"D. Coppersmith"
],
"categories": [
"quant-ph"
],
"title": "An approximate Fourier transform useful in quantum factoring",
"url": "https://arxiv.org/abs/quant-ph/0201067"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "67d3dfbc-7611-4ed9-87e6-03c6258430d6",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}