Reachability Deficits in Quantum Approximate Optimization of Graph Problems

Reachability Deficits in Quantum Approximate Optimization of Graph Problems

The quantum approximate optimization algorithm (QAOA) has become a cornerstone of contemporary quantum applications development. Here we show that the $density$ of problem constraints versus problem variables acts as a performance indicator. Density is found to correlate strongly with approximation...

Full description

Bibliographic Details
Main Authors: V. Akshay, H. Philathong, I. Zacharov, J. Biamonte
Format: Article
Language:English
Published: Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften 2021-08-01
Series:Quantum
Online Access:https://quantum-journal.org/papers/q-2021-08-30-532/pdf/

Similar Items

Similar Items