Fetching the paper…
Reading the bibliography…
Quantum computation using continuous-time evolution under a natural hardware Hamiltonian is a promising near- and mid-term direction toward powerful quantum computing hardware.
Quadratization in discrete optimization and quantum mechanics, 2019
Nike Dattani · 1901
Earlier work this paper cites.
Firas Hamze, Jack Raymond, Christopher A. Pattison, Katja Biswas, and Helmut G. Katzgraber · 1906
Earlier work this paper cites.
Quantum speedup of branch-and-bound algorithms, 2019
Ashley Montanaro · 1906
Earlier work this paper cites.
Solvable model of a spin-glass
David Sherrington and Scott Kirkpatrick · 1975
Earlier work this paper cites.
Random-Energy Model: Limit of a Family of Disordered Models
B. Derrida · 1980
Earlier work this paper cites.
The order parameter for spin glasses: a function on the interval 0-1
G Parisi · 1980
Earlier work this paper cites.
A recursive branch-and-bound algorithm for the exact ground state of ising spin-glass models
A. Hartwig, F. Daske, and S. Kobe · 1984
Earlier work this paper cites.
Absence of many states in realistic spin glasses
D S Fisher and D A Huse · 1987
Earlier work this paper cites.
Equilibrium behavior of the spin-glass ordered phase
Daniel S. Fisher and David A. Huse · 1988
Earlier work this paper cites.
Infinite-range Ising spin glass in a transverse field
D Thirumalai, Qiang Li, and T R Kirkpatrick · 1989
Earlier work this paper cites.
Quantum annealing: A new method for minimizing multidimensional functions
A.B. Finnila, M.A. Gomez, C. Sebenik, C. Stenson, and J.D. Doll · 1994
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996
Earlier work this paper cites.
Strengths and Weaknesses of Quantum Computing
C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Out of equilibrium dynamics in spin-glasses and other glassy systems , pages 161–223
Jean-Philippe Bouchaud, Leticia F Cugliandolo, Jorge Kurchan, and Marc Mezard · 1998
Earlier work this paper cites.
Quantum computation and decision trees
Edward Farhi and Sam Gutmann · 1998
Earlier work this paper cites.
Quantum annealing in the transverse Ising model
Tadashi Kadowaki and Hidetoshi Nishimori · 1998
Earlier work this paper cites.
From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
Stuart Hadfield, Zhihui Wang, Bryan O’Gorman, Eleanor G. Rieffel, Davide Venturelli, and Rupak Biswas · 1999
Earlier work this paper cites.
Quantum computation by adiabatic evolution, 2000
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser · 2000
Earlier work this paper cites.
Quantum walks on graphs
Dorit Aharonov, Andris Ambainis, Julia Kempe, and Umesh Vazirani · 2001
Earlier work this paper cites.
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua Lapan, Andrew Lundgren, and Daniel Preda · 2001
Earlier work this paper cites.
Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate
Michael J. Bremner, Christopher M. Dawson, Jennifer L. Dodd, Alexei Gilchrist, Aram W. Harrow, Duncan Mortimer, Michael A. Nielsen, and Tobias J. Osborne · 2002
Earlier work this paper cites.
Dynamics of glassy systems, 2002
Leticia F Cugliandolo · 2002
Earlier work this paper cites.
Random knapsack in expected polynomial time
Rene Beier and Berthold Vöcking · 2003
Earlier work this paper cites.
Exponential Algorithmic Speedup by a Quantum Walk
Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, and Daniel A. Spielman · 2003
Earlier work this paper cites.
Quantum random-walk search algorithm
Neil Shenvi, Julia Kempe, and K. Birgitta Whaley · 2003
Earlier work this paper cites.
Python language reference manual
Guido Van Rossum and Fred L Drake · 2003
Earlier work this paper cites.
Spatial search by quantum walk
Andrew M. Childs and Jeffrey Goldstone · 2004
Earlier work this paper cites.
Absence of an Almeida-Thouless line in three-dimensional spin glasses
A. P. Young and Helmut G. Katzgraber · 2004
Earlier work this paper cites.
Solving random satisfiable 3CNF formulas in expected polynomial time
Michael Krivelevich and Dan Vilenchik · 2006
Earlier work this paper cites.
A guide to NumPy , volume 1
Travis E Oliphant · 2006
Cited alongside, same era.
Matplotlib: A 2D graphics environment
John D Hunter · 2007
Cited alongside, same era.
IPython: A System for Interactive Scientific Computing
F. Perez and B. E. Granger · 2007
Cited alongside, same era.
How to make the quantum adiabatic algorithm fail
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Daniel Nagaj · 2008
Cited alongside, same era.
Perturbative gadgets at arbitrary orders
Stephen Jordan and Edward Farhi · 2008
Cited alongside, same era.
Vicky Choi · 2010
Cited alongside, same era.
A fully programmable 100-spin coherent Ising machine with all-to-all connections
Peter L. McMahon, Alireza Marandi, Yoshitaka Haribara, Ryan Hamerly, Carsten Langrock, Shuhei Tamate, Takahiro Inagaki, Hiroki Takesue, Shoko Utsunomiya, Kazuyuki Aihara, Robert L. Byer, M. M. Fejer, Hideo Mabuchi, and Yoshihisa Yamamoto · 2016
Later among the works it cites.
Probing many-body dynamics on a 51-atom quantum simulator
Hannes Bernien, Sylvain Schwartz, Alexander Keesling, Harry Levine, Ahmed Omran, Hannes Pichler, Soonwon Choi, Alexander S. Zibrov, Manuel Endres, Markus Greiner, Vladan Vuletić, and Mikhail D. Lukin · 2017
Later among the works it cites.
Modernizing quantum annealing using local searches
Nicholas Chancellor · 2017
Later among the works it cites.
Circuit design for multi-body interactions in superconducting quantum annealing systems with applications to a scalable architecture
Nicholas Chancellor, Stefan Zohren, and Paul A. Warburton · 2017
Later among the works it cites.
Fixed-point adiabatic quantum search
Alexander M. Dalzell, Theodore J. Yoder, and Isaac L. Chuang · 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…
Data structures for statistical computing in python
Wes McKinney · 2010
Cited alongside, same era.
Unstructured randomness, small gaps and localization
Edward Farhi, Jeffrey Goldstone, David Gosset, Sam Gutmann, and Peter Shor · 2011
Cited alongside, same era.
Quantum annealing with manufactured spins
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 · 2011
Cited alongside, same era.
Quantum simulation of the transverse ising model with trapped ions
K Kim, S Korenblit, R Islam, E E Edwards, M-S Chang, C Noh, H Carmichael, G-D Lin, L-M Duan, C C Joseph Wang, J K Freericks, and C Monroe · 2011
Cited alongside, same era.
A study of heuristic guesses for adiabatic quantum computation
Alejandro Perdomo-Ortiz, Salvador E. Venegas-Andraca, and Alán Aspuru-Guzik · 2011
Cited alongside, same era.
Finding low-energy conformations of lattice protein models by quantum annealing
Alejandro Perdomo-Ortiz, Neil Dickson, Marshall Drew-Brook, Geordie Rose, and Alán Aspuru-Guzik · 2012
Cited alongside, same era.
Hybrid annealing: Coupling a quantum simulator to a classical computer
Tobias Graß and Maciej Lewenstein · 2017
Later among the works it cites.
Zhaokai Li, Nikesh S Dattani, Xi Chen, Xiaomei Liu, Hengyan Wang, Richard Tanburn, Hongwei Chen, Xinhua Peng, and Jiangfeng Du · 2017
Later among the works it cites.
Nonlinear susceptibility of a quantum spin glass under uniform transverse and random longitudinal magnetic fields
S. G. Magalhaes, C. V. Morais, F. M. Zimmer, M. J. Lazo, and F. D. Nobre · 2017
Later among the works it cites.
Quantum speedup of the traveling-salesman problem for bounded-degree graphs
Dominic J. Moylett, Noah Linden, and Ashley Montanaro · 2017
Later among the works it cites.
Stability of the quantum Sherrington-Kirkpatrick spin glass model
A. P. Young · 2017
Later among the works it cites.
Quantum Boltzmann machine
Mohammad H. Amin, Evgeny Andriyash, Jason Rolfe, Bohdan Kulchytskyy, and Roger Melko · 2018
Later among the works it cites.
Quantum algorithm for energy matching in hard optimization problems
C. L. Baldwin and C. R. Laumann · 2018
Later among the works it cites.
Efficient Population Transfer via Non-Ergodic Extended States in Quantum Spin Glass
Kostyantyn Kechedzhi, Vadim Smelyanskiy, Jarrod R. McClean, Vasil S. Denchev, Masoud Mohseni, Sergei Isakov, Sergio Boixo, Boris Altshuler, and Hartmut Neven · 2018
Later among the works it cites.
Quantum-walk speedup of backtracking algorithms
Ashley Montanaro · 2018
Later among the works it cites.
Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail D. Lukin · 2018
Later among the works it cites.
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms , pages 1783–1793
Andris Ambainis, Kaspars Balodis, Jānis Iraids, Martins Kokainis, Krišjānis Prūsis, and Jevgēnijs Vihrovs · 2019
Closest in time.
Finding spin-glass ground states using quantum walks [dataset], 2019
N Chancellor, A Callison, V Kendon, and F Mintert · 2019
Closest in time.
Practical designs for permutation-symmetric problem hamiltonians on hypercubes, Sep 2019
A. Ben Dodds, Viv Kendon, Charles S. Adams, and Nicholas Chancellor · 2019
Closest in time.
Quantum annealing with longitudinal bias fields
Tobias Graß · 2019
Closest in time.
Duality in Quantum Quenches and Classical Approximation Algorithms: Pretty Good or Very Bad, November 2019
Matthew B. Hastings · 2019
Closest in time.
Equation planting: A tool for benchmarking ising machines
Itay Hen · 2019
Closest in time.
A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
S. Marsh and J. B. Wang · 2019
Closest in time.
Power of pausing: Advancing understanding of thermalization in experimental quantum annealers
Jeffrey Marshall, Davide Venturelli, Itay Hen, and Eleanor G. Rieffel · 2019
Closest in time.
Quantum search with hybrid adiabatic–quantum-walk algorithms and realistic noise
James G. Morley, Nicholas Chancellor, Sougato Bose, and Viv Kendon · 2019
Closest in time.
Improving quantum annealing of the ferromagnetic p p -spin model through pausing
G. Passarelli, V. Cataudella, and P. Lucignano · 2019
Closest in time.
Effectiveness of a general continuous time subroutine for hybrid quantum/classical optimisation, 2020
Laur Nita, Matthew Walsh, Jie Chen, Adam Callison, Viv Kendon, and Nicholas Chancellor · 2020
Closest in time.
D-Wave Systems Inc. website, 1999–
D-Wave · 2026
Closest in time.
SciPy: Open source scientific tools for Python, 2001–
Eric Jones, Travis Oliphant, Pearu Peterson, et al · 2026
Closest in time.