Excising dead components in the surface code using minimally invasive alterations: A performance study

• URL: http://arxiv.org/abs/2508.04786v1
• Date: Wed, 06 Aug 2025 18:02:25 GMT
• Title: Excising dead components in the surface code using minimally invasive alterations: A performance study
• Abstract summary: In solid-state qubits, the quantum error correcting protocol should ideally (i) use the same native operation set as that without dead components, (ii) maximize salvaging of functional components, and (iii) use a consistent global operating schedule.<n>We conduct extensive numerical simulations of this proposal for the pairwise-measurement-based surface code protocol in the presence of dead components under circuit-level noise.
• Score: 2.3824181818254027
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The physical implementation of a large-scale error-corrected quantum processor will necessarily need to mitigate the presence of defective (thereby "dead") physical components in its operation, for example, identified during bring-up of the device or detected in the middle of a computation. In the context of solid-state qubits, the quantum error correcting protocol operating in the presence of dead components should ideally (i) use the same native operation set as that without dead components, (ii) maximize salvaging of functional components, and (iii) use a consistent global operating schedule which optimizes logical qubit performance and is compatible with the control requirements of the system. The scheme proposed by Grans-Samuelsson et al. [Quantum 8, 1429 (2024)] satisfies all three of these criteria: it effectively excises (cuts out) dead components from the surface code using minimally invasive alterations (MIA). We conduct extensive numerical simulations of this proposal for the pairwise-measurement-based surface code protocol in the presence of dead components under circuit-level noise. To that end, we also describe techniques to automatically construct performant check (detector) bases directly from circuits without manual circuit annotation, which may be of independent interest. Both the MIA scheme and this automated check basis computation can be readily used with measurement-based as well as CNOT-based circuits, and the results presented here demonstrate state-of-the-art performance.

Related papers

• Physics-Guided Linear Mapper for Quantum Error Mitigation [0.0]
  We introduce a novel physics-guided linear mapper (PGLM) for quantum error mitigation.<n>The goal is to provide a data-efficient, interpretable, and low-latency alternative to the black-box machine learning for quantum error mitigation.
  arXiv  Detail & Related papers  (2026-08-24T11:19:10Z)
• Intent-Level Quantum Programming with Assertion-Guided Execution and Inspectable Intermediate Representation [0.22183164865527472]
  We present a quantum domain-specific language (Q) that addresses problems through three mechanisms.<n>First-class IR introspection, exposing circuit width, wire mapping, operation order, and measurement intent for developer inspection prior to execution.<n> assertion-guided modality inference, where the engine examines declared verification properties to automatically select sampling, statevector, or dual execution.
  arXiv  Detail & Related papers  (2026-07-31T18:21:32Z)
• Quantifying Gate Contribution in Quantum Feature Maps for Scalable Circuit Optimization [0.0]
  Gate Assessment and Threshold Evaluation (GATE) is presented as a circuit optimization methodology.<n>GATE quantifies the relevance of each gate by combining fidelity, entanglement, and sensitivity.<n>It is formulated for both simulator/emulator environments, where quantum states are accessible, and for real hardware.
  arXiv  Detail & Related papers  (2026-03-20T09:44:07Z)
• Moveless: Minimizing Overhead on QCCDs via Versatile Execution and Low Excess Shuttling [0.5833117322405447]
  We propose a compilation scheme specifically tailored for the structural regularity of QEC circuits.<n>Our resulting compiler, leads to QEC circuits which are on average 3.38x faster to execute, and lead to up to two orders of magnitude of improvement in logical error rates with realistic physical error rates.
  arXiv  Detail & Related papers  (2025-08-05T21:02:29Z)
• A Useful Metric for the NISQ Era: Qubit Error Probability and Its Role in Zero Noise Extrapolation [0.0]
  We propose the qubit error probability (QEP), a device specific metric that combines relaxation, dephasing, gate, and measurement contributions into a single per qubit figure of merit computable before execution.<n>In regimes where the raw circuits exhibit a finite mean QEP, the method suppresses observable errors beyond those attainable with circuit depth scaled ZNE.<n>These results demonstrate that QEP serves as a transparent and efficient error metric, and that its integration into ZNE provides a practical route to reliability gains on current superconducting hardware.
  arXiv  Detail & Related papers  (2025-03-13T09:42:03Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Learning to rank quantum circuits for hardware-optimized performance enhancement [0.0]
  We introduce and experimentally test a machine-learning-based method for ranking logically equivalent quantum circuits. We compare our method to two common approaches: random layout selection and a publicly available baseline called Mapomatic. Our best model leads to a $1.8times$ reduction in selection error when compared to the baseline approach and a $3.2times$ reduction when compared to random selection.
  arXiv  Detail & Related papers  (2024-04-09T18:00:01Z)
• 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)
• Measurement-free fault-tolerant quantum error correction in near-term devices [0.0]
  We provide a novel scheme to perform QEC cycles without the need of measuring qubits. We benchmark logical failure rates of the scheme in comparison to a flag-qubit based EC cycle. We outline how our scheme could be implemented in ion traps and with neutral atoms in a tweezer array.
  arXiv  Detail & Related papers  (2023-07-25T07:22:23Z)
• 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)
• Task-Oriented Sensing, Computation, and Communication Integration for Multi-Device Edge AI [108.08079323459822]
  This paper studies a new multi-intelligent edge artificial-latency (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) We measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain.
  arXiv  Detail & Related papers  (2022-07-03T06:57:07Z)
• 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)
• Efficient Micro-Structured Weight Unification and Pruning for Neural Network Compression [56.83861738731913]
  Deep Neural Network (DNN) models are essential for practical applications, especially for resource limited devices. Previous unstructured or structured weight pruning methods can hardly truly accelerate inference. We propose a generalized weight unification framework at a hardware compatible micro-structured level to achieve high amount of compression and acceleration.
  arXiv  Detail & Related papers  (2021-06-15T17:22:59Z)
• AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
  We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation. Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
  arXiv  Detail & Related papers  (2020-07-14T09:07:29Z)

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.