Optimal number of stabilizer measurement rounds in an idling surface code patch

• URL: http://arxiv.org/abs/2408.07529v4
• Date: Fri, 30 May 2025 19:10:14 GMT
• Title: Optimal number of stabilizer measurement rounds in an idling surface code patch
• Authors: Áron Márton, János K. Asbóth,
• Abstract summary: We numerically optimize the rate of stabilizer measurement rounds for a logical qubit encoded in a code patch.<n>We model the environmental noise on the circuit level, including gate errors, readout errors, amplitude and phase damping.<n>We find, qualitatively, that the optimal number of stabilizer measurement rounds is getting smaller for better qubits and getting larger for better gates or larger code sizes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Logical qubits can be protected against environmental noise by encoding them into a highly entangled state of many physical qubits and actively intervening in the dynamics with stabilizer measurements. In this work, we numerically optimize the rate of these interventions: the number of stabilizer measurement rounds for a logical qubit encoded in a surface code patch and idling for a given time. We model the environmental noise on the circuit level, including gate errors, readout errors, amplitude and phase damping. We find, qualitatively, that the optimal number of stabilizer measurement rounds is getting smaller for better qubits and getting larger for better gates or larger code sizes. We discuss the implications of our results to some of the leading architectures, superconducting qubits, and neutral atoms.

Related papers

• Compressing Syndrome Measurement Sequences [0.4870012761464388]
  We produce explicit measurement schedules sufficient for fault-tolerant error correction of quantum codes of distance $d$ with $r$ independent stabilizer generators.<n>We numerically examine the performance of our construction on the surface code under several noise models.
  arXiv  Detail & Related papers  (2025-09-08T23:48:49Z)
• Dynamical codes for hardware with noisy readouts [1.5833270109954136]
  Dynamical stabilizer codes may offer a practical route to large-scale quantum computation.<n>We ask how best to optimise the measurement schedule of dynamically condensed colour codes in various limits of noise bias.<n>We find differences in performance are primarily due to the number of rounds of measurements required, rather than the number of qubits.
  arXiv  Detail & Related papers  (2025-05-12T15:24:50Z)
• Non-local resources for error correction in quantum LDPC codes [0.0]
  Surface code suffers from a low encoding rate, requiring a vast number of physical qubits for large-scale quantum computation. hypergraph product codes present a promising alternative, as both their encoding rate and distance scale with block size. Recent advancements have shown how to deterministically perform high-fidelity cavity enabled non-local many-body gates.
  arXiv  Detail & Related papers  (2024-09-09T17:28:41Z)
• Optimal and robust error filtration for quantum information processing [0.0]
  Error filtration is a hardware scheme that mitigates noise by exploiting auxiliary qubits and entangling gates. We benchmark our approach against figures of merit that correspond to different applications.
  arXiv  Detail & Related papers  (2024-09-02T17:58:44Z)
• Reducing Quantum Error Correction Overhead with Versatile Flag-Sharing Syndrome Extraction Circuits [5.770351255180495]
  An efficient error syndrome extraction circuit should use fewer ancillary qubits, quantum gates, and measurements. We propose to design parallel flagged syndrome extraction with shared flag qubits for quantum stabilizer codes.
  arXiv  Detail & Related papers  (2024-06-30T06:35:48Z)
• Robust shallow shadows [0.251657752676152]
  We present a robust shadow estimation protocol for wide classes of shallow measurement circuits. We show how to estimate this directly from experimental data using tensor-network tools. Under the practical constraints of current and near-term noisy quantum devices, our method maximally realizes the potential of shadow estimation with global rotations.
  arXiv  Detail & Related papers  (2024-05-09T18:00:09Z)
• 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)
• Fast Quantum Calibration using Bayesian Optimization with State Parameter Estimator for Non-Markovian Environment [11.710177724383954]
  We propose a real-time optimal estimator of qubit states, which utilizes weak measurements and Bayesian optimization to find the optimal control pulses for gate design. Our numerical results demonstrate a significant reduction in the calibration process, obtaining a high gate fidelity.
  arXiv  Detail & Related papers  (2022-05-25T17:31:15Z)
• 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)
• 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)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Bayesian Bits: Unifying Quantization and Pruning [73.27732135853243]
  We introduce Bayesian Bits, a practical method for joint mixed precision quantization and pruning through gradient based optimization. We experimentally validate our proposed method on several benchmark datasets and show that we can learn pruned, mixed precision networks.
  arXiv  Detail & Related papers  (2020-05-14T16:00:34Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

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.