A Refinement of Shor's Algorithm
| dc.creator | McAnally, David | |
| dc.date | 2001-12-09 | |
| dc.date | 2002-04-17 | |
| dc.date.accessioned | 2026-07-07T06:03:19Z | |
| dc.date.available | 2026-07-07T06:03:19Z | |
| dc.description | 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%. | |
| dc.description | 45 pages v.2: Change to acknowledgements v.3: Abstract and first paragraph of introduction rewritten v.4: Typographical errors fixed | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0112055 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0112055 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/89897 | |
| dc.subject | Quantum Physics | |
| dc.title | A Refinement of Shor's Algorithm | |
| dc.type | text |