SearcharxivSearch

arXiv · 2511.08493

Reinforcement Learning Control of Quantum Error Correction

Volodymyr Sivak·Alexis Morvan·Michael Broughton·Rodrigo G. Cortiñas·Johannes Bausch·Andrew W. Senior·Matthew Neeley·Alec Eickbusch·Noah Shutty·Laleh Aghababaie Beni·James S. Spencer·Francisco J. H Heras·Thomas Edlich·Dmitry Abanin·Amira Abbas·Rajeev Acharya·Georg Aigeldinger·Ross Alcaraz·Sayra Alcaraz·Trond I. Andersen·Markus Ansmann·Frank Arute·Kunal Arya·Walt Askew·Nikita Astrakhantsev·Juan Atalaya·Brian Ballard·Joseph C. Bardin·Hector Bates·Andreas Bengtsson·Majid Bigdeli Karimi·Alexander Bilmes·Simon Bilodeau·Felix Borjans·Alexandre Bourassa·Jenna Bovaird·Dylan Bowers·Leon Brill·Peter Brooks·David A. Browne·Brett Buchea·Bob B. Buckley·Tim Burger·Brian Burkett·Nicholas Bushnell·Jamal Busnaina·Anthony Cabrera·Juan Campero·Hung-Shen Chang·Silas Chen·Ben Chiaro·Liang-Ying Chih·Agnetta Y. Cleland·Bryan Cochrane·Matt Cockrell·Josh Cogan·Roberto Collins·Paul Conner·Harold Cook·William Courtney·Alexander L. Crook·Ben Curtin·Martin Damyanov·Sayan Das·Dripto M. Debroy·Sean Demura·Paul Donohoe·Ilya Drozdov·Andrew Dunsworth·Valerie Ehimhen·Aviv Moshe Elbag·Lior Ella·Mahmoud Elzouka·David Enriquez·Catherine Erickson·Vinicius S. Ferreira·Marcos Flores·Leslie Flores Burgos·Ebrahim Forati·Jeremiah Ford·Austin G. Fowler·Brooks Foxen·Masaya Fukami·Alan Wing Lun Fung·Lenny Fuste·Suhas Ganjam·Gonzalo Garcia·Christopher Garrick·Robert Gasca·Helge Gehring·Robert Geiger·Élie Genois·William Giang·Dar Gilboa·James E. Goeders·Edward C. Gonzales·Raja Gosula·Stijn J. de Graaf·Alejandro Grajales Dau·Dietrich Graumann

Abstract

Quantum error correction (QEC) is the primary strategy for protecting a quantum computer from the environment. Its prerequisite is that errors must remain sufficiently rare, which requires perpetually adapting the computer's control parameters to the drifting environment conditions. The current solution to this problem is to terminate the entire quantum computation for recalibration, but it is incompatible with the long runtimes of future quantum algorithms. We address this challenge by unifying calibration with computation. We grant the QEC process a dual role: its error detection events are not only used to correct the logical quantum state, but are also repurposed as a learning signal, teaching a reinforcement learning (RL) agent to continuously steer the control parameters and stabilize the quantum system during computation. We experimentally demonstrate this framework on a Willow superconducting processor, improving the logical stability of the surface code 3.5-fold against injected drift. By synthesizing our full suite of technological advances, we achieve record performance of the surface and color codes, with average logical error per cycle of $7.72(9)\times10^{-4}$ and $8.19(14)\times10^{-3}$ respectively. Numerical simulations of large codes with tens of thousands of control parameters confirm the scalability of our RL framework, revealing an optimization speed that is independent of system size. This work thus enables a new paradigm: a quantum computer that learns from its errors and never stops computing.

Explore related subjects

Keep this discovery

BibTeXRIS

Volodymyr Sivak, Alexis Morvan, Michael Broughton, Rodrigo G. Cortiñas, Johannes Bausch, Andrew W. Senior, Matthew Neeley, Alec Eickbusch, Noah Shutty, Laleh Aghababaie Beni, James S. Spencer, Francisco J. H Heras, Thomas Edlich, Dmitry Abanin, Amira Abbas, Rajeev Acharya, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Nikita Astrakhantsev, Juan Atalaya, Brian Ballard, Joseph C. Bardin, Hector Bates, Andreas Bengtsson, Majid Bigdeli Karimi, Alexander Bilmes, Simon Bilodeau, Felix Borjans, Alexandre Bourassa, Jenna Bovaird, Dylan Bowers, Leon Brill, Peter Brooks, David A. Browne, Brett Buchea, Bob B. Buckley, Tim Burger, Brian Burkett, Nicholas Bushnell, Jamal Busnaina, Anthony Cabrera, Juan Campero, Hung-Shen Chang, Silas Chen, Ben Chiaro, Liang-Ying Chih, Agnetta Y. Cleland, Bryan Cochrane, Matt Cockrell, Josh Cogan, Roberto Collins, Paul Conner, Harold Cook, William Courtney, Alexander L. Crook, Ben Curtin, Martin Damyanov, Sayan Das, Dripto M. Debroy, Sean Demura, Paul Donohoe, Ilya Drozdov, Andrew Dunsworth, Valerie Ehimhen, Aviv Moshe Elbag, Lior Ella, Mahmoud Elzouka, David Enriquez, Catherine Erickson, Vinicius S. Ferreira, Marcos Flores, Leslie Flores Burgos, Ebrahim Forati, Jeremiah Ford, Austin G. Fowler, Brooks Foxen, Masaya Fukami, Alan Wing Lun Fung, Lenny Fuste, Suhas Ganjam, Gonzalo Garcia, Christopher Garrick, Robert Gasca, Helge Gehring, Robert Geiger, Élie Genois, William Giang, Dar Gilboa, James E. Goeders, Edward C. Gonzales, Raja Gosula, Stijn J. de Graaf, Alejandro Grajales Dau, Dietrich Graumann. 2025-11-11. Reinforcement Learning Control of Quantum Error Correction. https://arxiv.org/abs/2511.08493

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph