Fetching the paper…
Reading the bibliography…
Analog quantum algorithms are formulated in terms of Hamiltonians rather than unitary gates and include quantum adiabatic computing, quantum annealing, and the quantum approximate optimization algorithm (QAOA).
L. S. Pontryagin, V. G. Boltyanskii, R. V. Gamkrelidze, E. F. Mishchenko, The Mathematical Theory of Optimal Processes
1962
Earlier work this paper cites.
L. I. Schiff, Quantum Mechanics (McGraw-Hill, New York, 1968), 3rd ed
1968
Earlier work this paper cites.
J. Huyghebaert, H De Raedt, “Product formula methods for time-dependent Schrodinger problems,” J. Phys. A: Math. Gen. 23
1990
Earlier work this paper cites.
T. Kadowaki, H. Nishimori, “Quantum Annealing in the Transverse Ising Model,” Phys. Rev. E 58
1998
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, M. Sipser, “Quantum Computation by Adiabatic Evolution,” arXiv:quant-ph/0001106 (2000)
2000
Earlier work this paper cites.
J. Roland, N. J. Cerf, “ Quantum Search by Local Adiabatic Evolution,” Phys. Rev. A 65
2002
Earlier work this paper cites.
J. Roland, N. J. Cerf, “Quantum Search by Local Adiabatic Evolution,” Phys. Rev. A 65
2002
Earlier work this paper cites.
M. Demirplak, S. A. Rice, “Adiabatic Population Transfer with Control Fields,” J. of Phys. Chem. A 107
2003
Earlier work this paper cites.
R. MacKenzie, E. Marcotte, H. Paquette, “Perturbative approach to the adiabatic approximation,” Phys. Rev. A 73
2006
Earlier work this paper cites.
S. Jansen, M. Ruskai, R. Seiler, “Bounds for the adiabatic approximation with applications to quantum computation,” J. Math. Phys. 48
2007
Earlier work this paper cites.
M. V. Berry, “Transitionless quantum driving,” J. of Phys. A 42
2009
Earlier work this paper cites.
A. T. Rezakhani, W. J. Kuo, A. Hamma, D. A. Lidar, P. Zanardi, “Quantum Adiabatic Brachistochrone,” Phys. Rev. Lett. 103
2009
Earlier work this paper cites.
D. A. Lidar, A. T. Rezakhani, A. Hamma, “Adiabatic approximation with exponential accuracy for many-body systems and quantum computation,” J. Math. Physics 50
2009
Earlier work this paper cites.
M. H. S. Amin, “Consistency of the Adiabatic Theorem,” Phys. Rev. Lett. 102
2009
Earlier work this paper cites.
A. Perdomo-Ortiz, S. E. Venegas-Andraca, and A. Aspuru-Guzik, “A Study of Heuristic Guesses for Adiabatic Quantum Computation,” Quantum Inf. Proc. 10, 33 (2011)
2011
Cited alongside, same era.
D. Poulin, A. Qarry, R. D. Somma, F. Verstraete, “Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space,” Phys. Rev. Lett. 106
2011
Cited alongside, same era.
N. Wiebe, N. S. Babcock, “Improved error-scaling for adiabatic quantum evolutions,” New J. Phys. 14
2012
Cited alongside, same era.
2014
Cited alongside, same era.
S. Muthukrishnan, T. Albash, D. A. Lidar, “Tunneling and speedup in quantum optimization for permutation-symmetric problems,” Phys. Rev. X 6
2016
2019
Later among the works it cites.
C. Lin, Y. Wang, G. Kolesov, U. Kalabić, “Application of Pontryagin’s minimum principle to Grover’s quantum search problem,” Phys. Rev. A
2019
Later among the works it cites.
D. Guéry-Odelin, A. Ruschhaupt, A. Kiely, E. Torrontegui, S. Martínez-Garaot, J. G. Muga, “Shortcuts to adiabaticity: concepts, methods, and applications ,” Rev. Mod. Phys. 91
2019
Later among the works it cites.
M. Bukov, D. Sels, A. Polkovnikov, “Geometric Speed Limit of Accessible Many-Body State Preparation,” Phys. Rev. X 9
2019
Later among the works it cites.
I. Hen, “How Quantum is the Speedup in Adiabatic Unstructured Search?”, Quant. Inf. Proc. 18
2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Z. C. Yang, A. Rahmani, A. Shabani, H. Neven, C. Chamon, “Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle,” Phys. Rev. X
2017
Cited alongside, same era.
N. Chancellor, “Modernizing Quantum Annealing Using Local Searches,” New J. Phys. 19, 023024 (2017)
2017
Cited alongside, same era.
L. T. Brady, W. van Dam, “Necessary Adiabatic Run Times in Quantum Optimization,” Phys. Rev. A 95
2017
Cited alongside, same era.
J. Preskill, “ Quantum Computing in the NISQ era and beyond,” Quantum 2
2018
Cited alongside, same era.
2018
Cited alongside, same era.
F. Petiziol, B. Dive, F. Mintert, S. Wimberger, “Fast adiabatic evolution by oscillating initial Hamiltonians,” Phys. Rev. A. 98
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Later among the works it cites.
2020
Later among the works it cites.
L. Zhou, S. Wang, S. Choi, H. Pichler, M. D. Lukin, “Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices,” Phys. Rev. X 10
2020
Later among the works it cites.
G. Pagano, A. Bapat, P. Becker, K. S. Collins, A. De, P. W. Hess, H. B. Kaplan, A. Kyprianidis, W. L. Tan, C. Baldwin, L. T. Brady, A. Deshpande, F. Liu, S. Jordan, A. V. Gorshkov, C. Monroe, “Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator,” PNAS 117 (41), 25396-25401 (2020)
2020
Later among the works it cites.
2020
Later among the works it cites.
M.P. Harrigan eta al., “Quantum approximate optimization of non-planar graph problems on a planar superconducting processor”, Nature Physics 17
2021
Closest in time.
L. T. Brady, C. L. Baldwin, A. Bapat, Y. Kharkov, A. V. Gorshkov, “Optimal Protocols in Quantum Annealing and QAOA Problems,” Phys. Rev. Lett. 126, 070505 (2021)
2021
Closest in time.
A. Callison, M. Festenstein, J. Chen, L. Nita, V. Kendon, N. Chancellor, “An energetic perspective on rapid quenches in quantum annealing,” PRX Quantum 2, 010338 (2021)
2021
Closest in time.
2021
Closest in time.