Robust Control Optimization for Quantum Approximate Optimization Algorithm

Quantum variational algorithms have garnered significant interest recently, due to their feasibility of being implemented and tested on noisy intermediate scale quantum (NISQ) devices. We examine the robustness of the quantum approximate optimization algorithm (QAOA), which can be used to solve certain quantum control problems, state preparation problems, and combinatorial optimization problems. We demonstrate that the error of QAOA simulation can be significantly reduced by robust control optimization techniques, specifically, by sequential convex programming (SCP), to ensure error suppression in situations where the source of the error is known but not necessarily its magnitude. We show that robust optimization improves both the objective landscape of QAOA as well as overall circuit fidelity in the presence of coherent errors and errors in initial state preparation.

[1]  Juan Miguel Arrazola,et al.  A Quantum Approximate Optimization Algorithm for continuous problems , 2019, 1902.00409.

[2]  Johannes S. Otterbach.  Optimizing Variational Quantum Circuits using Evolution Strategies , 2018, ArXiv.

[3]  Murphy Yuezhen Niu,et al.  Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth , 2019, 1905.12134.

[4]  Ryan Babbush,et al.  The theory of variational hybrid quantum-classical algorithms , 2015, 1509.04279.

[5]  Lloyd,et al.  Almost any quantum logic gate is universal. , 1995, Physical review letters.

[6]  Hartmut Neven,et al.  Universal quantum control through deep reinforcement learning , 2019 .

[7]  Yvon Maday,et al.  New formulations of monotonically convergent quantum control algorithms , 2003 .

[8]  S. Lloyd.  Quantum approximate optimization is computationally universal , 2018, 1812.11075.

[9]  Walter Vinci,et al.  Quantum variational autoencoder , 2018, Quantum Science and Technology.

[10]  Hartmut Neven,et al.  Universal quantum control through deep reinforcement learning , 2018, npj Quantum Information.

[11]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.

[12]  Stuart Hadfield,et al.  Quantum Algorithms for Scientific Computing and Approximate Optimization , 2018, 1805.03265.

[13]  M. Leib,et al.  Comparison of QAOA with Quantum and Simulated Annealing , 2019, 1901.01903.

[14]  Constantin Brif,et al.  Robust control of quantum gates via sequential convex programming , 2013, ArXiv.

[15]  H. Rabitz,et al.  Robust quantum control in games: An adversarial learning approach , 2019, 1909.02296.

[16]  Herschel Rabitz,et al.  A RAPID MONOTONICALLY CONVERGENT ITERATION ALGORITHM FOR QUANTUM OPTIMAL CONTROL OVER THE EXPECTATION VALUE OF A POSITIVE DEFINITE OPERATOR , 1998 .

[17]  Daoyi Dong,et al.  Learning robust and high-precision quantum controls , 2019, Physical Review A.

[18]  Armin Rahmani,et al.  Optimal control of superconducting gmon qubits using Pontryagin's minimum principle: Preparing a maximally entangled state with singular bang-bang protocols , 2017, Physical Review A.

[19]  Pankaj Mehta,et al.  Reinforcement Learning in Different Phases of Quantum Control , 2017, Physical Review X.

[20]  Hartmut Neven,et al.  Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle , 2016, ArXiv.

[21]  Robert Kosut,et al.  Optimal control of two qubits via a single cavity drive in circuit quantum electrodynamics , 2017, 1703.06077.

[22]  Timo O. Reiss,et al.  Optimal control of coupled spin dynamics: design of NMR pulse sequences by gradient ascent algorithms. , 2005, Journal of magnetic resonance.