Quantum Optimal Control via Semi-Automatic Differentiation
arXiv:2205.15044 · doi:10.22331/q-2022-12-07-871
Abstract
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.
30 pages, 2 figures, 2 tables. Accepted in Quantum
References in corpus (12)
- Charge insensitive qubit design derived from the Cooper pair box
- QuTiP 2: A Python framework for the dynamics of open quantum systems
- Quantum information processing with circuit quantum electrodynamics
- Gradient-based optimal control of open quantum systems using quantum trajectories and automatic differentiation
- Protecting coherence in Optimal Control Theory: State dependent constraint approach
- Optimizing for an arbitrary perfect entangler: I. Functionals
- Optimizing for an arbitrary perfect entangler. II. Application
- Lower bounds on the complexity of simulating quantum gates
- A Chebychev propagator for inhomogeneous Schrödinger equations
- Control of Stochastic Quantum Dynamics by Differentiable Programming
- Principles of tractor atom interferometry
- Reducing Memory Requirements of Quantum Optimal Control
Cited by in corpus (19)
- QuTiP 5: The Quantum Toolbox in Python
- GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls
- Dicke State Generation and Extreme Spin Squeezing via Rapid Adiabatic Passage
- Controlling NMR spin systems for quantum computation
- Principles of tractor atom interferometry
- Optimal entanglement generation in optomechanical systems via Krotov control of covariance matrix dynamics
- Optimal control in large open quantum systems: the case of transmon readout and reset
- Optimal control of a Bose-Eintein Condensate in an optical lattice: The non-linear and two-dimensional cases
- Quantum superpositions of current states in Rydberg-atom networks
- Optimal control of large quantum systems: assessing memory and runtime performance of GRAPE
- Comparing planar quantum computing platforms at the quantum speed limit
- Extractable energy from quantum superposition of current states
- Exponentiation of Parametric Hamiltonians via Unitary interpolation
- Monte Carlo approach for finding optimally controlled quantum gates with differential geometry
- Quantum Zeno Dynamics of Two Interacting Particles
- High-Order Hermite Optimization: Fast and Exact Gradient Computation in Open-Loop Quantum Optimal Control using a Discrete Adjoint Approach
- Dipolar optimal control of entangled current states
- GRAPE.jl: Gradient Ascent Pulse Engineering in Julia
- Optimal transfer of entanglement in oscillator chains in non-Markovian open systems