Erasure Minesweeper: exploring hybrid-erasure surface code architectures for efficient quantum error correction

• URL: http://arxiv.org/abs/2505.00066v1
• Date: Wed, 30 Apr 2025 17:57:43 GMT
• Title: Erasure Minesweeper: exploring hybrid-erasure surface code architectures for efficient quantum error correction
• Authors: Jason D. Chadwick, Mariesa H. Teo, Joshua Viszlai, Willers Yang, Frederic T. Chong,
• Abstract summary: We introduce a hybrid-erasure architecture for surface code error correction.<n>A subset of qubits is designated as erasure qubits while the rest remain standard.<n>We show that a hybrid-erasure architecture can boost the performance of the surface code.
• Score: 2.1444724678552256
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dual-rail erasure qubits can substantially improve the efficiency of quantum error correction, allowing lower error rates to be achieved with fewer qubits, but each erasure qubit requires $3\times$ more transmons to implement compared to standard qubits. In this work, we introduce a hybrid-erasure architecture for surface code error correction where a carefully chosen subset of qubits is designated as erasure qubits while the rest remain standard. Through code-capacity analysis and circuit-level simulations, we show that a hybrid-erasure architecture can boost the performance of the surface code -- much like how a game of Minesweeper becomes easier once a few squares are revealed -- while using fewer resources than a full-erasure architecture. We study strategies for the allocation and placement of erasure qubits through analysis and simulations. We then use the hybrid-erasure architecture to explore the trade-offs between per-qubit cost and key logical performance metrics such as threshold and effective distance in surface code error correction. Our results show that the strategic introduction of dual-rail erasure qubits in a transmon architecture can enhance the logical performance of surface codes for a fixed transmon budget, particularly for near-term-relevant transmon counts and logical error rates.

Related papers

• Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code [5.89889361990138]
  We propose a new ion-trap optimized architecture for the efficient execution of both gate and non-transversal operations.<n>By differentiating the regions for gates from those for non-transversal gates and syndrome extraction, our chip layout minimizes ion shuttling and simplifies physical implementations.
  arXiv  Detail & Related papers  (2025-01-25T12:49:07Z)
• Demonstrating dynamic surface codes [138.1740645504286]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Snakes and Ladders: Adapting the surface code to defects [36.136619420474766]
  We develop a suite of novel and highly performant methods for adapting surface code patches in the presence of defective qubits and gates. Compared to prior works, our methods significantly improve the code distance of the adapted surface code patches for realistic defect rates.
  arXiv  Detail & Related papers  (2024-12-16T07:27:24Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling [0.0]
  Two-dimensional grid of locally-interacting qubits is promising platform for fault tolerant quantum computing. In this paper, we show that such constrained architectures can also support fault tolerance. We demonstrate that error correction is possible and identify the classes of codes that are naturally suited to this platform.
  arXiv  Detail & Related papers  (2024-02-19T23:31:55Z)
• 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)
• Improved Pairwise Measurement-Based Surface Code [0.0]
  We devise a new realization of the surface code on a rectangular lattice of qubits utilizing single-qubit and nearest-neighbor two-qubit Pauli measurements. This realization gains substantial advantages over prior pairwise measurement-based realizations of the surface code.
  arXiv  Detail & Related papers  (2023-10-19T17:59:55Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• 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)
• 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)
• Optimization of the surface code design for Majorana-based qubits [2.309914459672557]
  The surface code is a prominent topological error-correcting code exhibiting high fault-tolerance accuracy thresholds. Here, we present error-correction schemes using $textitonly$ Pauli measurements on single qubits and on pairs of nearest-neighbor qubits.
  arXiv  Detail & Related papers  (2020-07-01T08:01:07Z)

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.