Millisecond-Scale Calibration and Benchmarking of Superconducting Qubits
- URL: http://arxiv.org/abs/2602.11912v1
- Date: Thu, 12 Feb 2026 13:08:22 GMT
- Title: Millisecond-Scale Calibration and Benchmarking of Superconducting Qubits
- Authors: Malthe A. Marciniak, Rune T. Birke, Johann B. Severin, Fabrizio Berritta, Daniel Kjær, Filip Nilsson, Smitha N. Themadath, Sangeeth Kallatt, James L. Webb, Kristoffer Bentsen, Tonny Madsen, Zhenhai Sun, Svend Krøjer, Christopher W. Warren, Jacob Hastrup, Morten Kjaergaard,
- Abstract summary: We demonstrate an on-FPGA workflow that co-locates pulse generation, data acquisition, analysis, and feed-forward, eliminating CPU round trips.<n>Within this workflow, we introduce sparse-sampling and on-FPGA inference tools, including computationally efficient methods for estimation of exponential and sine-like response functions.<n>These methods enable low-latency primitives for readout calibration, spectroscopy, pulse-amplitude calibration, coherence estimation, and benchmarking.
- Score: 0.001970303609484344
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Superconducting qubit parameters drift on sub-second timescales, motivating calibration and benchmarking techniques that can be executed on millisecond timescales. We demonstrate an on-FPGA workflow that co-locates pulse generation, data acquisition, analysis, and feed-forward, eliminating CPU round trips. Within this workflow, we introduce sparse-sampling and on-FPGA inference tools, including computationally efficient methods for estimation of exponential and sine-like response functions, as well as on-FPGA implementations of Nelder-Mead optimization and golden-section search. These methods enable low-latency primitives for readout calibration, spectroscopy, pulse-amplitude calibration, coherence estimation, and benchmarking. We deploy this toolset to estimate $T_1$ in 10 ms, optimize readout parameters in 100 ms, optimize pulse amplitudes in 1 ms, and perform Clifford randomized gate benchmarking in 107 ms on a flux-tunable superconducting transmon qubit. Running a closed-loop on-FPGA recalibration protocol continuously for 6 hours enables more than 74,000 consecutive recalibrations and yields gate errors that consistently retain better performance than the baseline initial calibration. Correlation analysis shows that recalibration suppresses coupling of gate error to control-parameter drift while preserving a coherence-linked performance. Finally, we quantify uncertainty versus time-to-decision under our sparse sampling approaches and identify optimal parameter regimes for efficient estimation of qubit and pulse parameters.
Related papers
- Topology-Aware Block Coordinate Descent for Qubit Frequency Calibration of Superconducting Quantum Processors [9.256953420444077]
Pre-execution calibration is a major bottleneck for operating quantum processors.<n>We show that the widely-used Snake Sequence is equivalent to Block Coordinate Descent (BCD)<n>These results provide a scalable, implementation-ready workflow for frequency calibration on NISQ-era processors.
arXiv Detail & Related papers (2026-01-15T09:09:36Z) - Parameter Analysis and Optimization of Layer Fidelity for Quantum Processor Benchmarking at Scale [0.03499870393443267]
Layer fidelity is a benchmark well-suited to assessing processor performance at scale.<n>We extend the analysis of the original layer fidelity manuscript to optimize parameters of the benchmark.
arXiv Detail & Related papers (2025-10-19T16:18:26Z) - Efficient Qubit Calibration by Binary-Search Hamiltonian Tracking [18.54622697112264]
We present and experimentally implement a real-time protocol for calibrating the frequency of a resonantly driven qubit.<n>We show the efficacy of the algorithm by stabilizing a flux-tunable transmon qubit, leading to improved coherence and gate fidelity.
arXiv Detail & Related papers (2025-01-09T17:18:38Z) - Sensitivity-Adapted Closed-Loop Optimization for High-Fidelity Controlled-Z Gates in Superconducting Qubits [0.0]
We show that we can reach 99.9 % controlled-Z gate fidelity using a 64 ns long Fourier-series pulse defined by only seven parameters.<n>The demonstrated method can be used for tune-up and recalibration of superconducting quantum processors.
arXiv Detail & Related papers (2024-12-23T10:20:48Z) - Model-based Optimization of Superconducting Qubit Readout [59.992881941624965]
We demonstrate model-based readout optimization for superconducting qubits.
We observe 1.5% error per qubit with a 500ns end-to-end duration and minimal excess reset error from residual resonator photons.
This technique can scale to hundreds of qubits and be used to enhance the performance of error-correcting codes and near-term applications.
arXiv Detail & Related papers (2023-08-03T23:30:56Z) - Quantized Neural Networks for Low-Precision Accumulation with Guaranteed
Overflow Avoidance [68.8204255655161]
We introduce a quantization-aware training algorithm that guarantees avoiding numerical overflow when reducing the precision of accumulators during inference.
We evaluate our algorithm across multiple quantized models that we train for different tasks, showing that our approach can reduce the precision of accumulators while maintaining model accuracy with respect to a floating-point baseline.
arXiv Detail & Related papers (2023-01-31T02:46:57Z) - Optimization of Annealed Importance Sampling Hyperparameters [77.34726150561087]
Annealed Importance Sampling (AIS) is a popular algorithm used to estimates the intractable marginal likelihood of deep generative models.
We present a parameteric AIS process with flexible intermediary distributions and optimize the bridging distributions to use fewer number of steps for sampling.
We assess the performance of our optimized AIS for marginal likelihood estimation of deep generative models and compare it to other estimators.
arXiv Detail & Related papers (2022-09-27T07:58:25Z) - Multipoint-BAX: A New Approach for Efficiently Tuning Particle
Accelerator Emittance via Virtual Objectives [47.52324722637079]
We propose a new information-theoretic algorithm, Multipoint-BAX, for black-box optimization on multipoint queries.
We use Multipoint-BAX to minimize emittance at the Linac Coherent Light Source (LCLS) and the Facility for Advanced Accelerator Experimental Tests II (FACET-II)
arXiv Detail & Related papers (2022-09-10T04:01:23Z) - Fast Quantum Calibration using Bayesian Optimization with State
Parameter Estimator for Non-Markovian Environment [11.710177724383954]
We propose a real-time optimal estimator of qubit states, which utilizes weak measurements and Bayesian optimization to find the optimal control pulses for gate design.
Our numerical results demonstrate a significant reduction in the calibration process, obtaining a high gate fidelity.
arXiv Detail & Related papers (2022-05-25T17:31:15Z) - Accurate methods for the analysis of strong-drive effects in parametric
gates [94.70553167084388]
We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach.
We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
arXiv Detail & Related papers (2021-07-06T02:02:54Z) - Reducing the Variance of Gaussian Process Hyperparameter Optimization
with Preconditioning [54.01682318834995]
Preconditioning is a highly effective step for any iterative method involving matrix-vector multiplication.
We prove that preconditioning has an additional benefit that has been previously unexplored.
It simultaneously can reduce variance at essentially negligible cost.
arXiv Detail & Related papers (2021-07-01T06:43:11Z) - FastEmit: Low-latency Streaming ASR with Sequence-level Emission
Regularization [78.46088089185156]
Streaming automatic speech recognition (ASR) aims to emit each hypothesized word as quickly and accurately as possible.
Existing approaches penalize emission delay by manipulating per-token or per-frame probability prediction in sequence transducer models.
We propose a sequence-level emission regularization method, named FastEmit, that applies latency regularization directly on per-sequence probability in training transducer models.
arXiv Detail & Related papers (2020-10-21T17:05:01Z)
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.