Entropic property of QAOA with random choice of parameters
Andrey Yu. Chernyavskiy1,2, Boris I. Bantysh1,2
1 Russian Quantum Center, Skolkovo, 121205, Moscow, Russia
2 Valiev Institute of Physics and Technology, Russian Academy of Sciences, 117218, Moscow, Russia
Abstract
We present the analysis of QAOA (quantum approximate optimization algorithm) with a random choice of quantum circuit parameters. It has been found that, on average, this approach outperforms the classical bruteforce on unweighted QUSO (quadratic unconstrained spin optimization) problems, including Max-Cut problems. It has been experimentally shown that this effect is based on the increase of the entropy of different objective values probabilities.
Speaker
Andrey Chernyavskiy
Russian Quantum Center
Russia
Discussion
Ask question
