|
| related topics |
| {qubit, qubits, gate} |
| {error, code, errors} |
| {algorithm, log, probability} |
| {state, algorithm, problem} |
| {time, wave, function} |
| {classical, space, random} |
| {time, decoherence, evolution} |
| {temperature, thermal, energy} |
| {state, phys, rev} |
| {spin, pulse, spins} |
|
Robustness of Shor's algorithm
Simon J. Devitt, Austin G. Fowler, Lloyd C. L. Hollenberg
abstract: Shor's factorisation algorithm is a combination of classical pre- and
post-processing and a quantum period finding (QPF) subroutine which allows an
exponential speed up over classical factoring algorithms. We consider the
stability of this subroutine when exposed to a discrete error model that acts
to perturb the computational trajectory of a quantum computer. Through detailed
state vector simulations of an appropriate quantum circuit, we show that the
error locations within the circuit itself heavily influences the probability of
success of the QPF subroutine. The results also indicate that the naive
estimate of required component precision is too conservative.
- oai_identifier:
- oai:arXiv.org:quant-ph/0408081
- categories:
- quant-ph
- comments:
- 14 Pages, 14 Figures (LaTeX):
- arxiv_id:
- quant-ph/0408081
- journal_ref:
- Quant. Inf. Comp. 6, 616-629 (2006)
- created:
- 2004-08-12
- updated:
- 2006-01-09
Full article ▸
|
|
| related documents |
| 9605013v1 |
| 0610105v1 |
| 0109016v2 |
| 9505011v1 |
| 0504197v1 |
| 0305134v1 |
| 0304078v1 |
| 0308167v1 |
| 0511041v1 |
| 0411058v1 |
| 9909082v1 |
| 0012067v1 |
| 0505122v2 |
| 0512058v3 |
| 0304054v2 |
| 0305038v2 |
| 9908074v5 |
| 0610214v3 |
| 0405157v2 |
| 9903101v2 |
| 9803072v1 |
| 0601183v1 |
| 0506062v2 |
| 0211014v1 |
| 0505009v4 |
|