Home · Science · Sep 7 archive
Quantum Computers Just Passed a Test That Classical Computers Fundamentally Can't
Confirmed
In Short: Quantum computers have just passed a test that classical computers fundamentally cannot, according to a new experiment.
Quantum computers have just passed a test that classical computers fundamentally cannot, according to a new experiment. The test, known as the quantum verification problem, demonstrates the unique computational power of quantum systems, particularly their ability to handle superposition and perform certain tasks exponentially faster than classical counterparts.
As the complexity of the test increased, the performance gap between the quantum system and the best possible classical performance widened significantly, according to the researchers' paper published in Nature Communications. Despite hardware noise degrading the quantum system's performance as the experiments grew larger, it still consistently outperformed classical limits.
The advantage observed in the experiment increased exponentially with the length of the bit-string, closely mirroring the expected behavior of the optimal quantum strategy. This result underscores the computational power derived from the superposition of quantum bits, or qubits, which can exist in multiple states simultaneously until measured.
Quantum computers are supposed to have abilities far beyond conventional ones, but verifying that they actually do is surprisingly difficult. The challenge lies in the fact that checking the results of quantum computations can itself require computations that become prohibitively difficult for classical machines. This new experiment provides a clear demonstration of the quantum system's superior performance in a specific task.
What's confirmed
- And these elements behave according to the laws of quantum mechanics.
- However, unlike in classical mechanics, the double-slit experiment shows that quantum particles behave very differently before and after measurement.
- PQC, or post-quantum cryptography, is now part of the public discourse at numerous tech companies.
What's still developing
- And that's not just because the researchers haven't found a sufficiently clever classical algorithm.
- There's a mathematically proven limit to how well any classical computer can perform.
- And when a team led by computer scientists Marcello Benedetti and Harry Buhrman of Quantinuum in the UK ran it on a trapped-ion quantum system, it sailed right past the limit with ease.
- Quantum computers derive their unusual abilities from the strange physics that governs particles on the smallest scales.
- The mathematical nature of that superposition can be incredibly powerful from a computational standpoint, allowing a quantum computer to make short work of certain problems that are enormously difficult for a conventional computer.
- To intelligently talk about post-quantum cryptography, we must lay down some fundamental principles about quantum computing, which means looking, even superficially, into quantum mechanics.
- Hence, we simply aim to clarify some of the most basic principles in the hope of demystifying post-quantum cryptography.
- Classical computers store and process information using electrical signals, which can be in only two basic states: high or low voltage.