dorsal/arxiv
View SchemaA precise estimation of the computational complexity in Shor's factoring algorithm
| Authors | K. Kuriyama, S. Sano, S. Furuichi |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0406145 |
| URL | https://arxiv.org/abs/quant-ph/0406145 |
| Journal | Applied Mathematics and Information Science, Vol.1(2007),pp.313-322 |
Abstract
A precise estimation of the computational complexity in Shor's factoring algorithm under the condition that the large integer we want to factorize is composed by the product of two prime numbers, is derived by the results related to number theory. Compared with Shor's original estimation, our estimation shows that one can obtain the solution under such a condition, by less computational complexity.
{
"annotation_id": "43a52ca5-47d5-4c10-b4ed-13df2d173166",
"date_created": "2026-03-02T18:02:10.118000Z",
"date_modified": "2026-03-02T18:02:10.118000Z",
"file_hash": "4273109c3c87a73856c7ac7d7f472bfe7927b11dca6b46a4e66229466bce58c0",
"private": false,
"record": {
"abstract": "A precise estimation of the computational complexity in Shor\u0027s factoring\nalgorithm under the condition that the large integer we want to factorize is\ncomposed by the product of two prime numbers, is derived by the results related\nto number theory. Compared with Shor\u0027s original estimation, our estimation\nshows that one can obtain the solution under such a condition, by less\ncomputational complexity.",
"arxiv_id": "quant-ph/0406145",
"authors": [
"K. Kuriyama",
"S. Sano",
"S. Furuichi"
],
"categories": [
"quant-ph"
],
"journal_ref": "Applied Mathematics and Information Science,\n Vol.1(2007),pp.313-322",
"title": "A precise estimation of the computational complexity in Shor\u0027s factoring algorithm",
"url": "https://arxiv.org/abs/quant-ph/0406145"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "ac18c1d1-0373-4150-bcd9-001593f962eb",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}