{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T12:27:17Z","timestamp":1782736037782,"version":"3.54.5"},"reference-count":225,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T00:00:00Z","timestamp":1696464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Austrian Federal Ministry for Digital and Economic Affairs and the National Foundation for Research, Technology and Development and by the Austrian Science Fund","award":["P 30525-N31"],"award-info":[{"award-number":["P 30525-N31"]}]},{"DOI":"10.13039\/100021130","name":"Federal Ministry for Economic Affairs and Climate Action","doi-asserted-by":"crossref","award":["PlanQK (01MK20005N) and EniQmA (01MQ22007B)"],"award-info":[{"award-number":["PlanQK (01MK20005N) and EniQmA (01MQ22007B)"]}],"id":[{"id":"10.13039\/100021130","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Spanish MICINN","award":["PID2021-122270OB-I00 and TED2021-129381B-C21"],"award-info":[{"award-number":["PID2021-122270OB-I00 and TED2021-129381B-C21"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2024,3,31]]},"abstract":"<jats:p>The application of quantum computing to combinatorial optimization problems is attracting increasing research interest, resulting in diverse approaches and research streams. This study aims at identifying, classifying, and understanding existing solution approaches as well as typical use cases in the field. The obtained classification schemes are based on a full-text analysis of 156 included papers. Our results can be used by researchers and practitioners to (i) better understand adaptations to and utilizations of existing gate-based and quantum annealing approaches and (ii) identify typical use cases for quantum computing in areas such as graph optimization, routing, and scheduling.<\/jats:p>","DOI":"10.1145\/3620668","type":"journal-article","created":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T12:16:28Z","timestamp":1693916188000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study"],"prefix":"10.1145","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7589-8263","authenticated-orcid":false,"given":"Felix","family":"Gemeinhardt","sequence":"first","affiliation":[{"name":"Johannes Kepler University Linz, Institute for Business Informatics - Software Engineering CDL-MINT, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8331-4467","authenticated-orcid":false,"given":"Antonio","family":"Garmendia","sequence":"additional","affiliation":[{"name":"Universidad Aut\u00f3noma de Madrid, Modelling &amp; Software Engineering Research Group, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1124-7098","authenticated-orcid":false,"given":"Manuel","family":"Wimmer","sequence":"additional","affiliation":[{"name":"Johannes Kepler University Linz, Institute for Business Informatics - SoftwareEngineering CDL-MINT, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6761-6243","authenticated-orcid":false,"given":"Benjamin","family":"Weder","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Institute of Architecture of Application Systems (IAAS), Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9123-259X","authenticated-orcid":false,"given":"Frank","family":"Leymann","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Institute of Architecture of Application Systems (IAAS), Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,10,5]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.4236\/jcc.2020.811004"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2019.106630"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2019.04.186"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.124.090504"},{"key":"e_1_3_2_6_2","article-title":"Analysis of quantum approximate optimization algorithm under realistic noise in superconducting qubits","author":"Alam Mahabubul","year":"2019","unstructured":"Mahabubul Alam, Abdullah Ash-Saki, and Swaroop Ghosh. 2019. Analysis of quantum approximate optimization algorithm under realistic noise in superconducting qubits. arXiv preprint arXiv:1907.09631 (2019).","journal-title":"arXiv preprint arXiv:1907.09631"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE48585.2020.9116348"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.8.031016"},{"key":"e_1_3_2_9_2","article-title":"quantum Case-Based Reasoning (qCBR)","author":"Atchade-Adelomou Parfait","year":"2021","unstructured":"Parfait Atchade-Adelomou, Daniel Casado-Fauli, Elisabet Golobardes-Ribe, and Xavier Vilasis-Cardona. 2021. quantum Case-Based Reasoning (qCBR). arXiv preprint arXiv:2104.00409 (2021).","journal-title":"arXiv preprint arXiv:2104.00409"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-64078-1"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-04-20-256"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/QCE49297.2020.00020"},{"issue":"1","key":"e_1_3_2_13_2","first-page":"1","article-title":"Optimizing the optimizer: Decomposition techniques for quantum annealing","volume":"3","author":"Bass Gideon","year":"2021","unstructured":"Gideon Bass, Maxwell Henderson, Joshua Heath, and Joseph Dulny. 2021. Optimizing the optimizer: Decomposition techniques for quantum annealing. Quant. Mach. Intell. 3, 1 (2021), 1\u201314.","journal-title":"Quant. Mach. Intell."},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976236.39"},{"key":"e_1_3_2_15_2","article-title":"Solving vehicle routing problem using quantum approximate optimization algorithm","author":"Azad Utkarsh","year":"2020","unstructured":"Utkarsh Azad, Bikash K. Behera, Emad A. Ahmed, and Prasanta K. Panigrahi. 2020. Solving vehicle routing problem using quantum approximate optimization algorithm. arXiv preprint arXiv:2002.01351 (2020).","journal-title":"arXiv preprint arXiv:2002.01351"},{"key":"e_1_3_2_16_2","article-title":"Quantum assisted eigensolver","author":"Bharti Kishor","year":"2020","unstructured":"Kishor Bharti. 2020. Quantum assisted eigensolver. arXiv preprint arXiv:2009.11001 (2020).","journal-title":"arXiv preprint arXiv:2009.11001"},{"key":"e_1_3_2_17_2","article-title":"Iterative quantum assisted eigensolver","author":"Bharti Kishor","year":"2020","unstructured":"Kishor Bharti and Tobias Haug. 2020. Iterative quantum assisted eigensolver. arXiv preprint arXiv:2010.05638 (2020).","journal-title":"arXiv preprint arXiv:2010.05638"},{"key":"e_1_3_2_18_2","first-page":"1","volume-title":"24th Symposium on International Database Engineering & Applications","author":"Bittner Tim","year":"2020","unstructured":"Tim Bittner and Sven Groppe. 2020. Avoiding blocking by scheduling transactions using quantum annealing. In 24th Symposium on International Database Engineering & Applications. 1\u201310."},{"issue":"1","key":"e_1_3_2_19_2","first-page":"1","article-title":"Hardware accelerating the optimization of transaction schedules via quantum annealing by avoiding blocking","volume":"7","author":"Bittner Tim","year":"2020","unstructured":"Tim Bittner and Sven Groppe. 2020. Hardware accelerating the optimization of transaction schedules via quantum annealing by avoiding blocking. Open J. Cloud Comput. 7, 1 (2020), 1\u201321.","journal-title":"Open J. Cloud Comput."},{"key":"e_1_3_2_20_2","article-title":"QCI Qbsolv delivers strong classical performance for quantum-ready formulation","author":"Booth Michael","year":"2020","unstructured":"Michael Booth, Jesse Berwald, Uchenna Chukwu, John Dawson, Raouf Dridi, DeYung Le, Mark Wainger, and Steven P. Reinhardt. 2020. QCI Qbsolv delivers strong classical performance for quantum-ready formulation. arXiv preprint arXiv:2005.11294 (2020).","journal-title":"arXiv preprint arXiv:2005.11294"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3063635"},{"key":"e_1_3_2_22_2","article-title":"For fixed control parameters the quantum approximate optimization algorithm\u2019s objective function value concentrates for typical instances","author":"Brandao Fernando G. S. L.","year":"2018","unstructured":"Fernando G. S. L. Brandao, Michael Broughton, Edward Farhi, Sam Gutmann, and Hartmut Neven. 2018. For fixed control parameters the quantum approximate optimization algorithm\u2019s objective function value concentrates for typical instances. arXiv preprint arXiv:1812.04170 (2018).","journal-title":"arXiv preprint arXiv:1812.04170"},{"key":"e_1_3_2_23_2","article-title":"Hybrid quantum-classical algorithms for approximate graph coloring","author":"Bravyi Sergey","year":"2020","unstructured":"Sergey Bravyi, Alexander Kliesch, Robert Koenig, and Eugene Tang. 2020. Hybrid quantum-classical algorithms for approximate graph coloring. arXiv preprint arXiv:2011.13420 (2020).","journal-title":"arXiv preprint arXiv:2011.13420"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.260505"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8504"},{"key":"e_1_3_2_26_2","article-title":"Garden optimization problems for benchmarking quantum annealers","author":"Calaza Carlos D. Gonzalez","year":"2021","unstructured":"Carlos D. Gonzalez Calaza, Dennis Willsch, and Kristel Michielsen. 2021. Garden optimization problems for benchmarking quantum annealers. arXiv preprint arXiv:2101.10827 (2021).","journal-title":"arXiv preprint arXiv:2101.10827"},{"key":"e_1_3_2_27_2","article-title":"On quantum computing for mixed-integer programming","author":"Chang Chin-Yao","year":"2020","unstructured":"Chin-Yao Chang, Eric Jones, and Peter Graf. 2020. On quantum computing for mixed-integer programming. arXiv preprint arXiv:2010.07852 (2020).","journal-title":"arXiv preprint arXiv:2010.07852"},{"key":"e_1_3_2_28_2","article-title":"Optimizing quantum annealing schedules: From Monte Carlo tree search to QuantumZero","author":"Chen Yu-Qin","year":"2020","unstructured":"Yu-Qin Chen, Yu Chen, Chee-Kong Lee, Shengyu Zhang, and Chang-Yu Hsieh. 2020. Optimizing quantum annealing schedules: From Monte Carlo tree search to QuantumZero. arXiv preprint arXiv:2004.02836 (2020).","journal-title":"arXiv preprint arXiv:2004.02836"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.3390\/electronics9101669"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.3390\/app10207116"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC43674.2020.9286230"},{"key":"e_1_3_2_32_2","first-page":"111","volume-title":"International Conference on High Performance Computing in Asia-Pacific Region","author":"Clark James","year":"2019","unstructured":"James Clark, Tristan West, Joseph Zammit, Xiaohu Guo, Luke Mason, and Duncan Russell. 2019. Towards real time multi-robot routing using quantum computing technologies. In International Conference on High Performance Computing in Asia-Pacific Region. 111\u2013119."},{"key":"e_1_3_2_33_2","article-title":"Ising-based consensus clustering on specialized hardware","author":"Cohen Eldan","year":"2020","unstructured":"Eldan Cohen, Avradip Mandal, Hayato Ushijima-Mwesigwa, and Arnab Roy. 2020. Ising-based consensus clustering on specialized hardware. arXiv preprint arXiv:2003.01887 (2020).","journal-title":"arXiv preprint arXiv:2003.01887"},{"key":"e_1_3_2_34_2","article-title":"Performance of the quantum approximate optimization algorithm on the maximum cut problem","author":"Crooks Gavin E.","year":"2018","unstructured":"Gavin E. Crooks. 2018. Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419 (2018).","journal-title":"arXiv preprint arXiv:1811.08419"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-53585-5"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjqt\/s40507-021-00100-3"},{"key":"e_1_3_2_37_2","article-title":"Combinatorial optimization through variational quantum power method","author":"Daskin Ammar","year":"2020","unstructured":"Ammar Daskin. 2020. Combinatorial optimization through variational quantum power method. arXiv preprint arXiv:2007.01004 (2020).","journal-title":"arXiv preprint arXiv:2007.01004"},{"key":"e_1_3_2_38_2","article-title":"Quantum variational optimization: The role of entanglement and problem hardness","author":"D\u00edez-Valle Pablo","year":"2021","unstructured":"Pablo D\u00edez-Valle, Diego Porras, and Juan Jos\u00e9 Garc\u00eda-Ripoll. 2021. Quantum variational optimization: The role of entanglement and problem hardness. arXiv preprint arXiv:2103.14479 (2021).","journal-title":"arXiv preprint arXiv:2103.14479"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-021-00466-2"},{"key":"e_1_3_2_40_2","article-title":"Towards prediction of financial crashes with a D-Wave quantum computer","author":"Ding Yongcheng","year":"2019","unstructured":"Yongcheng Ding, Lucas Lamata, Jos\u00e9 D. Mart\u00edn-Guerrero, Enrique Lizaso, Samuel Mugel, Xi Chen, Rom\u00e1n Or\u00fas, Enrique Solano, and Mikel Sanz. 2019. Towards prediction of financial crashes with a D-Wave quantum computer. arXiv preprint arXiv:1904.05808 (2019).","journal-title":"arXiv preprint arXiv:1904.05808"},{"key":"e_1_3_2_41_2","article-title":"Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines","author":"Domino Krzysztof","year":"2020","unstructured":"Krzysztof Domino, M\u00e1ty\u00e1s Koniorczyk, Krzysztof Krawiec, Konrad Ja\u0142owiecki, and Bart\u0142omiej Gardas. 2020. Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines. arXiv preprint arXiv:2010.08227 (2020).","journal-title":"arXiv preprint arXiv:2010.08227"},{"key":"e_1_3_2_42_2","article-title":"Solving tiling puzzles with quantum annealing","author":"Eagle Asa","year":"2019","unstructured":"Asa Eagle, Takumi Kato, and Yuichiro Minato. 2019. Solving tiling puzzles with quantum annealing. arXiv preprint arXiv:1904.01770 (2019).","journal-title":"arXiv preprint arXiv:1904.01770"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-06-17-479"},{"key":"e_1_3_2_44_2","article-title":"The quantum approximate optimization algorithm needs to see the whole graph: A typical case","author":"Farhi Edward","year":"2020","unstructured":"Edward Farhi, David Gamarnik, and Sam Gutmann. 2020. The quantum approximate optimization algorithm needs to see the whole graph: A typical case. arXiv preprint arXiv:2004.09002 (2020).","journal-title":"arXiv preprint arXiv:2004.09002"},{"key":"e_1_3_2_45_2","article-title":"The quantum approximate optimization algorithm needs to see the whole graph: Worst case examples","author":"Farhi Edward","year":"2020","unstructured":"Edward Farhi, David Gamarnik, and Sam Gutmann. 2020. The quantum approximate optimization algorithm needs to see the whole graph: Worst case examples. arXiv preprint arXiv:2005.08747 (2020).","journal-title":"arXiv preprint arXiv:2005.08747"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.3389\/fict.2019.00013"},{"key":"e_1_3_2_47_2","article-title":"Hybrid quantum-classical optimization for financial index tracking","author":"Fern\u00e1ndez-Lorenzo Samuel","year":"2020","unstructured":"Samuel Fern\u00e1ndez-Lorenzo, Diego Porras, and Juan Jos\u00e9 Garc\u00eda-Ripoll. 2020. Hybrid quantum-classical optimization for financial index tracking. arXiv preprint arXiv:2008.12050 (2020).","journal-title":"arXiv preprint arXiv:2008.12050"},{"key":"e_1_3_2_48_2","first-page":"113388","article-title":"A study of the performance of classical minimizers in the Quantum Approximate Optimization Algorithm","author":"Fern\u00e1ndez-Pend\u00e1s Mario","year":"2021","unstructured":"Mario Fern\u00e1ndez-Pend\u00e1s, El\u00edas F. Combarro, Sofia Vallecorsa, Jos\u00e9 Ranilla, and Ignacio F. R\u00faa. 2021. A study of the performance of classical minimizers in the Quantum Approximate Optimization Algorithm. J. Comput. Appl. Math. 404 (2021), 113388.","journal-title":"J. Comput. Appl. Math."},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-020-00437-z"},{"key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-030-14082-3_3","volume-title":"International Workshop on Quantum Technology and Optimization Problems","author":"Gabor Thomas","year":"2019","unstructured":"Thomas Gabor, Sebastian Zielinski, Sebastian Feld, Christoph Roch, Christian Seidel, Florian Neukart, Isabella Galter, Wolfgang Mauerer, and Claudia Linnhoff-Popien. 2019. Assessing solution quality of 3SAT on a quantum annealing platform. In International Workshop on Quantum Technology and Optimization Problems. Springer, 23\u201335."},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2020.3033139"},{"key":"e_1_3_2_52_2","article-title":"Quantum observables for continuous control of the quantum approximate optimization algorithm via reinforcement learning","author":"Garcia-Saez Artur","year":"2019","unstructured":"Artur Garcia-Saez and Jordi Riu. 2019. Quantum observables for continuous control of the quantum approximate optimization algorithm via reinforcement learning. arXiv preprint arXiv:1911.09682 (2019).","journal-title":"arXiv preprint arXiv:1911.09682"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-04-08-428"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-019-00424-y"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-020-00464-9"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.15.014012"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-43176-9"},{"key":"e_1_3_2_58_2","article-title":"On the representation of Boolean and real functions as Hamiltonians for quantum computing","author":"Hadfield Stuart","year":"2018","unstructured":"Stuart Hadfield. 2018. On the representation of Boolean and real functions as Hamiltonians for quantum computing. arXiv preprint arXiv:1804.09130 (2018).","journal-title":"arXiv preprint arXiv:1804.09130"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12020034"},{"key":"e_1_3_2_60_2","article-title":"A quantum annealing approach for dynamic multi-depot capacitated vehicle routing problem","author":"Harikrishnakumar Ramkumar","year":"2020","unstructured":"Ramkumar Harikrishnakumar, Saideep Nannapaneni, Nam H. Nguyen, James E. Steck, and Elizabeth C. Behrman. 2020. A quantum annealing approach for dynamic multi-depot capacitated vehicle routing problem. arXiv preprint arXiv:2005.12478 (2020).","journal-title":"arXiv preprint arXiv:2005.12478"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-020-01105-y"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3049230"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ab85b8"},{"key":"e_1_3_2_64_2","article-title":"Approximating the quantum approximate optimisation algorithm","author":"Headley David","year":"2020","unstructured":"David Headley, Thorge M\u00fcller, Ana Martin, Enrique Solano, Mikel Sanz, and Frank K. Wilhelm. 2020. Approximating the quantum approximate optimisation algorithm. arXiv preprint arXiv:2002.12215 (2020).","journal-title":"arXiv preprint arXiv:2002.12215"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-021-03001-7"},{"key":"e_1_3_2_66_2","article-title":"Impact of graph structures for QAOA on MaxCut","author":"Herrman Rebekah","year":"2021","unstructured":"Rebekah Herrman, Lorna Treffert, James Ostrowski, Phillip C. Lotshaw, Travis S. Humble, and George Siopsis. 2021. Impact of graph structures for QAOA on MaxCut. arXiv preprint arXiv:2102.05997 (2021).","journal-title":"arXiv preprint arXiv:2102.05997"},{"key":"e_1_3_2_67_2","article-title":"Alibaba cloud quantum development platform: Applications to quantum algorithm design","author":"Huang Cupjin","year":"2019","unstructured":"Cupjin Huang, Mario Szegedy, Fang Zhang, Xun Gao, Jianxin Chen, and Yaoyun Shi. 2019. Alibaba cloud quantum development platform: Applications to quantum algorithm design. arXiv preprint arXiv:1909.02559 (2019).","journal-title":"arXiv preprint arXiv:1909.02559"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-020-02815-1"},{"key":"e_1_3_2_69_2","article-title":"Forecasting election polls with spin systems","author":"Ibarrondo Ruben","year":"2020","unstructured":"Ruben Ibarrondo, Mikel Sanz, and Roman Orus. 2020. Forecasting election polls with spin systems. arXiv preprint arXiv:2007.05070 (2020).","journal-title":"arXiv preprint arXiv:2007.05070"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-49172-3"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-021-82740-0"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-58081-9"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-021-87676-z"},{"key":"e_1_3_2_74_2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-030-14082-3_13","volume-title":"International Workshop on Quantum Technology and Optimization Problems","author":"Irie Hirotaka","year":"2019","unstructured":"Hirotaka Irie, Goragot Wongpaisarnsin, Masayoshi Terabe, Akira Miki, and Shinichirou Taguchi. 2019. Quantum annealing of vehicle routing problem with time, state and capacity. In International Workshop on Quantum Technology and Optimization Problems. Springer, 145\u2013156."},{"key":"e_1_3_2_75_2","first-page":"350","volume-title":"International Symposium on Intelligent Data Analysis","author":"Kalehbasti Pouya Rezazadeh","year":"2021","unstructured":"Pouya Rezazadeh Kalehbasti, Hayato Ushijima-Mwesigwa, Avradip Mandal, and Indradeep Ghosh. 2021. Ising-based Louvain method: Clustering large graphs with specialized hardware. In International Symposium on Intelligent Data Analysis. Springer, 350\u2013361."},{"key":"e_1_3_2_76_2","article-title":"Reinforcement-learning-based variational quantum circuits optimization for combinatorial problems","author":"Khairy Sami","year":"2019","unstructured":"Sami Khairy, Ruslan Shaydulin, Lukasz Cincio, Yuri Alexeev, and Prasanna Balaprakash. 2019. Reinforcement-learning-based variational quantum circuits optimization for combinatorial problems. arXiv preprint arXiv:1911.04574 (2019).","journal-title":"arXiv preprint arXiv:1911.04574"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5616"},{"key":"e_1_3_2_78_2","article-title":"Quantum scheduling for millimeter-wave observation satellite constellation","author":"Kim Joongheon","year":"2021","unstructured":"Joongheon Kim, Yunseok Kwak, Soyi Jung, and Jae-Hyun Kim. 2021. Quantum scheduling for millimeter-wave observation satellite constellation. arXiv preprint arXiv:2108.00626 (2021).","journal-title":"arXiv preprint arXiv:2108.00626"},{"key":"e_1_3_2_79_2","article-title":"An evolving objective function for improved variational quantum optimisation","author":"Kolotouros Ioannis","year":"2021","unstructured":"Ioannis Kolotouros and Petros Wallden. 2021. An evolving objective function for improved variational quantum optimisation. arXiv preprint arXiv:2105.11766 (2021).","journal-title":"arXiv preprint arXiv:2105.11766"},{"key":"e_1_3_2_80_2","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.90.064001"},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1145\/3387940.3391472"},{"key":"e_1_3_2_82_2","article-title":"Evaluation of QAOA based on the approximation ratio of individual samples","author":"Larkin Jason","year":"2020","unstructured":"Jason Larkin, Mat\u00edas Jonsson, Daniel Justice, and Gian Giacomo Guerreschi. 2020. Evaluation of QAOA based on the approximation ratio of individual samples. arXiv preprint arXiv:2006.04831 (2020).","journal-title":"arXiv preprint arXiv:2006.04831"},{"key":"e_1_3_2_83_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2020.3034798"},{"key":"e_1_3_2_84_2","article-title":"Towards favorable landscapes in quantum combinatorial optimization","author":"Lee Juneseo","year":"2021","unstructured":"Juneseo Lee, Alicia B. Magann, Herschel A. Rabitz, and Christian Arenz. 2021. Towards favorable landscapes in quantum combinatorial optimization. arXiv preprint arXiv:2105.01114 (2021).","journal-title":"arXiv preprint arXiv:2105.01114"},{"key":"e_1_3_2_85_2","article-title":"Large-scale quantum approximate optimization via divide-and-conquer","author":"Li Junde","year":"2021","unstructured":"Junde Li, Mahabubul Alam, and Swaroop Ghosh. 2021. Large-scale quantum approximate optimization via divide-and-conquer. arXiv preprint arXiv:2102.13288 (2021).","journal-title":"arXiv preprint arXiv:2102.13288"},{"key":"e_1_3_2_86_2","first-page":"335","volume-title":"21st International Symposium on Quality Electronic Design (ISQED\u201920)","author":"Li Junde","year":"2020","unstructured":"Junde Li, Mahabubul Alam, Abdullah Ash Saki, and Swaroop Ghosh. 2020. Hierarchical improvement of quantum approximate optimization algorithm for object detection. In 21st International Symposium on Quality Electronic Design (ISQED\u201920). IEEE, 335\u2013340."},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.023074"},{"key":"e_1_3_2_88_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.033402"},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.101.052327"},{"key":"e_1_3_2_90_2","article-title":"Layer VQE: A variational approach for combinatorial optimization on noisy quantum computers","author":"Liu Xiaoyuan","year":"2021","unstructured":"Xiaoyuan Liu, Anthony Angone, Ruslan Shaydulin, Ilya Safro, Yuri Alexeev, and Lukasz Cincio. 2021. Layer VQE: A variational approach for combinatorial optimization on noisy quantum computers. arXiv preprint arXiv:2102.05566 (2021).","journal-title":"arXiv preprint arXiv:2102.05566"},{"key":"e_1_3_2_91_2","article-title":"Leveraging special-purpose hardware for local search heuristics","author":"Liu Xiaoyuan","year":"2019","unstructured":"Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Avradip Mandal, Sarvagya Upadhyay, Ilya Safro, and Arnab Roy. 2019. Leveraging special-purpose hardware for local search heuristics. arXiv preprint arXiv:1911.09810 (2019).","journal-title":"arXiv preprint arXiv:1911.09810"},{"key":"e_1_3_2_92_2","article-title":"Mapping NP-hard and NP-complete optimisation problems to quadratic unconstrained binary optimisation problems","author":"Lodewijks Bas","year":"2019","unstructured":"Bas Lodewijks. 2019. Mapping NP-hard and NP-complete optimisation problems to quadratic unconstrained binary optimisation problems. arXiv preprint arXiv:1911.08043 (2019).","journal-title":"arXiv preprint arXiv:1911.08043"},{"key":"e_1_3_2_93_2","article-title":"Empirical performance bounds for quantum approximate optimization","author":"Lotshaw Phillip C.","year":"2021","unstructured":"Phillip C. Lotshaw, Travis S. Humble, Rebekah Herrman, James Ostrowski, and George Siopsis. 2021. Empirical performance bounds for quantum approximate optimization. arXiv preprint arXiv:2102.06813 (2021).","journal-title":"arXiv preprint arXiv:2102.06813"},{"key":"e_1_3_2_94_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-019-2323-5"},{"key":"e_1_3_2_95_2","article-title":"Feedback-based quantum optimization","author":"Magann Alicia B.","year":"2021","unstructured":"Alicia B. Magann, Kenneth M. Rudinger, Matthew D. Grace, and Mohan Sarovar. 2021. Feedback-based quantum optimization. arXiv preprint arXiv:2103.08619 (2021).","journal-title":"arXiv preprint arXiv:2103.08619"},{"key":"e_1_3_2_96_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-019-2171-3"},{"key":"e_1_3_2_97_2","article-title":"Problem-specific parameterized quantum circuits of the VQE algorithm for optimization problems","author":"Matsuo Atsushi","year":"2020","unstructured":"Atsushi Matsuo, Yudai Suzuki, and Shigeru Yamashita. 2020. Problem-specific parameterized quantum circuits of the VQE algorithm for optimization problems. arXiv preprint arXiv:2006.05643 (2020).","journal-title":"arXiv preprint arXiv:2006.05643"},{"key":"e_1_3_2_98_2","article-title":"Automated quantum programming via reinforcement learning for combinatorial optimization","author":"McKiernan Keri A.","year":"2019","unstructured":"Keri A. McKiernan, Erik Davis, M. Sohaib Alam, and Chad Rigetti. 2019. Automated quantum programming via reinforcement learning for combinatorial optimization. arXiv preprint arXiv:1908.08054 (2019).","journal-title":"arXiv preprint arXiv:1908.08054"},{"key":"e_1_3_2_99_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72904-2_7"},{"key":"e_1_3_2_100_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.043158"},{"key":"e_1_3_2_101_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.013304"},{"key":"e_1_3_2_102_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0227538"},{"key":"e_1_3_2_103_2","doi-asserted-by":"publisher","DOI":"10.3389\/fcomp.2019.00002"},{"key":"e_1_3_2_104_2","article-title":"Most frequent itemset optimization","author":"N\u00fc\u00dflein Jonas","year":"2019","unstructured":"Jonas N\u00fc\u00dflein. 2019. Most frequent itemset optimization. arXiv preprint arXiv:1904.07693 (2019).","journal-title":"arXiv preprint arXiv:1904.07693"},{"key":"e_1_3_2_105_2","article-title":"Solving multi-coloring combinatorial optimization problems using hybrid quantum algorithms","author":"Oh Young-Hyun","year":"2019","unstructured":"Young-Hyun Oh, Hamed Mohammadbagherpoor, Patrick Dreher, Anand Singh, Xianqing Yu, and Andy J. Rindos. 2019. Solving multi-coloring combinatorial optimization problems using hybrid quantum algorithms. arXiv preprint arXiv:1911.00595 (2019).","journal-title":"arXiv preprint arXiv:1911.00595"},{"key":"e_1_3_2_106_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-020-60022-5"},{"key":"e_1_3_2_107_2","doi-asserted-by":"publisher","DOI":"10.3389\/fcomp.2019.00009"},{"key":"e_1_3_2_108_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-49539-6"},{"key":"e_1_3_2_109_2","article-title":"Focusing on the Hybrid Quantum Computing\u2013Tabu Search Algorithm: New results on the Asymmetric Salesman Problem","author":"Osaba Eneko","year":"2021","unstructured":"Eneko Osaba, Esther Villar-Rodriguez, Izaskun Oregi, and Aitor Moreno Fernandez de Leceta. 2021. Focusing on the Hybrid Quantum Computing\u2013Tabu Search Algorithm: New results on the Asymmetric Salesman Problem. arXiv preprint arXiv:2102.05919 (2021).","journal-title":"arXiv preprint arXiv:2102.05919"},{"key":"e_1_3_2_110_2","first-page":"351","volume-title":"IEEE Congress on Evolutionary Computation (CEC\u201921)","author":"Osaba Eneko","year":"2021","unstructured":"Eneko Osaba, Esther Villar-Rodriguez, Izaskun Oregi, and Aitor Moreno Fernandez de Leceta. 2021. Hybrid quantum computing-tabu search algorithm for partitioning problems: Preliminary study on the traveling salesman problem. In IEEE Congress on Evolutionary Computation (CEC\u201921). IEEE, 351\u2013358."},{"key":"e_1_3_2_111_2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-030-14082-3_11","volume-title":"International Workshop on Quantum Technology and Optimization Problems","author":"Pelofske Elijah","year":"2019","unstructured":"Elijah Pelofske, Georg Hahn, and Hristo Djidjev. 2019. Solving large maximum clique problems on a quantum annealer. In International Workshop on Quantum Technology and Optimization Problems. Springer, 123\u2013135."},{"key":"e_1_3_2_112_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.3.013227"},{"key":"e_1_3_2_113_2","article-title":"Modeling linear inequality constraints in quadratic binary optimization for variational quantum eigensolver","author":"Quinones Miguel Paredes","year":"2020","unstructured":"Miguel Paredes Quinones and Catarina Junqueira. 2020. Modeling linear inequality constraints in quadratic binary optimization for variational quantum eigensolver. arXiv preprint arXiv:2007.13245 (2020).","journal-title":"arXiv preprint arXiv:2007.13245"},{"key":"e_1_3_2_114_2","article-title":"Characterization of QUBO reformulations for the maximum  \\(k\\) -colorable subgraph problem","author":"Quintero Rodolfo","year":"2021","unstructured":"Rodolfo Quintero, David Bernal, Tam\u00e1s Terlaky, and Luis F. Zuluaga. 2021. Characterization of QUBO reformulations for the maximum \\(k\\) -colorable subgraph problem. arXiv preprint arXiv:2101.09462 (2021).","journal-title":"arXiv preprint arXiv:2101.09462"},{"key":"e_1_3_2_115_2","article-title":"Quantum constraint learning for quantum approximate optimization algorithm","author":"Radha Santosh Kumar","year":"2021","unstructured":"Santosh Kumar Radha. 2021. Quantum constraint learning for quantum approximate optimization algorithm. arXiv preprint arXiv:2105.06770 (2021).","journal-title":"arXiv preprint arXiv:2105.06770"},{"key":"e_1_3_2_116_2","article-title":"Towards analyzing large graphs with quantum annealing and quantum gate computers","author":"Reittu Hannu","year":"2020","unstructured":"Hannu Reittu, Ville Kotovirta, Lasse Leskel\u00e4, Hannu Rummukainen, and Tomi R\u00e4ty. 2020. Towards analyzing large graphs with quantum annealing and quantum gate computers. arXiv preprint arXiv:2006.16702 (2020).","journal-title":"arXiv preprint arXiv:2006.16702"},{"key":"e_1_3_2_117_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.101.012320"},{"key":"e_1_3_2_118_2","article-title":"Quantum approximate algorithm for NP optimization problems with constraints","author":"Ruan Yue","year":"2020","unstructured":"Yue Ruan, Samuel Marsh, Xilin Xue, Xi Li, Zhihao Liu, and Jingbo Wang. 2020. Quantum approximate algorithm for NP optimization problems with constraints. arXiv preprint arXiv:2002.00943 (2020).","journal-title":"arXiv preprint arXiv:2002.00943"},{"key":"e_1_3_2_119_2","first-page":"17","volume-title":"IEEE International Symposium on Smart Electronic Systems (iSES\u201920)","author":"Saha Amit","year":"2020","unstructured":"Amit Saha, Debasri Saha, and Amlan Chakrabarti. 2020. Circuit design for K-coloring problem and its implementation on near-term quantum devices. In IEEE International Symposium on Smart Electronic Systems (iSES\u201920). IEEE, 17\u201322."},{"key":"e_1_3_2_120_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219749920500112"},{"key":"e_1_3_2_121_2","article-title":"Approaches to constrained quantum approximate optimization","author":"Saleem Zain H.","year":"2020","unstructured":"Zain H. Saleem, Teague Tomesh, Bilal Tariq, and Martin Suchara. 2020. Approaches to constrained quantum approximate optimization. arXiv preprint arXiv:2010.06660 (2020).","journal-title":"arXiv preprint arXiv:2010.06660"},{"key":"e_1_3_2_122_2","doi-asserted-by":"publisher","DOI":"10.1109\/IGSC48788.2019.8957201"},{"key":"e_1_3_2_123_2","article-title":"Classical symmetries and QAOA","author":"Shaydulin Ruslan","year":"2021","unstructured":"Ruslan Shaydulin, Stuart Hadfield, Tad Hogg, and Ilya Safro. 2021. Classical symmetries and QAOA. Bull. Amer. Phys. Soc. 66, 1 (2021).","journal-title":"Bull. Amer. Phys. Soc."},{"key":"e_1_3_2_124_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916288"},{"key":"e_1_3_2_125_2","doi-asserted-by":"publisher","DOI":"10.1002\/qute.201900029"},{"key":"e_1_3_2_126_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2021.3066275"},{"issue":"2","key":"e_1_3_2_127_2","first-page":"1","article-title":"Mapping graph coloring to quantum annealing","volume":"2","author":"Silva Carla","year":"2020","unstructured":"Carla Silva, Ana Aguiar, Priscila M. V. Lima, and In\u00eas Dutra. 2020. Mapping graph coloring to quantum annealing. Quant. Mach. Intell. 2, 2 (2020), 1\u201319.","journal-title":"Quant. Mach. Intell."},{"key":"e_1_3_2_128_2","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2020.3030609"},{"key":"e_1_3_2_129_2","article-title":"Image acquisition planning for earth observation satellites with a quantum annealer","author":"Stollenwerk Tobias","year":"2020","unstructured":"Tobias Stollenwerk, Vincent Michaud, Elisabeth Lobe, Mathieu Picard, Achim Basermann, and Thierry Botter. 2020. Image acquisition planning for earth observation satellites with a quantum annealer. arXiv preprint arXiv:2006.09724 (2020).","journal-title":"arXiv preprint arXiv:2006.09724"},{"key":"e_1_3_2_130_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2891235"},{"key":"e_1_3_2_131_2","article-title":"Comparison of QAOA with quantum and simulated annealing","author":"Streif Michael","year":"2019","unstructured":"Michael Streif and Martin Leib. 2019. Comparison of QAOA with quantum and simulated annealing. arXiv preprint arXiv:1901.01903 (2019).","journal-title":"arXiv preprint arXiv:1901.01903"},{"key":"e_1_3_2_132_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8c2b"},{"key":"e_1_3_2_133_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.104.012403"},{"key":"e_1_3_2_134_2","article-title":"A heuristic method to solve large-scale integer linear programs by combining branch-and-price with a quantum algorithm","author":"Svensson Marika","year":"2021","unstructured":"Marika Svensson, Martin Andersson, Mattias Gr\u00f6nkvist, Pontus Vikst\u00e5l, Devdatt Dubhashi, Giulia Ferrini, and G\u00f6ran Johansson. 2021. A heuristic method to solve large-scale integer linear programs by combining branch-and-price with a quantum algorithm. arXiv preprint arXiv:2103.15433 (2021).","journal-title":"arXiv preprint arXiv:2103.15433"},{"key":"e_1_3_2_135_2","doi-asserted-by":"publisher","DOI":"10.1109\/QCE49297.2020.00018"},{"key":"e_1_3_2_136_2","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.88.061010"},{"key":"e_1_3_2_137_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.032612"},{"key":"e_1_3_2_138_2","article-title":"Bridging classical and quantum with SDP initialized warm-starts for QAOA","author":"Tate Reuben","year":"2020","unstructured":"Reuben Tate, Majid Farhadi, Creston Herold, Greg Mohler, and Swati Gupta. 2020. Bridging classical and quantum with SDP initialized warm-starts for QAOA. arXiv preprint arXiv:2010.14021 (2020).","journal-title":"arXiv preprint arXiv:2010.14021"},{"key":"e_1_3_2_139_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-50433-5_40"},{"key":"e_1_3_2_140_2","doi-asserted-by":"publisher","DOI":"10.1145\/3425607"},{"key":"e_1_3_2_141_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42484-019-00001-w"},{"key":"e_1_3_2_142_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.033446"},{"key":"e_1_3_2_143_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-020-02692-8"},{"key":"e_1_3_2_144_2","doi-asserted-by":"publisher","DOI":"10.1007\/s42484-020-00022-w"},{"key":"e_1_3_2_145_2","doi-asserted-by":"publisher","DOI":"10.1088\/0256-307X\/38\/3\/030302"},{"key":"e_1_3_2_146_2","article-title":"Sweeping quantum annealing algorithm for constrained optimization problems","author":"Yan Zheng","year":"2021","unstructured":"Zheng Yan, Zheng Zhou, Yan-Cheng Wang, Zi Yang Meng, and Xue-Feng Zhang. 2021. Sweeping quantum annealing algorithm for constrained optimization problems. arXiv preprint arXiv:2105.07134 (2021).","journal-title":"arXiv preprint arXiv:2105.07134"},{"key":"e_1_3_2_147_2","first-page":"605","volume-title":"Mathematical and Scientific Machine Learning","author":"Yao Jiahao","year":"2020","unstructured":"Jiahao Yao, Marin Bukov, and Lin Lin. 2020. Policy gradient based quantum approximate optimization algorithm. In Mathematical and Scientific Machine Learning. PMLR, 605\u2013634."},{"key":"e_1_3_2_148_2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/3412451.3428500","volume-title":"1st ACM SIGSOFT International Workshop on Architectures and Paradigms for Engineering Quantum Software","author":"Yarkoni Sheir","year":"2020","unstructured":"Sheir Yarkoni, Florian Neukart, Eliane Moreno Gomez Tagle, Nicole Magiera, Bharat Mehta, Kunal Hire, Swapnil Narkhede, and Martin Hofmann. 2020. Quantum shuttle: Traffic navigation with quantum computing. In 1st ACM SIGSOFT International Workshop on Architectures and Paradigms for Engineering Quantum Software. 22\u201330."},{"key":"e_1_3_2_149_2","first-page":"1","volume-title":"IEEE Congress on Evolutionary Computation (CEC\u201918)","author":"Yarkoni Sheir","year":"2018","unstructured":"Sheir Yarkoni, Aske Plaat, and Thomas Back. 2018. First results solving arbitrarily structured maximum independent set problems using quantum annealing. In IEEE Congress on Evolutionary Computation (CEC\u201918). IEEE, 1\u20136."},{"key":"e_1_3_2_150_2","article-title":"Solving inequality-constrained binary optimization problems on quantum annealer","author":"Yonaga Kouki","year":"2020","unstructured":"Kouki Yonaga, Masamichi J. Miyama, and Masayuki Ohzeki. 2020. Solving inequality-constrained binary optimization problems on quantum annealer. arXiv preprint arXiv:2012.06119 (2020).","journal-title":"arXiv preprint arXiv:2012.06119"},{"key":"e_1_3_2_151_2","article-title":"PyQUBO: Python library for mapping combinatorial optimization problems to QUBO form","author":"Zaman Mashiyat","year":"2021","unstructured":"Mashiyat Zaman, Kotaro Tanahashi, and Shu Tanaka. 2021. PyQUBO: Python library for mapping combinatorial optimization problems to QUBO form. arXiv preprint arXiv:2103.01708 (2021).","journal-title":"arXiv preprint arXiv:2103.01708"},{"key":"e_1_3_2_152_2","article-title":"Differentiable quantum architecture search","author":"Zhang Shi-Xin","year":"2020","unstructured":"Shi-Xin Zhang, Chang-Yu Hsieh, Shengyu Zhang, and Hong Yao. 2020. Differentiable quantum architecture search. arXiv preprint arXiv:2010.08561 (2020).","journal-title":"arXiv preprint arXiv:2010.08561"},{"key":"e_1_3_2_153_2","article-title":"Neural predictor based quantum architecture search","author":"Zhang Shi-Xin","year":"2021","unstructured":"Shi-Xin Zhang, Chang-Yu Hsieh, Shengyu Zhang, and Hong Yao. 2021. Neural predictor based quantum architecture search. arXiv preprint arXiv:2103.06524 (2021).","journal-title":"arXiv preprint arXiv:2103.06524"},{"key":"e_1_3_2_154_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-07-27-510"},{"key":"e_1_3_2_155_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067"},{"key":"e_1_3_2_156_2","article-title":"An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer","author":"Zhu Linghua","year":"2020","unstructured":"Linghua Zhu, Ho Lun Tang, George S. Barron, F. A. Calderon-Vargas, Nicholas J. Mayhall, Edwin Barnes, and Sophia E. Economou. 2020. An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer. arXiv preprint arXiv:2005.10258 (2020).","journal-title":"arXiv preprint arXiv:2005.10258"},{"issue":"4","key":"e_1_3_2_157_2","first-page":"32","article-title":"Improving quantum annealing performance on embedded problems","volume":"7","author":"Zielewski Michael R.","year":"2020","unstructured":"Michael R. Zielewski, Mulya Agung, Ryusuke Egawa, and Hiroyuki Takizawa. 2020. Improving quantum annealing performance on embedded problems. Supercomput. Front. Innov. 7, 4 (2020), 32\u201348.","journal-title":"Supercomput. Front. Innov."},{"key":"e_1_3_2_158_2","unstructured":"Elsevier. 2023. Quantum computing research trends report. https:\/\/beta.elsevier.com\/insights\/quantum-computing-report?trial=true"},{"key":"e_1_3_2_159_2","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-1994-7104"},{"key":"e_1_3_2_160_2","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.90.015002"},{"key":"e_1_3_2_161_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.01.001"},{"key":"e_1_3_2_162_2","doi-asserted-by":"publisher","DOI":"10.1137\/040605072"},{"key":"e_1_3_2_163_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.3.316"},{"key":"e_1_3_2_164_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aaadc2"},{"key":"e_1_3_2_165_2","article-title":"Noisy Intermediate-Scale Quantum (NISQ) algorithms","author":"Bharti Kishor","year":"2021","unstructured":"Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw, Tobias Haug, Sumner Alperin-Lea, Abhinav Anand, Matthias Degroote, Hermanni Heimonen, Jakob S. Kottmann, Tim Menke, Wai-Keong Mok, Sukin Sim, Leong-Chuan Kwek, and Al\u00e1n Aspuru-Guzik. 2021. Noisy Intermediate-Scale Quantum (NISQ) algorithms. arXiv preprint arXiv:2101.08448 (2021).","journal-title":"arXiv preprint arXiv:2101.08448"},{"key":"e_1_3_2_166_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_167_2","article-title":"Performance comparison of optimization methods on variational quantum algorithms","author":"Bonet-Monroig Xavier","year":"2021","unstructured":"Xavier Bonet-Monroig, Hao Wang, Diederick Vermetten, Bruno Senjean, Charles Moussa, Thomas B\u00e4ck, Vedran Dunjko, and Thomas E. O\u2019Brien. 2021. Performance comparison of optimization methods on variational quantum algorithms. arXiv preprint arXiv:2111.13454 (2021).","journal-title":"arXiv preprint arXiv:2111.13454"},{"key":"e_1_3_2_168_2","article-title":"On quadratization of pseudo-Boolean functions","author":"Boros Endre","year":"2014","unstructured":"Endre Boros and Aritanan Gruber. 2014. On quadratization of pseudo-Boolean functions. arXiv preprint arXiv:1404.6538 (2014).","journal-title":"arXiv preprint arXiv:1404.6538"},{"key":"e_1_3_2_169_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"e_1_3_2_170_2","volume-title":"Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers","author":"Boyd Stephen","year":"2011","unstructured":"Stephen Boyd, Neal Parikh, and Eric Chu. 2011. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Now Publishers Inc."},{"key":"e_1_3_2_171_2","article-title":"The complexity of stoquastic local Hamiltonian problems","author":"Bravyi Sergey","year":"2006","unstructured":"Sergey Bravyi, David P. Divincenzo, Roberto I. Oliveira, and Barbara M. Terhal. 2006. The complexity of stoquastic local Hamiltonian problems. arXiv preprint quant-ph\/0606140 (2006).","journal-title":"arXiv preprint quant-ph\/0606140"},{"key":"e_1_3_2_172_2","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-021-00348-9"},{"key":"e_1_3_2_173_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-018-1357-8"},{"key":"e_1_3_2_174_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICOIN48656.2020.9016555"},{"key":"e_1_3_2_175_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-008-0082-9"},{"key":"e_1_3_2_176_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-19066-8"},{"key":"e_1_3_2_177_2","doi-asserted-by":"publisher","DOI":"10.7566\/JPSJ.90.032001"},{"key":"e_1_3_2_178_2","article-title":"A quantum approximate optimization algorithm","author":"Farhi Edward","year":"2014","unstructured":"Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014).","journal-title":"arXiv preprint arXiv:1411.4028"},{"key":"e_1_3_2_179_2","article-title":"Quantum computation by adiabatic evolution","author":"Farhi Edward","year":"2000","unstructured":"Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. 2000. Quantum computation by adiabatic evolution. arXiv preprint quant-ph\/0001106 (2000).","journal-title":"arXiv preprint quant-ph\/0001106"},{"key":"e_1_3_2_180_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"e_1_3_2_181_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.143"},{"key":"e_1_3_2_182_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2018.09.006"},{"key":"e_1_3_2_183_2","doi-asserted-by":"publisher","DOI":"10.5555\/3226649.3226818"},{"key":"e_1_3_2_184_2","unstructured":"Felix G. Gemeinhardt. 2022. quantum_CO_sms. Retrieved from https:\/\/github.com\/jku-win-se\/quantum_CO_sms"},{"key":"e_1_3_2_185_2","first-page":"212","volume-title":"28th Annual ACM Symposium on Theory of Computing","author":"Grover Lov K.","year":"1996","unstructured":"Lov K. Grover. 1996. A fast quantum mechanical algorithm for database search. In 28th Annual ACM Symposium on Theory of Computing. 212\u2013219."},{"key":"e_1_3_2_186_2","volume-title":"Exploring Network Structure, Dynamics, and Function Using NetworkX","author":"Hagberg Aric","year":"2008","unstructured":"Aric Hagberg, Pieter Swart, and Daniel S. Chult. 2008. Exploring Network Structure, Dynamics, and Function Using NetworkX. Technical Report. Los Alamos National Lab, Los Alamos, NM."},{"key":"e_1_3_2_187_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.119.170501"},{"key":"e_1_3_2_188_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-23922-0"},{"key":"e_1_3_2_189_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.91"},{"key":"e_1_3_2_190_2","volume-title":"Beitrag zur theorie des ferro-und paramagnetismus","author":"Ising Ernst","year":"1924","unstructured":"Ernst Ising. 1924. Beitrag zur theorie des ferro-und paramagnetismus. Ph. D. Dissertation. Grefe & Tiedemann."},{"key":"e_1_3_2_191_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.040101"},{"key":"e_1_3_2_192_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature23879"},{"key":"e_1_3_2_193_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/abd59a"},{"key":"e_1_3_2_194_2","author":"Keele Staffs","year":"2007","unstructured":"Staffs Keele. 2007. Guidelines for Performing Systematic Literature Reviews in Software Engineering. Technical Report.","journal-title":"Guidelines for Performing Systematic Literature Reviews in Software Engineering"},{"key":"e_1_3_2_195_2","article-title":"Algorithm engineering for a quantum annealing platform","author":"King Andrew D.","year":"2014","unstructured":"Andrew D. King and Catherine C. McGeoch. 2014. Algorithm engineering for a quantum annealing platform. arXiv preprint arXiv:1410.2628 (2014).","journal-title":"arXiv preprint arXiv:1410.2628"},{"key":"e_1_3_2_196_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_197_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2010.03.006"},{"issue":"1","key":"e_1_3_2_198_2","first-page":"1457981","article-title":"Digital-analog quantum simulations with superconducting circuits","volume":"3","author":"Lamata Lucas","year":"2018","unstructured":"Lucas Lamata, Adrian Parra-Rodriguez, Mikel Sanz, and Enrique Solano. 2018. Digital-analog quantum simulations with superconducting circuits. Adv. Phys.: X 3, 1 (2018), 1457981.","journal-title":"Adv. Phys.: X"},{"key":"e_1_3_2_199_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2970105"},{"key":"e_1_3_2_200_2","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"e_1_3_2_201_2","article-title":"A leap among quantum computing and quantum neural networks: A survey","author":"Massoli Fabio Valerio","year":"2022","unstructured":"Fabio Valerio Massoli, Lucia Vadicamo, Giuseppe Amato, and Fabrsizio Falchi. 2022. A leap among quantum computing and quantum neural networks: A survey. ACM Comput. Surv. 55, 5 (2022).","journal-title":"ACM Comput. Surv."},{"key":"e_1_3_2_202_2","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/3307650.3322273","volume-title":"46th International Symposium on Computer Architecture","author":"Murali Prakash","year":"2019","unstructured":"Prakash Murali, Norbert Matthias Linke, Margaret Martonosi, Ali Javadi Abhari, Nhung Hong Nguyen, and Cinthia Huerta Alderete. 2019. Full-stack, real-system quantum computer studies: Architectural comparisons and design insights. In 46th International Symposium on Computer Architecture. ACM, 527\u2013540."},{"key":"e_1_3_2_203_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.013304"},{"key":"e_1_3_2_204_2","article-title":"Complex semidefinite programming and Max-k-cut","author":"Newman Alantha","year":"2018","unstructured":"Alantha Newman. 2018. Complex semidefinite programming and Max-k-cut. arXiv preprint arXiv:1812.10770 (2018).","journal-title":"arXiv preprint arXiv:1812.10770"},{"issue":"2","key":"e_1_3_2_205_2","first-page":"60","article-title":"Quantum computation and quantum information","volume":"54","author":"Nielsen Michael A.","year":"2001","unstructured":"Michael A. Nielsen and Isaac L. Chuang. 2001. Quantum computation and quantum information. Phys. Today 54, 2 (2001), 60.","journal-title":"Phys. Today"},{"key":"e_1_3_2_206_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-010-0168-z"},{"key":"e_1_3_2_207_2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213"},{"key":"e_1_3_2_208_2","doi-asserted-by":"publisher","DOI":"10.14236\/ewic\/EASE2008.8"},{"key":"e_1_3_2_209_2","volume-title":"The Mathematical Theory of Optimal Processes\u2019Selected Works of LS Pontryagin","author":"Pontryagin L. S.","year":"1986","unstructured":"L. S. Pontryagin, V. G. Boltyanskii, R. V. Gamkrelidze, and E. F. Mishchenko. 1986. The Mathematical Theory of Optimal Processes\u2019Selected Works of LS Pontryagin, Vol. 4, Gordon and Breach Science Pub. S.A. Montreux, Switzerland."},{"key":"e_1_3_2_210_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_2_211_2","doi-asserted-by":"publisher","DOI":"10.1145\/3464420"},{"key":"e_1_3_2_212_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970739"},{"key":"e_1_3_2_213_2","volume":"24","author":"Schrijver Alexander","year":"2003","unstructured":"Alexander Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Vol. 24. Springer.","journal-title":"Combinatorial Optimization: Polyhedra and Efficiency"},{"key":"e_1_3_2_214_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.85.051112"},{"key":"e_1_3_2_215_2","article-title":"Quantum software components and platforms: Overview and quality assessment","author":"Serrano Manuel A.","year":"2022","unstructured":"Manuel A. Serrano, Jos\u00e9 A. Cruz-Lemus, Ricardo P\u00e9rez-Castillo, and Mario Piattini. 2022. Quantum software components and platforms: Overview and quality assessment. Comput. Surv. 55, 8 (2022).","journal-title":"Comput. Surv."},{"key":"e_1_3_2_216_2","article-title":"How \u201cquantum\u201d is the D-Wave machine?","author":"Shin Seung Woo","year":"2014","unstructured":"Seung Woo Shin, Graeme Smith, John A. Smolin, and Umesh Vazirani. 2014. How \u201cquantum\u201d is the D-Wave machine? arXiv preprint arXiv:1401.7087 (2014).","journal-title":"arXiv preprint arXiv:1401.7087"},{"key":"e_1_3_2_217_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548464"},{"key":"e_1_3_2_218_2","article-title":"Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms","author":"Tomesh Teague","year":"2022","unstructured":"Teague Tomesh, Nicholas Allen, and Zain Saleem. 2022. Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms. arXiv preprint arXiv:2210.04378 (2022).","journal-title":"arXiv preprint arXiv:2210.04378"},{"key":"e_1_3_2_219_2","doi-asserted-by":"publisher","DOI":"10.1080\/00107514.2018.1450720"},{"key":"e_1_3_2_220_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00766-005-0021-6"},{"key":"e_1_3_2_221_2","doi-asserted-by":"publisher","DOI":"10.1145\/2601248.2601268"},{"key":"e_1_3_2_222_2","article-title":"Combinatorial optimization on gate model quantum computers: A survey","author":"Zahedinejad Ehsan","year":"2017","unstructured":"Ehsan Zahedinejad and Arman Zaribafiyan. 2017. Combinatorial optimization on gate model quantum computers: A survey. arXiv preprint arXiv:1708.05294 (2017).","journal-title":"arXiv preprint arXiv:1708.05294"},{"key":"e_1_3_2_223_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2021.3063618"},{"key":"e_1_3_2_224_2","article-title":"Schedule path optimization for quantum annealing and adiabatic quantum computing","author":"Zeng Lishan","year":"2015","unstructured":"Lishan Zeng, Jun Zhang, and Mohan Sarovar. 2015. Schedule path optimization for quantum annealing and adiabatic quantum computing. arXiv preprint arXiv:1505.00209 (2015).","journal-title":"arXiv preprint arXiv:1505.00209"},{"key":"e_1_3_2_225_2","doi-asserted-by":"publisher","DOI":"10.1002\/que2.34"},{"key":"e_1_3_2_226_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1748\/3\/032022"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3620668","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3620668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:43Z","timestamp":1750291423000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3620668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,5]]},"references-count":225,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3,31]]}},"alternative-id":["10.1145\/3620668"],"URL":"https:\/\/doi.org\/10.1145\/3620668","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,5]]},"assertion":[{"value":"2022-12-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-08-21","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}