Optimization of Quantum Error Correcting Code under Temporal Variation of Qubit Quality

• URL: http://arxiv.org/abs/2505.06165v1
• Date: Fri, 09 May 2025 16:15:17 GMT
• Title: Optimization of Quantum Error Correcting Code under Temporal Variation of Qubit Quality
• Authors: Subrata Das, Swaroop Ghosh,
• Abstract summary: We analyze 12 days of calibration data from IBM's 127-qubit device (ibm_kyiv)<n>We propose a simple adaptive QEC approach that selects an appropriate code distance per qubit, based on daily error rates.<n>Across 12 calibration days on ibm_kyiv, our adaptive strategy reduces physical qubit overhead by over 50% per logical qubit while maintaining access to 85-100% of usable qubits.
• Score: 2.348041867134616
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Error rates in current noisy quantum hardware are not static; they vary over time and across qubits. This temporal and spatial variation challenges the effectiveness of fixed-distance quantum error correction (QEC) codes. In this paper, we analyze 12 days of calibration data from IBM's 127-qubit device (ibm_kyiv), showing the fluctuation of Pauli-X and CNOT gate error rates. We demonstrate that fixed-distance QEC can either underperform or lead to excessive overhead, depending on the selected qubit and the error rate of the day. We then propose a simple adaptive QEC approach that selects an appropriate code distance per qubit, based on daily error rates. Using logical error rate modeling, we identify qubits that cannot be used and qubits that can be recovered with minimal resources. Our method avoids unnecessary resource overhead by excluding outlier qubits and tailoring code distances. Across 12 calibration days on ibm_kyiv, our adaptive strategy reduces physical qubit overhead by over 50% per logical qubit while maintaining access to 85-100% of usable qubits. To further validate the method, we repeat the experiment on two additional 127-qubit devices, ibm_brisbane and ibm_sherbrooke, where the overhead savings reach up to 71% while still preserving over 80% qubit usability. This approach offers a practical and efficient path forward for Noisy Intermediate-Scale Quantum (NISQ)-era QEC strategies.

Related papers

• Suppressing Measurement Noise in Logical Qubits Through Measurement Scheduling [1.419616346522232]
  Noise in single-shot measurements limits logical readout fidelity, forming a critical bottleneck for quantum computation.<n>We propose a dynamic measurement scheduling protocol that suppresses logical readout errors by adaptively redistributing measurement tasks from error-prone qubits to stable nodes.<n> Numerical simulations show that logical error rates can be reduced by up to 34% across code distances for 3 to 11, with enhanced robustness in measurement-noise-dominated systems.
  arXiv  Detail & Related papers  (2025-05-12T01:54:40Z)
• Variational Quantum Algorithms in the era of Early Fault Tolerance [2.7899834802862284]
  Quantum computing roadmaps predict the availability of 10,000 qubit devices within the next 3-5 years.<n>We introduce partial error correction (pQEC), a strategy that error-corrects Clifford operations while performing Rz rotations via magic state injection.<n>Our results show that pQEC can improve VQA fidelities by 9.27x over standard approaches.
  arXiv  Detail & Related papers  (2025-03-26T20:06:32Z)
• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• Optimizing quantum error correction protocols with erasure qubits [42.00287729190062]
  Erasure qubits offer a promising avenue toward reducing the overhead of quantum error correction protocols. We focus on the performance of the surface code as a quantum memory. Our results indicate that QEC protocols with erasure qubits can outperform the ones with state-of-the-art transmons.
  arXiv  Detail & Related papers  (2024-08-01T18:00:01Z)
• 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)
• Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations [3.47670594338385]
  We propose a postselection-based algorithm to efficiently prepare resource states for gate teleportation. Our algorithm achieves fault tolerance, demonstrating the exponential suppression of logical errors with code distance. Our approach presents a promising path to reducing the resource requirement for quantum algorithms on error-corrected and noisy intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2023-03-30T13:46: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)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays [3.575043595126111]
  We propose a qubit encoding and gate protocol for $171$Yb neutral atom qubits that converts the dominant physical errors into erasures. We estimate that 98% of errors can be converted into erasures.
  arXiv  Detail & Related papers  (2022-01-10T18:56:31Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• 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)

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.