Fetching the paper…
Reading the bibliography…
With current semiconductor technology reaching its physical limits, special-purpose hardware has emerged as an option to tackle specific computing-intensive challenges.
1910
Earlier work this paper cites.
Magnus R. Hestenes and Eduard Stiefel, “Methods of conjugate gradients for solving linear systems,” Journal of Research of the National Bureau of Standards 49
1952
Earlier work this paper cites.
Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, and Edward Teller, “Equation of state calculations by fast computing machines,” The Journal of Chemical Physics 21
1953
Earlier work this paper cites.
W. K. Hastings, “Monte Carlo sampling methods using Markov chains and their applications,” Biometrika 57
1970
Earlier work this paper cites.
Robert H. Swendsen and Jian-Sheng Wang, “Replica monte carlo simulation of spin-glasses,” Phys. Rev. Lett. 57
1986
Earlier work this paper cites.
Charlie J. Geyer, “Parallel tempering,” in Computing Science and Statistics Proceedings of the 23rd Symposium on the Interface , edited by E. M. Keramidas and S. M. Kaufman (American Statistical Association, New York, 1991) p. 156
1991
Earlier work this paper cites.
Koji Hukushima and Koji Nemoto, “Exchange monte carlo method and application to spin glass simulations,” Journal of the Physical Society of Japan 65
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.
L. A. Wolsey and G. L. Nemhauser, Integer and Combinatorial Optimization (Wiley, 1999)
1999
Earlier work this paper cites.
J. Brooke, D. Bitko, T. F., Rosenbaum, and G. Aeppli, “Quantum annealing of a disordered magnet,” Science 284
1999
Earlier work this paper cites.
Koji Hukushima, “Domain-wall free energy of spin-glass models: Numerical method and boundary conditions,” Physical Review E 60
1999
Earlier work this paper cites.
S. Franz, M. Mézard, F. Ricci-Tersenghi, M. Weight, and R Zecchina, “A ferromagnet with a glass transition,” Europhysics Letters (EPL) 55
2001
Earlier work this paper cites.
Jérôme Houdayer, “A cluster monte carlo algorithm for 2-dimensional spin glasses,” Eur. Phys. J. B 22
2001
Earlier work this paper cites.
J. Brooke, T. F. Rosenbaum, and G. Aeppli, “Tunable quantum tunnelling of magnetic domain walls,” Nature 413
2001
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
Earlier work this paper cites.
W. Barthel, A. K. Hartmann, M. Leone, F. Ricci-Tersenghi, M. Weigt, and R. Zecchina, “Hiding solutions in random satisfiability problems: A statistical mechanics approach,” Phys. Rev. Lett. 88
2002
Earlier work this paper cites.
J. Roland and N. J. Cerf, “Quantum search by local adiabatic evolution,” Phys. Rev. A 65
2002
Earlier work this paper cites.
2003
Earlier work this paper cites.
2003
Earlier work this paper cites.
2003
Earlier work this paper cites.
W. M. Kaminsky and S. Lloyd, “Scalable architecture for adiabatic quantum computing of np-hard problems,” in Quantum Computing and Quantum Bits in Mesoscopic Systems , edited by A. J. Leggett, B. Ruggiero, and P. Silvestrini (Springer US, Boston, MA, 2004) pp. 229–236
2004
Earlier work this paper cites.
Helmut G Katzgraber, Simon Trebst, David A Huse, and Matthias Troyer, “Feedback-optimized parallel tempering monte carlo,” Journal of Statistical Mechanics: Theory and Experiment 2006
2006
Earlier work this paper cites.
Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler, “Bounds for the adiabatic approximation with applications to quantum computation,” Journal of Mathematical Physics 48
2007
Earlier work this paper cites.
Vicky Choi, “Minor-embedding in adiabatic quantum computation: I. The parameter setting problem,” Quant. Inf. Proc. 7
2008
Earlier work this paper cites.
2008
Earlier work this paper cites.
2009
Earlier work this paper cites.
M W Johnson, P Bunyk, F Maibaum, E Tolkacheva, A J Berkley, E M Chapple, R Harris, J Johansson, T Lanting, I Perminov, E Ladizinsky, T Oh, and G Rose, “A scalable control system for a superconducting adiabatic quantum optimization processor,” Superconductor Science and Technology 23
2010
Earlier work this paper cites.
A J Berkley, M W Johnson, P Bunyk, R Harris, J Johansson, T Lanting, E Ladizinsky, E Tolkacheva, M H S Amin, and G Rose, “A scalable readout system for a superconducting adiabatic quantum optimization system,” Superconductor Science and Technology 23
2010
Earlier work this paper cites.
R. Harris, M. W. Johnson, T. Lanting, A. J. Berkley, J. Johansson, P. Bunyk, E. Tolkacheva, E. Ladizinsky, N. Ladizinsky, T. Oh, F. Cioata, I. Perminov, P. Spear, C. Enderud, C. Rich, S. Uchaikin, M. C. Thom, E. M. Chapple, J. Wang, B. Wilson, M. H. S. Amin, N. Dickson, K. Karimi, B. Macready, C. J. S. Truncik, and G. Rose, “Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor,” Phys. Rev. B 82
2010
Earlier work this paper cites.
Thomas Jörg, Florent Krzakala, Guilhem Semerjian, and Francesco Zamponi, “First-order transitions and the performance of quantum algorithms in random optimization problems,” Phys. Rev. Lett. 104
2010
Earlier work this paper cites.
Federico Ricci-Tersenghi, “Being glassy without being hard to solve,” Science 330
2010
Cited alongside, same era.
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, S. Uchaikin, J. Wang, B. Wilson, and G. Rose, “Quantum annealing with manufactured spins,” Nature 473
2011
Cited alongside, same era.
Marco Guidetti and A. P. Young, “Complexity of several constraint-satisfaction problems using the heuristic classical algorithm walksat,” Phys. Rev. E 84
2011
Cited alongside, same era.
V. Choi, “Minor-embedding in adiabatic quantum computation: Ii. minor-universal graph design,” Quant. Inf. Proc. 10
2011
Cited alongside, same era.
Yoshihisa Yamamoto, Kazuyuki Aihara, Timothee Leleu, Ken-ichi Kawarabayashi, Satoshi Kako, Martin Fejer, Kyo Inoue, and Hiroki Takesue, “Coherent ising machines—optical neural networks operating at the quantum limit,” npj Quantum Information 3
2017
Later among the works it cites.
Tameem Albash, Victor Martin-Mayor, and Itay Hen, “Temperature scaling law for quantum annealing optimizers,” Physical Review Letters 119
2017
Later among the works it cites.
Shruti Puri, Christian Kraglund Andersen, Arne L. Grimsmo, and Alexandre Blais, “Quantum annealing with all-to-all connected nonlinear oscillators,” Nature Communications 8
2017
Later among the works it cites.
Satoshi Matsubara, Hirotaka Tamura, Motomu Takatsu, Danny Yoo, Behraz Vatankhahghadim, Hironobu Yamasaki, Toshiyuki Miyazawa, Sanroku Tsukamoto, Yasuhiro Watanabe, Kazuya Takemoto, and Ali Sheikholeslami, “Ising-model optimizer with parallel-trial bit-sieve engine,” in Complex, Intelligent, and Software Intensive Systems , edited by Leonard Barolli and Olivier Terzo (Springer International Publishing, Cham, 2018) pp. 432–438
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
Edward Farhi, David Gosset, Itay Hen, A. W. Sandvik, Peter Shor, A. P. Young, and Francesco Zamponi, “Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs,” Phys. Rev. A 86
2012
Cited alongside, same era.
2012
Cited alongside, same era.
E. A. J. F. Peters and G. de With, “Rejection-free monte carlo sampling for general potentials,” Physical Review E 85
2012
Cited alongside, same era.
Adam Lipowski and Dorota Lipowska, “Roulette-wheel selection via stochastic acceptance,” Physica A: Statistical Mechanics and its Applications 391
2012
Cited alongside, same era.
C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity , Dover Books on Computer Science (Dover Publications, 2013)
2013
Cited alongside, same era.
Christian A. Yates and Guido Klingbeil, “Recycling random numbers in the stochastic simulation algorithm,” The Journal of Chemical Physics 138
2013
Cited alongside, same era.
N. G. Dickson, M. W. Johnson, M. H. Amin, R. Harris, F. Altomare, A. J. Berkley, P. Bunyk, J. Cai, E. M. Chapple, P. Chavez, F. Cioata, T. Cirip, P. deBuen, M. Drew-Brook, C. Enderud, S. Gildert, F. Hamze, J. P. Hilton, E. Hoskinson, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Lanting, T. Mahon, R. Neufeld, T. Oh, I. Perminov, C. Petroff, A. Przybysz, C. Rich, P. Spear, A. Tcaciuc, M. C. Thom, E. Tolkacheva, S. Uchaikin, J. Wang, A. B. Wilson, Z. Merali, and G. Rose, “Thermally assisted quantum annealing of a 16-qubit problem,” Nature Communications 4
2013
Cited alongside, same era.
2018
Later among the works it cites.
S. Novikov, R. Hinkey, S. Disseler, J. I. Basham, T. Albash, A. Risinger, D. Ferguson, D. A. Lidar, and K. M. Zick, “Exploring more-coherent quantum annealing,” in 2018 IEEE International Conference on Rebooting Computing (ICRC) (2018) pp. 1–7
2018
Later among the works it cites.
2018
Later among the works it cites.
Massimiliano Di Ventra and Fabio L. Traversa, “Perspective: Memcomputing: Leveraging memory and physics to compute efficiently,” Journal of Applied Physics 123
2018
Later among the works it cites.
Joshua Job and Daniel Lidar, “Test-driving 1000 qubits,” Quantum Science and Technology 3
2018
Later among the works it cites.
Joshua Job, The theory and practice of benchmarking quantum annealers , Ph.D. thesis, University of Southern California, Los Angeles, CA (2018)
2018
Later among the works it cites.
Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon, Davide Venturelli, Alireza Marandi, Tatsuhiro Onodera, Edwin Ng, Carsten Langrock, Kensuke Inaba, Toshimori Honjo, Koji Enbutsu, Takeshi Umeki, Ryoichi Kasahara, Shoko Utsunomiya, Satoshi Kako, Ken-ichi Kawarabayashi, Robert L. Byer, Martin M. Fejer, Hideo Mabuchi, Dirk Englund, Eleanor Rieffel, Hiroki Takesue, and Yoshihisa Yamamoto, “Experimental investigation of performance differences between coherent ising machines and a quantum annealer,” Science Advances 5
2019
Later among the works it cites.
Maliheh Aramon, Gili Rosenberg, Elisabetta Valiante, Toshiyuki Miyazawa, Hirotaka Tamura, and Helmut G. Katzgraber, “Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer,” Frontiers in Physics 7
2019
Later among the works it cites.
Hayato Goto, “Quantum computation based on quantum adiabatic bifurcations of kerr-nonlinear parametric oscillators,” Journal of the Physical Society of Japan 88
2019
Later among the works it cites.
Alejandro Perdomo-Ortiz, Alexander Feldman, Asier Ozaeta, Sergei V. Isakov, Zheng Zhu, Bryan O’Gorman, Helmut G. Katzgraber, Alexander Diedrich, Hartmut Neven, Johan de Kleer, Brad Lackey, and Rupak Biswas, “Readiness of quantum optimization machines for industrial applications,” Phys. Rev. Applied 12
2019
Later among the works it cites.
Hayato Goto, Kosuke Tatsumura, and Alexander R. Dixon, “Combinatorial optimization by simulating adiabatic bifurcations in nonlinear hamiltonian systems,” Science Advances 5
2019
Later among the works it cites.
Itay Hen, “Equation planting: A tool for benchmarking ising machines,” Phys. Rev. Applied 12
2019
Later among the works it cites.
Tameem Albash, Victor Martin-Mayor, and Itay Hen, “Analog errors in ising machines,” Quantum Science and Technology 4
2019
Later among the works it cites.
Adam Pearson, Anurag Mishra, Itay Hen, and Daniel A. Lidar, “Analog errors in quantum annealing: doom and hope,” npj Quantum Information 5
2019
Later among the works it cites.
Jeffrey A. Grover, James I. Basham, Alexander Marakov, Steven M. Disseler, Robert T. Hinkey, Moe Khalil, Zachary A. Stegen, Thomas Chamberlin, Wade DeGottardi, David J. Clarke, James R. Medford, Joel D. Strand, Micah J. A. Stoutimore, Sergey Novikov, David G. Ferguson, Daniel Lidar, Kenneth M. Zick, and Anthony J. Przybysz, “Fast, lifetime-preserving readout for high-coherence quantum annealers,” PRX Quantum 1
2020
Later among the works it cites.
S. Matsubara, M. Takatsu, T. Miyazawa, T. Shibasaki, Y. Watanabe, K. Takemoto, and H. Tamura, “Digital annealer for high-speed solving of combinatorial optimization problems and its applications,” in 2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC) (2020) pp. 667–672
2020
Later among the works it cites.
Zheng Zhu, Chao Fang, and Helmut G. Katzgraber, “borealis—a generalized global update algorithm for boolean optimization problems,” Optimization Letters 14
2020
Later among the works it cites.
Jeffrey Marshall, Andrea Di Gioacchino, and Eleanor G. Rieffel, “Perils of embedding for sampling problems,” Phys. Rev. Research 2
2020
Later among the works it cites.
Stefanie Zbinden, Andreas Bärtschi, Hristo Djidjev, and Stephan Eidenbenz, “Embedding algorithms for quantum annealers with chimera and pegasus connection topologies,” High Performance Computing: 35th International Conference, ISC High Performance 2020, Frankfurt/Main, Germany, June 22–25, 2020, Proceedings 12151
2020
Later among the works it cites.
Wolfram Research, Inc., “Mathematica, Version 12.2,” Champaign, IL, 2020
2020
Later among the works it cites.
2021
Closest in time.
Kasho Yamamoto, Kazushi Kawamura, Kota Ando, Normann Mertig, Takashi Takemoto, Masanao Yamaoka, Hiroshi Teramoto, Akira Sakai, Shinya Takamaeda-Yamazaki, and Masato Motomura, “STATICA: A 512-spin 0.25m-weight annealing processor with an all-spin-updates-at-once architecture for combinatorial optimization with complete spin–spin interactions,” IEEE Journal of Solid-State Circuits 56
2021
Closest in time.
Hayato Goto, Kotaro Endo, Masaru Suzuki, Yoshisato Sakai, Taro Kanao, Yohei Hamakawa, Ryo Hidaka, Masaya Yamasaki, and Kosuke Tatsumura, “High-performance combinatorial optimization based on classical mechanics,” Science Advances 7
2021
Closest in time.
2021
Closest in time.
M. Bernaschi, M. Bisson, M. Fatica, E. Marinari, V. Martin-Mayor, G. Parisi, and F. Ricci-Tersenghi, “How we are leading a 3-XORSAT challenge: From the energy landscape to the algorithm and its efficient implementation on GPUs (a),” EPL (Europhysics Letters) 133
2021
Closest in time.