Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.11658

Error-Corrected Memory and Logic on a Heavy-Hex Superconducting-Qubit Processor

Campbell K. McLauchlan, Georgia M. Nixon, Julien M. Drouet, Xanda C. Kolesnikow, Seok-Hyung Lee, James Raftery, Karthik Siva, Stephen D. Bartlett, Benjamin J. Brown, Robin Harper

quant-phSubmitted Oct 8, 2026• Announced Oct 9, 2026• 1 citation
arXivHTMLPDF

Abstract

Large quantum computations require high-fidelity error-corrected memory and fault-tolerant logical operations. To achieve these with superconducting circuits, quantum processors will need many components operating with low error rates. In practice, fabrication of monolithic superconducting devices produces unavoidable heterogeneity in component performance, which the quantum computer must accommodate. We implement strategies to operate a large dynamic compass code on an array of 156 superconducting qubits arranged on a heavy-hexagonal lattice, making use of the entire monolithic quantum processor and redesigning our measurement schedule to exclude underperforming components. We demonstrate improvements of up to $35\%$ in logical error probabilities for a memory experiment by using a noise-informed decoder combined with strategies to exclude the worst-performing qubits and couplers, along with post-selecting on shots with a low probability of leakage errors. In addition to these memory results, we also observe performance gains of up to $56\%$ when these strategies are applied to measurement-based logic, demonstrated by stability experiments. We furthermore demonstrate high-fidelity fault-tolerant logic through lattice surgery. Through pre-selection filtering techniques, we can obtain Bell fidelities above $77\%$, and further logical gap post-selection using exclusive decoding increases these fidelities to above $97\%$. Our experiments demonstrate that high performance can be maintained in key elements of fault-tolerant quantum memory and logic when working on monolithic superconducting quantum processors with underperforming components, by using a suite of noise-informed quantum error correction strategies.

AI Summary

The paper studies how heterogeneous component quality and leakage affect error-corrected memory and measurement-based logic on a 156-qubit heavy-hex superconducting processor. It implements dynamic compass codes with measurement schedules redesigned to exclude defective qubits and couplers, combining these with ACES circuit-specific noise characterization, BeliefMatching decoding, measurement soft information, and leakage filtering. Performance is assessed through memory decay, stability experiments, and lattice-surgery Bell-state preparation. For a full-device $7\times7$ memory patch, the combined strategies yield logical error probabilities per measurement round of $4.11\%$ in $Z$ and $2.56\%$ in $X$, reductions of $32.3\%$ and $35.2\%$ relative to the reported-noise baseline. The best unpostselected results are $4.4\%$ and $2.9\%$. Defect exclusion reduces both code distances from seven to five. The resulting patch approximately matches average $5\times5$ performance, but average $3\times3$ patches still perform better. In $5\times5$ stability experiments, defect exclusion extends observed error suppression to 30 measurement rounds; without it, performance plateaus around 12 rounds. Combined improvements reduce failure probability by up to $56\%$. Lattice surgery gives unfiltered Bell-fidelity bounds of $58.6\%$–$73.5\%$ for two $3\times3$ patches. Pre-selection raises the lower bound to $77.3\%$ while retaining $13.3\%$ of attempts; additional logical-gap filtering raises it above $97.6\%$ at $27\%$ relative yield, approximately $3.6\%$ overall. The processor lacks mid-circuit reset, leakage is filtered rather than actively removed, and fidelity estimates use two correlators rather than full tomography. The applicability of observed soft-information benefits beyond these experiments remains unresolved.

Little sign of AI-generated textOverclaims

Central claim may not hold: The reported post-selected Bell-fidelity bounds combine correlators accepted using different readout-dependent decoding filters without establishing a common selected logical-state ensemble, so the claimed >97% Bell fidelity is not rigorously supported by those conditional correlations alone.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
28 pages, 20 figures, 5 tables

Related papers

Scalable quantum error correction tailored for a heavy-hex qubit array

Seok-Hyung Lee, Xanda C. Kolesnikow, Jun Zen +7 more

To produce an operable quantum computer that is made with imperfect hardware, we must design and test scalable quantum error correcting codes that are suited for the devices we can build and, in unison, develop decoding strategies that accommodate device-specific noise characteristics. Here, we introduce the \emph{dynamic compass code}, a subsystem code with a novel syndrome extraction cycle, that has a competitive threshold while making efficient use of qubits arranged on a heavy-hex lattice. We use a superconducting qubit array to implement a distance-5 instance of this code, and demonstrate how detailed noise characterisation can boost decoder performance to yield significant improvements in logical error rates. We perform averaged circuit eigenvalue sampling (ACES) to acquire detailed context-dependent error information on all elements of the syndrome extraction process. Furthermore, we leverage soft information produced from measurement devices to augment the decoder with measurement error information and detect leakage errors for exclusion through post-selection. Our noise-informed approach yields up to 38.3\% improvement in the logical error rate of a distance-5 implementation of the dynamic compass code in experiment.

quant-pharXiv:2604.14296•Apr 17, 2026•8 citations

Error correction on an array of superconducting qubits with defective components

Julien M. Drouet, Xanda C. Kolesnikow, Campbell K. McLauchlan +6 more

A solid-state quantum-computing architecture will require the fabrication of arrays of many coupled qubits. It is inevitable that this process will produce qubits and couplers with varying performance, with some components underperforming due to imperfect fabrication. Quantum error-correction requires high-performing components and hence these defects must be dealt with, either by adapting the code to exclude the defects, or by informing the decoder to accommodate defects in post-processing. Here we implement and compare strategies to operate distance-5 surface codes on a quantum processor consisting of a square-lattice array of 120 superconducting qubits. We demonstrate a dramatic reduction in the probability of a logical error in a memory experiment by excluding underperforming components, compared with both a standard approach of ignoring defects, and a defect-aware decoding approach. We observe up to 2.8X improvement in logical errors per round when excluding defects compared with the standard defect-ignorant approach (1.62% compared to 4.49%). In contrast, defect-aware decoding gives only modest gains. Defects are also expected to be particularly harmful for measurement-based logical operations. Using a stability experiment we show that excluding defects resurrects measurement-based logic gate performance, observing a 6.3% per-round suppression of failure rate when excluding defects, compared to zero suppression otherwise. Furthermore, we show a further substantial decrease in logical errors when using leakage post-selection in combination with our defect exclusion strategies, resulting in a distance-5 code outperforming the best distance-3 in one basis. Our experiments therefore give a proof-of-principle demonstration of the essential utility of defect exclusion methods in the scale-up of solid-state quantum computing approaches.

quant-pharXiv:2607.12118•Jul 15, 2026•10 citations

Low-valency scalable quantum error correction with a dynamic compass code

Jun Zen, Xanda C. Kolesnikow, Campbell K. McLauchlan +6 more

The ongoing development of hardware that is capable of reliably executing general quantum algorithms requires quantum error-correcting codes that are both practical for realisation and rapidly reduce logical error rates as they are scaled up. Here we introduce the dynamic compass code, a code that can be implemented with a modest footprint on the heavy-hex lattice while also demonstrating a threshold. The dynamic code is obtained by choosing a novel measurement schedule for the syndrome extraction circuit of the heavy-hex subsystem code. We numerically evaluate its performance and observe that different choices of schedule can provide a trade-off in protection against logical errors in the $X$ vs $Z$ basis. We also demonstrate that this new measurement schedule provides the code with a threshold for stability experiments. We finally show how the dynamic compass code could be used for fault-tolerant logic by illustrating lattice surgery between code patches.

quant-pharXiv:2604.14299•Apr 17, 2026•5 citations

Entangled logical qubits on a superconducting quantum processor

Robin Harper, Xanda C. Kolesnikow, Campbell K. McLauchlan +3 more

We demonstrate high-fidelity logical qubit operations using \texttt{ibm\_phoenix}, a square-lattice array of 120 coupled superconducting qubits that are capable of fast reset. Using strategies to exclude underperforming components together with noise informed decoding, we routinely produce surface codes at distance-3 and distance-5 with logical error per round below 1\%. We demonstrate entanglement between two logical qubits, where logical Bell-state fidelities above 93\% are observed for entanglement created via lattice surgery. With three logical qubits and lattice surgery, we perform logical teleportation of a range of states and gates, observing fidelities in the range 78\% - 93\%. Using reset to reduce qubit leakage, we show that repeated rounds of stabilizer measurements continue to exhibit improvements in a stability experiment up to $\sim 2\cdot 10^{-7}$ over 170 measurement rounds.

quant-pharXiv:2610.32347•Oct 26, 2026•0 citations

Characterising the failure mechanisms of error-corrected quantum logic gates

Robin Harper, C. Lainé, Evan T. Hockings +4 more

Mid-circuit measurements used in quantum error correction are essential in the architecture of a fault-tolerant quantum computer, as they read out syndrome data and drive logic gates. Here, we use a heavy-hex code prepared on a superconducting qubit array to investigate how different noise sources impact error-corrected logic. First, we identify that idling errors occurring during readout periods are highly detrimental to a quantum memory. We demonstrate significant improvements to the memory by designing and implementing a low-depth syndrome extraction circuit. Second, we perform a stability experiment to investigate the type of failures that can occur during logic gates due to readout assignment errors. We find that the error rate of the stability experiment improves with additional stabilizer readout cycles, revealing a trade-off as additional stability comes at the expense of time over which the memory can decay. We corroborate our results using holistic device benchmarking and by comparison to numerical simulations. Finally, by varying different parameters in our simulations we identify the key noise sources that impact the fidelity of fault-tolerant logic gates, with measurement noise playing a dominant role in logical gate performance. With rapid progress in quantum error correction, clear performance benchmarks are needed to assess readiness for fault tolerant operation. Here the authors report benchmarking and noise characterization in a superconducting quantum processor, identifying key factors that impact error-corrected logic.

arXiv:2504.07258•Nature Communications•Apr 10, 2026•20 citations

Echo Cross Resonance gate error budgeting on a superconducting quantum processor

Travers Ward, Russell P. Rundle, Richard Bounds +9 more

High fidelity quantum operations are key to enabling fault-tolerant quantum computation. Superconducting quantum processors have demonstrated high-fidelity operations, but on larger devices there is commonly a broad distribution of qualities, with the low-performing tail affecting near-term performance and applications. Here we present an error budgeting procedure for the native two-qubit operation on a 32-qubit superconducting-qubit-based quantum computer, the OQC Toshiko gen-1 system. We estimate the prevalence of different forms of error such as coherent error and control qubit leakage, then apply error suppression strategies based on the most significant sources of error, making use of pulse-shaping and additional compensating gates. These techniques require no additional hardware overhead and little additional calibration, making them suitable for routine adoption. An average reduction of 3.7x in error rate for two qubit operations is shown across a chain of 16 qubits, with the median error rate improving from 4.6$\%$ to 1.2$\%$ as measured by interleaved randomized benchmarking. The largest improvements are seen on previously under-performing qubit pairs, demonstrating the importance of practical error suppression in reducing the low-performing tail of gate qualities and achieving consistently good performance across a device.

quant-pharXiv:2601.20458•Jan 29, 2026•5 citations
Large quantum computations require high-fidelity error-corrected memory and fault-tolerant logical operations. To achieve these with superconducting circuits, quantum processors will need many components operating with low error rates. In practice, fabrication of monolithic superconducting devices produces unavoidable heterogeneity in component performance, which the quantum computer must accommodate. We implement strategies to operate a large dynamic compass code on an array of 156 superconducting qubits arranged on a heavy-hexagonal lattice, making use of the entire monolithic quantum processor and redesigning our measurement schedule to exclude underperforming components. We demonstrate improvements of up to 35%35\%35% in logical error probabilities for a memory experiment by using a noise-informed decoder combined with strategies to exclude the worst-performing qubits and couplers, along with post-selecting on shots with a low probability of leakage errors. In addition to these memory results, we also observe performance gains of up to 56%56\%56% when these strategies are applied to measurement-based logic, demonstrated by stability experiments. We furthermore demonstrate high-fidelity fault-tolerant logic through lattice surgery. Through pre-selection filtering techniques, we can obtain Bell fidelities above 77%77\%77%, and further logical gap post-selection using exclusive decoding increases these fidelities to above 97%97\%97%. Our experiments demonstrate that high performance can be maintained in key elements of fault-tolerant quantum memory and logic when working on monolithic superconducting quantum processors with underperforming components, by using a suite of noise-informed quantum error correction strategies.
The paper studies how heterogeneous component quality and leakage affect error-corrected memory and measurement-based logic on a 156-qubit heavy-hex superconducting processor. It implements dynamic compass codes with measurement schedules redesigned to exclude defective qubits and couplers, combining these with ACES circuit-specific noise characterization, BeliefMatching decoding, measurement soft information, and leakage filtering. Performance is assessed through memory decay, stability experiments, and lattice-surgery Bell-state preparation.
For a full-device 7×77\times77×7 memory patch, the combined strategies yield logical error probabilities per measurement round of 4.11%4.11\%4.11% in ZZZ and 2.56%2.56\%2.56% in XXX, reductions of 32.3%32.3\%32.3% and 35.2%35.2\%35.2% relative to the reported-noise baseline. The best unpostselected results are 4.4%4.4\%4.4% and 2.9%2.9\%2.9%. Defect exclusion reduces both code distances from seven to five. The resulting patch approximately matches average 5×55\times55×5 performance, but average 3×33\times33×3 patches still perform better.
In 5×55\times55×5 stability experiments, defect exclusion extends observed error suppression to 30 measurement rounds; without it, performance plateaus around 12 rounds. Combined improvements reduce failure probability by up to 56%56\%56%. Lattice surgery gives unfiltered Bell-fidelity bounds of 58.6%58.6\%58.6%–73.5%73.5\%73.5% for two 3×33\times33×3 patches. Pre-selection raises the lower bound to 77.3%77.3\%77.3% while retaining 13.3%13.3\%13.3% of attempts; additional logical-gap filtering raises it above 97.6%97.6\%97.6% at 27%27\%27% relative yield, approximately 3.6%3.6\%3.6% overall.
The processor lacks mid-circuit reset, leakage is filtered rather than actively removed, and fidelity estimates use two correlators rather than full tomography. The applicability of observed soft-information benefits beyond these experiments remains unresolved.
To produce an operable quantum computer that is made with imperfect hardware, we must design and test scalable quantum error correcting codes that are suited for the devices we can build and, in unison, develop decoding strategies that accommodate device-specific noise characteristics. Here, we introduce the \emph{dynamic compass code}, a subsystem code with a novel syndrome extraction cycle, that has a competitive threshold while making efficient use of qubits arranged on a heavy-hex lattice. We use a superconducting qubit array to implement a distance-5 instance of this code, and demonstrate how detailed noise characterisation can boost decoder performance to yield significant improvements in logical error rates. We perform averaged circuit eigenvalue sampling (ACES) to acquire detailed context-dependent error information on all elements of the syndrome extraction process. Furthermore, we leverage soft information produced from measurement devices to augment the decoder with measurement error information and detect leakage errors for exclusion through post-selection. Our noise-informed approach yields up to 38.3\% improvement in the logical error rate of a distance-5 implementation of the dynamic compass code in experiment.
A solid-state quantum-computing architecture will require the fabrication of arrays of many coupled qubits. It is inevitable that this process will produce qubits and couplers with varying performance, with some components underperforming due to imperfect fabrication. Quantum error-correction requires high-performing components and hence these defects must be dealt with, either by adapting the code to exclude the defects, or by informing the decoder to accommodate defects in post-processing. Here we implement and compare strategies to operate distance-5 surface codes on a quantum processor consisting of a square-lattice array of 120 superconducting qubits. We demonstrate a dramatic reduction in the probability of a logical error in a memory experiment by excluding underperforming components, compared with both a standard approach of ignoring defects, and a defect-aware decoding approach. We observe up to 2.8X improvement in logical errors per round when excluding defects compared with the standard defect-ignorant approach (1.62% compared to 4.49%). In contrast, defect-aware decoding gives only modest gains. Defects are also expected to be particularly harmful for measurement-based logical operations. Using a stability experiment we show that excluding defects resurrects measurement-based logic gate performance, observing a 6.3% per-round suppression of failure rate when excluding defects, compared to zero suppression otherwise. Furthermore, we show a further substantial decrease in logical errors when using leakage post-selection in combination with our defect exclusion strategies, resulting in a distance-5 code outperforming the best distance-3 in one basis. Our experiments therefore give a proof-of-principle demonstration of the essential utility of defect exclusion methods in the scale-up of solid-state quantum computing approaches.
The ongoing development of hardware that is capable of reliably executing general quantum algorithms requires quantum error-correcting codes that are both practical for realisation and rapidly reduce logical error rates as they are scaled up. Here we introduce the dynamic compass code, a code that can be implemented with a modest footprint on the heavy-hex lattice while also demonstrating a threshold. The dynamic code is obtained by choosing a novel measurement schedule for the syndrome extraction circuit of the heavy-hex subsystem code. We numerically evaluate its performance and observe that different choices of schedule can provide a trade-off in protection against logical errors in the XXX vs ZZZ basis. We also demonstrate that this new measurement schedule provides the code with a threshold for stability experiments. We finally show how the dynamic compass code could be used for fault-tolerant logic by illustrating lattice surgery between code patches.
We demonstrate high-fidelity logical qubit operations using \texttt{ibm\_phoenix}, a square-lattice array of 120 coupled superconducting qubits that are capable of fast reset. Using strategies to exclude underperforming components together with noise informed decoding, we routinely produce surface codes at distance-3 and distance-5 with logical error per round below 1\%. We demonstrate entanglement between two logical qubits, where logical Bell-state fidelities above 93\% are observed for entanglement created via lattice surgery. With three logical qubits and lattice surgery, we perform logical teleportation of a range of states and gates, observing fidelities in the range 78\% - 93\%. Using reset to reduce qubit leakage, we show that repeated rounds of stabilizer measurements continue to exhibit improvements in a stability experiment up to ∼2⋅10−7\sim 2\cdot 10^{-7}∼2⋅10−7 over 170 measurement rounds.
Mid-circuit measurements used in quantum error correction are essential in the architecture of a fault-tolerant quantum computer, as they read out syndrome data and drive logic gates. Here, we use a heavy-hex code prepared on a superconducting qubit array to investigate how different noise sources impact error-corrected logic. First, we identify that idling errors occurring during readout periods are highly detrimental to a quantum memory. We demonstrate significant improvements to the memory by designing and implementing a low-depth syndrome extraction circuit. Second, we perform a stability experiment to investigate the type of failures that can occur during logic gates due to readout assignment errors. We find that the error rate of the stability experiment improves with additional stabilizer readout cycles, revealing a trade-off as additional stability comes at the expense of time over which the memory can decay. We corroborate our results using holistic device benchmarking and by comparison to numerical simulations. Finally, by varying different parameters in our simulations we identify the key noise sources that impact the fidelity of fault-tolerant logic gates, with measurement noise playing a dominant role in logical gate performance. With rapid progress in quantum error correction, clear performance benchmarks are needed to assess readiness for fault tolerant operation. Here the authors report benchmarking and noise characterization in a superconducting quantum processor, identifying key factors that impact error-corrected logic.
High fidelity quantum operations are key to enabling fault-tolerant quantum computation. Superconducting quantum processors have demonstrated high-fidelity operations, but on larger devices there is commonly a broad distribution of qualities, with the low-performing tail affecting near-term performance and applications. Here we present an error budgeting procedure for the native two-qubit operation on a 32-qubit superconducting-qubit-based quantum computer, the OQC Toshiko gen-1 system. We estimate the prevalence of different forms of error such as coherent error and control qubit leakage, then apply error suppression strategies based on the most significant sources of error, making use of pulse-shaping and additional compensating gates. These techniques require no additional hardware overhead and little additional calibration, making them suitable for routine adoption. An average reduction of 3.7x in error rate for two qubit operations is shown across a chain of 16 qubits, with the median error rate improving from 4.6%\%% to 1.2%\%% as measured by interleaved randomized benchmarking. The largest improvements are seen on previously under-performing qubit pairs, demonstrating the importance of practical error suppression in reducing the low-performing tail of gate qualities and achieving consistently good performance across a device.