{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:18:22Z","timestamp":1782969502217,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T00:00:00Z","timestamp":1712534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100007225","name":"Ministry of Science and Technology","doi-asserted-by":"publisher","award":["111-2221-E-006-116-MY3"],"award-info":[{"award-number":["111-2221-E-006-116-MY3"]}],"id":[{"id":"10.13039\/100007225","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["112-2119-M-002-017-"],"award-info":[{"award-number":["112-2119-M-002-017-"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["112-2221-E-002-159-MY3"],"award-info":[{"award-number":["112-2221-E-002-159-MY3"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Center of Data Intelligence: Technologies, Applications, and Systems","award":["NTU-112L900903"],"award-info":[{"award-number":["NTU-112L900903"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,8]]},"DOI":"10.1145\/3605098.3635897","type":"proceedings-article","created":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T17:59:16Z","timestamp":1716314356000},"page":"1487-1494","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Towards Optimizations of Quantum Circuit Simulation for Solving Max-Cut Problems with QAOA"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8163-9554","authenticated-orcid":false,"given":"Yu-Cheng","family":"Lin","sequence":"first","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8267-8071","authenticated-orcid":false,"given":"Chuan-Chi","family":"Wang","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8967-1385","authenticated-orcid":false,"given":"Chia-Heng","family":"Tu","sequence":"additional","affiliation":[{"name":"National Cheng Kung University, Taipei, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2043-2663","authenticated-orcid":false,"given":"Shih-Hao","family":"Hung","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(94)00117-0"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266.2020.00029"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CICC48029.2020.9075903"},{"key":"e_1_3_2_1_4_1","volume-title":"Noise Resilient Compilation Policies for Quantum Approximate Optimization Algorithm. In 2020 IEEE\/ACM International Conference On Computer Aided Design (ICCAD). 1--7.","author":"Alam Mahabubul","year":"2020","unstructured":"Mahabubul Alam, Abdullah Ash-Saki, Junde Li, Anupam Chattopadhyay, and Swaroop Ghosh. 2020. Noise Resilient Compilation Policies for Quantum Approximate Optimization Algorithm. In 2020 IEEE\/ACM International Conference On Computer Aided Design (ICCAD). 1--7."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218558"},{"key":"e_1_3_2_1_6_1","volume-title":"Complexity and Approximation","author":"Ausiello Giorgio","unstructured":"Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, and Viggo Kann. 1999. Complexity and Approximation. Springer."},{"key":"e_1_3_2_1_7_1","volume-title":"Global portfolio optimization. Financial analysts journal 48, 5","author":"Black Fischer","year":"1992","unstructured":"Fischer Black and Robert Litterman. 1992. Global portfolio optimization. Financial analysts journal 48, 5 (1992), 28--43."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.107.032407"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE53715.2022.00028"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.013141"},{"key":"e_1_3_2_1_11_1","unstructured":"Cirq 2022. Cirq is a Python library for writing manipulating and optimizing quantum circuits and running them against quantum computers and simulators. https:\/\/github.com\/quantumlib\/Cirq"},{"key":"e_1_3_2_1_12_1","unstructured":"Gavin E. Crooks. 2018. Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem. arXiv:1811.08419"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"The cuQuantum development team. 2023. cuQuantum. If you use this software please cite it as below.. 10.5281\/zenodo.7806810","DOI":"10.5281\/zenodo.7806810"},{"key":"e_1_3_2_1_14_1","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A Quantum Approximate Optimization Algorithm. arXiv:1411.4028"},{"key":"e_1_3_2_1_15_1","volume-title":"A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292, 5516","author":"Farhi Edward","year":"2001","unstructured":"Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Joshua Lapan, Andrew Lundgren, and Daniel Preda. 2001. A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292, 5516 (2001), 472--475."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2021.113388"},{"key":"e_1_3_2_1_17_1","volume-title":"The traveling-salesman problem. Operations research 4, 1","author":"Flood Merrill M","year":"1956","unstructured":"Merrill M Flood. 1956. The traveling-salesman problem. Operations research 4, 1 (1956), 61--75."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.3390\/a15060202"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Alexey Galda Xiaoyuan Liu Danylo Lykov Yuri Alexeev and Ilya Safro. 2021. Transferability of optimal QAOA parameters between random graphs. arXiv:2106.07531","DOI":"10.1109\/QCE52317.2021.00034"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0208073"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3390\/a12020034"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Rebekah Herrman Phillip C. Lotshaw James Ostrowski Travis S. Humble and George Siopsis. 2021. Multi-angle Quantum Approximate Optimization Algorithm. arXiv:2109.11455","DOI":"10.1038\/s41598-022-10555-8"},{"key":"e_1_3_2_1_24_1","unstructured":"Juho Hirvonen Joel Rybicki Stefan Schmid and Jukka Suomela. 2014. Large Cuts with Local Algorithms on Triangle-Free Graphs. arXiv:1402.2543"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-11-17-861"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-47174-9"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-021-03342-3"},{"key":"e_1_3_2_1_28_1","unstructured":"Ritajit Majumdar Dhiraj Madan Debasmita Bhoumik Dhinakaran Vinayagamurthy Shesha Raghunathan and Susmita Sur-Kolay. 2021. Optimizing Ansatz Design in QAOA for Max-cut. arXiv:2106.02812"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1088\/2633-1357\/abb0d7"},{"key":"e_1_3_2_1_30_1","unstructured":"Glen Bigan Mbeng Rosario Fazio and Giuseppe Santoro. 2019. Quantum Annealing: a journey through Digitalization Control and hybrid Quantum Variational schemes. arXiv:1906.08948"},{"key":"e_1_3_2_1_31_1","volume-title":"Monte carlo simulation. Number 116","author":"Mooney Christopher Z","unstructured":"Christopher Z Mooney. 1997. Monte carlo simulation. Number 116. Sage."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213"},{"key":"e_1_3_2_1_33_1","volume-title":"Genetic algorithms","author":"Reeves Colin","unstructured":"Colin Reeves. 2003. Genetic algorithms. Springer. 55--82 pages."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_1_35_1","unstructured":"Mikhail Smelyanskiy Nicolas P. D. Sawaya and Al\u00e1n Aspuru-Guzik. 2016. qHiPSTER: The Quantum High Performance Software Testing Environment. arXiv:1601.07195"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-01-31-49"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-08-31-314"},{"key":"e_1_3_2_1_38_1","volume-title":"Peter JM van Laarhoven, and Emile HL Aarts.","author":"Van Laarhoven Peter JM","year":"1987","unstructured":"Peter JM Van Laarhoven, Emile HL Aarts, Peter JM van Laarhoven, and Emile HL Aarts. 1987. Simulated annealing. Springer."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.97.022304"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.042612"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-01-27-635"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067"},{"key":"e_1_3_2_1_43_1","volume-title":"George S. Barron, F. A. Calderon-Vargas, Nicholas J. Mayhall, Edwin Barnes, and Sophia E. Economou.","author":"Zhu Linghua","year":"2022","unstructured":"Linghua Zhu, Ho Lun Tang, George S. Barron, F. A. Calderon-Vargas, Nicholas J. Mayhall, Edwin Barnes, and Sophia E. Economou. 2022. An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer. arXiv:2005.10258"}],"event":{"name":"SAC '24: 39th ACM\/SIGAPP Symposium on Applied Computing","location":"Avila Spain","acronym":"SAC '24","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 39th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605098.3635897","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3605098.3635897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:13Z","timestamp":1750178173000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605098.3635897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,8]]},"references-count":43,"alternative-id":["10.1145\/3605098.3635897","10.1145\/3605098"],"URL":"https:\/\/doi.org\/10.1145\/3605098.3635897","relation":{},"subject":[],"published":{"date-parts":[[2024,4,8]]},"assertion":[{"value":"2024-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}