Fetching the paper…
Reading the bibliography…
Quantum annealing is a practical approach to approximately implement the adiabatic quantum computational model under a real-world setting.
1903
Earlier work this paper cites.
1904
Earlier work this paper cites.
1908
Earlier work this paper cites.
1909
Earlier work this paper cites.
1911
Earlier work this paper cites.
S. Kirkpatrick and B. Selman, “Critical behavior in the satisfiability of random boolean expressions,” Science 264
1994
Earlier work this paper cites.
L. P. Kaelbling, M. L. Littman, and A. W. Moore, “Reinforcement learning: A survey,” J. Artif. Intell. Res. 4
1996
Earlier work this paper cites.
Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, and Lidror Troyansky, “Determining computational complexity from characteristic ‘phase transitions’,” Nature 400
1999
Earlier work this paper cites.
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser, “Quantum computation by adiabatic evolution,” (2000), arXiv:quant-ph/0001106
2000
Earlier work this paper cites.
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.
Andrew M Childs, Edward Farhi, and John Preskill, “Robustness of adiabatic quantum computation,” Phys. Rev. A 65
2001
Earlier work this paper cites.
2001
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, “Quantum adiabatic evolution algorithms versus simulated annealing,” arXiv preprint quant-ph/0201031 , 2002
2002
Earlier work this paper cites.
J. Roland and N. J. Cerf, “Quantum search by local adiabatic evolution,” Physical Review A , vol. 65, no. 4, p. 042308, 2002
2002
Earlier work this paper cites.
Tad Hogg, “Adiabatic quantum computing for random satisfiability problems,” Phys. Rev. A 67
2003
Earlier work this paper cites.
Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev, “Adiabatic quantum computation is equivalent to standard quantum computation,” (2004), arXiv:quant-ph/0405098
2004
Earlier work this paper cites.
Arnab Das and BK Chakrabarti, Quantum annealing and related optimization methods (Springer, 2005)
2005
Earlier work this paper cites.
Marko Žnidarič, “Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiability,” Phys. Rev. A 71
2005
Earlier work this paper cites.
Levente Kocsis and Csaba Szepesvári, “Bandit based monte-carlo planning,” in European conference on machine learning (Springer, Berlin, Heidelberg, 2006) pp. 282–293
2006
Earlier work this paper cites.
Levente Kocsis and Csaba Szepesvári, “Bandit based monte-carlo planning,” in Lecture Notes in Computer Science (Springer Berlin Heidelberg, 2006) pp. 282–293
2006
Earlier work this paper cites.
Rémi Coulom, “Efficient selectivity and backup operators in monte-carlo tree search,” in Computers and Games (Springer Berlin Heidelberg, 2007) pp. 72–83
2007
Earlier work this paper cites.
S. Boixo, E. Knill, R. D. Somma et al. , “Eigenpath traversal by phase randomization.” Quantum Inf. Comput. , vol. 9, no. 9&10, pp. 833–855, 2009
2009
Earlier work this paper cites.
Chang-Shing Lee, Mei-Hui Wang, Guillaume Chaslot, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Shang-Rong Tsai, Shun-Chin Hsu, and Tzung-Pei Hong, “The computational intelligence of mogo revealed in taiwan’s computer go tournaments,” IEEE Transactions on Computational Intelligence and AI in games 1
2009
Earlier work this paper cites.
T. Caneva, T. Calarco, and S. Montangero, “Chopped random-basis quantum optimization,” Physical Review A , vol. 84, no. 2, p. 022326, 2011
2011
Earlier work this paper cites.
T. Caneva, T. Calarco, and S. Montangero, “Chopped random-basis quantum optimization,” Physical Review A , vol. 84, no. 2, p. 022326, 2011
2011
Earlier work this paper cites.
Martijn van Otterlo and Marco Wiering, “Reinforcement learning and markov decision processes,” in Adaptation, Learning, and Optimization (Springer Berlin Heidelberg, 2012) pp. 3–42
2012
Cited alongside, same era.
2013
Cited alongside, same era.
Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J Love, Alán Aspuru-Guzik, and Jeremy L O’brien, “A variational eigenvalue solver on a photonic quantum processor,” Nat. Commun. 5
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Tameem Albash and Daniel A Lidar, “Adiabatic quantum computation,” Rev. Mod. Phys. 90
2018
Later among the works it cites.
David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, Timothy Lillicrap, Karen Simonyan, and Demis Hassabis, “A general reinforcement learning algorithm that masters chess, shogi, and go through self-play,” Science 362
2018
Later among the works it cites.
John Preskill, “Quantum computing in the NISQ era and beyond,” Quantum 2
2018
Later among the works it cites.
Marin Bukov, Alexandre GR Day, Dries Sels, Phillip Weinberg, Anatoli Polkovnikov, and Pankaj Mehta, “Reinforcement learning in different phases of quantum control,” Phys. Rev. X 8
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Chunlin Chen, Daoyi Dong, Han-Xiong Li, Jian Chu, and Tzyh-Jong Tarn, “Fidelity-based probabilistic q-learning for control of quantum systems,” IEEE Transactions on Neural Networks and Learning Systems 25
2014
Cited alongside, same era.
Volodymyr Mnih, Koray Kavukcuoglu, David Silver, Andrei A. Rusu, Joel Veness, Marc G. Bellemare, Alex Graves, Martin Riedmiller, Andreas K. Fidjeland, Georg Ostrovski, Stig Petersen, Charles Beattie, Amir Sadik, Ioannis Antonoglou, Helen King, Dharshan Kumaran, Daan Wierstra, Shane Legg, and Demis Hassabis, “Human-level control through deep reinforcement learning,” Nature 518
2015
Cited alongside, same era.
Lishan Zeng, Jun Zhang, and Mohan Sarovar, “Schedule path optimization for adiabatic quantum computing and optimization,” J Phys. A: Math Theor. 49
2016
Cited alongside, same era.
Jarrod R McClean, Jonathan Romero, Ryan Babbush, and Alán Aspuru-Guzik, “The theory of variational hybrid quantum-classical algorithms,” New. J. Phys. 18
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Alex Mott, Joshua Job, Jean-Roch Vlimant, Daniel Lidar, and Maria Spiropulu, “Solving a higgs optimization problem with quantum annealing for machine learning,” Nature 550
2017
Cited alongside, same era.
Layla Hormozi, Ethan W Brown, Giuseppe Carleo, and Matthias Troyer, “Nonstoquastic hamiltonians and quantum annealing of an ising spin glass,” Phys. Rev. B 95
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2018
Later among the works it cites.
Richard S. Sutton and Andrew G. Barto, Reinforcement Learning: An Introduction (A Bradford Book, Cambridge, MA, USA, 2018)
2018
Later among the works it cites.
Thomas Fösel, Petru Tighineanu, Talitha Weiss, and Florian Marquardt, “Reinforcement learning with neural networks for quantum feedback,” Phys. Rev. X 8
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
Yudong Cao, Jonathan Romero, Jonathan P. Olson, Matthias Degroote, Peter D. Johnson, Mária Kieferová, Ian D. Kivlichan, Tim Menke, Borja Peropadre, Nicolas P. D. Sawaya, Sukin Sim, Libor Veis, and Alán Aspuru-Guzik, “Quantum chemistry in the age of quantum computing,” Chem. Rev. 119
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Murphy Yuezhen Niu, Sergio Boixo, Vadim N Smelyanskiy, and Hartmut Neven, “Universal quantum control through deep reinforcement learning,” npj Quantum Inf. 5
2019
Later among the works it cites.
Hendrik Poulsen Nautrup, Nicolas Delfosse, Vedran Dunjko, Hans J Briegel, and Nicolai Friis, “Optimizing quantum error correction codes with reinforcement learning,” Quantum 3
2019
Later among the works it cites.
Han Xu, Junning Li, Liqiang Liu, Yu Wang, Haidong Yuan, and Xin Wang, “Generalizable control for quantum parameter estimation through reinforcement learning,” npj Quantum Inf. 5
2019
Later among the works it cites.
James King, Sheir Yarkoni, Jack Raymond, Isil Ozfidan, Andrew D King, Mayssam Mohammadi Nevisi, Jeremy P Hilton, and Catherine C McGeoch, “Quantum annealing amid local ruggedness and global frustration,” Journal of the Physical Society of Japan 88
2019
Later among the works it cites.
H. P. Nautrup, N. Delfosse, V. Dunjko, H. J. Briegel, and N. Friis, “Optimizing quantum error correction codes with reinforcement learning,” Quantum , vol. 3, p. 215, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
Dennis Willsch, Madita Willsch, Hans De Raedt, and Kristel Michielsen, “Support vector machines on the d-wave quantum annealer,” Comput. Phys Commun. 248
2020
Closest in time.
M. Dalgaard, F. Motzoi, J. J. Sørensen, and J. Sherson, “Global optimization of quantum dynamics with alphazero deep exploration,” npj Quantum Information , vol. 6, no. 1, pp. 1–9, 2020
2020
Closest in time.
2020
Closest in time.
Y. Susa and H. Nishimori, “Variational optimization of the quantum annealing schedule for the lechner-hauke-zoller scheme,” Physical Review A , vol. 103, no. 2, p. 022619, 2021
2021
Closest in time.
2021
Closest in time.
L. T. Brady, C. L. Baldwin, A. Bapat, Y. Kharkov, and A. V. Gorshkov, “Optimal protocols in quantum annealing and quantum approximate optimization algorithm problems,” Physical Review Letters , vol. 126, no. 7, p. 070505, 2021
2021
Closest in time.