Symmetry-informed transferability of optimal parameters in the quantum approximate optimization algorithm

One of the main limitations of variational quantum algorithms is the classical optimization of the highly dimensional nonconvex variational parameter landscape. To simplify this optimization, we can reduce the search space using problem symmetries and typical optimal parameters as initial points if they concentrate. In this article, we consider typical values of optimal parameters of the quantum approximate optimization algorithm for the MAXCUT problem with <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"><a:mi>d</a:mi></a:math>-regular tree subgraphs and reuse them in different graph instances. We prove symmetries in the optimization landscape of several kinds of weighted and unweighted graphs, which explains the existence of multiple sets of optimal parameters. However, we observe that not all optimal sets can be successfully transferred between problem instances. We find specific transferable domains in the search space and show how to translate an arbitrary set of optimal parameters into the adequate domain using the studied symmetries. Finally, we extend these results to general classical optimization problems described by Ising Hamiltonians, the Hamiltonian variational ansatz for relevant physical models, and the recursive and multiangle quantum approximate optimization algorithms.