20091024, 23:53  #1 
Dec 2008
1101000001_{2} Posts 
Shor's Algorithm
Shor's algorithm can be subdivided into two parts, namely, a "classical" and "quantum" part (see Algorithm 8.5.2 of Crandall & Pomerance or, unfortunately, the Wikipedia article).
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"? 
20091025, 01:24  #2 
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2×3,343 Posts 
In comparison, the "classical part" is trivial.
Last fiddled with by retina on 20091025 at 01:27 
20091025, 02:10  #3 
Dec 2008
7^{2}×17 Posts 
Thank you kindly, retina!
Enjoy your evil lair 
20091027, 09:31  #4 
Aug 2004
Melbourne, Australia
152_{10} Posts 
Curious, Shor is also interested in problems regarding Latin squares.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
TF algorithm(s)  davieddy  Miscellaneous Math  61  20110706 20:13 
Quantum Computers and Shor  davieddy  Science & Technology  6  20101116 21:22 
Shor's Factoring Algorithm  does it even work?  Citrix  Factoring  37  20080816 14:19 
Maybe new sieving algorithm  nuggetprime  Riesel Prime Search  5  20070420 04:19 
Prime95's FFT Algorithm  Angular  Math  6  20020926 00:13 