Improved success probability with greater circuit depth for the quantum approximate optimization algorithm

E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem, Science 292

2001

Earlier work this paper cites.

M. Kjaergaard, M. Schwartz, A. Greene, G. Samach, A. Bengtsson, M. O’Keeffe, C. McNally, J. Braumüller, D. Kim, P. Krantz, et al. , A quantum instruction set implemented on a superconducting quantum processor, arXiv preprint arXiv:2001.08838 (2020b)

Original

2001

Earlier work this paper cites.

M. Grönkvist, The Tail Assignment Problem , Ph.D. thesis, Chalmers University of Technology and Göteborg University (2005)

2005

Earlier work this paper cites.

V. Choi, Adiabatic quantum algorithms for the np-complete maximum-weight independent set, exact cover and 3sat problems, arXiv preprint arXiv:1004.2226 (2010)

Original

2010

Earlier work this paper cites.

J. M. Chow, L. DiCarlo, J. M. Gambetta, A. Nunnenkamp, L. S. Bishop, L. Frunzio, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf, Detecting highly entangled states with a joint qubit readout, Physical Review A 81

Original

2010

Earlier work this paper cites.

A. D. Córcoles, J. M. Gambetta, J. M. Chow, J. A. Smolin, M. Ware, J. Strand, B. L. T. Plourde, and M. Steffen, Process verification of two-qubit quantum gates by randomized benchmarking, Physical Review A 87

2013

Earlier work this paper cites.

E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm, arXiv preprint arXiv:1411.4028 (2014)

Original

2014

Earlier work this paper cites.

A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, A variational eigenvalue solver on a photonic quantum processor, Nature Communications 5

2014

Earlier work this paper cites.

A. Lucas, Ising formulations of many np problems, Frontiers in Physics 2

2014

Earlier work this paper cites.

A. Montanaro, Quantum algorithms: an overview, npj Quantum Information 2

2016

Earlier work this paper cites.

P. J. J. O’Malley, R. Babbush, I. D. Kivlichan, J. Romero, J. R. McClean, R. Barends, J. Kelly, P. Roushan, A. Tranter, N. Ding, et al. , Scalable quantum simulation of molecular energies, Physical Review X 6

2016

Cited alongside, same era.

E. Farhi and A. W. Harrow, Quantum supremacy through the quantum approximate optimization algorithm, arXiv preprint arXiv:1602.07674 (2016)

Original

2016

Cited alongside, same era.

H. Wang and L.-A. Wu, Ultrafast adiabatic quantum algorithm for the np-complete exact cover problem, Scientific reports 6

2016

Cited alongside, same era.

D. C. McKay, S. Filipp, A. Mezzacapo, E. Magesan, J. M. Chow, and J. M. Gambetta, Universal gate for fixed-frequency qubits via a tunable bus, Physical Review Applied 6

2016

Cited alongside, same era.

G. Wendin, Quantum information processing with superconducting circuits: a review, Reports on Progress in Physics 80

K. Michielsen, M. Nocon, D. Willsch, F. Jin, T. Lippert, and H. De Raedt, Benchmarking gate-based quantum computers, Computer Physics Communications 220

2017

Later among the works it cites.

J. Preskill, Quantum computing in the nisq era and beyond, Quantum 2

2018

Later among the works it cites.

S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14

2018

Later among the works it cites.

S. Caldwell, N. Didier, C. Ryan, E. Sete, A. Hudson, P. Karalekas, R. Manenti, M. da Silva, R. Sinclair, E. Acala, et al. , Parametrically activated entangling gates using transmon qubits, Physical Review Applied 10

2018

Later among the works it cites.

F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell, et al. , Quantum supremacy using a programmable superconducting processor, Nature 574