Papers
Topics
Authors
Recent
Search
2000 character limit reached

MLQAOA: Graph Learning Accelerated Hybrid Quantum-Classical Multilevel QAOA

Published 22 Apr 2024 in quant-ph, cs.CE, and physics.comp-ph | (2404.14399v3)

Abstract: Learning the problem structure at multiple levels of coarseness to inform the decomposition-based hybrid quantum-classical combinatorial optimization solvers is a promising approach to scaling up variational approaches. We introduce a multilevel algorithm reinforced with the spectral graph representation learning-based accelerator to tackle large-scale graph maximum cut instances and fused with several versions of the quantum approximate optimization algorithm (QAOA) and QAOA-inspired algorithms. The graph representation learning model utilizes the idea of QAOA variational parameters concentration and substantially improves the performance of QAOA. We demonstrate the potential of using multilevel QAOA and representation learning-based approaches on very large graphs by achieving high-quality solutions in a much faster time. Reproducibility: Our source code and results are available at https://github.com/bachbao/MLQAOA

Definition Search Book Streamline Icon: https://streamlinehq.com
References (70)
  1. Multigrid solvers and multilevel optimization strategies. Multilevel optimization in VLSICAD, pages 1–69, 2003.
  2. Variational quantum algorithms. Nature Reviews Physics, 3(9):625–644, August 2021.
  3. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028, 2014.
  4. Noisy intermediate-scale quantum algorithms. Reviews of Modern Physics, 94(1), February 2022.
  5. Qaoa for max-cut requires hundreds of qubits for quantum speed-up. Scientific Reports, 9:6903, 2019.
  6. Graph representation learning for parameter transferability in quantum approximate optimization algorithm. arXiv preprint arXiv:2401.06655, 2024.
  7. A hybrid approach for solving optimization problems on small quantum computers. Computer, 52(6):18–26, 2019.
  8. Multilevel combinatorial optimization across quantum architectures. ACM Transactions on Quantum Computing, 2(1), feb 2021.
  9. Hybrid quantum-classical multilevel approach for maximum cuts on graphs. In 2023 IEEE High Performance Extreme Computing Conference (HPEC), pages 1–7. IEEE, 2023.
  10. Quantum-informed recursive optimization algorithms. arXiv preprint arXiv:2308.13607, 2023.
  11. Yuan Ye. Gset - a suite-style benchmark for graph processing systems. https://web.stanford.edu/~yyye/yyye/Gset/, 2003.
  12. Howard Karloff. How good is the Goemans-Williamson MAX CUT algorithm? In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC ’96, page 427–434, 1996.
  13. The university of florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS), 38(1):1–25, 2011.
  14. The network data repository with interactive graph analytics and visualization. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1), Mar. 2015.
  15. Some simplified np-complete problems. In Proceedings of the sixth annual ACM symposium on Theory of computing, pages 47–63, 1974.
  16. Advanced coarsening schemes for graph partitioning. In International Symposium on Experimental Algorithms, pages 369–380. Springer, 2012.
  17. Visualizing large graphs. Wiley Interdisciplinary Reviews: Computational Statistics, 7(2):115–136, 2015.
  18. Graph minimum linear arrangement by multilevel weighted edge contractions. Journal of Algorithms, 60(1):24–41, 2006.
  19. Multiscale planar graph generation. Applied Network Science, 4:1–28, 2019.
  20. Algebraic distance on graphs. SIAM Journal on Scientific Computing, 33(6):3468–3490, 2011.
  21. A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications. IEEE Transactions on Knowledge and Data Engineering, 30(9):1616–1637, September 2018.
  22. Graph Embedding via Diffusion-Wavelets-Based Node Feature Distribution Characterization. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pages 3478–3482. ACM, October 2021.
  23. A simple yet effective baseline for non-attributed graph classification, May 2022. arXiv:1811.03508 [cs, stat].
  24. Invariant embedding for graph classification. In ICML 2019 Workshop on Learning and Reasoning with Graph-Structured Data, 2019.
  25. graph2vec: Learning Distributed Representations of Graphs, July 2017. arXiv:1707.05005 [cs].
  26. Nino Shervashidze. Weisfeiler-Lehman Graph Kernels. Journal of Machine Learning Research, 2011.
  27. On graph kernels: Hardness results and efficient alternatives. In Bernhard Schölkopf and Manfred K. Warmuth, editors, Learning Theory and Kernel Machines, pages 129–143, Berlin, Heidelberg, 2003. Springer Berlin Heidelberg.
  28. K.M. Borgwardt and H. Kriegel. Shortest-Path Kernels on Graphs. In Fifth IEEE International Conference on Data Mining (ICDM’05), pages 74–81, Houston, TX, USA, 2005. IEEE.
  29. Deep Graph Kernels. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 1365–1374, Sydney NSW Australia, August 2015. ACM.
  30. Gl2vec: Graph embedding enriched by line graphs with edge features. In Tom Gedeon, Kok Wai Wong, and Minho Lee, editors, Neural Information Processing, pages 3–14, Cham, 2019. Springer International Publishing.
  31. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2016.
  32. Simplifying graph convolutional networks. In International conference on machine learning, pages 6861–6871. PMLR, 2019.
  33. How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018.
  34. Causal graphsage: A robust graph method for classification based on causal sampling. Pattern Recognition, 128:108696, 08 2022.
  35. N De Lara and E Pineau. A simple baseline algorithm for graph classification. arxiv (2018). arXiv preprint arXiv:1810.09155, pages 1–7, 2018.
  36. Netlsd: Hearing the shape of a graph. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD ’18, page 2347–2356, New York, NY, USA, 2018. Association for Computing Machinery.
  37. Hunt for the unique, stable, sparse and fast feature learning on graphs. In I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 30. Curran Associates, Inc., 2017.
  38. Similarity-based parameter transferability in the quantum approximate optimization algorithm. Frontiers in Quantum Science and Technology, 2, 2023.
  39. Warm-starting quantum optimization. Quantum, 5:479, June 2021.
  40. Improving quantum approximate optimization by noise-directed adaptive remapping. arXiv preprint arXiv:2404.01412, 2024.
  41. Quantum neural architecture search with quantum circuits metric and bayesian optimization. In ICML 2022 2nd AI for Science Workshop, 2022.
  42. Classical symmetries and the quantum approximate optimization algorithm. Quantum Information Processing, 20(11):359, 2021.
  43. Multilevel combinatorial optimization across quantum architectures. ACM Transactions on Quantum Computing, 2(1):1–29, 2021.
  44. Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms. arXiv preprint arXiv:2306.00494, 2023.
  45. Qaoa-in-qaoa: Solving large-scale maxcut problems on small quantum machines. Phys. Rev. Appl., 19:024027, Feb 2023.
  46. Cutting quantum circuits to run on quantum and classical platforms. arXiv preprint arXiv:2205.05836, 2022.
  47. Clifford-based circuit cutting for quantum simulation. In Proceedings of the 50th Annual International Symposium on Computer Architecture, ISCA ’23, New York, NY, USA, 2023. Association for Computing Machinery.
  48. Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps. Nature Communications, 13(1), 2022.
  49. Noise-induced barren plateaus in variational quantum algorithms. Nature Communications, 12(1):6961, November 2021.
  50. Evaluating quantum approximate optimization algorithm: A case study. In 2019 tenth international green and sustainable computing conference (IGSC), pages 1–6. IEEE, 2019.
  51. Multistart methods for quantum approximate optimization. In 2019 IEEE High Performance Extreme Computing Conference (HPEC), pages 1–8. IEEE, 2019.
  52. Learning to optimize variational quantum circuits to solve combinatorial problems. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 2367–2375, 2020.
  53. Transferability of optimal qaoa parameters between random graphs. In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 171–180. IEEE, 2021.
  54. Similarity-based parameter transferability in the quantum approximate optimization algorithm. Front. Quantum. Sci. Technol., 2:1200975, July 2023.
  55. LLC Gurobi Optimization. Gurobi optimizer reference manual, 2021.
  56. Obstacles to variational quantum optimization from symmetry protection. Physical Review Letters, 125(26), December 2020.
  57. Relaxation-based coarsening and multiscale graph organization. Multiscale Modeling & Simulation, 9(1):407–423, 2011.
  58. What works best when? a systematic evaluation of heuristics for max-cut and qubo. INFORMS Journal on Computing, 30(3), 2018.
  59. Cirq Developers. Cirq. version v0, 12, 2021.
  60. Expectation values from the single-layer quantum approximate optimization algorithm on ising problems. Quantum Science and Technology, 7(4):045036, September.
  61. IBM Quantum. https://quantum.ibm.com/, 2021.
  62. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6):1115–1145, nov 1995.
  63. Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM Journal on Optimization, 10(2):443–461, 2000.
  64. Combinatorial optimization with physics-inspired graph neural networks. Nature Machine Intelligence, 4(4):367–377, 2022.
  65. Breakout local search for the max-cutproblem. Engineering Applications of Artificial Intelligence, 26(3):1162–1173, 2013.
  66. What works best when? a systematic evaluation of heuristics for max-cut and QUBO. INFORMS Journal on Computing, 30(3), 2018.
  67. Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM Journal on Optimization, 12, 07 2001.
  68. A low-level hybridization between memetic algorithm and vns for the max-cut problem. pages 999–1006, 06 2005.
  69. Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR, 8:239–253, 2010.
  70. Estimation of distribution algorithm for the max-cut problem. In Graph-Based Representations in Pattern Recognition, pages 244–253, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg.
Citations (3)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (3)

  1. Bao Bach 
  2. Jose Falla 
  3. Ilya Safro 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free