Re:2025 Turing Award given for Quantum Information Science
by shorden on Wednesday March 18, 2026 @03:50PM
(#47430582)
Worth noting that this is a bound on arbitrary search, but there exist some problems with structure (e.g. integer factorization) for which quantum algorithms are exponentially faster than known classical algorithms (a problem believed to be in NP and BQP but not P).
[ Parent
| on HN ]
There are no comments on this comment yet.