Real-Time Adaptive Filtering and the Boxcar Limit in Superconducting Qubit Readout
Abstract
Control and readout systems for superconducting quantum computing support real-time control and high-fidelity qubit-state discrimination. We examine when additional digital processing improves readout fidelity. A common baseline for dispersive readout uses a boxcar averager to compute a uniformly weighted average over a fixed window followed by threshold-based state assignment. We evaluated an adaptive finite-impulse-response (FIR) filter trained in real time using the least-mean-squares (LMS) algorithm on a field-programmable gate array (FPGA) quantum controller. We also analyzed measured readout shots offline to compare the frozen filter with boxcar averaging, and evaluate per-sample weighting plus sequential detection. For the fixed FIR filters tested, summing the filtered samples gives the boxcar sum multiplied by one complex number apart from a small edge correction. We call this the kernel collapse. The multiplication scales the state separation and noise equally without improving state discrimination, and we call this the boxcar limit. The frozen LMS filter reduces trace noise, but shows no resolved improvement in readout fidelity. On a 2D transmon, optimizing the readout window accounted for much of the improvement over full-window integration. We then examined how changing the decision method could reduce calibration effort and decision time. On a higher-fidelity 3D ancilla readout, our modeled template estimation reached the same fidelity target as direct averaging with 89.8% fewer labeled shots per state. Offline sequential replay assigned most shots before the acquisition window ended. These results distinguish waveform denoising from state-discrimination improvement, and motivate direct control of decision weights and assignment time in dispersive readout.
Related
- Modeling Logical Gates and Readout of Superconducting Gottesman-Kitaev-Preskill Qubits
- Readout failures in superconducting qubits due to TLS-defects in tunnel junctions
- Fisher-Information Recovery in Superconducting-Qubit Magnetometry with Squeezed-Microwave Readout
- Broadband Purcell Filter for Fast Superconducting Qubit Reset and Readout
- Arbitrary-phase CZ gate and remote readout across spatially separated superconducting nodes
BibTeX
@misc{johnson2026realtime,
title = {{Real-Time Adaptive Filtering and the Boxcar Limit in Superconducting Qubit Readout}},
author = {Hans Johnson and Tanay Roy and Leonardo Bove and David van Zanten and Silvia Zorzetti and Jafar Saniie},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.00783},
eprint = {2610.00783},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.00783},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Real-Time Adaptive Filtering and the Boxcar Limit in Superconducting Qubit Readout
AU - Hans Johnson
AU - Tanay Roy
AU - Leonardo Bove
AU - David van Zanten
AU - Silvia Zorzetti
AU - Jafar Saniie
PY - 2026
DA - 2026/10/16
PB - arXiv
DO - 10.48550/arxiv.2610.00783
UR - https://arxiv.org/abs/2610.00783
AB - Control and readout systems for superconducting quantum computing support real-time control and high-fidelity qubit-state discrimination. We examine when additional digital processing improves readout fidelity. A common baseline for dispersive readout uses a boxcar averager to compute a uniformly weighted average over a fixed window followed by threshold-based state assignment. We evaluated an adaptive finite-impulse-response (FIR) filter trained in real time using the least-mean-squares (LMS) algorithm on a field-programmable gate array (FPGA) quantum controller. We also analyzed measured readout shots offline to compare the frozen filter with boxcar averaging, and evaluate per-sample weighting plus sequential detection. For the fixed FIR filters tested, summing the filtered samples gives the boxcar sum multiplied by one complex number apart from a small edge correction. We call this the kernel collapse. The multiplication scales the state separation and noise equally without improving state discrimination, and we call this the boxcar limit. The frozen LMS filter reduces trace noise, but shows no resolved improvement in readout fidelity. On a 2D transmon, optimizing the readout window accounted for much of the improvement over full-window integration. We then examined how changing the decision method could reduce calibration effort and decision time. On a higher-fidelity 3D ancilla readout, our modeled template estimation reached the same fidelity target as direct averaging with 89.8% fewer labeled shots per state. Offline sequential replay assigned most shots before the acquisition window ended. These results distinguish waveform denoising from state-discrimination improvement, and motivate direct control of decision weights and assignment time in dispersive readout.
ER -