Corpus ID: 215827463

The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case

@article{Farhi2020TheQA,
  title={The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case},
  author={E. Farhi and D. Gamarnik and S. Gutmann},
  journal={ArXiv},
  year={2020},
  volume={abs/2004.09002}
}
The Quantum Approximate Optimization Algorithm can naturally be applied to combinatorial search problems on graphs. The quantum circuit has p applications of a unitary operator that respects the locality of the graph. On a graph with bounded degree, with p small enough, measurements of distant qubits in the state output by the QAOA give uncorrelated results. We focus on finding big independent sets in random graphs with dn/2 edges keeping d fixed and n large. Using the Overlap Gap Property of… Expand
30 Citations
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples
  • 14
  • PDF
Improving the Quantum Approximate Optimization Algorithm with postselection
  • PDF
Quantum circuit optimization using quantum Karnaugh map
  • 3
  • PDF
Evaluation of Quantum Approximate Optimization Algorithm based on the approximation ratio of single samples
  • 2
  • PDF
Coreset Clustering on Small Quantum Computers
  • 2
  • PDF
Classical symmetries and QAOA
  • 5
  • Highly Influenced
  • PDF
Differentiable Quantum Architecture Search
  • 5
  • PDF
Impact of Graph Structures for QAOA on MaxCut
  • 1
  • PDF
...
1
2
3
...

References

SHOWING 1-10 OF 18 REFERENCES
A Quantum Approximate Optimization Algorithm
  • 716
  • PDF
A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
  • 106
  • PDF
Limits of local algorithms over sparse random graphs
  • 77
  • PDF
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
  • 103
  • PDF
The Overlap Gap Property and Approximate Message Passing Algorithms for $p$-spin models.
  • 13
  • PDF
Optimization of the Sherrington-Kirkpatrick Hamiltonian
  • A. Montanari
  • Mathematics, Computer Science
  • 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2019
  • 46
  • PDF
Walksat Stalls Well Below Satisfiability
  • 15
  • PDF
Performance of Sequential Local Algorithms for the Random NAE-K-SAT Problem
  • 17
  • PDF
...
1
2
...