Quantum devices require precisely calibrated analog signals, a process that is complex and time-consuming. Many calibration strategies exist, and all require careful analysis and tuning to optimize system availability. To enable rigorous statistical evaluation of quantum calibration procedures, we leverage statistical model checking (SMC), a technique used in fields that require statistical guarantees. SMC allows for probabilistic evaluation of properties of interest, such as a certain parameter's time to failure. We extend the SMC for Processor Analysis (SPA) framework, which uses SMC for evaluation of classical systems, to create SPA for Quantum calibration (SPAQ) enabling simplified tuning and analysis of quantum system calibration. We focus on a directed acyclic graph-based calibration optimization scheme and demonstrate how to craft properties of interest for its analysis. We show how to use SPAQ to find lower bounds of time to failure information, hidden node dependencies, and parameter threshold values and use that information to improve simulated quantum system availability through calibration scheme adjustments.
Quantum devices require precisely calibrated analog signals, a process that is complex and time-consuming. Many calibration strategies exist, and all require careful analysis and tuning to optimize system availability. To enable rigorous statistical evaluation of quantum calibration procedures, we leverage statistical model checking (SMC), a technique used in fields that require statistical guarantees. SMC allows for probabilistic evaluation of properties of interest, such as a certain parameter's time to failure. We extend the SMC for Processor Analysis (SPA) framework, which uses SMC for evaluation of classical systems, to create SPA for Quantum calibration (SPAQ) enabling simplified tuning and analysis of quantum system calibration. We focus on a directed acyclic graph-based calibration optimization scheme and demonstrate how to craft properties of interest for its analysis. We show how to use SPAQ to find lower bounds of time to failure information, hidden node dependencies, and parameter threshold values and use that information to improve simulated quantum system availability through calibration scheme adjustments.
Probabilistic model checking (PMC) is a verification technique for analyzing the properties of probabilistic systems. However, existing techniques face challenges in verifying large systems with high accuracy. PMC struggles with state explosion , where the number of states grows exponentially with the size of the system, making large system verification infeasible. While statistical model checking (SMC) avoids PMC’s state explosion problem by using a simulation approach, it suffers from runtime explosion, requiring numerous samples for high accuracy. To address these limitations in verifying large systems with high accuracy, we present quantum probabilistic model checking (QPMC), the first method leveraging quantum computing for PMC with respect to timebounded properties. QPMC addresses state explosion by encoding PMC problems into quantum circuits that superpose states within qubits. Additionally, QPMC resolves runtime explosion through Quantum Amplitude Estimation, efficiently estimating the probabilities of specified properties. We prove that QPMC correctly solves PMC problems and achieves a quadratic speedup in time complexity compared to SMC.
Quantum processors are expected to speed up various applications, including, but not limited to, chemistry, finance, and secure communication, on the premise that the device's error rate is well below the quantum error correction threshold.Thus, the infrastructure provider must perform routine characterization and calibration (C&C) to maintain the device's quality.The user cannot access the device during the C&C routine, which is not ideal but necessary for both the user and the provider.To maximize device availability, the provider must minimize the time required for the C&C routine.This thesis introduces a modular C&C framework designed to reduce system downtime, implemented as an opensource Python library named Inspeqtor.To enable broad data efficiency, the framework establishes compatible abstractions for Bayesian Optimal Experimental Design (BOED) tailored for general-purpose models.Alongside this capability, Inspeqtor provides firstclass support for a Graybox characterization method adaptable to multiple qubit implementations.Through statistical analysis of this Graybox method, we derive a performance bound showing that, while the expected minimum of the empirical error depends on the number of measurement shots, the predictive performance bound on average gate fidelity remains independent of the shot count due to the cancellation of data variance.This reveals that once the model's test error approaches this shot-dependent variance, it can accurately predict average gate fidelity, suggesting that strategic balancing of shot count and sample size can be exploited to train highly accurate predictive models.Furthermore, we develop a Probabilistic Graybox Model (PGM) to enable the integration of Graybox characterization with BOED.We validate this approach via a numerical simulation, demonstrating that the PGM maintains high accuracy even under stochastic noise and with limited training sample sizes.By building each module directly around the system's mathematical representation, Inspeqtor bridges the gap between software implementation and mathematical abstraction.This functional, composable approach narrows the domain-knowledge gap for infrastructure engineers and quantum researchers, widening the path to highly available quantum computing platforms.
High fidelity operation of a quantum system requires precise tuning of control parameters. Calibration of a quantum system is often achieved by running complex series of dependent experiments and a full system calibration can require tens of calibration experiments to complete. Optimal control parameters drift over time, and components of experimental quantum systems are susceptible to failure. Hence, continuous operation of a quantum system requires automated background processes such as frequent recalibration and monitoring. In this article, we present a scheduling toolkit that schedules experiments based on a directed acyclic graph using a configurable traversal algorithm. Our scheduler can be triggered from any process, enabling universal feedback between the scheduler and the quantum control system. To demonstrate the capabilities of our system, we implemented a complex system calibration algorithm based on our scheduling toolkit.
High-fidelity control of qubits requires precisely tuned control parameters. Typically, these parameters are found through a series of bootstrapped calibration experiments which successively acquire more accurate information about a physical qubit. However, optimal parameters are typically different between devices and can also drift in time, which begets the need for an efficient calibration strategy. Here, we introduce a framework to understand the relationship between calibrations as a directed graph. With this approach, calibration is reduced to a graph traversal problem that is automatable and extensible.
Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration. In practice, however, analog control parameters inevitably drift because of environmental fluctuations. As future fault-tolerant quantum computations are expected to run for days or even months, interrupting computation for repeated recalibration becomes fundamentally impractical. A promising alternative is to integrate calibration directly into computation by repurposing syndrome measurements as a calibration signal (Sivak et al, Nature 2026), but whether such self-calibration can be achieved with provable efficiency remains an open question. Here we establish a theoretical framework for such self-calibrating quantum fault tolerance. We prove that, for a broad class of control-induced errors, the detection rate defines a locally strongly convex surrogate objective for analog calibration with high probability. This geometric property enables a simple and efficient online optimization algorithm using only syndrome measurements collected during normal error correction. We prove convergence to an ε detection rate within O(1/ε2) epochs for time-independent drifts and also establish guarantees for time-dependent drifts. We further show that the convergence rate is independent of the code distance for quantum low-density parity-check (LDPC) codes. Pulse-level simulations of neutral-atom arrays and large-scale circuit-level Clifford simulations confirm these theoretical predictions. Our results establish self-calibrating fault tolerance as a provably efficient paradigm in which the same syndrome measurements simultaneously protect logical information and stabilize the underlying hardware.
Maximizing the computational utility of near-term quantum processors requires predictive noise models that inform robust, noise-aware compilation and error mitigation. Conventional models often fail to capture the complex error dynamics of real hardware or require prohibitive characterization overhead. We introduce a data-efficient framework that first constructs a physically motivated, parameterized noise model, and subsequently employs machine-learning-driven Bayesian optimization to identify its parameters. Our approach circumvents costly characterization protocols by estimating algorithm- and hardware-specific error parameters directly from readily available experimental data derived from existing application and benchmark circuit executions. The generality and robustness of the framework are demonstrated across diverse algorithms and superconducting devices, yielding high-fidelity predictions by estimating an independent parameter set tailored to each specific algorithm-hardware context. Crucially, we show that a model calibrated exclusively on small-scale circuits accurately predicts the behavior of larger validation circuits. Our data-efficient approach achieves up to a 65% improvement in model fidelity quantified by the Hellinger distance between predicted and experimental circuit output distributions, compared to standard noise models derived from device properties. This work establishes a practical paradigm for application-aware noise characterization, enabling compilation and error-mitigation strategies tailored to the specific interplay between quantum algorithms and device-specific noise dynamics.