Halma: a routing-based technique for defect mitigation in quantum error correction

• URL: http://arxiv.org/abs/2412.21000v1
• Date: Mon, 30 Dec 2024 15:09:53 GMT
• Title: Halma: a routing-based technique for defect mitigation in quantum error correction
• Authors: Runshi Zhou, Fang Zhang, Linghang Kong, Jianxin Chen,
• Abstract summary: We introduce Halma, a defect mitigation technique empowered by an expanded native gate set. Halma effectively mitigates ancilla qubit defects during surface code stabilizer measurements.
• Score: 1.8733234845721083
• License:
• Abstract: As quantum chips scale up for large-scale computation, hardware defects become inevitable and must be carefully addressed. In this work, we introduce Halma, a defect mitigation technique empowered by an expanded native gate set that incorporates the iSWAP gate alongside the conventional CNOT gate, both commonly available on many superconducting processors. Halma effectively mitigates ancilla qubit defects during surface code stabilizer measurements, enhancing the robustness and reliability of quantum computation. Halma introduces zero reduction in the spacelike distance of the code, leading to effective preservation of encoded logical information. Meanwhile, it does not further sacrifice the timelike distance, which enables efficient logical operations on surface code patches. Under a realistic physical noise level of $10^{-3}$, Halma achieves a logical error rate that is only $\sim1.5\times$ that of the defect-free code when handling a single ancilla qubit defect on a small-distance surface code. In comparison to previous defect-handling methods, Halma provides a $\sim10\times$ improvement in the average logical error rate of distance-11 surface codes with a defect rate of 2%, and a $\sim3\times$ reduction in the teraquop footprint, that is, the number of physical qubits required to reach a logical error rate of $10^{-12}$. Generally speaking, Halma can be viewed as an additional equipment in the toolbox of defect mitigation, or an upgrade patch, as it is directly compatible with most of the existing superstabilizer-based approaches in handling data qubit defects and defect clusters. Halma not only significantly eases the near-term realization of fault-tolerant quantum computing on hardware with fabrication defects, but also exemplifies how leveraging intrinsic hardware capabilities can enhance quantum hardware performance, particularly in the context of quantum error correction.

Related papers

• Hardware-Efficient Fault Tolerant Quantum Computing with Bosonic Grid States in Superconducting Circuits [0.0]
  This perspective manuscript describes how bosonic codes, particularly grid state encodings, offer a pathway to scalable fault-tolerant quantum computing. By leveraging the large Hilbert space of bosonic modes, quantum error correction can operate at the single physical unit level. We argue that it offers the shortest path to achieving fault tolerance in gate-based quantum computing processors with a MHz logical clock rate.
  arXiv  Detail & Related papers  (2024-09-09T17:20:06Z)
• 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)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Codesign of quantum error-correcting codes and modular chiplets in the presence of defects [3.9145409368937867]
  Fabrication errors pose a challenge in scaling up solid-state quantum devices to the sizes required for fault-tolerant applications. We simulate the surface code adapted to qubit arrays with arbitrarily distributed defects to find metrics that characterize how defects affect fidelity. We find that an optimal choice of chiplet size, based on the defect rate and target fidelity, is essential to limiting any additional error correction overhead due to defects.
  arXiv  Detail & Related papers  (2023-04-29T01:06: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)
• Adaptive surface code for quantum error correction in the presence of temporary or permanent defects [0.0]
  We show that combining an appropriate defect detection algorithm and a quarantine of the identified zone allows one to preserve the advantage of quantum error correction at finite code sizes. Results pave the way to the experimental implementation of large-scale quantum computers where defects will be inevitable.
  arXiv  Detail & Related papers  (2022-11-15T19:39:49Z)
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays [3.575043595126111]
  We propose a qubit encoding and gate protocol for $171$Yb neutral atom qubits that converts the dominant physical errors into erasures. We estimate that 98% of errors can be converted into erasures.
  arXiv  Detail & Related papers  (2022-01-10T18:56:31Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)

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.