Suppressing Measurement Noise in Logical Qubits Through Measurement Scheduling

• URL: http://arxiv.org/abs/2505.07173v1
• Date: Mon, 12 May 2025 01:54:40 GMT
• Title: Suppressing Measurement Noise in Logical Qubits Through Measurement Scheduling
• Authors: Xiao-Yue Xu, Chen Ding, Wan-Su Bao,
• Abstract summary: 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.
• Score: 1.419616346522232
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error correction is essential for reliable quantum computation, where surface codes demonstrate high fault-tolerant thresholds and hardware efficiency. However, noise in single-shot measurements limits logical readout fidelity, forming a critical bottleneck for fault-tolerant quantum computation. We propose a dynamic measurement scheduling protocol that suppresses logical readout errors by adaptively redistributing measurement tasks from error-prone qubits to stable nodes. Using shallow entangled circuits, the protocol balances gate errors and measurement noise. This is achieved by dynamically prioritizing resource allocation based on topological criticality and error metrics. When addressing realistic scenarios where temporal constraints are governed by decoherence limits and error-correction requirements, we implement reinforcement learning (RL) to achieve adaptive measurement scheduling. 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. Our protocol offers a versatile, hardware-efficient solution for high-fidelity quantum error correction, advancing large-scale quantum computing.

Related papers

• Optimized measurement-free and fault-tolerant quantum error correction for neutral atoms [1.4767596539913115]
  A major challenge in performing quantum error correction (QEC) is implementing reliable measurements and conditional feed-forward operations.<n>We propose implementations of small measurement-free QEC schemes, which are fault-tolerant to circuit-level noise.<n>We highlight how this alternative approach paves the way towards implementing resource-efficient measurement-free QEC on neutral-atom arrays.
  arXiv  Detail & Related papers  (2024-04-17T18:01:57Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Minimizing readout-induced noise for early fault-tolerant quantum computers [0.0]
  We present a different method for syndrome extraction, namely Generalized Syndrome Measurement. We can detect the error in the logical state with minimized readout-induced noise. We numerically analyze the performance of our protocol using Iceberg code and Steane code.
  arXiv  Detail & Related papers  (2023-04-23T04:16:26Z)
• 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)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Applying the Quantum Error-correcting Codes for Fault-tolerant Blind Quantum Computation [33.51070104730591]
  The Blind Quantum Computation (BQC) is a delegated protocol, which allows a client to rent a remote quantum server to implement desired quantum computations. We propose a fault-tolerant blind quantum computation protocol with quantum error-correcting codes to avoid the accumulation and propagation of qubit errors during the computing.
  arXiv  Detail & Related papers  (2023-01-05T08:52:55Z)
• Measurement based estimator scheme for continuous quantum error correction [52.77024349608834]
  Canonical discrete quantum error correction (DQEC) schemes use projective von Neumann measurements on stabilizers to discretize the error syndromes into a finite set. Quantum error correction (QEC) based on continuous measurement, known as continuous quantum error correction (CQEC), can be executed faster than DQEC and can also be resource efficient. We show that by constructing a measurement-based estimator (MBE) of the logical qubit to be protected, it is possible to accurately track the errors occurring on the physical qubits in real time.
  arXiv  Detail & Related papers  (2022-03-25T09:07:18Z)
• 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)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• 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)
• Error mitigation via stabilizer measurement emulation [0.0]
  We introduce and demonstrate quantum measurement emulation (QQME) QQME effectively emulates the measurement of stabilizer operators via gate application, leading to a first-order insensitivity to coherent errors. It is particularly well-suited to discrete coherent errors that are challenging for DD to address.
  arXiv  Detail & Related papers  (2021-02-10T22:58:09Z)

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.