{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T04:43:00Z","timestamp":1781930580007,"version":"3.54.5"},"reference-count":24,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T00:00:00Z","timestamp":1670371200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Quantum optimization algorithms are some of the most promising algorithms expected to show a quantum advantage. When solving quadratic unconstrained binary optimization problems, quantum optimization algorithms usually provide an approximate solution. The solution quality, however, is not guaranteed to be good enough to warrant selecting it over the classical optimizer solution, as it depends on the problem instance. Here, we present an algorithm based on a graph neural network that can choose between a quantum optimizer and classical optimizer using performance prediction. In addition, we present an approach that predicts the optimal parameters of a variational quantum optimizer. We tested our approach with a specific quantum optimizer, the quantum approximate optimization algorithm, applied to the Max-Cut problem, which is an example of a quadratic unconstrained binary optimization problem. We observed qualitatively and quantitatively that graph neural networks are suited for a performance prediction of up to nine-vertex Max-Cut instances with a quantum approximate optimization algorithm with a depth of up to three. For the performance prediction task, the average difference between the actual quantum algorithm performance and the predicted performance is below 19.7% and, for the parameter prediction task, the solution using the predicted parameters is within 2.7% of the optimal parameter solution. Our method therefore has the capacity to find problems that are best suited for quantum solvers. The proposed method and the corresponding algorithm can be used for hybrid quantum algorithm selection.<\/jats:p>","DOI":"10.3390\/sym14122593","type":"journal-article","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T02:17:57Z","timestamp":1670465877000},"page":"2593","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Capturing Symmetries of Quantum Optimization Algorithms Using Graph Neural Networks"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8921-9583","authenticated-orcid":false,"given":"Ajinkya","family":"Deshpande","sequence":"first","affiliation":[{"name":"Terra Quantum AG, Kornhausstrasse 25, 9000 St. Gallen, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5033-4063","authenticated-orcid":false,"given":"Alexey","family":"Melnikov","sequence":"additional","affiliation":[{"name":"Terra Quantum AG, Kornhausstrasse 25, 9000 St. Gallen, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,12,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s11128-021-03232-8","article-title":"Impact of graph structures for QAOA on MaxCut","volume":"20","author":"Herrman","year":"2021","journal-title":"Quantum Inf. Process."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"044009","DOI":"10.1088\/2058-9565\/abb8e5","article-title":"To quantum or not to quantum: Towards algorithm selection in near-term quantum optimization","volume":"5","author":"Moussa","year":"2020","journal-title":"Quantum Sci. Technol."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"125002","DOI":"10.1088\/1367-2630\/ab5c5e","article-title":"Predicting quantum advantage by quantum walk with convolutional neural networks","volume":"21","author":"Melnikov","year":"2019","journal-title":"New J. Phys."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1900115","DOI":"10.1002\/qute.201900115","article-title":"Machine learning transfer efficiencies for noisy quantum walks","volume":"3","author":"Melnikov","year":"2020","journal-title":"Adv. Quantum Technol."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Melnikov, A.A., Fedichkin, L.E., Lee, R.K., and Alodjants, A. (2020, January 4\u20138). Deep neural networks classifying transfer efficiency in complex networks. Proceedings of the IEEE 2020 Opto-Electronics and Communications Conference, Taipei, Taiwan.","DOI":"10.1109\/OECC48412.2020.9273550"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"022208","DOI":"10.1103\/PhysRevA.105.022208","article-title":"Supervised graph classification for chiral quantum walks","volume":"105","author":"Kryukov","year":"2022","journal-title":"Phys. Rev. A"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"3101409","DOI":"10.1109\/TQE.2021.3066275","article-title":"Exploiting Symmetry Reduces the Cost of Training QAOA","volume":"2","author":"Shaydulin","year":"2021","journal-title":"IEEE Trans. Quantum Eng."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Alam, M., Ash-Saki, A., and Ghosh, S. (2020, January 9\u201313). Accelerating Quantum Approximate Optimization Algorithm using Machine Learning. Proceedings of the 2020 Design, Automation Test in Europe Conference Exhibition (DATE), Grenoble, France.","DOI":"10.23919\/DATE48585.2020.9116348"},{"key":"ref_9","unstructured":"Verdon, G., Broughton, M., McClean, J.R., Sung, K.J., Babbush, R., Jiang, Z., Neven, H., and Mohseni, M. (2019). Learning to learn with quantum neural networks via classical neural networks. arXiv."},{"key":"ref_10","first-page":"2367","article-title":"Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems","volume":"34","author":"Khairy","year":"2020","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Redmon, J., Divvala, S., Girshick, R., and Farhadi, A. (2016, January 27\u201330). You Only Look Once: Unified, Real-Time Object Detection. Proceedings of the 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Las Vegas, NV, USA.","DOI":"10.1109\/CVPR.2016.91"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Luong, T., Pham, H., and Manning, C.D. (2015, January 17\u201321). Effective Approaches to Attention-based Neural Machine Translation. Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, Lisbon, Portugal.","DOI":"10.18653\/v1\/D15-1166"},{"key":"ref_13","unstructured":"Wu, Y., Schuster, M., Chen, Z., Le, Q.V., Norouzi, M., Macherey, W., Krikun, M., Cao, Y., Gao, Q., and Macherey, K. (2016). Google\u2019s Neural Machine Translation System: Bridging the Gap between Human and Machine Translation. arXiv."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","article-title":"The unconstrained binary quadratic programming problem: A survey","volume":"28","author":"Kochenberger","year":"2014","journal-title":"J. Comb. Optim."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"034008","DOI":"10.1088\/2058-9565\/ab8c2b","article-title":"Training the Quantum Approximate Optimization Algorithm without access to a Quantum Processing Unit","volume":"5","author":"Streif","year":"2020","journal-title":"Quantum Sci. Technol."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"861","DOI":"10.22331\/q-2022-11-17-861","article-title":"Graph neural network initialisation of quantum approximate optimisation","volume":"6","author":"Jain","year":"2022","journal-title":"Quantum"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/72.572108","article-title":"Supervised neural networks for the classification of structures","volume":"8","author":"Sperduti","year":"1997","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_18","unstructured":"Gori, M., Monfardini, G., and Scarselli, F. (August, January 31). A new model for learning in graph domains. Proceedings of the 2005 IEEE International Joint Conference on Neural Networks, Montreal, QC, Canada."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","article-title":"The Graph Neural Network Model","volume":"20","author":"Scarselli","year":"2009","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","article-title":"Graph neural networks: A review of methods and applications","volume":"1","author":"Zhou","year":"2020","journal-title":"AI Open"},{"key":"ref_21","unstructured":"Kipf, T.N., and Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. arXiv."},{"key":"ref_22","unstructured":"Xu, K., Hu, W., Leskovec, J., and Jegelka, S. (2019, January 6\u20139). How Powerful are Graph Neural Networks?. Proceedings of the International Conference on Learning Representations, New Orleans, LA, USA."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s11128-021-03342-3","article-title":"Empirical Performance Bounds for Quantum Approximate Optimization","volume":"20","author":"Lotshaw","year":"2021","journal-title":"Quantum Inf. Process."},{"key":"ref_24","unstructured":"Lotshaw, P.C., and Humble, T.S. (2022, December 01). QAOA Dataset, Available online: https:\/\/code.ornl.gov\/qci\/qaoa-dataset-version1."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/12\/2593\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:35:59Z","timestamp":1760146559000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/12\/2593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,7]]},"references-count":24,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["sym14122593"],"URL":"https:\/\/doi.org\/10.3390\/sym14122593","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,7]]}}}