Fetching the paper…
Reading the bibliography…
Branch-and-bound is a widely used technique for solving combinatorial optimisation problems where one has access to two procedures: a branching procedure that splits a set of potential solutions into subsets, and a cost procedure that determines a lower bound on the cost of any solution in a given subset.
Finding spin-glass ground states using quantum walks, 2019
A. Callison, N. Chancellor, F. Mintert, and V. Kendon · 1903
Earlier work this paper cites.
Branch-and-bound methods: A survey
E. Lawler and D. Wood · 1966
Earlier work this paper cites.
Solvable model of a spin-glass
D. Sherrington and S. Kirkpatrick · 1975
Earlier work this paper cites.
Exact ground state of amorphous Ising systems
S. Kobe and A. Hartwig · 1978
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 · 1980
Earlier work this paper cites.
A sequence of approximated solutions to the S-K model for spin glasses
G. Parisi · 1980
Earlier work this paper cites.
On the computational complexity of Ising spin glass models
F. Barahona · 1982
Earlier work this paper cites.
On a search problem related to branch-and-bound procedures
R. Karp, M. Saks, and A. Wigderson · 1986
Earlier work this paper cites.
Low autocorrelation binary sequences: statistical mechanics and configuration space analysis
J. Bernasconi · 1987
Earlier work this paper cites.
Randomized parallel algorithms for backtrack search and branch-and-bound computation
R. Karp and Y. Zhang · 1993
Earlier work this paper cites.
A quantum algorithm for finding the minimum, 1996
C. Dürr and P. Høyer · 1996
Earlier work this paper cites.
Quantum mechanics helps in searching for a needle in a haystack
L. Grover · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
P. W. Shor · 1997
Earlier work this paper cites.
Quantum computation by adiabatic evolution
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser · 2000
Earlier work this paper cites.
Analysis of the ∞ \infty -replica symmetry breaking solution of the Sherrington-Kirkpatrick model
A. Crisanti and T. Rizzo · 2002
Cited alongside, same era.
Ground-state energy and frustration of the Sherrington-Kirkpatrick model and related models, 2003
S. Kobe · 2003
Cited alongside, same era.
Low energy excitations in spin glasses from exact ground states
M. Palassini, F. Liers, M. Juenger, and A. Young · 2003
Cited alongside, same era.
Quantum search of spatial regions
S. Aaronson and A. Ambainis · 2005
Cited alongside, same era.
Extremal optimization for Sherrington-Kirkpatrick spin glasses
S. Boettcher · 2005
Cited alongside, same era.
The Parisi formula
M. Talagrand · 2006
Cited alongside, same era.
I. Georgescu, S. Ashhab, and F. Nori · 2014
Later among the works it cites.
Quantum algorithms: an overview
A. Montanaro · 2016
Later among the works it cites.
Low autocorrelation binary sequences
T. Packebusch and S. Mertens · 2016
Later among the works it cites.
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
A. Ambainis and M. Kokainis · 2017
Later among the works it cites.
Quantum sdp-solvers: Better upper and lower bounds
J. van Apeldoorn, A. Gilyén, S. Gribling, and R. de Wolf · 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…
M. Pelikan, H. Katzgraber, and S. Kobe · 2008
Cited alongside, same era.
Replica Symmetry Breaking at Low Temperatures
M. Schmidt · 2008
Cited alongside, same era.
Concentration of measure for the analysis of randomized algorithms
D. Dubhashi and A. Panconesi · 2009
Cited alongside, same era.
Applied Integer Programming: Modeling and Solution
D. Chen, R. Batson, and Y. Dang · 2010
Cited alongside, same era.
Quantum walks and electric networks, 2013
A. Belovs · 2013
Cited alongside, same era.
Time-efficient quantum walks for 3-distinctness
A. Belovs, A. Childs, S. Jeffery, R. Kothari, and F. Magniez · 2013
Cited alongside, same era.
F. Brandão and K. Svore · 2017
Later among the works it cites.
Quantum speedup of the traveling-salesman problem for bounded-degree graphs
D. Moylett, N. Linden, and A. Montanaro · 2017
Later among the works it cites.
Improvements in quantum SDP-solving with applications, 2018
J. van Apeldoorn and A. Gilyén · 2018
Later among the works it cites.
Applying quantum algorithms to constraint satisfaction problems, 2018
E. Campbell, A. Khurana, and A. Montanaro · 2018
Later among the works it cites.
Improved quantum backtracking algorithms using effective resistance estimates
M. Jarret and K. Wan · 2018
Later among the works it cites.
A quantum interior point method for LPs and SDPs, 2018
I. Kerenidis and A. Prakash · 2018
Later among the works it cites.
Optimization of the Sherrington-Kirkpatrick Hamiltonian, 2018
A. Montanari · 2018
Later among the works it cites.
Quantum-walk speedup of backtracking algorithms
A. Montanaro · 2018
Later among the works it cites.
Quantum SDP solvers: Large speed-ups, optimality, and applications to quantum learning
F. Brandão, A. Kalev, T. Li, C. Y.-Y. Lin, K. Svore, and X. Wu · 2019
Closest in time.