Robustness of Shor's algorithm

Authors:
Simon J. Devitt;Austin G. Fowler;Lloyd C. L. Hollenberg
Affiliations:
Centre for Quantum Computer Technology, School of Physics, University of Melbourne, Melbourne, Victoria, Australia;Centre for Quantum Computer Technology, School of Physics, University of Melbourne, Melbourne, Victoria, Australia;Centre for Quantum Computer Technology, School of Physics, University of Melbourne, Melbourne, Victoria, Australia
Venue:
Quantum Information & Computation
Year:
2006

Citing 4
Cited 0

Nonlocal Properties of Two-Qubit Gates and Mixed States, and the Optimization of Quantum Computations

Quantum Information Processing
Fault-tolerant quantum computation

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Quantum Computation and Quantum Information: 10th Anniversary Edition

Quantum Computation and Quantum Information: 10th Anniversary Edition
Graph-based simulation of quantum computation in the density matrix representation

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

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.