A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem

Johan Håstad. On bounded occurrence constraint satisfaction, 2000. Information Processing Letters

2000

Earlier work this paper cites.

Johan Håstad. Some optimal inapproximability results, 2001. Journal of ACM, 48

2001

Earlier work this paper cites.

Luca Trevisan. Non-approximability results for optimization problems on bounded degree instances, 2001. Proc. 30 th 30^{\textrm{th}} STOC, pp 453-461

2001

Earlier work this paper cites.

Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O’Donnell, 2005. On the Fourier tails of bounded functions over the discrete cube. Israel Journal of Mathematics, 160

Original

2007

Cited alongside, same era.

Edward Farhi, Jeffrey Goldstone, Sam Gutmann. A Quantum Approximate Optimization Algorithm, 2014. arXiv:1411.4028 [quant-ph]

Original

2014

Cited alongside, same era.

Boaz Barak, Ankur Moitra, Ryan O’Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright. Beating the random assignment on constraint satisfaction problems of bounded degree, 2015. Electronic Colloquium on Computational Complexity, Report No. 82 (2015). arXiv:1505.03424 [cs.CC]

Original

2015

Closest in time.

Johan Håstad. Improved bounds for bounded occurrence constraint satisfaction, manuscript, 2015. https://www.nada.kth.se/~johanh/bounded2.pdf

2015

Closest in time.