Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Utilizing Graph Sparsification for Pre-processing in Maxcut QUBO Solver (2401.13004v1)

Published 23 Jan 2024 in math.OC, cs.DC, and quant-ph

Abstract: We suggest employing graph sparsification as a pre-processing step for maxcut programs using the QUBO solver. Quantum(-inspired) algorithms are recognized for their potential efficiency in handling quadratic unconstrained binary optimization (QUBO). Given that maxcut is an NP-hard problem and can be readily expressed using QUBO, it stands out as an exemplary case to demonstrate the effectiveness of quantum(-inspired) QUBO approaches. Here, the non-zero count in the QUBO matrix corresponds to the graph's edge count. Given that many quantum(-inspired) solvers operate through cloud services, transmitting data for dense graphs can be costly. By introducing the graph sparsification method, we aim to mitigate these communication costs. Experimental results on classical, quantum-inspired, and quantum solvers indicate that this approach substantially reduces communication overheads and yields an objective value close to the optimal solution.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (46)
  1. Raman Arora and Jalaj Upadhyay. 2019. On differentially private graph sparsification and applications. Advances in neural information processing systems 32 (2019).
  2. András A Benczúr and David R Karger. 1996. Approximating s𝑠sitalic_s-t𝑡titalic_t minimum cuts in O⁢(n2)𝑂superscript𝑛2O(n^{2})italic_O ( italic_n start_POSTSUPERSCRIPT 2 end_POSTSUPERSCRIPT ) time. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. 47–55.
  3. Alain Billionnet and Sourour Elloumi. 2007. Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem. Mathematical programming 109 (2007), 55–68.
  4. Lifting and separation procedures for the cut polytope. Mathematical Programming 146 (2014), 351–378.
  5. Upper-bounds for quadratic 0–1 maximization. Operations Research Letters 9, 2 (1990), 73–79.
  6. McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. In ALENEX 2022. 54–66.
  7. Philippe Codognet. 2021. Constraint solving by quantum annealing. In 50th International Conference on Parallel Processing Workshop. 1–10.
  8. Philippe Codognet. 2022. Domain-wall/unary encoding in QUBO for permutation problems. In 2022 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, 167–173.
  9. Oliver Dial. 2022. Eagle’s quantum performance progress. https://research.ibm.com/blog/eagle-quantum-processor-performance
  10. What works best when? A systematic evaluation of heuristics for Max-Cut and QUBO. INFORMS Journal on Computing 30, 3 (2018), 608–624.
  11. Decomposition and linearization for 0-1 quadratic programming. Annals of Operations Research 99, 1-4 (2000), 79–93.
  12. Damir Ferizovic. 2019. A Practical Analysis of Kernelization Techniques for the Maximum Cut Problem. Ph.D. Dissertation. Karlsruher Institut für Technologie (KIT).
  13. Engineering kernelization for maximum cut. In ALENEX 2020. SIAM, 27–41.
  14. Fixstars. 2023. About Amplify AE. https://amplify.fixstars.com/ja/docs/amplify-ae/about.html
  15. Sevag Gharibian and François Le Gall. 2022. Dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum PCP conjecture. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. 19–32.
  16. Michel X Goemans and David P Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM (JACM) 42, 6 (1995), 1115–1145.
  17. Martin Grötschel and George L Nemhauser. 1984. A polynomial algorithm for the max-cut problem on graphs without long odd cycles. Mathematical Programming 29, 1 (1984), 28–40.
  18. Gian Giacomo Guerreschi and Anne Y Matsuura. 2019. QAOA for Max-Cut requires hundreds of qubits for quantum speed-up. Scientific reports 9, 1 (2019), 6903.
  19. LLC Gurobi Optimization. 2021. Gurobi optimizer reference manual.
  20. Roof duality, complementation and persistency in quadratic 0–1 optimization. Mathematical programming 28 (1984), 121–155.
  21. Formulating and solving routing problems on quantum computers. IEEE Transactions on Quantum Engineering 2 (2021), 1–17.
  22. Miguel Herrero-Collantes and Juan Carlos Garcia-Escartin. 2017. Quantum random number generators. Reviews of Modern Physics 89, 1 (2017), 015004.
  23. IBM Japan. 2023. IBM Quantum System One “ibm_kawasaki”. https://www.ibm.com/blogs/think/jp-ja/tag/ibm_kawasaki/
  24. David R Karger. 1993. Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms. 21–30.
  25. Richard M Karp. 2010. Reducibility among combinatorial problems. Springer.
  26. Graph partitioning using single commodity flows. Journal of the ACM (JACM) 56, 4 (2009), 1–15.
  27. Dynamical process of a bit-width reduced Ising model with simulated annealing. arXiv preprint arXiv:2304.12796 (2023).
  28. Sunyoung Kim and Masakazu Kojima. 2003. Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Computational optimization and applications 26 (2003), 143–154.
  29. Robbie King. 2022. An improved approximation algorithm for quantum max-cut. arXiv preprint arXiv:2209.02589 (2022).
  30. Solomon Kullback and Richard A Leibler. 1951. On information and sufficiency. The annals of mathematical statistics 22, 1 (1951), 79–86.
  31. Sebastian Lamm. 2022. Scalable Graph Algorithms using Practically Efficient Data Reductions. Ph.D. Dissertation. Karlsruher Institut für Technologie (KIT).
  32. Frauke Liers and Gregor Pardella. 2012. Partitioning planar graphs: a fast combinatorial approach for max-cut. Computational Optimization and Applications 51, 1 (2012), 323–344.
  33. Sanjeev Mahajan and Hariharan Ramesh. 1999. Derandomizing approximation algorithms based on semidefinite programming. SIAM J. Comput. 28, 5 (1999), 1641–1663.
  34. (Prototype of a) MaxCut and BQP Instance Library.
  35. Easy and difficult objective functions for max cut. Mathematical programming 94 (2003), 459–466.
  36. Renee Mirka and David P Williamson. 2023. An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut. ACM Journal of Experimental Algorithmics 28 (2023), 1–18.
  37. George L Nemhauser and Leslie E Trotter Jr. 1975. Vertex packings: structural properties and algorithms. Mathematical Programming 8, 1 (1975), 232–248.
  38. How to reduce the bit-width of an Ising model by adding auxiliary spins. IEEE Trans. Comput. 71, 1 (2020), 223–234.
  39. Hiroki Oshiyama and Masayuki Ohzeki. 2022. Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization. Scientific reports 12, 1 (2022), 2146.
  40. Panos M Pardalos and Gregory P Rodgers. 1990. Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 2 (1990), 131–144.
  41. Michael JD Powell. 1994. A direct search optimization method that models the objective and constraint functions by linear interpolation. Springer.
  42. Abraham P Punnen. 2022. The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications. Springer Nature.
  43. Faster exact solution of sparse MaxCut and QUBO problems. Mathematical Programming Computation (2023), 1–26.
  44. Unifying maximum cut and minimum cut of a planar graph. IEEE Trans. Comput. 39, 5 (1990), 694–697.
  45. Peter W Shor. 2002. Introduction to quantum algorithms. In Proceedings of Symposia in Applied Mathematics, Vol. 58. 143–160.
  46. Daniel A Spielman and Nikhil Srivastava. 2008. Graph sparsification by effective resistances. In Proceedings of the fortieth annual ACM symposium on Theory of computing. 563–568.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now