Optimal Control for Closed and Open System Quantum Optimization

Abstract

We provide a rigorous analysis of the quantum optimal control problem in the setting of a linear combination $s(t)B+(1-s(t))C$ of two noncommuting Hamiltonians $B$ and $C$. This includes both quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA). The target is to minimize the energy of the final ``problem'' Hamiltonian $C$, for a time-dependent and bounded control schedule $s(t)\in [0,1]$ and $t\in \mc{I}:= [0,t_f]$. It was recently shown, in a purely closed system setting, that the optimal solution to this problem is a ``bang-anneal-bang'' schedule, with the bangs characterized by $s(t)=0$ and $s(t)=1$ in finite subintervals of $\mc{I}$, in particular $s(0)=0$ and $s(t_f)=1$, in contrast to the standard prescription $s(0)=1$ and $s(t_f)=0$ of quantum annealing. Here we extend this result to the open system setting, where the system is described by a density matrix rather than a pure state. This is the natural setting for experimental realizations of QA and QAOA. For finite-dimensional environments and without any approximations we identify sufficient conditions ensuring that either the bang-anneal, anneal-bang, or bang-anneal-bang schedules are optimal, and recover the optimality of $s(0)=0$ and $s(t_f)=1$. However, for infinite-dimensional environments and a system described by an adiabatic Redfield master equation we do not recover the bang-type optimal solution. In fact we can only identify conditions under which $s(t_f)=1$, and even this result is not recovered in the fully Markovian limit. The analysis, which we carry out entirely within the geometric framework of Pontryagin Maximum Principle, simplifies using the density matrix formulation compared to the state vector formulation.

21 pages (incl. 9 page appendix), 3 figures

References in corpus (14)

• A Quantum Approximate Optimization Algorithm
• Mathematical Foundation of Quantum Annealing
• Bounds for the adiabatic approximation with applications to quantum computation
• Quantum Adiabatic Brachistochrone
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• A Brief History of the GKLS Equation
• Internal Consistency of Fault-Tolerant Quantum Error Correction in Light of Rigorous Derivations of the Quantum Markovian Limit
• Accuracy vs run time in adiabatic quantum search
• Shortcuts to adiabaticity for quantum annealing
• Optimal Control of Majorana Zero Modes
• Cooling through optimal control of quantum evolution
• Comparison of QAOA with Quantum and Simulated Annealing
• What do QAOA energies reveal about graphs?
• Optimal quantum control with digitized Quantum Annealing

Cited by in corpus (15)

• Introduction to Theoretical and Experimental aspects of Quantum Optimal Control
• Optimal quantum annealing: A variational shortcut to adiabaticity approach
• Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
• Binary Control Pulse Optimization for Quantum Systems
• Minimum time generation of a uniform superposition in a qubit with only transverse field control
• Deep learning optimal quantum annealing schedules for random Ising models
• Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
• Quantum optimal control in quantum technologies. Strategic report on current status, visions and goals for research in Europe
• Switching Time Optimization for Binary Quantum Optimal Control
• Quantum Property Preservation
• Optimal solutions to quantum annealing using two independent control functions
• Limits of Short-Time Evolution of Local Hamiltonians
• Binary Quantum Control Optimization with Uncertain Hamiltonians
• CDJ-Pontryagin Optimal Control for General Continuously Monitored Quantum Systems
• Geometry and quantum brachistochrone analysis of multiple entangled spin-1/2 particles under all-range Ising interaction