Quantum computer completes verified task beyond practical reach of classical simulations
IBM and researchers from the University of Chicago announced a demonstration in quantum computing that meets the fundamental criteria for "quantum advantage"—the point where quantum computers can be confirmed to have outperformed classical computers on trusted computations.
IBM and researchers from the University of Chicago have demonstrated a quantum computer completing a task that defies practical reach of classical simulations, marking a significant step towards quantum advantage. The team successfully executed 70 logical qubits, 2,415 logical two-qubit operations, and 468 T gates in approximately 15 minutes on an IBM quantum computer.
This accomplishment, detailed in a paper published on the arXiv preprint server, shows that the quantum computation retained the same hardness criteria as random circuit sampling (RCS), a benchmark for testing quantum supremacy. Importantly, the new structure enabled error detection during the computation, providing statistical fidelity bounds where classical simulations face prohibitive runtimes.
This verification breakthrough enhances confidence that the quantum computer is solving a computationally hard problem. By overcoming the verification challenge, the researchers have paved the way for practical applications of quantum computing and established a foundation for trusting quantum computers as they scale to solve far beyond classical capabilities.
Written by urgent.news from Phys.org's reporting — not their text. Machine-written — may contain errors; check the original before relying on it.
