Snakes and Ladders: Adapting the surface code to defects

• URL: http://arxiv.org/abs/2412.11504v1
• Date: Mon, 16 Dec 2024 07:27:24 GMT
• Title: Snakes and Ladders: Adapting the surface code to defects
• Authors: Catherine Leroux, Sophia F. Lin, Przemyslaw Bienias, Krishanu R. Sankar, Asmae Benhemou, Aleksander Kubica, Joseph K. Iverson,
• Abstract summary: 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.
• Score: 36.136619420474766
• License:
• Abstract: One of the critical challenges solid-state quantum processors face is the presence of fabrication imperfections and two-level systems, which render certain qubits and gates either inoperable or much noisier than tolerable by quantum error correction protocols. To address this challenge, we develop a suite of novel and highly performant methods for adapting surface code patches in the presence of defective qubits and gates, which we call \emph{Snakes and Ladders}. We explain how our algorithm generates and compares several strategies in order to find the optimal one for any given configuration of defective components, as well as introduce heuristics to improve runtime and minimize computing resources required by our algorithm. In addition to memory storage we also show how to apply our methods to lattice surgery protocols. Compared to prior works, our methods significantly improve the code distance of the adapted surface code patches for realistic defect rates, resulting in a logical performance similar to that of the defect-free patches.

Related papers

• Demonstrating dynamic surface codes [138.1740645504286]
  We experimentally demonstrate three time-dynamic implementations of the surface code. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. 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. 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)
• 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)
• Low-Overhead Defect-Adaptive Surface Code with Bandage-Like Super-Stabilizers [4.146058318261507]
  We introduce an automatic adapter to implement the surface code on defective lattices. Unlike previous approaches, this adapter leverages newly proposed bandage-like super-stabilizers to save more qubits. Our work presents a low-overhead, automated solution to the challenge of adapting the surface code to defects.
  arXiv  Detail & Related papers  (2024-04-29T12:24:43Z)
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice [41.94295877935867]
  Topological quantum error correction is a milestone in the scaling roadmap of quantum computers. The square-lattice surface code has become the workhorse to address this challenge. In some platforms, however, the connectivities are kept even lower in order to minimise gate errors.
  arXiv  Detail & Related papers  (2024-02-03T15:28:27Z)
• 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)
• Dependency-Aware Compilation for Surface Code Quantum Architectures [7.543907169342984]
  We study the problem of compiling quantum circuits for quantum computers implementing surface codes. We solve this problem efficiently and near-optimally with a novel algorithm. Our evaluation shows that our approach is powerful and flexible for compiling realistic workloads.
  arXiv  Detail & Related papers  (2023-11-29T19:36:19Z)
• Efficient Simulation of Leakage Errors in Quantum Error Correcting Codes Using Tensor Network Methods [0.196629787330046]
  We present a computationally efficient simulation methodology for studying leakage errors in quantum error correcting codes (QECCs) Our approach enables the simulation of various leakage processes, including thermal noise and coherent errors, without approximations. By leveraging the small amount of entanglement generated during the error correction process, we are able to study large systems, up to a few hundred qudits, over many code cycles.
  arXiv  Detail & Related papers  (2023-08-16T07:36:33Z)
• 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)
• Universal quantum computing with twist-free and temporally encoded lattice surgery [3.222802562733787]
  We introduce a decoder capable of correcting spacelike and timelike errors during lattice surgery protocols. We compute logical failure rates of a lattice surgery protocol for a biased circuit-level noise model. We propose a layout for a quantum processor that is more efficient for rectangular surface codes exploiting noise bias.
  arXiv  Detail & Related papers  (2021-09-06T21:18:01Z)
• Entanglement-assisted entanglement purification [62.997667081978825]
  We present a new class of entanglement-assisted entanglement purification protocols that can generate high-fidelity entanglement from noisy, finite-size ensembles. Our protocols can deal with arbitrary errors, but are best suited for few errors, and work particularly well for decay noise.
  arXiv  Detail & Related papers  (2020-11-13T19:00:05Z)

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.