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. This test, known as the quantum verification problem, challenges both types of systems to their limits.
Quantum computers have just passed a test that classical computers fundamentally cannot, according to a new experiment. This test, known as the quantum verification problem, challenges both types of systems to their limits. As the test became more difficult, the performance gap between the quantum system and the best possible classical performance widened significantly, according to the researchers' paper published in Nature Communications.
The experiment, led by computer scientists Marcello Benedetti and Harry Buhrman of Quantinuum in the UK, used a trapped-ion quantum system. As the experiments grew larger and required more quantum operations, hardware noise began to degrade the quantum system's performance. However, the quantum system still consistently outperformed the classical limit, with the observed advantage increasing exponentially with the length of the bit-string.
This result is significant because it verifies the computational power of superposition, a key feature of quantum computers. Unlike classical bits, which can represent information as either a 1 or a 0, quantum bits, or qubits, can exist in a superposition of both states until measured. This superposition allows quantum computers to process information in ways that are far more powerful than classical computers for certain tasks.
The ability to perform these tests is crucial because verifying the results of quantum computations can itself require computations that become prohibitively difficult for classical machines. The researchers set out to test the computational power of superposition, and the results suggest that quantum computers are indeed capable of far greater computational abilities than classical systems.
What's confirmed
What's still developing
- And that's not just because the researchers haven't found a sufficiently clever classical algorithm.
- The experimentally observed advantage increased exponentially with bit-string length, closely tracking, if not quite matching, the behavior expected of the optimal quantum strategy.
- 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.
- 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.