Fetching the paper…
Reading the bibliography…
One of the major application areas of interest for both near-term and fault-tolerant quantum computers is the optimization of classical objective functions.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,”
1983
Earlier work this paper cites.
B. Gidas, “Global optimization via the langevin equation,”
1985
Earlier work this paper cites.
R. H. Swendsen and J.-S. Wang, “Nonuniversal critical dynamics in Monte Carlo simulations,”
1987
Earlier work this paper cites.
P. Raghavan and C. D. Tompson, “Randomized rounding: a technique for provably good algorithms and algorithmic proofs,”
1987
Earlier work this paper cites.
U. Wolff, “Collective Monte Carlo updating for spin systems,”
1989
Earlier work this paper cites.
L. T. Watson and R. T. Haftka, “Modern homotopy methods in optimization,”
1989
Earlier work this paper cites.
D. S. Fisher, “Critical behavior of random transverse-field ising spin chains,”
1995
Earlier work this paper cites.
L. K. Grover, “A fast quantum mechanical algorithm for database search,”
1996
Earlier work this paper cites.
C. Durr and P. Hoyer, “A quantum algorithm for finding the minimum,”
1996
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse ising model,”
1998
Earlier work this paper cites.
E. Farhi and S. Gutmann, “Analog analogue of a digital quantum computation,”
1998
Earlier work this paper cites.
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,”
1999
Earlier work this paper cites.
K. A. Smith, “Neural networks for combinatorial optimization: a review of more than a decade of research,”
1999
Earlier work this paper cites.
N. J. Cerf, L. K. Grover, and C. P. Williams, “Nested quantum search and structured problems,”
2000
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, “Quantum computation by adiabatic evolution,”
2000
Earlier work this paper cites.
A. M. Childs, E. Farhi, J. Goldstone, and S. Gutmann, “Finding cliques by quantum adiabatic evolution,”
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,”
2001
Earlier work this paper cites.
J. Houdayer, “A cluster Monte Carlo algorithm for 2-dimensional spin glasses,”
2001
Earlier work this paper cites.
E. Farhi, J. Goldstone, and S. Gutmann, “Quantum adiabatic evolution algorithms with different paths,”
2002
Earlier work this paper cites.
M. Szegedy, “Quantum speed-up of markov chain based algorithms,”
2004
Earlier work this paper cites.
A. M. Childs and J. Goldstone, “Spatial search by quantum walk,”
2004
Earlier work this paper cites.
F. Hamze and N. de Freitas, “From fields to trees,”
2004
Earlier work this paper cites.
B. W. Reichardt, “The quantum adiabatic optimization algorithm and local minima,”
2004
Earlier work this paper cites.
D. J. Earl and M. W. Deem, “Parallel tempering: Theory, applications, and new perspectives,”
2005
Earlier work this paper cites.
D. M. Dunlavy and D. P. O’Leary, “Homotopy optimization methods for global optimization,”
2005
Earlier work this paper cites.
C. Dürr, M. Heiligman, P. Hoyer, and M. Mhalla, “Quantum query complexity of some graph problems,”
2006
Earlier work this paper cites.
J. Nocedal and S. Wright, Numerical optimization (Springer Science & Business Media, 2006)
2006
Earlier work this paper cites.
M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Nest, and H.-J. Briegel, “Entanglement in graph states and its applications,”
2006
Earlier work this paper cites.
B. Addis and S. Leyffer, “A trust-region algorithm for global optimization,”
2006
Earlier work this paper cites.
S. Aaronson and A. Ambainis, “The need for structure in quantum speedups,”
2009
Earlier work this paper cites.
S. Dughmi, “Submodular functions: Extensions, distributions, and algorithms. a survey,”
2009
Earlier work this paper cites.
M. Mezard and A. Montanari, Information, physics, and computation (Oxford University Press, 2009)
2009
Cited alongside, same era.
M. W. Johnson, M. H. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, et al. , “Quantum annealing with manufactured spins,”
2011
Cited alongside, same era.
D. P. Williamson and D. B. Shmoys, The design of approximation algorithms (Cambridge University Press, 2011)
2011
Cited alongside, same era.
L. C. Lau, R. Ravi, and M. Singh, Iterative methods in combinatorial optimization , Vol. 46 (Cambridge University Press, 2011)
2011
Cited alongside, same era.
E. Farhi, J. Goldston, D. Gosset, S. Gutmann, H. B. Meyer, and P. Shor, “Quantum adiabatic algorithms, small gaps, and different paths,”
2011
Cited alongside, same era.
2018
Later among the works it cites.
J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, “Barren plateaus in quantum neural network training landscapes,”
2018
Later among the works it cites.
2018
Later among the works it cites.
A. Ambainis, K. Balodis, J. Iraids, M. Kokainis, K. Prūsis, and J. Vihrovs, “Quantum speedups for exponential-time dynamic programming algorithms,”
2019
Later among the works it cites.
E. Campbell, A. Khurana, and A. Montanaro, “Applying quantum algorithms to constraint satisfaction problems,”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. L. Allgower and K. Georg, Numerical continuation methods: an introduction , Vol. 13 (Springer Science & Business Media, 2012)
2012
Cited alongside, same era.
V. V. Vazirani, Approximation algorithms (Springer Science & Business Media, 2013)
2013
Cited alongside, same era.
S. Boixo, T. F. Rønnow, S. V. Isakov, Z. Wang, D. Wecker, D. A. Lidar, J. M. Martinis, and M. Troyer, “Evidence for quantum annealing with more than one hundred qubits,”
2014
Cited alongside, same era.
A. Selby, “Efficient subgraph-based sampling of Ising-type models with frustration,”
2014
Cited alongside, same era.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’brien, “A variational eigenvalue solver on a photonic quantum processor,”
2014
Cited alongside, same era.
E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,”
2014
Cited alongside, same era.
C. A. Floudas and P. M. Pardalos, Recent advances in global optimization , Vol. 176 (Princeton University press, 2014)
2014
Cited alongside, same era.
2019
Later among the works it cites.
G. Nannicini, “Performance of hybrid quantum-classical variational heuristics for combinatorial optimization,”
2019
Later among the works it cites.
M. B. Hastings, “Classical and quantum bounded depth approximation algorithms,”
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
S. Hadfield, Z. Wang, B. O’Gorman, E. G. Rieffel, D. Venturelli, and R. Biswas, “From the quantum approximate optimization algorithm to a quantum alternating operator ansatz,”
2019
Later among the works it cites.
M. Streif and M. Leib, “Comparison of qaoa with quantum and simulated annealing,”
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
A. F. Izmaylov, T.-C. Yen, R. A. Lang, and V. Verteletskyi, “Unitary partitioning approach to the measurement problem in the variational quantum eigensolver method,”
2019
Later among the works it cites.
2019
Later among the works it cites.
A. Montanaro, “Quantum speedup of branch-and-bound algorithms,”
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
V. N. Smelyanskiy, K. Kechedzhi, S. Boixo, S. V. Isakov, H. Neven, and B. Altshuler, “Nonergodic delocalized states for efficient population transfer within a narrow band of the energy landscape,”
2020
Closest in time.
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, “Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices,”
2020
Closest in time.
L. Li, M. Fan, M. Coram, P. Riley, and S. Leichenauer, “Quantum optimization with a novel gibbs objective function and ansatz architecture search,”
2020
Closest in time.
Z. Wang, N. C. Rubin, J. M. Dominy, and E. G. Rieffel, “ x y xy mixers: Analytical and numerical results for the quantum alternating operator ansatz,”
2020
Closest in time.
A. Chapman and S. T. Flammia, “Characterization of solvable spin models via graph invariants,”
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
V. Akshay, H. Philathong, M. E. Morales, and J. D. Biamonte, “Reachability deficits in quantum approximate optimization,”
2020
Closest in time.
P. K. Barkoutsos, G. Nannicini, A. Robert, I. Tavernelli, and S. Woerner, “Improving Variational Quantum Optimization using CVaR,”
2020
Closest in time.
2020
Closest in time.