Error correction on an array of superconducting qubits with defective components
- URL: http://arxiv.org/abs/2607.12118v1
- Date: Mon, 13 Jul 2026 19:53:50 GMT
- Title: Error correction on an array of superconducting qubits with defective components
- Abstract summary: 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.<n>We demonstrate a dramatic reduction in the probability of a logical error in a memory experiment by excluding underperforming components.
- Score: 1.1235145048383497
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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.
Related papers
- Error Correction of Beamsplitter-Generated Entangled GKP States [56.80803785296797]
A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code.<n>We generate entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter.<n>We generate all four Bell states with an average fidelity of 69%, and demonstrate an extension of the entangled state lifetime through the use of quantum error correction.
arXiv Detail & Related papers (2026-05-08T17:01:19Z) - A biased-erasure cavity qubit with hardware-efficient quantum error detection [19.031335768368475]
Erasure qubits are beneficial for quantum error correction due to their relaxed threshold requirements.<n>We realize a hardware-efficient biased-erasure qubit encoded in the vacuum and two-photon Fock states of a single microwave cavity.
arXiv Detail & Related papers (2026-01-29T12:19:59Z) - Echo Cross Resonance gate error budgeting on a superconducting quantum processor [0.0]
We present an error budgeting procedure for the native two-qubit operation on a 32-qubit superconducting-qubit-based quantum computer.<n>An average reduction of 3.7x in error rate for two qubit operations is shown across a chain of 16 qubits.<n>The largest improvements are seen on previously under-performing qubit pairs.
arXiv Detail & Related papers (2026-01-28T10:31:35Z) - Fault-Tolerant Quantum Error Correction: Implementing Hamming-Based Codes with Advanced Syndrome Extraction Techniques [0.0]
We show that intelligent ancilla management improves error suppression by up to 2.4$times$ compared to standard approaches.<n>Our implementations achieve logical error rates as low as $5.1 times 10-5$ under realistic noise conditions.<n>These results provide immediately deployable tools for near-term quantum devices.
arXiv Detail & Related papers (2026-01-10T00:10:52Z) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - Model-based Optimization of Superconducting Qubit Readout [59.992881941624965]
We demonstrate model-based readout optimization for superconducting qubits.
We observe 1.5% error per qubit with a 500ns end-to-end duration and minimal excess reset error from residual resonator photons.
This technique can scale to hundreds of qubits and be used to enhance the performance of error-correcting codes and near-term applications.
arXiv Detail & Related papers (2023-08-03T23:30:56Z) - Codesign of quantum error-correcting codes and modular chiplets in the presence of defects [3.9145409368937867]
Fabrication errors pose a challenge in scaling up solid-state quantum devices to the sizes required for fault-tolerant applications.
We simulate the surface code adapted to qubit arrays with arbitrarily distributed defects to find metrics that characterize how defects affect fidelity.
We find that an optimal choice of chiplet size, based on the defect rate and target fidelity, is essential to limiting any additional error correction overhead due to defects.
arXiv Detail & Related papers (2023-04-29T01:06:52Z) - Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
We report the measurement of logical qubit performance scaling across multiple code sizes.
Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number.
Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
arXiv Detail & Related papers (2022-07-13T18:00:02Z) - Fault-tolerant parity readout on a shuttling-based trapped-ion quantum
computer [64.47265213752996]
We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme.
We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%.
The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
arXiv Detail & Related papers (2021-07-13T20:08:04Z) - Exponential suppression of bit or phase flip errors with repetitive
error correction [56.362599585843085]
State-of-the-art quantum platforms typically have physical error rates near $10-3$.
Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits.
We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
arXiv Detail & Related papers (2021-02-11T17:11:20Z) - Fault-Tolerant Operation of a Quantum Error-Correction Code [1.835073691235972]
Quantum error correction protects fragile quantum information by encoding it into a larger quantum system.
Fault-tolerant circuits contain the spread of errors while operating the logical qubit.
We show that fault-tolerant circuits enable highly accurate logical primitives in current quantum systems.
arXiv Detail & Related papers (2020-09-24T04:31:38Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.