Presentation + Paper
8 March 2023 Benchmarking the recursive quantum approximate optimization algorithm
Paige Frederick, Rich Rines, F. T. Chong, Pranav Gokhale
Author Affiliations +
Abstract
Recent results on the Quantum Approximate Optimization Algorithm (QAOA) have cast pessimism on its potential to exhibit practical quantum speedups. For instance, QAOA’s locality limits its performance on tasks such as coloring bipartite graphs—which is easy for classical methods. Motivated by these limitations, the Recursive QAOA was introduced to overcome the locality and symmetry of QAOA. Despite being more powerful than QAOA, RQAOA is fully classically simulable at level-1 depth (p = 1). We report results on RQAOA in this classically simulable regime, benchmarked on random Quantum Unconstrainted Binary Optimization (QUBO) problems with up to 100 variables. We find that RQAOA generally matches the performance of classical simulated annealing and significantly outperforms ordinary QAOA.
Conference Presentation
© (2023) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Paige Frederick, Rich Rines, F. T. Chong, and Pranav Gokhale "Benchmarking the recursive quantum approximate optimization algorithm", Proc. SPIE 12446, Quantum Computing, Communication, and Simulation III, 1244609 (8 March 2023); https://doi.org/10.1117/12.2648434
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Quantum approximate optimization

Binary data

Quantum encoding

Algorithms

Annealing

Quantum communications

Quantum ground state

RELATED CONTENT


Back to Top