A quantum advantage over classical for local max cut
Quantum Physics
2023-09-18 v4
Abstract
We compare the performance of a quantum local algorithm to a similar classical counterpart on a well-established combinatorial optimization problem LocalMaxCut. We show that a popular quantum algorithm first discovered by Farhi, Goldstone, and Gutmannn [1] called the quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs. These results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical computation.
Cite
@article{arxiv.2304.08420,
title = {A quantum advantage over classical for local max cut},
author = {Charlie Carlson and Zackary Jorquera and Alexandra Kolla and Steven Kordonowy},
journal= {arXiv preprint arXiv:2304.08420},
year = {2023}
}