Hacker News new | past | comments | ask | show | jobs | submit login

Quantum computers are not faster classical computers. They solve some problems exponentially faster than classical computers. For example we can break RSA keys with a quantum computer because we have a quantum algorithm (Shor's algorithm) to solve this problem.

We do not have many quantum algorithms that solve interesting problems exponentially faster. Finding these algorithms is not an easy task and we do not expect all problems to be solvable this way.

Disclaimer: I'm a researcher in quantum algorithms.




Just to add, nobody expects NP-complete or harder problems (like the MILP example) to get any speedup form quantum computers at all.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: