dorsal/arxiv
View SchemaQuantum Computing Discrete Logarithms with the Help of a Preprocessed State
| Authors | Wim van Dam |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0311134 |
| URL | https://arxiv.org/abs/quant-ph/0311134 |
Abstract
An alternative quantum algorithm for the discrete logarithm problem is presented. The algorithm uses two quantum registers and two Fourier transforms whereas Shor's algorithm requires three registers and four Fourier transforms. A crucial ingredient of the algorithm is a quantum state that needs to be constructed before we can perform the computation. After one copy of this state is created, the algorithm can be executed arbitrarily many times.
{
"annotation_id": "e6768fc2-3102-4361-9f63-f0427d1baf42",
"date_created": "2026-03-02T18:02:02.856000Z",
"date_modified": "2026-03-02T18:02:02.856000Z",
"file_hash": "3813ba2db460468c019fc2407a20bcc1edbfa16bc719e00f5630ede1b2cd6a81",
"private": false,
"record": {
"abstract": "An alternative quantum algorithm for the discrete logarithm problem is\npresented. The algorithm uses two quantum registers and two Fourier transforms\nwhereas Shor\u0027s algorithm requires three registers and four Fourier transforms.\nA crucial ingredient of the algorithm is a quantum state that needs to be\nconstructed before we can perform the computation. After one copy of this state\nis created, the algorithm can be executed arbitrarily many times.",
"arxiv_id": "quant-ph/0311134",
"authors": [
"Wim van Dam"
],
"categories": [
"quant-ph"
],
"title": "Quantum Computing Discrete Logarithms with the Help of a Preprocessed State",
"url": "https://arxiv.org/abs/quant-ph/0311134"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "d1cbdc9c-d5b1-4500-b10c-d6db94bc667c",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}