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:1612.04929 · Physical Review A

Speedup for quantum optimal control from automatic differentiation based on graphics processing units

Nelson Leung, Mohamed R. Abdelhafez, Jens Koch, David Schuster

Published Apr 13, 2017• 134 citations
arXivHTMLPDF

Abstract

We implement a quantum optimal control algorithm based on automatic differentiation and harness the acceleration afforded by graphics processing units (GPUs). Automatic differentiation allows us to specify advanced optimization criteria and incorporate them in the optimization process with ease. We show that the use of GPUs can speedup calculations by more than an order of magnitude. Our strategy facilitates efficient numerical simulations on affordable desktop computers and exploration of a host of optimization constraints and system parameters relevant to real-life experiments. We demonstrate optimization of quantum evolution based on fine-grained evaluation of performance at each intermediate time step, thus enabling more intricate control on the evolution path, suppression of departures from the truncated model subspace, as well as minimization of the physical time needed to perform high-fidelity state preparation and unitary gates.

DOI
10.1103/physreva.95.042318

Related papers

Gradient-based optimal control of open quantum systems using quantum trajectories and automatic differentiation

Mohamed R. Abdelhafez, David Schuster, Jens Koch

We present a gradient-based optimal-control technique for open quantum systems that utilizes quantum trajectories to simulate the quantum dynamics during optimization. Using trajectories allows for optimizing open systems with less computational cost than the regular density matrix approaches in most realistic optimization problems. We introduce an improved-sampling algorithm which minimizes the number of trajectories needed per optimization iteration. Together with employing stochastic gradient descent techniques, this reduces the complexity of optimizing many realistic open quantum systems to the complexity encountered with closed systems. Our optimizer harnesses automatic differentiation to provide flexibility in optimization and to suit the different constraints and diverse parameter regimes of real-life experiments. We utilize the optimizer in a variety of applications to demonstrate how the use of quantum trajectories significantly reduces the computation complexity while achieving a multitude of simultaneous optimization targets. Demonstrated targets include high state-transfer fidelities despite dissipation, faster gate times, and maximization of qubit-readout fidelity while maintaining the quantum nondemolition nature of the measurement and allowing for subsequent fast resonator reset.

arXiv:1901.05541•Physical Review A•May 20, 2019•98 citations

Quantum Optimal Control via Semi-Automatic Differentiation

Michael H. Goerz, Sebastian Camilo Carrasco, Vladimir S. Malinovsky

We develop a framework of "semi-automatic differentiation" that combines existing gradient-based methods of quantum optimal control with automatic differentiation. The approach allows to optimize practically any computable functional and is implemented in two open source Julia packages, GRAPE.jl and Krotov.jl , part of the QuantumControl.jl framework. Our method is based on formally rewriting the optimization functional in terms of propagated states, overlaps with target states, or quantum gates. An analytical application of the chain rule then allows to separate the time propagation and the evaluation of the functional when calculating the gradient. The former can be evaluated with great efficiency via a modified GRAPE scheme. The latter is evaluated with automatic differentiation, but with a profoundly reduced complexity compared to the time propagation. Thus, our approach eliminates the prohibitive memory and runtime overhead normally associated with automatic differentiation and facilitates further advancement in quantum control by enabling the direct optimization of non-analytic functionals for quantum information and quantum metrology, especially in open quantum systems. We illustrate and benchmark the use of semi-automatic differentiation for the optimization of perfectly entangling quantum gates on superconducting qubits coupled via a shared transmission line. This includes the first direct optimization of the non-analytic gate concurrence.

arXiv:2205.15044•Quantum•Dec 7, 2022•37 citations

Differentiable Quantum Circuit Simulator

Jincheng Zhang

This paper presents a novel approach to simulating quantum circuits with differentiability, enabling gradient-based optimization for quantum algorithms. The core of the method lies in combining the accuracy of quantum circuit Monte Carlo simulation with the efficiency of automatic differentiation. We introduce a framework where the quantum circuit's evolution is simulated using Monte Carlo techniques, and the resulting expectation values are computed using automatic differentiation. This allows us to calculate gradients with respect to the circuit's parameters, which can then be used with standard optimization algorithms to refine the circuit's design. The key innovation is the seamless integration of these two techniques, offering a pathway to directly optimize quantum circuits for improved performance. The presented methodology provides a foundation for exploring advanced quantum algorithms and improving their efficiency through gradient-based approaches.

•Aug 29, 2026•0 citations

Efficient techniques to GPU Accelerations of Multi-Shot Quantum Computing Simulations

Jun Doi, Hiroshi Horii, Christopher J. Wood

Quantum computers are becoming practical for computing numerous applications. However, simulating quantum computing on classical computers is still demanding yet useful because current quantum computers are limited because of computer resources, hardware limits, instability, and noises. Improving quantum computing simulation performance in classical computers will contribute to the development of quantum computers and their algorithms. Quantum computing simulations on classical computers require long performance times, especially for quantum circuits with a large number of qubits or when simulating a large number of shots for noise simulations or circuits with intermediate measures. Graphical processing units (GPU) are suitable to accelerate quantum computer simulations by exploiting their computational power and high bandwidth memory and they have a large advantage in simulating relatively larger qubits circuits. However, GPUs are inefficient at simulating multi-shots runs with noises because the randomness prevents highly parallelization. In addition, GPUs have a disadvantage in simulating circuits with a small number of qubits because of the large overheads in GPU kernel execution. In this paper, we introduce optimization techniques for multi-shot simulations on GPUs. We gather multiple shots of simulations into a single GPU kernel execution to reduce overheads by scheduling randomness caused by noises. In addition, we introduce shot-branching that reduces calculations and memory usage for multi-shot simulations. By using these techniques, we speed up x10 from previous implementations.

arXiv:2308.03399•Aug 7, 2023•21 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•International Conference on Communication Systems & Networks (COMSNETS)•Jan 6, 2025•7 citations

Quantum Computing with Distributed Modules

Leung, Nelson

This thesis describes our work on optimizing quantum control and scaling up quantum computers. We demonstrate the application of automatic differentiation in quantum optimal control, which allows us to specify advanced optimization criteria and incorporate them in the optimization process of quantum control with ease. These criteria enable more intricate control on the evolution path, suppression of departures from the truncated model subspace, as well as minimization of the physical time needed to perform high-fidelity state preparation and unitary gates. We subsequently present our experimental efforts in efficiently scaling up a quantum computer. The innovation of quantum random access memory (qRAM) architecture with multimode circuit QED establishes a promising path towards expanding the information processing power of a quantum device, without introducing control-resources overhead. Using a single Josephson junction transmon circuit serving as the central processor, we demonstrate universal operations on a nine-qubit random access memory. We further present our experimental results in establishing bidirectional and deterministic photonic communication between two remote superconducting multimode processors, connected through a one-meter long coaxial cable. This device demonstrates a prototype of setting up a scalable and distributed quantum computing cluster that could solve a harder computational problem.

•Mar 1, 2019•1 citation
We implement a quantum optimal control algorithm based on automatic differentiation and harness the acceleration afforded by graphics processing units (GPUs). Automatic differentiation allows us to specify advanced optimization criteria and incorporate them in the optimization process with ease. We show that the use of GPUs can speedup calculations by more than an order of magnitude. Our strategy facilitates efficient numerical simulations on affordable desktop computers and exploration of a host of optimization constraints and system parameters relevant to real-life experiments. We demonstrate optimization of quantum evolution based on fine-grained evaluation of performance at each intermediate time step, thus enabling more intricate control on the evolution path, suppression of departures from the truncated model subspace, as well as minimization of the physical time needed to perform high-fidelity state preparation and unitary gates.
We present a gradient-based optimal-control technique for open quantum systems that utilizes quantum trajectories to simulate the quantum dynamics during optimization. Using trajectories allows for optimizing open systems with less computational cost than the regular density matrix approaches in most realistic optimization problems. We introduce an improved-sampling algorithm which minimizes the number of trajectories needed per optimization iteration. Together with employing stochastic gradient descent techniques, this reduces the complexity of optimizing many realistic open quantum systems to the complexity encountered with closed systems. Our optimizer harnesses automatic differentiation to provide flexibility in optimization and to suit the different constraints and diverse parameter regimes of real-life experiments. We utilize the optimizer in a variety of applications to demonstrate how the use of quantum trajectories significantly reduces the computation complexity while achieving a multitude of simultaneous optimization targets. Demonstrated targets include high state-transfer fidelities despite dissipation, faster gate times, and maximization of qubit-readout fidelity while maintaining the quantum nondemolition nature of the measurement and allowing for subsequent fast resonator reset.
We develop a framework of "semi-automatic differentiation" that combines existing gradient-based methods of quantum optimal control with automatic differentiation. The approach allows to optimize practically any computable functional and is implemented in two open source Julia packages, GRAPE.jl and Krotov.jl , part of the QuantumControl.jl framework. Our method is based on formally rewriting the optimization functional in terms of propagated states, overlaps with target states, or quantum gates. An analytical application of the chain rule then allows to separate the time propagation and the evaluation of the functional when calculating the gradient. The former can be evaluated with great efficiency via a modified GRAPE scheme. The latter is evaluated with automatic differentiation, but with a profoundly reduced complexity compared to the time propagation. Thus, our approach eliminates the prohibitive memory and runtime overhead normally associated with automatic differentiation and facilitates further advancement in quantum control by enabling the direct optimization of non-analytic functionals for quantum information and quantum metrology, especially in open quantum systems. We illustrate and benchmark the use of semi-automatic differentiation for the optimization of perfectly entangling quantum gates on superconducting qubits coupled via a shared transmission line. This includes the first direct optimization of the non-analytic gate concurrence.
This paper presents a novel approach to simulating quantum circuits with differentiability, enabling gradient-based optimization for quantum algorithms. The core of the method lies in combining the accuracy of quantum circuit Monte Carlo simulation with the efficiency of automatic differentiation. We introduce a framework where the quantum circuit's evolution is simulated using Monte Carlo techniques, and the resulting expectation values are computed using automatic differentiation. This allows us to calculate gradients with respect to the circuit's parameters, which can then be used with standard optimization algorithms to refine the circuit's design. The key innovation is the seamless integration of these two techniques, offering a pathway to directly optimize quantum circuits for improved performance. The presented methodology provides a foundation for exploring advanced quantum algorithms and improving their efficiency through gradient-based approaches.
Quantum computers are becoming practical for computing numerous applications. However, simulating quantum computing on classical computers is still demanding yet useful because current quantum computers are limited because of computer resources, hardware limits, instability, and noises. Improving quantum computing simulation performance in classical computers will contribute to the development of quantum computers and their algorithms. Quantum computing simulations on classical computers require long performance times, especially for quantum circuits with a large number of qubits or when simulating a large number of shots for noise simulations or circuits with intermediate measures. Graphical processing units (GPU) are suitable to accelerate quantum computer simulations by exploiting their computational power and high bandwidth memory and they have a large advantage in simulating relatively larger qubits circuits. However, GPUs are inefficient at simulating multi-shots runs with noises because the randomness prevents highly parallelization. In addition, GPUs have a disadvantage in simulating circuits with a small number of qubits because of the large overheads in GPU kernel execution. In this paper, we introduce optimization techniques for multi-shot simulations on GPUs. We gather multiple shots of simulations into a single GPU kernel execution to reduce overheads by scheduling randomness caused by noises. In addition, we introduce shot-branching that reduces calculations and memory usage for multi-shot simulations. By using these techniques, we speed up x10 from previous implementations.
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 thesis describes our work on optimizing quantum control and scaling up quantum computers. We demonstrate the application of automatic differentiation in quantum optimal control, which allows us to specify advanced optimization criteria and incorporate them in the optimization process of quantum control with ease. These criteria enable more intricate control on the evolution path, suppression of departures from the truncated model subspace, as well as minimization of the physical time needed to perform high-fidelity state preparation and unitary gates. We subsequently present our experimental efforts in efficiently scaling up a quantum computer. The innovation of quantum random access memory (qRAM) architecture with multimode circuit QED establishes a promising path towards expanding the information processing power of a quantum device, without introducing control-resources overhead. Using a single Josephson junction transmon circuit serving as the central processor, we demonstrate universal operations on a nine-qubit random access memory. We further present our experimental results in establishing bidirectional and deterministic photonic communication between two remote superconducting multimode processors, connected through a one-meter long coaxial cable. This device demonstrates a prototype of setting up a scalable and distributed quantum computing cluster that could solve a harder computational problem.