Timeline for What is the order of a in (Z/nZ)*?
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 29, 2010 at 6:26 | comment | added | Niel de Beaudrap | @Jeremy West: The idea of "parallelism" in quantum computers is derived purely from an extra-scientific interpretation of quantum mechanics (the so-called "many worlds hypothesis"). What is less controvertial, and certainly true regardless of one's opinions on what quantum mechanics 'means', is that quantum computers would be very good at solving certain problems exhibiting periodic structures. "Order finding modulo n" is precisely one such problem, and is the heart of Shor's algorithm. | |
| Oct 29, 2010 at 1:41 | vote | accept | Jeremy West | ||
| Oct 29, 2010 at 1:41 | |||||
| Oct 29, 2010 at 1:18 | comment | added | Jeremy West | As far as I can tell (from the wiki article) Shor's algorithm relies on the parallelism inherent in quantum computing, rather than any particular insight about how the order of a might be related to a and n. Is this accurate? | |
| Oct 29, 2010 at 0:03 | history | answered | wood | CC BY-SA 2.5 |