Fetching the paper…
Reading the bibliography…
In this work, we compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers such as Gurobi and MQLib to solve the combinatorial optimization problem MaxCut on 3-regular graphs.
Nicholas C. Wormald, “The asymptotic distribution of short cycles in random regular graphs,” J. Comb. Theory. Ser. B 31
1981
Earlier work this paper cites.
Michel X. Goemans and David P. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” J. ACM 42
1995
Earlier work this paper cites.
R. Dechter, “Bucket elimination: A unifying framework for probabilistic inference,” in Learning in Graphical Models (Springer Netherlands, 1998) pp. 75–104
1998
Earlier work this paper cites.
2004
Earlier work this paper cites.
Eran Halperin, Dror Livnat, and Uri Zwick, “Max cut in cubic graphs,” Journal of Algorithms 53
2004
Earlier work this paper cites.
Brendan D. McKay, Nicholas C. Wormald, and Beata Wysocka, “Short cycles in random regular graphs,” Electron. J. Comb. 11
2004
Earlier work this paper cites.
Igor L. Markov and Yaoyun Shi, “Simulating quantum computation by contracting tensor networks,” SIAM. J. Sci. Comput. 38
2008
Earlier work this paper cites.
Robert Elsässer and Tobias Tscheuschner, “Settling the complexity of local max-cut (almost) completely,” in Automata, Languages and Programming (Springer Berlin Heidelberg, 2011) pp. 171–182
2011
Earlier work this paper cites.
John Preskill, “Quantum computing and the entanglement frontier,” (2012), arXiv:1203.5813 [quant-ph]
2012
Earlier work this paper cites.
A. Peruzzo et. al., “A variational eigenvalue solver on a photonic quantum processor,” Nat. Commun. 5
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
Thomas Häner and Damian S. Steiger, “0.5 petabyte simulation of a 45-qubit quantum circuit,” Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis SC ’17 (2017), 10.1145/3126908.3126947
2017
Earlier work this paper cites.
John Preskill, “Quantum computing in the NISQ era and beyond,” Quantum 2
2018
Earlier work this paper cites.
Iain Dunning, Swati Gupta, and John 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.
Daniel J. Harvey and David R. Wood, “The treewidth of line graphs,” J. Comb. Theory. Ser. B 132
2018
Earlier work this paper cites.
F. Arute et. al., “Quantum supremacy using a programmable superconducting processor,” Nature 574
2019
Cited alongside, same era.
G. G. Guerreschi and A. Y. Matsuura, “QAOA for Max-Cut requires hundreds of qubits for quantum speed-up,” Sci. Rep. 9
2019
Cited alongside, same era.
Ruslan Shaydulin, Ilya Safro, and Jeffrey Larson, “Multistart methods for quantum approximate optimization,” 2019 IEEE High Performance Extreme Computing Conference (HPEC) (2019), 10.1109/hpec.2019.8916288
2019
Cited alongside, same era.
Xin-Chuan Wu, Sheng Di, Emma Maitreyee Dasgupta, Franck Cappello, Hal Finkel, Yuri Alexeev, and Frederic T. Chong, “Full-state quantum circuit simulation by using data compression,” Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (2019), 10.1145/3295500.3356155
2019
Cited alongside, same era.
Rebekah Herrman, Lorna Treffert, James Ostrowski, Phillip C. Lotshaw, Travis S. Humble, and George Siopsis, “Impact of graph structures for QAOA on MaxCut,” Quantum. Inf. Process. 20
2021
Later among the works it cites.
Ruslan Shaydulin, Kunal Marwaha, Jonathan Wurtz, and Phillip C. Lotshaw, “QAOAKit: A toolkit for reproducible study, application, and verification of the QAOA,” 2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) (2021), 10.1109/qcs54837.2021.00011
2021
Later among the works it cites.
Ruslan Shaydulin and Stefan M. Wild, “Exploiting symmetry reduces the cost of training qaoa,” IEEE trans. quantum eng. 2
2021
Later among the works it cites.
Danylo Lykov, “QTensor,” https://github.com/danlkv/qtensor (2021)
2021
Later among the works it cites.
Johnnie Gray and Stefanos Kourtis, “Hyper-optimized tensor network contraction,” Quantum 5
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail D. Lukin, “Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices,” Phys. Rev. X 10
2020
Cited alongside, same era.
Michel Fabrice Serret, Bertrand Marchand, and Thomas Ayral, “Solving optimization problems with Rydberg analog quantum computers: Realistic requirements for quantum advantage using noisy simulation and classical benchmarks,” Phys. Rev. A 102
2020
Cited alongside, same era.
Michael Streif and Martin Leib, “Training the quantum approximate optimization algorithm without access to a quantum processing unit,” Quantum Sci. Technol. 5
2020
Cited alongside, same era.
Roman Schutski, Danil Lykov, and Ivan Oseledets, “Adaptive algorithm for quantum circuit simulation,” Phys. Rev. A 101
2020
Cited alongside, same era.
Turbasu Chatterjee, Shah Ishmam Mohtashim, and Akash Kundu, “On the variational perspectives to the graph isomorphism problem,” (2021), 10.48550/arXiv.2111.09821
2021
Cited alongside, same era.
Daniel J. Egger, Jakub Mareček, and Stefan Woerner, “Warm-starting quantum optimization,” Quantum 5
2021
Cited alongside, same era.
L. C. G. Govia, C. Poole, M. Saffman, and H. K. Krovi, “Freedom of the mixer rotation axis improves performance in the quantum approximate optimization algorithm,” Phys. Rev. A 104
2021
Cited alongside, same era.
2021
Cited alongside, same era.
2021
Later among the works it cites.
Juneseo Lee, Alicia B. Magann, Herschel A. Rabitz, and Christian Arenz, “Progress toward favorable landscapes in quantum combinatorial optimization,” Phys. Rev. A 104
2021
Later among the works it cites.
2021
Later among the works it cites.
S. Ebadi et. al., “Quantum optimization of maximum independent set using Rydberg atom arrays,” Science 376
2022
Closest in time.
Linghua Zhu, Ho Lun Tang, George S. Barron, F. A. Calderon-Vargas, Nicholas J. Mayhall, Edwin Barnes, and Sophia E. Economou, “Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer,” Phys. Rev. Research 4
2022
Closest in time.
Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, and Leo Zhou, “The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model,” Leibniz International Proceedings in Informatics (LIPIcs), 232
2022
Closest in time.
Danylo Lykov, Roman Schutski, Alexey Galda, Valeri Vinokur, and Yuri Alexeev, “Tensor network quantum simulator with step-dependent parallelization,” 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (2022), 10.1109/qce53715.2022.00081
2022
Closest in time.
Jonathan Wurtz and Peter J. Love, “Counterdiabaticity and the quantum approximate optimization algorithm,” Quantum 6
2022
Closest in time.
Jason Larkin, Matí as Jonsson, Daniel Justice, and Gian Giacomo Guerreschi, “Evaluation of QAOA based on the approximation ratio of individual samples,” Quantum Sci. Technol. 7
2022
Closest in time.
Henry Liu, Junyu Liu, Rui Liu, Henry Makhanov, Danylo Lykov, Anuj Apte, and Yuri Alexeev, “Embedding learning in hybrid quantum-classical neural networks,” (2022), 10.48550/arXiv.2204.04550
2022
Closest in time.
Boaz Barak and Kunal Marwaha, “Classical algorithms and quantum limitations for maximum cut on high-girth graphs,” (2022), 10.4230/LIPICS.ITCS.2022.14
2022
Closest in time.