ERASER: Towards Adaptive Leakage Suppression for Fault-Tolerant Quantum Computing
Suhas Vittal (1), Poulami Das (2), Moinuddin Qureshi (1) ((1) Georgia, Institute of Technology, (2) The University of Texas at Austin)

TL;DR
ERASER introduces an adaptive leakage suppression method for quantum error correction, selectively applying leakage reduction circuits based on real-time leakage detection to improve fault tolerance in quantum computing.
Contribution
This work presents ERASER, a novel approach that dynamically identifies leaked qubits and optimizes leakage reduction circuit usage, reducing logical error rates significantly.
Findings
ERASER reduces logical error rate by up to 4.3x.
ERASER+M further improves error suppression, achieving up to 23x reduction.
Selective LRC application based on leakage detection enhances fault tolerance.
Abstract
Quantum error correction (QEC) codes can tolerate hardware errors by encoding fault-tolerant logical qubits using redundant physical qubits and detecting errors using parity checks. Leakage errors occur in quantum systems when a qubit leaves its computational basis and enters higher energy states. These errors severely limit the performance of QEC due to two reasons. First, they lead to erroneous parity checks that obfuscate the accurate detection of errors. Second, the leakage spreads to other qubits and creates a pathway for more errors over time. Prior works tolerate leakage errors by using leakage reduction circuits (LRCs) that modify the parity check circuitry of QEC codes. Unfortunately, naively using LRCs always throughout a program is sub-optimal because LRCs incur additional two-qubit operations that (1) facilitate leakage transport, and (2) serve as new sources of errors.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
