Approaches to Constrained Quantum Approximate Optimization

R. M. Karp, Reducibility among combinatorial problems, in Complexity of computer computations (Springer, 1972) pp. 85–103

1972

Earlier work this paper cites.

E. Farhi, D. Gamarnik, and S. Gutmann, The Quantum Approximate Optimization Algorithm needs to see the whole graph: A typical case, arXiv preprint arXiv:2004.09002 (2020b)

Original

2004

Earlier work this paper cites.

A. Auyeung and A. Abraham, The largest compatible subset problem for phylogenetic data, arXiv preprint cs/0405025 (2004)

2004

Earlier work this paper cites.

E. Farhi, D. Gamarnik, and S. Gutmann, The Quantum Approximate Optimization Algorithm needs to see the whole graph: Worst case examples, arXiv preprint arXiv:2005.08747 (2020a)

Original

2005

Earlier work this paper cites.

C. Schön, K. Hammerer, M. M. Wolf, J. I. Cirac, and E. Solano, Sequential generation of matrix-product states in cavity QED, Physical Review A 75

2007

Earlier work this paper cites.

M. Safar and S. Habib, Hard constrained vertex-cover communication algorithm for WSN, in International Conference on Embedded and Ubiquitous Computing (Springer, 2007) pp. 635–649

2007

Earlier work this paper cites.

H. Wang, S. Ashhab, and F. Nori, Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer, Physical Review A 79

2009

Earlier work this paper cites.

V. V. Shende and I. L. Markov, On the cnot-cost of toffoli gates, Quantum Info. Comput. 9

2009

Earlier work this paper cites.

C. Ambühl and M. Mastrolilli, Single machine precedence constrained scheduling is a vertex cover problem, Algorithmica 53

2009

Earlier work this paper cites.

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

2014

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.

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.

M. Saffman, Quantum computing with atomic qubits and rydberg interactions: progress and challenges, Journal of Physics B: Atomic, Molecular and Optical Physics 49

2016

Cited alongside, same era.

J. M. Gambetta, J. M. Chow, and M. Steffen, Building logical qubits in a superconducting quantum computing system, npj Quantum Information 3

2017

Cited alongside, same era.

Y. He, M.-X. Luo, E. Zhang, H.-K. Wang, and X.-F. Wang, Decompositions of n-qubit toffoli gates with linear circuit complexity, International Journal of Theoretical Physics 56

2017

Cited alongside, same era.

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

2018

M. Saffman, Quantum computing with neutral atoms, National Science Review 6

2019

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

2019

Later among the works it cites.

S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Venturelli, and R. Biswas, From the quantum approximate optimization algorithm to a quantum alternating operator ansatz, Algorithms 12

2019

Later among the works it cites.

A. M. Dalzell, A. W. Harrow, D. E. Koh, and R. L. La Placa, How many qubits are needed for quantum computational supremacy?, Quantum 4

2020

Closest in time.

Z. Wang, N. C. Rubin, J. M. Dominy, and E. G. Rieffel, XY mixers: Analytical and numerical results for the quantum alternating operator ansatz, Physical Review A 101