Fetching the paper…
Reading the bibliography…
We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algorithm (QAOA).
1902
Earlier work this paper cites.
1906
Earlier work this paper cites.
1907
Earlier work this paper cites.
1910
Earlier work this paper cites.
1910
Earlier work this paper cites.
1912
Earlier work this paper cites.
1912
Earlier work this paper cites.
David Sherrington and Scott Kirkpatrick, “Solvable model of a spin-glass,” Phys. Rev. Lett. 35
1975
Earlier work this paper cites.
F Barahona, “On the computational complexity of Ising spin glass models,” Journal of Physics A: Mathematical and General 15
1982
Earlier work this paper cites.
Michel X. Goemans and David P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” J. ACM 42
1995
Earlier work this paper cites.
Seth Lloyd, “Universal quantum simulators,” Science 273
1996
Earlier work this paper cites.
Tadashi Kadowaki and Hidetoshi Nishimori, “Quantum annealing in the transverse Ising model,” Phys. Rev. E 58
1998
Earlier work this paper cites.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua Lapan, Andrew Lundgren, and Daniel Preda, “A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem,” Science 292
2001
Cited alongside, same era.
Jun Zhang, Jiri Vala, Shankar Sastry, and K. Birgitta Whaley, “Geometric theory of nonlocal two-qubit operations,” Phys. Rev. A 67
2003
Cited alongside, same era.
Alán Aspuru-Guzik, Anthony D. Dutoi, Peter J. Love, and Martin Head-Gordon, “Simulated quantum computation of molecular energies,” Science 309
2005
Cited alongside, same era.
Vicky Choi, “Minor-embedding in adiabatic quantum computation: I. the parameter setting problem,” Quantum Information Processing 7
2008
Cited alongside, same era.
Yuichi Hirata, Masaki Nakanishi, Shigeru Yamashita, and Yasuhiko Nakashima, “An efficient conversion of quantum circuits to a linear nearest neighbor architecture,” Quantum Info. Comput. 11
Rupak Biswas, Zhang Jiang, Kostya Kechezhi, Sergey Knysh, Salvatore Mandrà, Bryan O’Gorman, Alejandro Perdomo-Ortiz, Andre Petukhov, John Realpe-Gómez, Eleanor Rieffel, Davide Venturelli, Fedir Vasko, and Zhihui Wang, “A NASA perspective on quantum computing: Opportunities and challenges,” Parallel Computing 64
2017
Later among the works it cites.
Zhang Jiang, Eleanor G. Rieffel, and Zhihui Wang, “Near-optimal quantum circuit for Grover’s unstructured search using a transverse field,” Phys. Rev. A 95
2017
Later among the works it cites.
Stuart Hadfield, Zhihui Wang, Bryan O’Gorman, Eleanor Rieffel, Davide Venturelli, and Rupak Biswas, “From the quantum approximate optimization algorithm to a quantum alternating operator ansatz,” Algorithms 12
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
Andrew Lucas, “Ising formulations of many NP problems,” Frontiers in Physics 2
2014
Cited alongside, same era.
Troels F. Rønnow, Zhihui Wang, Joshua Job, Sergio Boixo, Sergei V. Isakov, David Wecker, John M. Martinis, Daniel A. Lidar, and Matthias Troyer, “Defining and detecting quantum speedup,” Science 345
2014
Cited alongside, same era.
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, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, A. G. Fowler, E. Jeffrey, E. Lucero, A. Megrant, J. Y. Mutus, M. Neeley, C. Neill, C. Quintana, D. Sank, A. Vainsencher, J. Wenner, T. C. White, P. V. Coveney, P. J. Love, H. Neven, A. Aspuru-Guzik, and J. M. Martinis, “Scalable quantum simulation of molecular energies,” Phys. Rev. X 6
2016
Cited alongside, same era.
Jacob Biamonte, Peter Wittek, Nicola Pancotti, Patrick Rebentrost, Nathan Wiebe, and Seth Lloyd, “Quantum machine learning,” Nature 549
2016
Cited alongside, same era.
Vasil S. Denchev, Sergio Boixo, Sergei V. Isakov, Nan Ding, Ryan Babbush, Vadim Smelyanskiy, John Martinis, and Hartmut Neven, “What is the computational value of finite-range tunneling?” Phys. Rev. X 6
2016
Cited alongside, same era.
Dave Wecker, Matthew B. Hastings, and Matthias Troyer, “Training a quantum optimizer,” Phys. Rev. A 94
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2017
Later among the works it cites.
Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani, Hartmut Neven, and Claudio Chamon, “Optimizing variational quantum algorithms using Pontryagin’s minimum principle,” Phys. Rev. X 7
2017
Later among the works it cites.
Zhihui Wang, Stuart Hadfield, Zhang Jiang, and Eleanor G. Rieffel, “Quantum approximate optimization algorithm for MaxCut: A fermionic view,” Phys. Rev. A 97
2018
Later among the works it cites.
2018
Later among the works it cites.
Xiaogang Qiang, Xiaoqi Zhou, Jianwei Wang, Callum M. Wilkes, Thomas Loke, Sean O’Gara, Laurent Kling, Graham D. Marshall, Raffaele Santagati, Timothy C. Ralph, Jingbo B. Wang, Jeremy L. O’Brien, Mark G. Thompson, and Jonathan C. F. Matthews, “Large-scale silicon quantum photonics implementing arbitrary two-qubit processing,” Nature Photonics 12
2018
Later among the works it cites.
Jarrod R. McClean, Sergio Boixo, Vadim N. Smelyanskiy, Ryan Babbush, and Hartmut Neven, “Barren plateaus in quantum neural network training landscapes,” Nature Communications 9
2018
Later among the works it cites.
The Cirq Developers, “Cirq: A python framework for creating, editing, and invoking noisy intermediate scale quantum (NISQ) circuits,” (2020), https://github.com/quantumlib/Cirq
2020
Closest in time.
Google AI Quantum and Collaborators, “Sycamore QAOA experimental data,” (2020), 10.6084/m9.figshare.12597590.v2
2020
Closest in time.