20世紀の名著名論：Peter Shor : Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

By 今井 浩. 2004

440 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/7f4a99b8bef1d0b0d73d257cc5ecbe15216a4bfd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Scott Aaronson
2. Alexei Y. Arkhipov
3. Greg Kuperberg
4. Louis H. Kauffman
5. Ashley Montanaro
6. Sergey Bravyi
7. Hsin-Yuan Huang
8. John Preskill

Citations in the corpus

• The computational complexity of linear optics (2010, methodology): “However, just like Simon’s oracle algorithm [58] led shortly afterward to Shor’s algorithm [57], so too in this case one could hope to “reify the oracle”: that is, find a real, unrelativized problem with the same behavior that the oracle problem illustrated more abstractly.”
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem (2003, background): “Shor’s algorithm [22] solves HSP when G = Z in polynomial time in the length of the output.”