Opportunities and challenges in scaling quantum error detection on hardware

📅 2026-05-04
📈 Citations: 0
Influential: 0
📄 PDF

career value

182K/year
🤖 AI Summary
Quantum error detection faces significant challenges in scalability, including exponentially growing sampling and post-processing overheads as well as constant resource costs from encoding that may compromise accuracy. This work presents the first systematic benchmarking of repetition and three-qubit bit-flip codes for logical memory and computation on medium-scale real and simulated noisy quantum hardware, encompassing up to 74 physical qubits. The authors introduce a pseudo-threshold estimation method to quantitatively assess code efficacy. Their experiments uncover both the current scalability limitations and the latent potential of existing devices, offering crucial empirical insights to guide the design of future fault-tolerant quantum architectures.
📝 Abstract
Quantum error detection can produce unbiased expectation values that exponentially converge to noiseless results as the code distance is increased. Despite this, its performance as an error mitigation technique is relatively understudied on quantum hardware because of its two main drawbacks: (i) the number of samples increases exponentially in the circuit depth/noise level, and (ii) the classical processing generally grows exponentially in the code distance, though exceptions exist. Additionally, the constant (but often large) overhead of embedding the code and logical operations on hardware can make accuracy worse instead of better. In this work, we seek to provide a clear picture of these opportunities and challenges for scaling quantum error detection on hardware. We do so by performing a detailed benchmarking study on real and simulated noisy quantum computers, using the repetition code and triangular color code for memory experiments and logical computations with up to $74$ physical qubits. In addition to these benchmarks, we estimate the pseudothreshold of codes to map the frontier of error detection on current and future quantum computers. Despite the challenges, our results show strong promise for scaling quantum error detection on hardware.
Problem

Research questions and friction points this paper is trying to address.

quantum error detection
hardware overhead
exponential sampling
classical processing
code distance
Innovation

Methods, ideas, or system contributions that make the work stand out.

quantum error detection
pseudothreshold
hardware benchmarking
logical qubits
noisy quantum computers
Y
Yanis Le Fur
Institute of Physics, École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland; Departamento de Física Téorica de la Materia Condensada and Condensed Matter Physics Center (IFIMAC), Universidad Autónoma de Madrid, 28049 Madrid, Spain; Institute of Fundamental Physics IFF-CSIC, Calle Serrano 113b, 28006, Madrid, Spain
E
Ethan Egger
Department of Computer Science and Engineering, Michigan State University, East Lansing, MI 48823, USA; Department of Physics and Astronomy, Michigan State University, East Lansing, MI 48823, USA; Center for Quantum Computing, Science, and Engineering, Michigan State University, East Lansing, MI 48823, USA; Center for Quantum Information and Control, University of New Mexico, Albuquerque, NM 87131, USA
H
Hong-Ye Hu
Department of Physics, Harvard University, Cambridge, MA 02138, USA; EdenCode Inc.
Vincent Russo
Vincent Russo
See homepage
Computer Science
W
William J. Zeng
Unitary Foundation; Quantonation
Ryan LaRose
Ryan LaRose
Michigan State University
Quantum computingquantum algorithms