Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2509.08555 · New Journal of Physics

Benchmarking optimization algorithms for automated calibration of quantum devices

Kevin Pack, Shai Machnes, Frank K. Wilhelm

Published May 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Abstract We present the results of a comprehensive study of optimization algorithms for the calibration of quantum devices. As part of our ongoing efforts to automate bring-up, tune-up, and system identification procedures, we investigate a broad range of optimizers within a simulated environment designed to closely mimic the challenges of real-world experimental conditions. Our benchmark includes widely used algorithms such as Nelder–Mead and the state-of-the-art covariance matrix adaptation evolution strategy (CMA-ES). We evaluate performance in both low-dimensional settings, representing simple pulse shapes used in current optimal control protocols with a limited number of parameters, and high-dimensional regimes, which reflect the demands of complex control pulses with many parameters. Based on our findings, we recommend the CMA-ES algorithm and provide empirical evidence for its superior performance across all tested scenarios.

DOI
10.1088/1367-2630/ae6c54

Related papers

Performance comparison of optimization methods on variational quantum algorithms

Xavier Bonet-Monroig, Hao Wang, Diederick Vermetten +5 more

Variational quantum algorithms (VQAs) offer a promising path toward using near-term quantum hardware for applications in academic and industrial research. These algorithms aim to find approximate solutions to quantum problems by optimizing a parametrized quantum circuit using a classical optimization algorithm. A successful VQA requires fast and reliable classical optimization algorithms. Understanding and optimizing how off-the-shelf optimization methods perform in this context is important for the future of the field. In this work, we study the performance of four commonly used gradient-free optimization methods [sequential least-squares quadratic programming, constrained optimization by linear approximations, the covariance matrix adaptation evolutionary strategy (CMA-ES), and the simultaneous perturbation stochastic approximation (SPSA)] to find ground-state energies of a range of small chemistry and material science problems. We test a telescoping sampling scheme (where the accuracy of the cost-function estimate provided to the optimizer is increased as the optimization converges) for all methods, demonstrating mixed results across our range of optimizers and problems chosen. We further hyperparameter tune two of the four optimizers (CMA-ES and SPSA) across a large range of models and demonstrate that with appropriate hyperparameter tuning, CMA-ES is competitive with and sometimes outperforms SPSA (which is not observed in the absence of hyperparameter tuning). Finally, we investigate the ability of an optimizer to beat the ``sampling-noise floor'' given by the sampling noise of each cost-function estimate provided to the optimizer. Our results demonstrate the necessity for tailoring and hyperparameter tuning known optimization techniques for inherently noisy variational quantum algorithms and that the variational landscape that one finds in a VQA is highly problem and system dependent. This provides guidance for future implementations of these algorithms in experiments.

arXiv:2111.13454•Physical Review A•Mar 7, 2023•114 citations

Software tool-set for automated quantum system identification and device bring up

Anurag Saha Roy, Kevin Pack, Nicolas Wittler +1 more

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.

arXiv:2205.04829•Jan 6, 2025•2 citations

Performance analysis of derandomized evolution strategies in quantum control experiments

Ofer M. Shir, Jonathan Roslund, Thomas Bäck +1 more

Genetic Algorithms (GAs) are historically the most commonly used optimization method in Quantum Control (QC) experiments. We transfer specific Derandomized Evolution Strategies (DES) that have performed well on noise-free theoretical Quantum Control calculations, including the Covariance Matrix Adaptation (CMA-ES) algorithm, into the noisy environment of Quantum Control experiments. We study the performance of these DES variants in laboratory experiments, and reveal the underlying strategy dynamics of first- versus second-order landscape information.

Genetic and Evolutionary Computation Conference (GECCO)•Jul 12, 2008•4 citations

Benchmarking the operation of quantum heuristics and Ising machines: scoring parameter setting strategies on optimization applications

David E. Bernal, Robin Brown, Pratik Sathe +4 more

We discuss guidelines for evaluating the performance of parameterized stochastic solvers for optimization problems, with particular attention to systems that employ novel hardware, such as digital quantum processors running variational algorithms, analog processors performing quantum annealing, or coherent Ising machines. We illustrate through an example a benchmarking procedure grounded in the statistical analysis of the expectation of a given performance metric measured in a test environment. In particular, we discuss the necessity and cost of setting parameters that affect the algorithm's performance. The optimal value of these parameters could vary significantly between instances of the same target problem. We present an open-source software package that facilitates the design, evaluation, and visualization of practical parameter tuning strategies for the complex use of the heterogeneous components of the solver. We examine in detail an example using parallel tempering and a simulator of a photonic coherent Ising machine computing and display the scoring of an illustrative baseline family of parameter setting strategies that feature an exploration-exploitation trade-off.

arXiv:2402.10255•Quantum Machine Intelligence•Sep 5, 2025•8 citations

Fast Quantum Calibration using Bayesian Optimization with State Parameter Estimator for Non-Markovian Environment

Qian, Peng, Qamar, Shahid, Xiao Xiao +5 more

As quantum systems expand in size and complexity, manual qubit characterization and gate optimization will be a non-scalable and time-consuming venture. Physical qubits have to be carefully calibrated because quantum processors are very sensitive to the external environment, with control hardware parameters slowly drifting during operation, affecting gate fidelity. Currently, existing calibration techniques require complex and lengthy measurements to independently control the different parameters of each gate and are unscalable to large quantum systems. Therefore, fully automated protocols with the desired functionalities are required to speed up the calibration process. This paper aims to propose single-qubit calibration of superconducting qubits under continuous weak measurements from a real physical experimental settings point of view. 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. Using the proposed estimator we estimated the qubit state with and without measurement noise and the estimation error between the qubit state and the estimator state is less than 0.02. With this setup, we drive an approximated pi pulse with final fidelity of 0.9928. This shows that our proposed strategy is robust against the presence of measurement and environmental noise and can also be applicable for the calibration of many other quantum computation technologies.

arXiv:2205.12929•May 25, 2022•1 citation

Self-Adaptive Quantum Field Optimization Algorithm

Jincheng Zhang

The current landscape of quantum field theory faces significant challenges in achieving precise control and optimization of complex quantum fields. Traditional optimization algorithms often struggle with high dimensionality and non-linearity, leading to suboptimal solutions. This paper introduces a novel self-adaptive quantum field optimization algorithm that leverages the unique properties of dynamic quantum fields to dynamically adjust parameters and achieve accurate control and optimization. We detail the core mechanism, including the use of a dynamic feedback loop, to automatically tune the quantum field based on input data, effectively addressing the limitations of static optimization techniques. The algorithm demonstrates significant improvements in optimization performance compared to existing methods across various benchmark problems.

•Aug 29, 2026•0 citations
Abstract We present the results of a comprehensive study of optimization algorithms for the calibration of quantum devices. As part of our ongoing efforts to automate bring-up, tune-up, and system identification procedures, we investigate a broad range of optimizers within a simulated environment designed to closely mimic the challenges of real-world experimental conditions. Our benchmark includes widely used algorithms such as Nelder–Mead and the state-of-the-art covariance matrix adaptation evolution strategy (CMA-ES). We evaluate performance in both low-dimensional settings, representing simple pulse shapes used in current optimal control protocols with a limited number of parameters, and high-dimensional regimes, which reflect the demands of complex control pulses with many parameters. Based on our findings, we recommend the CMA-ES algorithm and provide empirical evidence for its superior performance across all tested scenarios.
Variational quantum algorithms (VQAs) offer a promising path toward using near-term quantum hardware for applications in academic and industrial research. These algorithms aim to find approximate solutions to quantum problems by optimizing a parametrized quantum circuit using a classical optimization algorithm. A successful VQA requires fast and reliable classical optimization algorithms. Understanding and optimizing how off-the-shelf optimization methods perform in this context is important for the future of the field. In this work, we study the performance of four commonly used gradient-free optimization methods [sequential least-squares quadratic programming, constrained optimization by linear approximations, the covariance matrix adaptation evolutionary strategy (CMA-ES), and the simultaneous perturbation stochastic approximation (SPSA)] to find ground-state energies of a range of small chemistry and material science problems. We test a telescoping sampling scheme (where the accuracy of the cost-function estimate provided to the optimizer is increased as the optimization converges) for all methods, demonstrating mixed results across our range of optimizers and problems chosen. We further hyperparameter tune two of the four optimizers (CMA-ES and SPSA) across a large range of models and demonstrate that with appropriate hyperparameter tuning, CMA-ES is competitive with and sometimes outperforms SPSA (which is not observed in the absence of hyperparameter tuning). Finally, we investigate the ability of an optimizer to beat the ``sampling-noise floor'' given by the sampling noise of each cost-function estimate provided to the optimizer. Our results demonstrate the necessity for tailoring and hyperparameter tuning known optimization techniques for inherently noisy variational quantum algorithms and that the variational landscape that one finds in a VQA is highly problem and system dependent. This provides guidance for future implementations of these algorithms in experiments.
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.
Genetic Algorithms (GAs) are historically the most commonly used optimization method in Quantum Control (QC) experiments. We transfer specific Derandomized Evolution Strategies (DES) that have performed well on noise-free theoretical Quantum Control calculations, including the Covariance Matrix Adaptation (CMA-ES) algorithm, into the noisy environment of Quantum Control experiments. We study the performance of these DES variants in laboratory experiments, and reveal the underlying strategy dynamics of first- versus second-order landscape information.
We discuss guidelines for evaluating the performance of parameterized stochastic solvers for optimization problems, with particular attention to systems that employ novel hardware, such as digital quantum processors running variational algorithms, analog processors performing quantum annealing, or coherent Ising machines. We illustrate through an example a benchmarking procedure grounded in the statistical analysis of the expectation of a given performance metric measured in a test environment. In particular, we discuss the necessity and cost of setting parameters that affect the algorithm's performance. The optimal value of these parameters could vary significantly between instances of the same target problem. We present an open-source software package that facilitates the design, evaluation, and visualization of practical parameter tuning strategies for the complex use of the heterogeneous components of the solver. We examine in detail an example using parallel tempering and a simulator of a photonic coherent Ising machine computing and display the scoring of an illustrative baseline family of parameter setting strategies that feature an exploration-exploitation trade-off.
As quantum systems expand in size and complexity, manual qubit characterization and gate optimization will be a non-scalable and time-consuming venture. Physical qubits have to be carefully calibrated because quantum processors are very sensitive to the external environment, with control hardware parameters slowly drifting during operation, affecting gate fidelity. Currently, existing calibration techniques require complex and lengthy measurements to independently control the different parameters of each gate and are unscalable to large quantum systems. Therefore, fully automated protocols with the desired functionalities are required to speed up the calibration process. This paper aims to propose single-qubit calibration of superconducting qubits under continuous weak measurements from a real physical experimental settings point of view. 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. Using the proposed estimator we estimated the qubit state with and without measurement noise and the estimation error between the qubit state and the estimator state is less than 0.02. With this setup, we drive an approximated pi pulse with final fidelity of 0.9928. This shows that our proposed strategy is robust against the presence of measurement and environmental noise and can also be applicable for the calibration of many other quantum computation technologies.
The current landscape of quantum field theory faces significant challenges in achieving precise control and optimization of complex quantum fields. Traditional optimization algorithms often struggle with high dimensionality and non-linearity, leading to suboptimal solutions. This paper introduces a novel self-adaptive quantum field optimization algorithm that leverages the unique properties of dynamic quantum fields to dynamically adjust parameters and achieve accurate control and optimization. We detail the core mechanism, including the use of a dynamic feedback loop, to automatically tune the quantum field based on input data, effectively addressing the limitations of static optimization techniques. The algorithm demonstrates significant improvements in optimization performance compared to existing methods across various benchmark problems.