dorsal/arxiv
View SchemaA Refinement of Shor's Algorithm
| Authors | David McAnally |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0112055 |
| URL | https://arxiv.org/abs/quant-ph/0112055 |
Abstract
A refinement of Shor's Algorithm for determining order is introduced, which determines a divisor of the order after any one run of a quantum computer with almost absolute certainty. The information garnered from each run is accumulated to determine the order, and for any k greater than 1, there is a guaranteed minimum positive probability that the order will be determined after at most k runs. The probability of determination of the order after at most k runs exponentially approaches a value negligibly less than one, so that the accumulated information determines the order with almost absolute certainty. The probability of determining the order after at most two runs is more than 60%, and the probability of determining the order after at most four runs is more than 90%.
{
"annotation_id": "df8eb7e8-19bf-46ac-9597-82cb1b1d7e42",
"date_created": "2026-03-02T18:01:49.012000Z",
"date_modified": "2026-03-02T18:01:49.012000Z",
"file_hash": "00db184704c30cac7c8c31c5003aed0094665d5bcbe87c90b4609a2fee69a1e8",
"private": false,
"record": {
"abstract": "A refinement of Shor\u0027s Algorithm for determining order is introduced, which\ndetermines a divisor of the order after any one run of a quantum computer with\nalmost absolute certainty. The information garnered from each run is\naccumulated to determine the order, and for any k greater than 1, there is a\nguaranteed minimum positive probability that the order will be determined after\nat most k runs. The probability of determination of the order after at most k\nruns exponentially approaches a value negligibly less than one, so that the\naccumulated information determines the order with almost absolute certainty.\nThe probability of determining the order after at most two runs is more than\n60%, and the probability of determining the order after at most four runs is\nmore than 90%.",
"arxiv_id": "quant-ph/0112055",
"authors": [
"David McAnally"
],
"categories": [
"quant-ph"
],
"title": "A Refinement of Shor\u0027s Algorithm",
"url": "https://arxiv.org/abs/quant-ph/0112055"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "08eac875-4895-439f-b9c2-6aa43235aa9f",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}