Robustness of Shor's algorithm

Details Robustness of Shor's algorithm Robustness of Shor's algorithm

2004-08-12

arxiv.org/abs/quant-ph/0408081v5

Quant. Inf. Comp. 6, 616-629 (2006)

Physics

Quantum Physics

14 Pages, 14 Figures (LaTeX):

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Robustness of Shor's algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robustness of Shor's algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robustness of Shor's algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-575650