Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
dave_au
on Nov 22, 2009
|
parent
|
context
|
favorite
| on:
The First Universal Quantum Processor
From what I can remember, Schors algorithm gives you a polynomial speedup for factoring rather than putting it in polynomial time.
It's been a little while since I was up to speed on this though.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
It's been a little while since I was up to speed on this though.