Fetching the paper…
Reading the bibliography…
Quantum annealers are an alternative approach to quantum computing which make use of the adiabatic theorem to efficiently find the ground state of a physically realizable Hamiltonian.
1901
Earlier work this paper cites.
1901
Earlier work this paper cites.
1910
Earlier work this paper cites.
R. Byrd, P. Lu, J. Nocedal, and C. Zhu, “A limited memory algorithm for bound constrained optimization,” SIAM J. Sci. Comput. 16
1995
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse ising model,” Physical Review E 58
1998
Earlier work this paper cites.
S. Bravyi and A. Y. Kitaev, “Fermionic quantum computation,” Annals of Physics 298
2002
Earlier work this paper cites.
A. Ambainis and O. Regev, “An elementary proof of the quantum adiabatic theorem,” (2006), arXiv:0411152v2 [quant-ph]
2006
Earlier work this paper cites.
A. Das and B. K. Chakrabarti, “Colloquium: Quantum annealing and analog quantum computation,” Reviews of Modern Physics 80
2008
Earlier work this paper cites.
V. Choi, “Minor-embedding in adiabatic quantum computation: I. the parameter setting problem,” Quantum Information Processing 7
2008
Earlier work this paper cites.
J. Biamonte and P. Love, “Realizable hamiltonians for universal adiabatic quantum computers,” Physical Review A 78
2008
Earlier work this paper cites.
J. D. Whitfield, J. Biamonte, and A. Aspuru-Guzik, “Simulation of electronic structure hamiltonians using quantum computers,” Molecular Physics 109
2011
Earlier work this paper cites.
D. de Falco and D. Tamascelli, “An introduction to quantum annealing,” RAIRO - Theoretical Informatics and Applications 45
2011
Earlier work this paper cites.
P. Atkins and R. Friedman, Molecular Quantum Mechanics , 5th ed. (Oxford University Press, 2011)
2011
Cited alongside, same era.
J. T. Seeley, M. Richard, and P. J. Love, “The bravyi-kitaev transformation for quantum computation of electronic structure.” The Journal of Chemical Physics 137
2012
Cited alongside, same era.
A. Peruzzo, J. R. McClean, P. Shadbolt, M.-H. Yung, X. 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
Cited alongside, same era.
A. Cho, “Quantum or not, controversial computer yields no speedup,” Science 344
2014
Cited alongside, same era.
A. Tranter, S. E. Sofia, J. Seeley, M. Kaicher, J. R. McClean, R. Babbush, P. V. Coveney, F. Mintert, F. K. Wilhelm, and P. J. Love, “The bravyi-kitaev transformation: Properties and applications,” International Journal of Quantum Chemistry 115
2017
Later among the works it cites.
W. Vinci and D. A. Lidar, “Non-stoquastic hamiltonians in quantum annealing via geometric phases,” npj Quantum Information 3
2017
Later among the works it cites.
R. Xia, T. Bian, and S. Kais, “Electronic structure calculations and the ising hamiltonian,” The Journal of Physical Chemistry B 122
2018
Later among the works it cites.
I. G. Ryabinkin, T.-C. Yen, S. N. Genin, and A. F. Izmaylov, “Qubit coupled cluster method: A systematic approach to quantum chemistry on a quantum computer,” Journal of Chemical Theory and Computation 14
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…
2015
Cited alongside, same era.
R. Babbush, P. J. Love, and A. Aspuru-Guzik, “Adiabatic quantum simulation of quantum chemistry,” Scientific Reports 4
2015
Cited alongside, same era.
Y. Cao, R. Babbush, J. Biamonte, and S. Kais, “Hamiltonian gadgets with reduced resource requirements,” Physical Review A 91
2015
Cited alongside, same era.
M. Amin, “Searching for quantum speedup in quasistatic quantum annealers,” Physical Review A 92
2015
Cited alongside, same era.
R. Barends, A. Shabani, L. Lamata, J. Kelly, A. Mezzacapo, U. L. Heras, R. Babbush, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, E. Jeffrey, E. Lucero, A. Megrant, J. Y. Mutus, M. Neeley, C. Neill, P. J. J. O’Malley, C. Quintana, P. Roushan, D. Sank, A. Vainsencher, J. Wenner, T. C. White, E. Solano, H. Neven, and J. M. Martinis, “Digitized adiabatic quantum computing with a superconducting circuit,” Nature 534
2016
Cited alongside, same era.
2017
Cited alongside, same era.
M. Anthony, E. Borost, Y. Cramat, and A. Gruber, “Quadratic reformulations of nonlinear binary optimization problems,” Mathematical Programming 162
2017
Cited alongside, same era.
D-Wave Ocean Software , D-Wave Systems
Cited in the paper.
Q. Sun, T. C. Berkelbach, N. S. Blunt, G. H. Booth, S. Guo, Z. Li, J. Liu, J. McClain, E. R. Sayfutyarova, S. Sharma, S. Wouters, and G. K.-L. Chan, “Pyscf: the python‐based simulations of chemistry framework,” Wiley Interdisciplinary Reviews: Computational Molecular Science 8
2018
Later among the works it cites.
R. Xia and S. Kais, “Quantum machine learning for electronic structure calculations,” Nature Communications 9
2018
Later among the works it cites.
2019
Later among the works it cites.
I. G. Ryabinkin, S. N. Genin, and A. F. Izmaylov, “Constrained variational quantum eigensolver: Quantum computer search engine in the fock space,” Journal of Chemical Theory and Computation 15
2019
Later among the works it cites.
K. Choo, A. Mezzacapo, and G. Carleo, “Fermionic neural-network states for ab-initio electronic structure,” Nature Communications 11
2020
Closest in time.
I. Ozfidan, C. Deng, A. Y. Smirnov, T. Lanting, R. Harris, L. Swenson, J. Whittaker, F. Altomare, M. Babcock, C. Baron, A. Berkley, K. Boothby, H. Christiani, P. Bunyk, C. Enderud, B. Evert, M. Hager, A. Hajda, J. Hilton, S. Huang, E. Hoskinson, M. Johnson, K. Jooya, E. Ladizinsky, N. Ladizinsky, R. Li, A. MacDonald, D. Marsden, G. Marsden, T. Medina, R. Molavi, R. Neufeld, M. Nissen, M. Norouzpour, T. Oh, I. Pavlov, I. Perminov, G. Poulin-Lamarre, M. Reis, T. Prescott, C. Rich, Y. Sato, G. Sterling, N. Tsai, M. Volkmann, W. Wilkinson, J. Yao, and M. H. Amin, “Demonstration of a nonstoquastic hamiltonian in coupled superconducting flux qubits,” Physical Review Applied 13
2020
Closest in time.