Combinatorial optimization with quantum imaginary time evolution
Abstract: We use Quantum Imaginary Time Evolution (QITE) to solve polynomial unconstrained binary optimization (PUBO) problems. We show that a linear Ansatz yields good results for a wide range of PUBO problems, often outperforming standard classical methods, such as the Goemans-Williamson (GW) algorithm. We obtain numerical results for the Low Autocorrelation Binary Sequences (LABS) and weighted MaxCut combinatorial optimization problems, thus extending an earlier demonstration of successful application of QITE on MaxCut for unweighted graphs. We find the performance of QITE on the LABS problem with a separable Ansatz comparable with p=10 QAOA, and do not see a significant advantage with an entangling Ansatz. On weighted MaxCut, QITE with a separable Ansatz often outperforms the GW algorithm on graphs up to 150 vertices.
- F. Barahona, Journal of physics. A, Mathematical and general 15, 3241 (1982).
- P. J. Love, Nature Physics 16, 130 (2020).
- C. Cao, Z. An, S.-Y. Hou, D. L. Zhou, and B. Zeng, “Quantum imaginary time evolution steered by reinforcement learning,” (2021), arXiv:2105.08696 [quant-ph] .
- C. Mathieu and W. Schudy, in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’08 (Society for Industrial and Applied Mathematics, USA, 2008) p. 176–182.
- M. X. Goemans and D. P. Williamson, in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing (1994) pp. 422–431.
- 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,” (2023), arXiv:2308.02342 [quant-ph] .
- B. Bošković, F. Brglez, and J. Brest, “A GitHub Archive for Solvers and Solutions of the labs problem,” For updates, see https://github.com/borkob/git_labs. (2016).
- G. E. Crooks, arXiv e-prints , arXiv:1811.08419 (2018), arXiv:1811.08419 [quant-ph] .
- G. G. Guerreschi and A. Y. Matsuura, Scientific Reports 9 (2019), 10.1038/s41598-019-43176-9.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
