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

IEEE International Conference on Quantum Computing and Engineering (QCE)

Sum-of-Squares Bounds for Quantum Optimal Control

Flemming Holtorf, Frank Schäfer, Julian Arnold, Christopher Rackauckas, Alan S. Edelman

Published Sep 17, 2023• 0 citations
Publisher

Abstract

The precise control of devices on the quantum scale is crucial for all quantum computing applications. The limitations of quantum control are therefore of great interest to those developing quantum hardware or researching quantum information protocols. We show how moment-sum-of-squares techniques can be combined with quantum dynamics and filtering theory to construct a hierarchy of convex optimization problems that furnish hard, computable bounds on the best achievable performance in quantum control tasks. These bounds can serve as witnesses of fundamental limitations, certificates of optimality, or performance targets and thus complement existing controller design strategies. In particular, our work allows us to compute bounds for common quantum control tasks, such as maximizing the fidelity of the final quantum state relative to a target state given a finite time budget or finding the minimum time required to reach the target state with near-unit fidelity. Our work also naturally applies to feedback-controlled quantum systems subjected to continuous observations, e.g., homodyne detection or photon counting, which are of emerging interest for the next generation of quantum devices. We provide an open-source package, MarkovBounds.jl, that is built upon the optimization ecosystem in the Julia programming language and exposes a high-level interface to the proposed bounding framework.

DOI
10.1109/qce57702.2023.10284

Related papers

Performance Bounds for Quantum Feedback Control

Flemming Holtorf, Frank Schäfer, Julian Arnold +2 more

The limits of quantum feedback control have immediate consequences for quantum information science at large, yet remain largely unexplored. Here, we combine quantum filtering theory and moment-sum-of-squares techniques to construct a hierarchy of convex optimization problems that furnish monotonically improving, computable bounds on the best attainable performance for a broad class of quantum feedback control problems. These bounds may serve as witnesses of fundamental limitations, optimality certificates, or performance targets. We prove convergence of the bounds to the optimal control performance under technical conditions and demonstrate the practical utility of our approach by designing certifiably near-optimal controllers for a qubit in a cavity subjected to photon counting and homodyne detection measurements.

arXiv:2304.03366•IEEE Transactions on Automatic Control•Jun 18, 2024•1 citation

Conservation-Law-Based Global Bounds to Quantum Optimal Control

Hanwen Zhang, Zeyu Kuang, Shruti Puri +1 more

Active control of quantum systems enables diverse applications ranging from quantum computation to manipulation of molecular processes. Maximum speeds and related bounds have been identified from uncertainty principles and related inequalities, but such bounds utilize only coarse system information and loosen significantly in the presence of constraints and complex interaction dynamics. We show that an integral-equation-based formulation of conservation laws in quantum dynamics leads to a systematic framework for identifying fundamental limits to any quantum control scenario. We demonstrate the utility of our bounds in three scenarios-three-level driving, decoherence suppression, and maximum-fidelity gate implementations-and show that in each case our bounds are tight or nearly so. Global bounds complement local-optimization-based designs, illuminating performance levels that may be possible, as well as those that cannot be surpassed.

arXiv:2105.06054•Physical Review Letters•Sep 10, 2021•12 citations

Software tools for quantum control: improving quantum computer performance through noise and error suppression

Harrison Ball, Michael J. Biercuk, Andre R. R. Carvalho +10 more

Abstract Effectively manipulating quantum computing (QC) hardware in the presence of imperfect devices and control systems is a central challenge in realizing useful quantum computers. Susceptibility to noise critically limits the performance and capabilities of today’s so-called noisy intermediate-scale quantum devices, as well as any future QC technologies. Fortunately, quantum control enables efficient execution of quantum logic operations and quantum algorithms with built-in robustness to errors, and without the need for complex logical encoding. In this manuscript we introduce software tools for the application and integration of quantum control in QC research, serving the needs of hardware R&D teams, algorithm developers, and end users. We provide an overview of a set of Python-based classical software tools for creating and deploying optimized quantum control solutions at various layers of the QC software stack. We describe a software architecture leveraging both high-performance distributed cloud computation and local custom integration into hardware systems, and explain how key functionality is integrable with other software packages and quantum programming languages. Our presentation includes a detailed mathematical overview of key features including a flexible optimization toolkit, engineering-inspired filter functions for analyzing noise susceptibility in high-dimensional Hilbert spaces, and new approaches to noise and hardware characterization. Pseudocode is presented in order to elucidate common programming workflows for these tasks, and performance benchmarking is reported for numerically intensive tasks, highlighting the benefits of the selected cloud-compute architecture. Finally, we present a series of case studies demonstrating the application of quantum control solutions derived from these tools in real experimental settings using both trapped-ion and superconducting quantum computer hardware.

arXiv:2001.04060•Quantum Science and Technology•Jan 18, 2021•113 citations

Computational techniques for optimal control of quantum systems

Evangelos A. Coutsias, G. von Winckel

The control of matter and energy at a fundamental level will be a cornerstone of new technologies for years to come. This idea is exemplified in a distilled form by controlling the dynamics of quantum mechanical systems via a time-dependent potential. The contributions detailed within this work focus on the computational aspects of formulating and solving quantum control problems efficiently. The accurate numerical computation of optimal controls of infinite dimensional quantum control problems is a very difficult task that requires to take into account the features of the original infinite dimensional problem. An important issue is the choice of the functional space where the minimization process is defined. A systematic comparison of L2 versus H1 based minimization shows that the choice of the appropriate functional space matters and has many consequences in the implementation of some optimization techniques. A matrix-free cascadic BFGS algorithm is introduced in the L 2 and H1 settings and it is demonstrated that the choice of H1 over L2 results in a substantial performance and robustness increase. A comparison between optimal control resulting from function space minimization and the control obtained by minimization over Chebyshev and POD basis function coefficients is presented. A theoretical and computational framework is presented to obtain accurate controls for fast quantum state transitions that are needed in a host of applications such as nano electronic devices and quantum computing. This method is based on a reduced Hessian Krylov-Newton scheme applied to a norm-preserving discrete model of a dipole quantum control problem. The use of second-order numerical methods for solving the control problem is justified proving existence of optimal solutions and analyzing first- and second-order optimality conditions. Criteria for the discretization of the non-convex optimization problem and for the formulation of the Hessian are given to ensure accurate gradients and a symmetric Hessian. Robustness of the Newton approach is obtained using a globalization strategy with a robust linesearch procedure. Results of numerical experiments demonstrate that the Newton approach presented in this dissertation is able to provide fast and accurate controls for high-energy state transitions. Control of bound-to-bound and bound-to-continuum transitions in open quantum systems and vector field control of two-dimensional systems is presented. An efficient space-time spectral discretization of the time-dependent Schrodinger equation and preconditioning strategy for a fast approximate solution with Krylov methods is outlined.

•Jan 1, 2011•0 citations

Quantum Control and Statistical Information

Maison Clouâtré

Quantum control plays a crucial role in quantum inference tasks such as parameter estimation and state discrimination. Despite this, the fields of quantum control and quantum inference have remained largely disjoint. We bridge these fields, revealing that (i) quantum control determines the fundamental performance limits of quantum estimation and state discrimination, and (ii) control of statistical information measures enables performance approaching these limits. This thesis begins by establishing an axiomatic formalization of quantum control theory and developing a mathematical framework for analyzing, approximating, and controlling the evolution of quantum systems. A self-contained treatment of optimal quantum control is presented. This treatment exploits the unique structure of quantum dynamics rather than merely borrowing notions from classical control. Quantum control systems are shown to be universally contractive, which plays an important role in the treatment of optimal quantum control and in the derivation of various approximation results. Next, the thesis proceeds by addressing statistical inference problems, with emphasis on parameter estimation and state discrimination. Controlled information measures are introduced, providing more sensible alternatives to existing information measures for quantum inference, e.g., quantum Fisher information. Controlled information measures are shown to exhibit useful properties, e.g., data-processing inequalities. Methods for deriving achievability and converse bounds on controlled information measures are developed, and adaptive control techniques for information maximization are proposed. This thesis leverages a cross-pollination of control theory, statistical inference, and quantum information towards the development of an application-focused theory of quantum inference.

•Feb 1, 2026•0 citations

A Discrete Invitation to Quantum Filtering and Feedback Control

Luc Bouten, Ramon van Handel, M. R. James

The engineering and control of devices at the quantum mechanical level—such as those consisting of small numbers of atoms and photons—is a delicate business. The fundamental uncertainty that is inherently present at this scale manifests itself in the unavoidable presence of noise, making this a novel field of application for stochastic estimation and control theory. In this expository paper we demonstrate estimation and feedback control of quantum mechanical systems in what is essentially a noncommutative version of the binomial model that is popular in mathematical finance. The model is extremely rich and allows a full development of the theory while remaining completely within the setting of finite-dimensional Hilbert spaces (thus avoiding the technical complications of the continuous theory). We introduce discretized models of an atom in interaction with the electromagnetic field, obtain filtering equations for photon counting and homodyne detection, and solve a stochastic control problem using dynamic programming and Lyapunov function methods.

arXiv:math/0606118•SIAM Review•May 1, 2009•89 citations
The precise control of devices on the quantum scale is crucial for all quantum computing applications. The limitations of quantum control are therefore of great interest to those developing quantum hardware or researching quantum information protocols. We show how moment-sum-of-squares techniques can be combined with quantum dynamics and filtering theory to construct a hierarchy of convex optimization problems that furnish hard, computable bounds on the best achievable performance in quantum control tasks. These bounds can serve as witnesses of fundamental limitations, certificates of optimality, or performance targets and thus complement existing controller design strategies. In particular, our work allows us to compute bounds for common quantum control tasks, such as maximizing the fidelity of the final quantum state relative to a target state given a finite time budget or finding the minimum time required to reach the target state with near-unit fidelity. Our work also naturally applies to feedback-controlled quantum systems subjected to continuous observations, e.g., homodyne detection or photon counting, which are of emerging interest for the next generation of quantum devices. We provide an open-source package, MarkovBounds.jl, that is built upon the optimization ecosystem in the Julia programming language and exposes a high-level interface to the proposed bounding framework.
The limits of quantum feedback control have immediate consequences for quantum information science at large, yet remain largely unexplored. Here, we combine quantum filtering theory and moment-sum-of-squares techniques to construct a hierarchy of convex optimization problems that furnish monotonically improving, computable bounds on the best attainable performance for a broad class of quantum feedback control problems. These bounds may serve as witnesses of fundamental limitations, optimality certificates, or performance targets. We prove convergence of the bounds to the optimal control performance under technical conditions and demonstrate the practical utility of our approach by designing certifiably near-optimal controllers for a qubit in a cavity subjected to photon counting and homodyne detection measurements.
Active control of quantum systems enables diverse applications ranging from quantum computation to manipulation of molecular processes. Maximum speeds and related bounds have been identified from uncertainty principles and related inequalities, but such bounds utilize only coarse system information and loosen significantly in the presence of constraints and complex interaction dynamics. We show that an integral-equation-based formulation of conservation laws in quantum dynamics leads to a systematic framework for identifying fundamental limits to any quantum control scenario. We demonstrate the utility of our bounds in three scenarios-three-level driving, decoherence suppression, and maximum-fidelity gate implementations-and show that in each case our bounds are tight or nearly so. Global bounds complement local-optimization-based designs, illuminating performance levels that may be possible, as well as those that cannot be surpassed.
Abstract Effectively manipulating quantum computing (QC) hardware in the presence of imperfect devices and control systems is a central challenge in realizing useful quantum computers. Susceptibility to noise critically limits the performance and capabilities of today’s so-called noisy intermediate-scale quantum devices, as well as any future QC technologies. Fortunately, quantum control enables efficient execution of quantum logic operations and quantum algorithms with built-in robustness to errors, and without the need for complex logical encoding. In this manuscript we introduce software tools for the application and integration of quantum control in QC research, serving the needs of hardware R&D teams, algorithm developers, and end users. We provide an overview of a set of Python-based classical software tools for creating and deploying optimized quantum control solutions at various layers of the QC software stack. We describe a software architecture leveraging both high-performance distributed cloud computation and local custom integration into hardware systems, and explain how key functionality is integrable with other software packages and quantum programming languages. Our presentation includes a detailed mathematical overview of key features including a flexible optimization toolkit, engineering-inspired filter functions for analyzing noise susceptibility in high-dimensional Hilbert spaces, and new approaches to noise and hardware characterization. Pseudocode is presented in order to elucidate common programming workflows for these tasks, and performance benchmarking is reported for numerically intensive tasks, highlighting the benefits of the selected cloud-compute architecture. Finally, we present a series of case studies demonstrating the application of quantum control solutions derived from these tools in real experimental settings using both trapped-ion and superconducting quantum computer hardware.
The control of matter and energy at a fundamental level will be a cornerstone of new technologies for years to come. This idea is exemplified in a distilled form by controlling the dynamics of quantum mechanical systems via a time-dependent potential. The contributions detailed within this work focus on the computational aspects of formulating and solving quantum control problems efficiently. The accurate numerical computation of optimal controls of infinite dimensional quantum control problems is a very difficult task that requires to take into account the features of the original infinite dimensional problem. An important issue is the choice of the functional space where the minimization process is defined. A systematic comparison of L2 versus H1 based minimization shows that the choice of the appropriate functional space matters and has many consequences in the implementation of some optimization techniques. A matrix-free cascadic BFGS algorithm is introduced in the L 2 and H1 settings and it is demonstrated that the choice of H1 over L2 results in a substantial performance and robustness increase. A comparison between optimal control resulting from function space minimization and the control obtained by minimization over Chebyshev and POD basis function coefficients is presented. A theoretical and computational framework is presented to obtain accurate controls for fast quantum state transitions that are needed in a host of applications such as nano electronic devices and quantum computing. This method is based on a reduced Hessian Krylov-Newton scheme applied to a norm-preserving discrete model of a dipole quantum control problem. The use of second-order numerical methods for solving the control problem is justified proving existence of optimal solutions and analyzing first- and second-order optimality conditions. Criteria for the discretization of the non-convex optimization problem and for the formulation of the Hessian are given to ensure accurate gradients and a symmetric Hessian. Robustness of the Newton approach is obtained using a globalization strategy with a robust linesearch procedure. Results of numerical experiments demonstrate that the Newton approach presented in this dissertation is able to provide fast and accurate controls for high-energy state transitions. Control of bound-to-bound and bound-to-continuum transitions in open quantum systems and vector field control of two-dimensional systems is presented. An efficient space-time spectral discretization of the time-dependent Schrodinger equation and preconditioning strategy for a fast approximate solution with Krylov methods is outlined.
Quantum control plays a crucial role in quantum inference tasks such as parameter estimation and state discrimination. Despite this, the fields of quantum control and quantum inference have remained largely disjoint. We bridge these fields, revealing that (i) quantum control determines the fundamental performance limits of quantum estimation and state discrimination, and (ii) control of statistical information measures enables performance approaching these limits. This thesis begins by establishing an axiomatic formalization of quantum control theory and developing a mathematical framework for analyzing, approximating, and controlling the evolution of quantum systems. A self-contained treatment of optimal quantum control is presented. This treatment exploits the unique structure of quantum dynamics rather than merely borrowing notions from classical control. Quantum control systems are shown to be universally contractive, which plays an important role in the treatment of optimal quantum control and in the derivation of various approximation results. Next, the thesis proceeds by addressing statistical inference problems, with emphasis on parameter estimation and state discrimination. Controlled information measures are introduced, providing more sensible alternatives to existing information measures for quantum inference, e.g., quantum Fisher information. Controlled information measures are shown to exhibit useful properties, e.g., data-processing inequalities. Methods for deriving achievability and converse bounds on controlled information measures are developed, and adaptive control techniques for information maximization are proposed. This thesis leverages a cross-pollination of control theory, statistical inference, and quantum information towards the development of an application-focused theory of quantum inference.
The engineering and control of devices at the quantum mechanical level—such as those consisting of small numbers of atoms and photons—is a delicate business. The fundamental uncertainty that is inherently present at this scale manifests itself in the unavoidable presence of noise, making this a novel field of application for stochastic estimation and control theory. In this expository paper we demonstrate estimation and feedback control of quantum mechanical systems in what is essentially a noncommutative version of the binomial model that is popular in mathematical finance. The model is extremely rich and allows a full development of the theory while remaining completely within the setting of finite-dimensional Hilbert spaces (thus avoiding the technical complications of the continuous theory). We introduce discretized models of an atom in interaction with the electromagnetic field, obtain filtering equations for photon counting and homodyne detection, and solve a stochastic control problem using dynamic programming and Lyapunov function methods.