Back to News
quantum-computing

IBM & Chicago Verify Quantum Advantage With New Error Correction

Ivy Delaney
Loading...
4 min read
0 likes
⚡ Quantum Brief
IBM and researchers from The University of Chicago report achieving quantum advantage by completing a complex computation in approximately 15 minutes, a task requiring infeasible time for even the most powerful classical computers. The team encoded 70 logical qubits using a new error correction method, representing one of the largest demonstrations of logical quantum computing to date and enabling verifiable results. “Verification remains one of the biggest challenges in firmly establishing experimental quantum advantage,” said Bill Fefferman, Associate Professor at the University of Chicago. The researchers have openly released their circuits and results on the Quantum Advantage Tracker.
AI Audio Summary
0:00 / 0:00
Click to play
page-006-object-008.webp
Quantum News · Media Library

IBM and researchers from The University of Chicago report achieving quantum advantage by completing a complex computation in approximately 15 minutes, a task requiring infeasible time for even the most powerful classical computers.

The team encoded 70 logical qubits using a new error correction method, representing one of the largest demonstrations of logical quantum computing to date and enabling verifiable results. “Verification remains one of the biggest challenges in firmly establishing experimental quantum advantage,” said Bill Fefferman, Associate Professor at the University of Chicago. The researchers have openly released their circuits and results on the Quantum Advantage Tracker.

Encoded Circuits Achieve Quantum Advantage with 70 Logical Qubits Researchers have demonstrated a quantum computation exceeding the capabilities of the most powerful classical computers, achieving what is known as quantum advantage while simultaneously bolstering confidence in the accuracy of the results. IBM and The University of Chicago report successfully encoding 70 logical qubits, a significant leap in the stability and reliability of quantum information processing, and executing a complex calculation that would be impractical for conventional systems. This achievement moves beyond simply demonstrating a speedup; it addresses the critical need for verifiable quantum computations. The experiment utilized a novel approach to quantum circuit design, allowing the team to perform a computationally challenging task and detect errors during the process. Unlike previous attempts at demonstrating quantum advantage, which relied on benchmarks like random circuit sampling and faced verification hurdles, this new method retains the difficulty of those benchmarks while enabling error detection. The quantum computation itself completed in approximately 15 minutes, a timeframe that would require infeasible computational resources for leading classical methods. This demonstration involved executing 2,415 logical two-qubit operations and 468 logical “T gates”, metrics quantifying the complexity of the quantum circuit. Crucially, the encoded circuit achieved logical error rates ten times lower than the underlying physical error rates, resulting in remarkably high circuit fidelity despite the large number of operations. Jay Gambetta, Director of IBM Research and IBM Fellow, stated that “We are now firmly in the quantum advantage era,” emphasizing the milestone’s importance for scaling quantum computing and building trust in these emerging systems. Verification remains one of the biggest challenges in firmly establishing experimental quantum advantage,” said Bill Fefferman, Associate Professor at the University of Chicago. Bill Fefferman, Associate Professor at the University of Chicago Source: https://www.prnewswire.com/news-releases/ibm-and-the-university-of-chicago-demonstrate-quantum-advantage-establishing-trusted-quantum-computation-on-logical-circuits-302838890.html Stay currentSee today’s quantum computing news on Quantum Zeitgeist for the latest breakthroughs in qubits, hardware, algorithms, and industry deals. Tags: Ivy Delaney Ivy Delaney has been working with neural networks and machine learning since the mid-nineties, back when a couple of hidden layers and a long afternoon of training counted as ambitious. She has watched the field go from academic curiosity to the thing quietly running underneath everything, and she brings that long view to quantum computing.

For Quantum Zeitgeist she covers the ground where the two fields meet. That means quantum machine learning and the variational algorithms it leans on, and it also means the less glamorous but more interesting story of classical machine learning already doing real work inside quantum machines, decoding error-correcting codes, calibrating noisy hardware and learning the error models that simulators depend on. She writes about the hardware those algorithms have to run on too, and about the post-quantum cryptography scramble that the same hardware has set off. Her stories typically start with the paper, whether that is peer-reviewed work, conference proceedings or an arXiv preprint, with the source linked so you can hold a claim up against the research it came from. She is unimpressed by benchmarks that will not say what they beat, and by demonstrations that only work in the press release. Latest Posts by Ivy Delaney: Kalman Filter Reduces Magnetic Field Drift in Quantum Gas Experiments August 1, 2026 NRL’s Quantum Science Institute Coordinates Navy’s QIST Research August 1, 2026 Picosecond-Level Precision Validates QTREX Quantum Platform July 31, 2026

Read Original

Tags

quantum-computing
quantum-hardware
quantum-advantage

Source Information

Source: Quantum Zeitgeist

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.