|
2009-10-24, 23:53
|
#1 |
Dec 2008
72×17 Posts |
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, 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"? |
|
|
|
2009-10-25, 01:24
|
#2 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2·19·163 Posts |
In comparison, the "classical part" is trivial.
Last fiddled with by retina on 2009-10-25 at 01:27 |
|
|
|
2009-10-25, 02:10
|
#3 |
|
Dec 2008
72·17 Posts |
Thank you kindly, retina!
Enjoy your evil lair 
|
|
|
|
|
2009-10-27, 09:31
|
#4 |
Aug 2004
Melbourne, Australia
23·19 Posts |
Curious, Shor is also interested in problems regarding Latin squares.
|
|
|
|
 |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| TF algorithm(s) | davieddy | Miscellaneous Math | 61 | 2011-07-06 20:13 |
| Quantum Computers and Shor | davieddy | Science & Technology | 6 | 2010-11-16 21:22 |
| Shor's Factoring Algorithm - does it even work? | Citrix | Factoring | 37 | 2008-08-16 14:19 |
| Maybe new sieving algorithm | nuggetprime | Riesel Prime Search | 5 | 2007-04-20 04:19 |
| Prime95's FFT Algorithm | Angular | Math | 6 | 2002-09-26 00:13 |
