-   Math (
-   -   Shor's Algorithm (

flouran 2009-10-24 23:53

Shor's Algorithm
Shor's algorithm can be sub-divided into two parts, namely, a "classical" and "quantum" part (see Algorithm 8.5.2 of Crandall & Pomerance or, unfortunately, [URL="'s_Algorithm#Procedure"]the Wikipedia article[/URL]).

I had the following question:

Would an improvement (such as an optimized method of division, multiplication, addition, and/or subtraction) to the "classical part" of Shor's algorithm result in a somewhat significant improvement to the algorithm as a whole? Or is the "classical part" of Shor's algorithm rather insignificant compared to the "quantum part"?

retina 2009-10-25 01:24

In comparison, the "classical part" is trivial.

flouran 2009-10-25 02:10

Thank you kindly, retina!

Enjoy your evil lair :smile:

Dougy 2009-10-27 09:31

Curious, Shor is also interested in problems regarding [URL=""]Latin squares[/URL].

All times are UTC. The time now is 17:05.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.