Applying the Quantum Approximate Optimization Algorithm to the Tail Assignment Problem

M. Y. Niu, S. Lu, and I. L. Chuang, “Optimizing qaoa: Success probability and runtime dependence on circuit depth,” (2019), arXiv:1905.12134

Original

1905

Earlier work this paper cites.

M. Willsch, D. Willsch, F. Jin, H. D. Raedt, and K. Michielsen, “Benchmarking the quantum approximate optimization algorithm,” (2019), arXiv:1907.02359

Original

1907

Earlier work this paper cites.

M. Alam, A. Ash-Saki, and S. Ghosh, “Analysis of quantum approximate optimization algorithm under realistic noise in superconducting qubits,” (2019), arXiv:1907.09631

Original

1907

Earlier work this paper cites.

C. Xue, Z.-Y. Chen, Y.-C. Wu, and G.-P. Guo, “Effects of quantum noise on quantum approximate optimization algorithm,” (2019), arXiv:1909.02196

Original

1909

Earlier work this paper cites.

L. Li, M. Fan, M. Coram, P. Riley, and S. Leichenauer, “Quantum optimization with a novel gibbs objective function and ansatz architecture search,” (2019), arXiv:1909.07621v1

Original

1909

Earlier work this paper cites.

R. Shaydulin and Y. Alexeev, “Evaluating quantum approximate optimization algorithm: A case study,” (2019), arXiv:1910.04881

Original

1910

Earlier work this paper cites.

E. Farhi, J. Goldstone, S. Gutmann, and L. Zhou, “The quantum approximate optimization algorithm and the sherrington-kirkpatrick model at infinite size,” (2019), arXiv:1910.08187

Original

1910

Earlier work this paper cites.

A. Bengtsson, P. Vikstål, C. Warren, M. Svensson, X. Gu, A. Frisk Kockum, P. Krantz, C. Križan, D. Shiri, I.-M. Svensson, G. Tancredi, G. Johansson, P. Delsing, G. Ferrini, and J. Bylander, “Quantum approximate optimization of the exact-cover problem on a superconducting quantum processor,” (2019), arXiv:1912.10495

Original

1912

Earlier work this paper cites.

F. Sansavini and V. Parigi, “Continuous variables graph states shaped as complex networks: optimization and manipulation,” (2019), arXiv:1912.03265

Original

1912

Earlier work this paper cites.

J. A. Nelder and R. Mead, The computer journal 7

1965

Earlier work this paper cites.

C. G. Broyden, IMA Journal of Applied Mathematics 6

1970

Earlier work this paper cites.

R. Fletcher, The computer journal 13

1970

Earlier work this paper cites.

D. Goldfarb, Mathematics of computation 24

1970

Earlier work this paper cites.

D. F. Shanno, Mathematics of computation 24

1970

Earlier work this paper cites.

R. M. Karp, “Reducibility among combinatorial problems,” (Springer US, Boston, MA, 1972) pp. 85–103

1972

Cited alongside, same era.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, San Fransisco, 1979)

1979

Cited alongside, same era.

C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance, Operations Research 46

1996

Cited alongside, same era.

J. C. Lagarias, J. A. Reeds, M. H. Wright, and P. E. Wright, SIAM Journal of Optimization 9

1998

Cited alongside, same era.

E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, Science 292

2001

Cited alongside, same era.

R. Albert and A.-L. Barabási, Rev. Mod. Phys. 74

M. Conforti, G. Cornuejols, and G. Zambelli, Integer Programming (Springer International Publishing, 2014) pp. 5–16

2014

Later among the works it cites.

H. Wang and L.-A. Wu, Scientific Reports 6

2016

Later among the works it cites.

Z. Jiang, E. G. Rieffel, and Z. Wang, Physical Review A 95

2017

Later among the works it cites.

T. L. Jacobs, L. A. Garrow, M. Lohatepanont, Frank, S. Koppelman, G. M. Coldren, and H. W. Purnomo (2017)

2017

Later among the works it cites.

E. Farhi, J. Goldstone, S. Gutmann, and H. Neven, “Quantum algorithms for fixed qubit architectures,” (2017), arXiv:1703.06199

Original

2017

Later among the works it cites.

G. E. Crooks, “Performance of the quantum approximate optimization algorithm on the maximum cut problem,” (2018), arXiv:1811.08419v1