Fetching the paper…
Reading the bibliography…
State-of-the-art classical optimization solvers set a high bar for quantum computers to deliver utility in this domain.
W. K. Hastings, Monte carlo sampling methods using Markov chains and their applications, Biometrika 57
1970
Earlier work this paper cites.
C. G. Broyden, The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations, IMA J. Appl. Math. 6
1970
Earlier work this paper cites.
R. Fletcher, A new approach to variable metric algorithms, Comput. J. 13
1970
Earlier work this paper cites.
D. Goldfarb, A family of variable-metric methods derived by variational means, Math. Comput. 24
1970
Earlier work this paper cites.
D. F. Shanno, Conditioning of quasi-Newton methods for function minimization, Math. Comput. 24
1970
Earlier work this paper cites.
D. Sherrington and S. Kirkpatrick, Solvable Model of a Spin-Glass, Phys. Rev. Lett. 35
1975
Earlier work this paper cites.
S. F. Edwards and P. W. Anderson, Theory of spin glasses, J. Phys. F: Met. Phys. 5
1975
Earlier work this paper cites.
S. F. Edwards and P. W. Anderson, Theory of spin glasses. II, J. Phys. F: Met. Phys. 6
1976
Earlier work this paper cites.
F. Barahona, On the computational complexity of Ising spin glass models, J. Phys. A Math. Theor. 15
1982
Earlier work this paper cites.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science 220
1983
Earlier work this paper cites.
G. Parisi, Order Parameter for Spin-Glasses, Phys. Rev. Lett. 50
1983
Earlier work this paper cites.
K. Binder and A. P. Young, Spin glasses: Experimental facts, theoretical concepts, and open questions, Rev. Mod. Phys. 58
1986
Earlier work this paper cites.
M. X. Goemans and D. P. Williamson, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, J. ACM 42
1995
Earlier work this paper cites.
E. D. Andersen and K. D. Andersen, Presolving in linear programming, Mathematical Programming 71
1995
Earlier work this paper cites.
K. Hukushima and K. Nemoto, Exchange Monte Carlo Method and Application to Spin Glass Simulations, J. Phys. Soc. Jpn. 65
1996
Earlier work this paper cites.
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Courier, North Chelmsford, 1998)
1998
Earlier work this paper cites.
A. Steane, Quantum computing, Rep. Prog. Phys. 61
1998
Earlier work this paper cites.
E. Turkel, Preconditioning Techniques in Computational Fluid Dynamics, Annu. Rev. Fluid Mech. 31
1999
Earlier work this paper cites.
P. Berman and M. Karpinski, On Some Tighter Inapproximability Results (Extended Abstract), in Automata, Languages and Programming , edited by J. Wiedermann, P. van Emde Boas, and M. Nielsen (Springer Berlin Heidelberg, Berlin, Heidelberg, 1999) pp. 200–209
1999
Earlier work this paper cites.
A. STEGER and N. C. WORMALD, Generating Random Regular Graphs Quickly, Comb. Probab. Comput. 8
1999
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum Computation by Adiabatic Evolution, arXiv:quant-ph/0001106 (2000)
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, Science 292
2001
Earlier work this paper cites.
S. Boettcher and A. G. Percus, Extremal optimization for graph partitioning, Phys. Rev. E 64
2001
Earlier work this paper cites.
S. Burer, R. D. C. Monteiro, and Y. Zhang, Rank-two relaxation heuristics for max-cut and other binary quadratic programs, SIAM J. Optim. 12
2002
Earlier work this paper cites.
C. H. Papadimitriou, Computational complexity, in Encyclopedia of Computer Science (John Wiley and Sons Ltd., GBR, 2003) p. 260–265
2003
Earlier work this paper cites.
S. Burer and R. D. C. Monteiro, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Math. Program. 95
2003
Earlier work this paper cites.
J. H. Kim and V. H. Vu, Generating Random Regular Graphs, in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing , STOC ’03 (Association for Computing Machinery, New York, NY, USA, 2003) p. 213–222
2003
Earlier work this paper cites.
N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of State Calculations by Fast Computing Machines, J. Chem. Phys. 21
2004
Earlier work this paper cites.
E. Halperin, D. Livnat, and U. Zwick, MAX CUT in cubic graphs, J. Algorithms 53
2004
Earlier work this paper cites.
T. Castellani and A. Cavagna, Spin-glass theory for pedestrians, J. Stat. Mech.: Theory Exp. 2005
2005
Earlier work this paper cites.
A. Das and B. K. Chakrabarti, Colloquium: Quantum annealing and analog quantum computation, Rev. Mod. Phys. 80
2008
Earlier work this paper cites.
A. A. Hagberg, D. A. Schult, and P. J. Swart, Exploring Network Structure, Dynamics, and Function using Networkx, in Proceedings of the 7th Python in Science Conference , edited by G. Varoquaux, T. Vaught, and J. Millman (Pasadena, CA USA, 2008) pp. 11 – 15
2008
Earlier work this paper cites.
E. Knill, D. Leibfried, R. Reichle, J. Britton, R. B. Blakestad, J. D. Jost, C. Langer, R. Ozeri, S. Seidelin, and D. J. Wineland, Randomized benchmarking of quantum gates, Phys. Rev. A 77
2008
Earlier work this paper cites.
M. Mézard and A. Montanari, Information, Physics, and Computation (Oxford University Press, 2009)
2009
Earlier work this paper cites.
T. D. Ladd, F. Jelezko, R. Laflamme, Y. Nakamura, C. Monroe, and J. L. O’Brien, Quantum computers, Nature 464
2010
Earlier work this paper cites.
D. P. Williamson and D. B. Shmoys, The Design of Approximation Algorithms (Cambridge University Press, 2011)
2011
Earlier work this paper cites.
B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms , Vol. 2 (Springer, Berlin Heidelberg New York, 2012)
2012
Earlier work this paper cites.
E. Farhi, D. Gosset, I. Hen, A. W. Sandvik, P. Shor, A. P. Young, and F. Zamponi, Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs, Phys. Rev. A 86
2012
Earlier work this paper cites.
G. Kochenberger, J.-K. Hao, F. Glover, M. Lewis, Z. Lü, H. Wang, and Y. Wang, The unconstrained binary quadratic programming problem: a survey, J. Comb. Optim. 28
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
A. Lucas, Ising formulations of many NP problems, Front. Phys. 2
2014
Earlier work this paper cites.
R. Orús, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Ann. Phys. (N. Y.) 349
2014
Earlier work this paper cites.
A. J. Wathen, Preconditioning, Acta Numer. 24
2015
Earlier work this paper cites.
G. Gamrath, T. Koch, A. Martin, M. Miltenberger, and D. Weninger, Progress in presolving for mixed integer programming, Mathematical Programming Computation 7
2015
Earlier work this paper cites.
D. Venturelli, S. Mandrà, S. Knysh, B. O’Gorman, R. Biswas, and V. Smelyanskiy, Quantum optimization of fully connected spin glasses, Phys. Rev. X 5
2015
Earlier work this paper cites.
C.-W. Liu, A. Polkovnikov, and A. W. Sandvik, Quantum versus classical annealing: Insights from scaling theory and results for spin glasses on 3-regular graphs, Phys. Rev. Lett. 114
2015
Earlier work this paper cites.
K. M. Gegner, A. B. Birchfield, T. Xu, K. S. Shetye, and T. J. Overbye, A methodology for the creation of geographically realistic synthetic power flow models, in 2016 IEEE Power and Energy Conference at Illinois (PECI) (2016) pp. 1–6
2016
Earlier work this paper cites.
J. J. Wallman and J. Emerson, Noise tailoring for scalable quantum computation via randomized compiling, Phys. Rev. A 94
2016
Earlier work this paper cites.
H. Goto, Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network, Sci. Rep. 6
2016
Earlier work this paper cites.
ARPA-E GridData Program, ACTIVSg500: 500 bus synthetic grid on footprint of South Carolina (2017)
2017
Earlier work this paper cites.
T. Xu, A. B. Birchfield, K. S. Shetye, and T. J. Overbye, Creation of synthetic electric grid models for transient stability studies, in The 10th Bulk Power Systems Dynamics and Control Symposium (IREP 2017) (2017) pp. 1–6
2017
Earlier work this paper cites.
I. Dunning, S. Gupta, and J. Silberholz, What works best when? a systematic evaluation of heuristics for max-cut and QUBO, INFORMS J. Comput. 30
2018
Earlier work this paper cites.
T. Albash and D. A. Lidar, Demonstration of a scaling advantage for a quantum annealer over simulated annealing, Phys. Rev. X 8
2018
Earlier work this paper cites.
M. B. Hastings, A Short Path Quantum Algorithm for Exact Optimization, Quantum 2
2018
Cited alongside, same era.
J. Gray, quimb: a python library for quantum information and many-body calculations, Journal of Open Source Software 3
2018
Cited alongside, same era.
2019
Cited alongside, same era.
R. Shaydulin, I. Safro, and J. Larson, Multistart methods for quantum approximate optimization, in 2019 IEEE High Performance Extreme Computing Conference (HPEC) (2019) pp. 1–8
2019
Cited alongside, same era.
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, Algorithms 12
M. Dupont, B. Evert, M. J. Hodson, B. Sundar, S. Jeffrey, Y. Yamaguchi, D. Feng, F. B. Maciejewski, S. Hadfield, M. S. Alam, Z. Wang, S. Grabbe, P. A. Lott, E. G. Rieffel, D. Venturelli, and M. J. Reagor, Quantum-enhanced greedy combinatorial optimization solver, Sci. Adv. 9
2023
Later among the works it cites.
H. Jing, Y. Wang, and Y. Li, Data-driven quantum approximate optimization algorithm for power systems, Comms. Eng. 2
2023
Later among the works it cites.
T. Ayral, T. Louvet, Y. Zhou, C. Lambert, E. M. Stoudenmire, and X. Waintal, Density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity, PRX Quantum 4
2023
Later among the works it cites.
A. Matsuo, S. Yamashita, and D. J. Egger, A SAT Approach to the Initial Mapping Problem in Swap Gate Insertion for Commuting Gates, IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E106.A
2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
Y. Chen, M. Farahzad, S. Yoo, and T.-C. Wei, Detector tomography on IBM quantum computers and mitigation of an imperfect measurement, Phys. Rev. A 100
2019
Cited alongside, same era.
H. Goto, K. Tatsumura, and A. R. Dixon, Combinatorial optimization by simulating adiabatic bifurcations in nonlinear hamiltonian systems, Sci. Adv. 5
2019
Cited alongside, same era.
W. Yao, A. S. Bandeira, and S. Villar, Experimental performance of graph neural networks on random instances of max-cut, in Wavelets and Sparsity XVIII , Vol. 11138, edited by D. V. D. Ville, M. Papadakis, and Y. M. Lu, International Society for Optics and Photonics (SPIE, 2019) p. 111380S
2019
Cited alongside, same era.
M. Aramon, G. Rosenberg, E. Valiante, T. Miyazawa, H. Tamura, and H. G. Katzgraber, Physics-inspired optimization for quadratic unconstrained problems using a digital annealer, Front. Phys. 7
2019
Cited alongside, same era.
A. Montanari, Optimization of the sherrington-kirkpatrick hamiltonian, in 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (2019) pp. 1417–1433
2019
Cited alongside, same era.
P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. D. Oliver, Perspectives of quantum annealing: methods and implementations, Rep. Prog. Phys. 83
2020
Cited alongside, same era.
P. J. Karalekas, N. A. Tezak, E. C. Peterson, C. A. Ryan, M. P. da Silva, and R. S. Smith, A quantum-classical cloud platform optimized for variational hybrid algorithms, Quantum Sci. Technol. 5
2020
Cited alongside, same era.
M. Bechtold, J. Barzen, F. Leymann, A. Mandl, J. Obst, F. Truger, and B. Weder, Investigating the effect of circuit cutting in qaoa for the maxcut problem on nisq devices, Quantum Sci. Technol. 8
2023
Later among the works it cites.
A. Angone, X. Liu, R. Shaydulin, and I. Safro, Hybrid quantum-classical multilevel approach for maximum cuts on graphs, in 2023 IEEE High Performance Extreme Computing Conference (HPEC) (2023) pp. 1–7
2023
Later among the works it cites.
A. Galda, E. Gupta, J. Falla, X. Liu, D. Lykov, Y. Alexeev, and I. Safro, Similarity-based parameter transferability in the quantum approximate optimization algorithm, Front. Quantum Sci. Technol. Volume 2 - 2023
2023
Later among the works it cites.
R. Shaydulin, P. C. Lotshaw, J. Larson, J. Ostrowski, and T. S. Humble, Parameter transfer for quantum approximate optimization of weighted maxcut, ACM Transactions on Quantum Computing 4
2023
Later among the works it cites.
Z. Cai, R. Babbush, S. C. Benjamin, S. Endo, W. J. Huggins, Y. Li, J. R. McClean, and T. E. O’Brien, Quantum error mitigation, Rev. Mod. Phys. 95
2023
Later among the works it cites.
Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. van den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala, Evidence for the utility of quantum computing before fault tolerance, Nature 618
2023
Later among the works it cites.
2023
Later among the works it cites.
R. Shaydulin and M. Pistoia, Qaoawith n ⋅ p ≥ 200 n\cdot p\geq 200 , in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) , Vol. 01 (2023) pp. 1074–1077
2023
Later among the works it cites.
M. DeCross, E. Chertkov, M. Kohagen, and M. Foss-Feig, Qubit-reuse compilation with mid-circuit measurement and reset, Phys. Rev. X 13
2023
Later among the works it cites.
D. Lykov, J. Wurtz, C. Poole, M. Saffman, T. Noel, and Y. Alexeev, Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm, npj Quantum Inf. 9
2023
Later among the works it cites.
M. C. Angelini and F. Ricci-Tersenghi, Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set, Nat. Mach. Intell. 5
2023
Later among the works it cites.
S. Boettcher, Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems, Nat. Mach. Intell. 5
2023
Later among the works it cites.
M. J. A. Schuetz, J. K. Brubaker, and H. G. Katzgraber, Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set, Nat. Mach. Intell. 5
2023
Later among the works it cites.
A. Abbas, A. Ambainis, B. Augustino, A. Bärtschi, H. Buhrman, C. Coffrin, G. Cortiana, V. Dunjko, D. J. Egger, B. G. Elmegreen, N. Franco, F. Fratini, B. Fuller, J. Gacon, C. Gonciulea, S. Gribling, S. Gupta, S. Hadfield, R. Heese, G. Kircher, T. Kleinert, T. Koch, G. Korpas, S. Lenk, J. Marecek, V. Markov, G. Mazzola, S. Mensa, N. Mohseni, G. Nannicini, C. O’Meara, E. P. Tapia, S. Pokutta, M. Proissl, P. Rebentrost, E. Sahin, B. C. B. Symons, S. Tornow, V. Valls, S. Woerner, M. L. Wolf-Bauwens, J. Yard, S. Yarkoni, D. Zechiel, S. Zhuk, and C. Zoufal, Challenges and opportunities in quantum optimization, Nat. Rev. Phys. 6
2024
Later among the works it cites.
K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, and A. Summer, A review on quantum approximate optimization algorithm and its variants, Phys. Rep. 1068
2024
Later among the works it cites.
2024
Later among the works it cites.
R. Shaydulin, C. Li, S. Chakrabarti, M. DeCross, D. Herman, N. Kumar, J. Larson, D. Lykov, P. Minssen, Y. Sun, Y. Alexeev, J. M. Dreiling, J. P. Gaebler, T. M. Gatterman, J. A. Gerber, K. Gilmore, D. Gresh, N. Hewitt, C. V. Horst, S. Hu, J. Johansen, M. Matheny, T. Mengle, M. Mills, S. A. Moses, B. Neyenhuis, P. Siegfried, R. Yalovetzky, and M. Pistoia, Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem, Sci. Adv. 10
2024
Later among the works it cites.
2024
Later among the works it cites.
M. Dupont and B. Sundar, Extending relax-and-round combinatorial optimization solvers with quantum correlations, Phys. Rev. A 109
2024
Later among the works it cites.
2024
Later among the works it cites.
S. H. Sack and D. J. Egger, Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation, Phys. Rev. Res. 6
2024
Later among the works it cites.
B. Bach, J. Falla, and I. Safro, Mlqaoa: Graph learning accelerated hybrid quantum-classical multilevel qaoa, in 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) , Vol. 01 (2024) pp. 1–12
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
F. B. Maciejewski, B. G. Bach, M. Dupont, P. A. Lott, B. Sundar, D. E. B. Neira, I. Safro, and D. Venturelli, A Multilevel Approach for Solving Large-Scale QUBO Problems with Noisy Hybrid Quantum Approximate Optimization, in 2024 IEEE High Performance Extreme Computing Conference (HPEC) (2024) pp. 1–10
2024
Later among the works it cites.
T. Lubinski, C. Coffrin, C. McGeoch, P. Sathe, J. Apanavicius, D. Bernal Neira, and Q. E. D. C.-C. Collaboration, Optimization applications as quantum performance benchmarks, ACM Transactions on Quantum Computing 5
2024
Later among the works it cites.
S. H. Sureshbabu, D. Herman, R. Shaydulin, J. Basso, S. Chakrabarti, Y. Sun, and M. Pistoia, Parameter Setting in Quantum Approximate Optimization of Weighted Problems, Quantum 8
2024
Later among the works it cites.
M. Schnaus, L. Palackal, B. Poggel, X. Runge, H. Ehm, J. M. Lorenz, and C. B. Mendl, Efficient encodings of the travelling salesperson problem for variational quantum algorithms, in 2024 IEEE International Conference on Quantum Software (QSW) (2024) pp. 81–87
2024
Later among the works it cites.
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Lukin, Logical quantum processor based on reconfigurable atom arrays, Nature 626
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
Q.-G. Zeng, X.-P. Cui, B. Liu, Y. Wang, P. Mosharev, and M.-H. Yung, Performance of quantum annealing inspired algorithms for combinatorial optimization problems, Commun. phys. 7
2024
Later among the works it cites.
D-Wave, dwave-samplers (2024)
2024
Later among the works it cites.
H. Munoz-Bauza and D. Lidar, Scaling advantage in approximate optimization with quantum annealing, Phys. Rev. Lett. 134
2025
Closest in time.
J. A. Montañez-Barrera and K. Michielsen, Toward a linear-ramp qaoa protocol: evidence of a scaling advantage in solving some combinatorial optimization problems, npj Quantum Inf. 11
2025
Closest in time.
M. Dupont, B. Sundar, B. Evert, D. E. B. Neira, Z. Peng, S. Jeffrey, and M. J. Hodson, Benchmarking quantum optimization for the maximum-cut problem on a superconducting quantum computer, Phys. Rev. Appl. 23
2025
Closest in time.
M. Ponce, R. Herrman, P. C. Lotshaw, S. Powers, G. Siopsis, T. Humble, and J. Ostrowski, Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms, Quantum Inf. Process. 24
2025
Closest in time.
M. Sciorilli, L. Borges, T. L. Patti, D. García-Martín, G. Camilo, A. Anandkumar, and L. Aolita, Towards large-scale quantum optimization solvers with few qubits, Nat. Comm. 16
2025
Closest in time.
A. Acharya, R. Yalovetzky, P. Minssen, S. Chakrabarti, R. Shaydulin, R. Raymond, Y. Sun, D. Herman, R. S. Andrist, G. Salton, M. J. A. Schuetz, H. G. Katzgraber, and M. Pistoia, Decomposition pipeline for large-scale portfolio optimization with applications to near-term quantum computing, Phys. Rev. Res. 7
2025
Closest in time.
M. Larocca, S. Thanasilp, S. Wang, K. Sharma, J. Biamonte, P. J. Coles, L. Cincio, J. R. McClean, Z. Holmes, and M. Cerezo, Barren plateaus in variational quantum computing, Nat. Rev. Phys. 7
2025
Closest in time.
Z. He, R. Shaydulin, D. Herman, C. Li, R. Raymond, S. H. Sureshbabu, and M. Pistoia, Parameter setting heuristics make the quantum approximate optimization algorithm suitable for the early fault-tolerant era, in Proceedings of the 43rd IEEE/ACM International Conference on Computer-Aided Design , ICCAD ’24 (Association for Computing Machinery, New York, NY, USA, 2025)
2025
Closest in time.
J. Robledo-Moreno, M. Motta, H. Haas, A. Javadi-Abhari, P. Jurcevic, W. Kirby, S. Martiel, K. Sharma, S. Sharma, T. Shirakawa, I. Sitdikov, R.-Y. Sun, K. J. Sung, M. Takita, M. C. Tran, S. Yunoki, and A. Mezzacapo, Chemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer, Sci. Adv. 11
2025
Closest in time.
R. C. U. States), Optimization via quantum preconditioning, 10.5281/zenodo.14921060 (2025)
2025
Closest in time.