Quantum Speedup Found for Huge Class of Hard Problems
It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do it for some critical optimization tasks. The post Quantum Speedup Found for Huge Class of Hard Problems first appeared on Quanta Magazine
For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve — akin to identifying a peak to climb — and then they must develop a strategy to solve it. Classical and quantum researchers compete using different strategies, with a healthy rivalry between the two. Quantum researchers report a fast way to solve a problem — often by scaling a peak…
