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

Quantum supremacy is not merely about quantum computers performing tasks better than classical computers. It's about quantum computers achieving a superpolynomial speedup over classical computers, such that classical computers can't feasibly perform the task in a reasonable amount of time for all inputs.

That's an important distinction because it's significantly more difficult to achieve a fundamental asymptotic improvement instead of an iterative speedup for the same factor. If a quantum computer completes a task with complexity O(2n) that a classical computer requires O(10n) to complete, you don't have quantum supremacy. If your quantum computer can accomplish a task in O(2n) that your classical computer needs O(2^n) to perform, you've got supremacy.

Given that nuance, I wouldn't say it may be a matter of time before we demonstrate quantum supremacy. There is still an undercurrent of skepticism in the research community.




Applications are open for YC Summer 2019

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

Search: