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 Conference on Decision and Control (CDC)

Optimal control protocols can be exponentially accelerated by quantum algorithms

He Sun, Jing Zhang, Re-Bing Wu, HERSCHEL A. RABITZ, Tzyh‐Jong Tarn

Published Dec 1, 2016• 2 citations
Publisher

Abstract

Optimal control is one of the most popular and efficient control strategies that have been widely used in both classical and quantum systems. Inspired by the recent progresses of quantum algorithms, we find that optimal control protocols can be exponentially accelerated by embedding a quantum controller in the control loop instead of the classical controller. This is the first time to our knowledge that a quantum controller has been shown to exponentially improve the efficiency of control compared with classical controller. Our method opens up new perspectives in various fields, especially those related to the synthesis of large-scale complex systems.

DOI
10.1109/cdc.2016.7798682

Related papers

Efficient Quantum Algorithms for Quantum Optimal Control

Xiantao Li, Chunhao Wang

In this paper, we present efficient quantum algorithms that are exponentially faster than classical algorithms for solving the quantum optimal control problem. This problem involves finding the control variable that maximizes a physical quantity at time $T$, where the system is governed by a time-dependent Schrödinger equation. This type of control problem also has an intricate relation with machine learning. Our algorithms are based on a time-dependent Hamiltonian simulation method and a fast gradient-estimation algorithm. We also provide a comprehensive error analysis to quantify the total error from various steps, such as the finite-dimensional representation of the control function, the discretization of the Schrödinger equation, the numerical quadrature, and optimization. Our quantum algorithms require fault-tolerant quantum computers.

arXiv:2304.02613•Apr 5, 2023•5 citations

Fully efficient time-parallelized quantum optimal control algorithm

Mohamed Kamel Riahi, Julien Salomon, Steffen J. Glaser +1 more

We present a time-parallelization method that enables one to accelerate the computation of quantum optimal control algorithms. We show that this approach is approximately fully efficient when based on a gradient method as optimization solver: the computational time is approximately divided by the number of available processors. The control of spin systems, molecular orientation, and Bose-Einstein condensates are used as illustrative examples to highlight the wide range of applications of this numerical scheme.

arXiv:1603.01237•Physical Review A•Apr 13, 2016•24 citations

Efficient Optimal Control of Open Quantum Systems

Wenhao He, Tongyang Li, Xiantao Li +3 more

The optimal control problem for open quantum systems can be formulated as a time-dependent Lindbladian that is parameterized by a number of time-dependent control variables. Given an observable and an initial state, the goal is to tune the control variables so that the expected value of some observable with respect to the final state is maximized. In this paper, we present algorithms for solving this optimal control problem efficiently, i.e., having a poly-logarithmic dependency on the system dimension, which is exponentially faster than best-known classical algorithms. Our algorithms are hybrid, consisting of both quantum and classical components. The quantum procedure simulates time-dependent Lindblad evolution that drives the initial state to the final state, and it also provides access to the gradients of the objective function via quantum gradient estimation. The classical procedure uses the gradient information to update the control variables. At the technical level, we provide the first (to the best of our knowledge) simulation algorithm for time-dependent Lindbladians with an $\ell_1$-norm dependence. As an alternative, we also present a simulation algorithm in the interaction picture to improve the algorithm for the cases where the time-independent component of a Lindbladian dominates the time-dependent part. On the classical side, we heavily adapt the state-of-the-art classical optimization analysis to interface with the quantum part of our algorithms. Both the quantum simulation techniques and the classical optimization analyses might be of independent interest.

arXiv:2405.19245•Leibniz international proceedings in informatics•Jan 1, 2024•8 citations

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

José M. Rodríguez-Borbón, Xian Wang, Adrián Perez Diéguez +2 more

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains. Program summary Program Title: VAN-DAMME CPC Library link to program files:: https://doi.org/10.17632/zcgw2n5bjf.1 Licensing provisions: GNU General Public License 3 Programming language: C++ and CUDA Nature of problem: The VAN-DAMME software package utilizes GPU-accelerated routines and new algorithmic improvements to compute optimized time-dependent magnetic fields that can drive a system from a known initial qubit configuration to a specified target state with a large (≈1) transition probability . Solution method: Quantum control , GPU acceleration, analytic gradients, matrix exponential, and gradient ascent optimization.

Computer Physics Communications•Oct 17, 2024•5 citations

Automated discovery of better quantum machines

Jonas Landgraf

Human intelligence is associated with the ability to perform complex reasoning, find creative solutions to problems, and discover and generalize patterns. Ambitiously, the field of artificial intelligence (AI) aims to enable computer systems to acquire such abilities, and has experienced remarkable progress in recent years. Leveraging these advances for scientific research has the potential to accelerate progress and achieve milestones previously unreachable. In this thesis, we develop and adapt new tools based on AI and numerical optimization to address several challenges in quantum information processing, particularly in quantum control and the design of quantum experiments. Among AI methods, reinforcement learning (RL) provides a framework for discovering optimal strategies for controlling quantum systems without requiring prior knowledge of the system. However, it had been an outstanding challenge to implement and train such an RL-based controller capable of interacting with a quantum experiment in real-time, so on time scales much shorter than the system's coherence time. In our work, we overcome this challenge by deploying a sub-microsecond-latency neural network in a superconducting circuit experiment. Using RL, we train the network exclusively from measurements and show that it can efficiently initialize a superconducting transmon. Next, we experimentally test an improved protocol for the quantum control of a microwave cavity, which promises to completely suppress coherent errors in the so-called SNAP quantum gate. We apply this scheme in a circuit quantum electrodynamics experiment and demonstrate that it reduces the dominant error of the SNAP gate by 53% compared to the original protocol in realistic scenarios. A central challenge and opportunity is to harness AI methods to acquire new scientific knowledge. This is the ambition of the field of artificial scientific discovery. In this spirit, we develop the algorithm AutoScatter to automatically discover new design schemes for signal-processing devices. AutoScatter optimizes the discrete and continuous system parameters to achieve the desired target behavior with the minimum required resources. By using an abstract graph representation, the discovered setups can be interpreted easily, leading to multiple generalizations. Our design concepts are transferable and can be implemented on a variety of hardware platforms, including photonic, microwave, and optomechanical systems. In the last part of this thesis, we extend AutoScatter to the discovery of systems with a periodic lattice structure, leading to new amplifier, isolator, and frequency-demultiplexer schemes. To do so, we base our automated discovery on a transfer-matrix approach, offering a new perspective on non-Hermitian topological systems.

•Jan 1, 2026•0 citations

Optimal Control at the Quantum Speed Limit

Tommaso Caneva, Michael Murphy, Tommaso Calarco +4 more

Optimal control theory is a promising candidate for a drastic improvement of the performance of quantum information tasks. We explore its ultimate limit in paradigmatic cases, and demonstrate that it coincides with the maximum speed limit allowed by quantum evolution.

arXiv:0902.4193•Physical Review Letters•Dec 7, 2009•509 citations
Optimal control is one of the most popular and efficient control strategies that have been widely used in both classical and quantum systems. Inspired by the recent progresses of quantum algorithms, we find that optimal control protocols can be exponentially accelerated by embedding a quantum controller in the control loop instead of the classical controller. This is the first time to our knowledge that a quantum controller has been shown to exponentially improve the efficiency of control compared with classical controller. Our method opens up new perspectives in various fields, especially those related to the synthesis of large-scale complex systems.
In this paper, we present efficient quantum algorithms that are exponentially faster than classical algorithms for solving the quantum optimal control problem. This problem involves finding the control variable that maximizes a physical quantity at time TTT, where the system is governed by a time-dependent Schrödinger equation. This type of control problem also has an intricate relation with machine learning. Our algorithms are based on a time-dependent Hamiltonian simulation method and a fast gradient-estimation algorithm. We also provide a comprehensive error analysis to quantify the total error from various steps, such as the finite-dimensional representation of the control function, the discretization of the Schrödinger equation, the numerical quadrature, and optimization. Our quantum algorithms require fault-tolerant quantum computers.
We present a time-parallelization method that enables one to accelerate the computation of quantum optimal control algorithms. We show that this approach is approximately fully efficient when based on a gradient method as optimization solver: the computational time is approximately divided by the number of available processors. The control of spin systems, molecular orientation, and Bose-Einstein condensates are used as illustrative examples to highlight the wide range of applications of this numerical scheme.
The optimal control problem for open quantum systems can be formulated as a time-dependent Lindbladian that is parameterized by a number of time-dependent control variables. Given an observable and an initial state, the goal is to tune the control variables so that the expected value of some observable with respect to the final state is maximized. In this paper, we present algorithms for solving this optimal control problem efficiently, i.e., having a poly-logarithmic dependency on the system dimension, which is exponentially faster than best-known classical algorithms. Our algorithms are hybrid, consisting of both quantum and classical components. The quantum procedure simulates time-dependent Lindblad evolution that drives the initial state to the final state, and it also provides access to the gradients of the objective function via quantum gradient estimation. The classical procedure uses the gradient information to update the control variables. At the technical level, we provide the first (to the best of our knowledge) simulation algorithm for time-dependent Lindbladians with an ℓ1\ell_1ℓ1​-norm dependence. As an alternative, we also present a simulation algorithm in the interaction picture to improve the algorithm for the cases where the time-independent component of a Lindbladian dominates the time-dependent part. On the classical side, we heavily adapt the state-of-the-art classical optimization analysis to interface with the quantum part of our algorithms. Both the quantum simulation techniques and the classical optimization analyses might be of independent interest.
We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains. Program summary Program Title: VAN-DAMME CPC Library link to program files:: https://doi.org/10.17632/zcgw2n5bjf.1 Licensing provisions: GNU General Public License 3 Programming language: C++ and CUDA Nature of problem: The VAN-DAMME software package utilizes GPU-accelerated routines and new algorithmic improvements to compute optimized time-dependent magnetic fields that can drive a system from a known initial qubit configuration to a specified target state with a large (≈1) transition probability . Solution method: Quantum control , GPU acceleration, analytic gradients, matrix exponential, and gradient ascent optimization.
Human intelligence is associated with the ability to perform complex reasoning, find creative solutions to problems, and discover and generalize patterns. Ambitiously, the field of artificial intelligence (AI) aims to enable computer systems to acquire such abilities, and has experienced remarkable progress in recent years. Leveraging these advances for scientific research has the potential to accelerate progress and achieve milestones previously unreachable. In this thesis, we develop and adapt new tools based on AI and numerical optimization to address several challenges in quantum information processing, particularly in quantum control and the design of quantum experiments. Among AI methods, reinforcement learning (RL) provides a framework for discovering optimal strategies for controlling quantum systems without requiring prior knowledge of the system. However, it had been an outstanding challenge to implement and train such an RL-based controller capable of interacting with a quantum experiment in real-time, so on time scales much shorter than the system's coherence time. In our work, we overcome this challenge by deploying a sub-microsecond-latency neural network in a superconducting circuit experiment. Using RL, we train the network exclusively from measurements and show that it can efficiently initialize a superconducting transmon. Next, we experimentally test an improved protocol for the quantum control of a microwave cavity, which promises to completely suppress coherent errors in the so-called SNAP quantum gate. We apply this scheme in a circuit quantum electrodynamics experiment and demonstrate that it reduces the dominant error of the SNAP gate by 53% compared to the original protocol in realistic scenarios. A central challenge and opportunity is to harness AI methods to acquire new scientific knowledge. This is the ambition of the field of artificial scientific discovery. In this spirit, we develop the algorithm AutoScatter to automatically discover new design schemes for signal-processing devices. AutoScatter optimizes the discrete and continuous system parameters to achieve the desired target behavior with the minimum required resources. By using an abstract graph representation, the discovered setups can be interpreted easily, leading to multiple generalizations. Our design concepts are transferable and can be implemented on a variety of hardware platforms, including photonic, microwave, and optomechanical systems. In the last part of this thesis, we extend AutoScatter to the discovery of systems with a periodic lattice structure, leading to new amplifier, isolator, and frequency-demultiplexer schemes. To do so, we base our automated discovery on a transfer-matrix approach, offering a new perspective on non-Hermitian topological systems.