|
|
|
|
|
|
by throwaway81523
329 days ago
|
|
|
It's a theoretical result. There was a problem believed to take exponential time on a classical computer but polynomial time on a quantum computer. It turns out to be solvable in polynomial time on both types of computer, removing the quantum exponential speedup. Whether one polynomial was bigger or smaller than the other wasn't of much interest, as I understand it. The surprise was just that both are polynomials. |
|
|