Fault-tolerant quantum architectures based on erasure qubits

Abstract

The overhead of quantum error correction (QEC) poses a major bottleneck for realizing fault-tolerant computation. To reduce this overhead, we exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We start by introducing a formalism for QEC schemes with erasure qubits and express the corresponding decoding problem as a matching problem. Then, we propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our schemes are well-suited for superconducting circuits, being compatible with planar layouts. We numerically estimate the memory thresholds for the circuit noise model that includes spreading (via entangling operations) and imperfect detection of erasures. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.

11+4 pages, 14 figures

References in corpus (4)

• Topological Quantum Distillation
• Decoherence benchmarking of superconducting qubits
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Dynamically Generated Logical Qubits

Cited by in corpus (10)

• Quantum Error Correction resilient against Atom Loss
• Optimizing quantum error correction protocols with erasure qubits
• Local Clustering Decoder as a fast and adaptive hardware decoder for the surface code
• Surface Code with Imperfect Erasure Checks
• Degenerate quantum erasure decoding
• Tailoring Dynamical Codes for Biased Noise: The X${}^3$Z${}^3$ Floquet Code
• Stabilizing Non-Abelian Topological Order against Heralded Noise via Local Lindbladian Dynamics
• Quantum low-density parity-check codes for erasure-biased atomic quantum processors
• Taming Rydberg Decay with Measurement-based Quantum Computation
• Intrinsic Heralding and Optimal Decoders for Non-Abelian Topological Order