Papers
Topics
Authors
Recent
2000 character limit reached

Quantum Graph Optimization Algorithm (2404.06434v1)

Published 9 Apr 2024 in quant-ph

Abstract: Quadratic unconstrained binary optimization (QUBO) tasks are very important in chemistry, finance, job scheduling, and so on, which can be represented using graph structures, with the variables as nodes and the interaction between them as edges. Variational quantum algorithms, especially the Quantum Approximate Optimization Algorithm (QAOA) and its variants, present a promising way, potentially exceeding the capabilities of classical algorithms, for addressing QUBO tasks. However, the possibility of using message-passing machines, inspired by classical graph neural networks, to enhance the power and performance of these quantum algorithms for QUBO tasks was not investigated. This study introduces a novel variational quantum graph optimization algorithm that integrates the message-passing mechanism, which demonstrates significant improvements in performance for solving QUBO problems in terms of resource efficiency and solution precision, compared to QAOA, its variants, and other quantum graph neural networks. Furthermore, in terms of scalability on QUBO tasks, our algorithm shows superior performance compared to QAOA, presenting a substantial advancement in the field of quantum approximate optimization.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (20)
  1. C. Zoufal, R. V. Mishmash, N. Sharma, N. Kumar, A. Sheshadri, A. Deshmukh, N. Ibrahim, J. Gacon, and S. Woerner, “Variational quantum algorithm for unconstrained black box binary optimization: Application to feature selection,” Quantum, vol. 7, p. 909, 2023.
  2. E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” arXiv preprint arXiv:1411.4028, 2014.
  3. S. Brandhofer, D. Braun, V. Dehn, G. Hellstern, M. Hüls, Y. Ji, I. Polian, A. S. Bhatia, and T. Wellens, “Benchmarking the performance of portfolio optimization with QAOA,” Quant. Inf. Process., vol. 22, no. 1, pp. 1–27, 2023.
  4. Y. Du, M.-H. Hsieh, T. Liu, S. You, and D. Tao, “Learnability of quantum neural networks,” PRX Quantum, vol. 2, no. 4, p. 040337, 2021.
  5. X. Hou, G. Zhou, Q. Li, S. Jin, and X. Wang, “A universal duplication-free quantum neural network,” arXiv preprint arXiv:2106.13211, 2021.
  6. A. Pérez-Salinas, A. Cervera-Lierta, E. Gil-Fuster, and J. I. Latorre, “Data re-uploading for a universal quantum classifier,” Quantum, vol. 4, p. 226, 2020.
  7. O. Kyriienko and E. B. Magnusson, “Unsupervised quantum machine learning for fraud detection,” arXiv preprint arXiv:2208.01203, 2022.
  8. G. Liu and W. Ma, “A quantum artificial neural network for stock closing price prediction,” Inf. Sci., vol. 598, pp. 75–85, 2022.
  9. R. Lorenz, A. Pearson, K. Meichanetzidis, D. Kartsaklis, and B. Coecke, “QNLP in practice: Running compositional models of meaning on a quantum computer,” J. Artif. Intell. Res., vol. 76, pp. 1305–1342, 2023.
  10. Y. Jing, X. Li, Y. Yang, C. Wu, W. Fu, W. Hu, Y. Li, and H. Xu, “RGB image classification with quantum convolutional ansatz,” Quant. Inf. Process., vol. 21, no. 3, p. 101, 2022.
  11. Q. Li, Y. Huang, X. Hou, Y. Li, X. Wang, and A. Bayat, “Ensemble-learning error mitigation for variational quantum shallow-circuit classifiers,” Phys. Rev. Res., vol. 6, no. 1, p. 013027, 2024.
  12. X.-M. Zhang, T. Li, and X. Yuan, “Quantum state preparation with optimal circuit depth: Implementations and applications,” Phys. Rev. Lett., vol. 129, no. 23, p. 230504, 2022.
  13. W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” Adv. Neural Inf. Process. Syst., vol. 30, 2017.
  14. A. Strokach, D. Becerra, C. Corbi-Verge, A. Perez-Riba, and P. M. Kim, “Fast and flexible protein design using deep graph neural networks,” Cell Syst., vol. 11, no. 4, pp. 402–411, 2020.
  15. W. Jiang and J. Luo, “Graph neural network for traffic forecasting: A survey,” Expert Syst. Appl., p. 117921, 2022.
  16. M. J. A. Schuetz, J. K. Brubaker, and H. G. Katzgraber, “Combinatorial optimization with physics-inspired graph neural networks,” Nat. Mach. Intell., vol. 4, no. 4, pp. 367–377, 2022.
  17. G. Verdon, T. McCourt, E. Luzhnica, V. Singh, S. Leichenauer, and J. Hidary, “Quantum graph neural networks,” arXiv preprint arXiv:1909.12264, 2019.
  18. X. Ai, Z. Zhang, L. Sun, J. Yan, and E. Hancock, “Decompositional quantum graph neural network,” arXiv preprint arXiv:2201.05158, 2022.
  19. Edward Farhi and Hartmut Neven. ”Classification with quantum neural networks on near term processors.” arXiv preprint arXiv:1802.06002, 2018.
  20. Reza Mahroo and Amin Kargarian. ”Learning Infused Quantum-Classical Distributed Optimization Technique for Power Generation Scheduling.” IEEE Transactions on Quantum Engineering, 2023. IEEE.

Summary

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

Whiteboard

Open Problems

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

Continue Learning

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

Collections

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

Tweets

Sign up for free to view the 2 tweets with 1 like about this paper.