Get the latest tech news
Quantum Speedup Found for 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.
Just last week, a purported quantum speedup, published in the journal Science, was met with immediate skepticism from two separate groups who showed how to perform similarcalculations on classical machines. Variations of this problem show up in various forms across computer science, especially in error coding and cryptography — fields focused on securely and accurately encoding data as it’s transmitted. The DQI researchers recognized, basically, that plotting a better line is akin to shifting a noisy encoded message closer to its accurate meaning.
Or read this on Hacker News