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 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.
Frequent recalibration of multi-qubit systems is essential to maintain hardware fidelity, but calibration itself is costly and subject to rapid parameter drift. This work presents a novel framework for time-aware active calibration that combines Bayesian Optimization (BO) and Reinforcement Learning (RL) to adaptively schedule and prioritize calibration experiments under uncertainty. We model the calibration landscape as a directed acyclic graph (DAG), where nodes represent hardware parameters (e.g., frequency, amplitude ratio, DRAG, or phase) and edges capture inter-parameter dependencies extracted automatically from Qiskit Experiments metadata. Each parameter's temporal drift is modeled as an Ornstein-Uhlenbeck (OU) or exponential decay process with uncertainty bounds. The BO agent prioritizes the next calibration target using a time-aware acquisition score that balances expected improvement, predictive uncertainty, and experiment duration under system-level constraints. A parallel RL scheduler coordinates cross-qubit calibration and readout tasks to minimize idle time and avoid conflicts. Our system further incorporates self-triggered recalibration based on online RB/XEB health metrics, enabling autonomous recovery from drift without human intervention. Experimental evaluation on multi-qubit testbeds demonstrates improved calibration efficiency, longer mean time between recalibrations (MTBC), and reduced overall calibration overhead compared to fixed or purely heuristic scheduling baselines.
This work presents a structural critique of calibration-based control frameworks for superconducting quantum computing systems, with particular focus on architectures relying on recursive calibration loops and dependency graph formalism. It is shown that the current paradigm does not resolve the fundamental problem of physical instability, but instead formalizes it as an operational requirement. Continuous recalibration, parameter drift, and dependency-driven control structures indicate the absence of stable, reproducible computational states. The analysis demonstrates that the system does not admit a stationary operational regime, and that control is effectively shifted from physical determinacy to procedural scheduling. Directed acyclic graphs and calibration routines are shown to reorganize instability rather than eliminate it. Furthermore, the framework lacks invariant quantities, external validation criteria, and any demonstrated convergence toward stable configurations. Validation remains internal and self-referential, preventing the establishment of physically meaningful computational states. Scalability is assumed through automation, but no structural argument is provided to ensure bounded error propagation or stability under system growth. As a result, increasing system size amplifies the instability it attempts to manage. The work concludes that the calibration-based paradigm represents a systematic redefinition of instability as workflow. The resulting architecture does not achieve control of a quantum system, but continuous management of its failure modes.
Quantum network control is a major research area of the QUANT-NET project. We strive to build a quantum network control plane to orchestrate and manage all the physicallayer technologies, and to explore what a quantum network control plane should look like in the future, so as to automate high-rate and high-fidelity entanglement generation, distribution, and storage in an efficient, reliable, and cost-effective way. To these ends, we have designed a two-level control framework for quantum networks. Within such a framework, a two-level scheduler has been implemented to support synchronous time slot scheduling, network-wide non-real-time control, and nodewide real-time control. This two-level control framework and the scheduler are being deployed and evaluated in the QUANTNET testbed. Enabled by this two-level control framework and the scheduler, several basic quantum network operations have been automated in the testbed, which include automated quantum node calibration and on-demand single photon generation. In this paper, we present this two-level control framework, the scheduler, and the automated quantum network operations that have been enabled in the QUANT-NET testbed.
We present a software tool-set which combines the theoretical, optimal control view of quantum devices with the practical operation and characterization tasks required for quantum computing. In the same framework, we perform model-based simulations to create control schemes, calibrate these controls in a closed-loop with the device (or in this demo —by emulating the experimental process) and finally improve the system model through minimization of the mismatch between simulation and experiment, resulting in a digital twin of the device. The model based simulator is implemented using TensorFlow, for numeric efficiency, scalability and to make use of automatic differentiation, which enables gradient-based optimization for arbitrary models and control schemes. Optimizations are carried out with a collection of state-of-the-art algorithms originated in the field of machine learning. All of this comes with a user-friendly Qiskit interface, which allows end-users to easily simulate their quantum circuits on a high-fidelity differentiable physics simulator.
This paper presents a novel approach to quantum circuit optimization – self-correcting quantum circuits – that leverages adaptive gate scheduling to mitigate the detrimental effects of noise and decoherence. The core concept involves establishing a closed-loop feedback system where real-time performance measurements of the circuit are utilized to dynamically adjust the execution order of quantum gates. This contrasts with traditional static circuit design or gate scheduling methods which often rely on pre-determined strategies and fail to adapt to unforeseen variations in quantum system behavior. The algorithm incorporates a scheduler that continuously monitors circuit output probabilities and adjusts gate timings and sequences to minimize error propagation. The effectiveness of this approach is demonstrated through a theoretical analysis and a conceptual framework, outlining the key components and operational principles. The primary goal is to create a system capable of actively correcting for errors during execution, enhancing the fidelity and reliability of quantum computations. We propose a mathematical framework for describing the adaptive gate scheduling process, utilizing concepts from Markov Chains and Bayesian Optimization to model the uncertainty and optimize the scheduling strategy. The potential impact of this research lies in enabling the design of more robust and reliable quantum algorithms, particularly for complex computations where error mitigation is crucial.