{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:53:56Z","timestamp":1770285236704,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","funder":[{"name":"National Science and Technology Council, Taiwan","award":["114-2119-M-002 -020 - and 114-2221-E-006 -165 -MY3"],"award-info":[{"award-number":["114-2119-M-002 -020 - and 114-2221-E-006 -165 -MY3"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,16]]},"DOI":"10.1145\/3769002.3769984","type":"proceedings-article","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T19:16:19Z","timestamp":1770232579000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Quantum-Inspired QAOA Solver for Knapsack Problems with 100-Qubit Scalability and 100,000x Speedup"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-0108-4478","authenticated-orcid":false,"given":"Shan-Jung","family":"Hou","sequence":"first","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7458-9634","authenticated-orcid":false,"given":"Po-Hsuan","family":"Huang","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8967-1385","authenticated-orcid":false,"given":"Chia-Heng","family":"Tu","sequence":"additional","affiliation":[{"name":"National Cheng Kung University, Tainan, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,2,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","first-page":"102093","DOI":"10.1016\/j.jksuci.2024.102093","article-title":"Binary metaheuristic algorithms for 0-1 knapsack problems: Performance analysis, hybrid variants, and real-world application","volume":"36","author":"Abdel-Basset Mohamed","year":"2024","unstructured":"Mohamed Abdel-Basset, Reda Mohamed, Safaa Saber, Ibrahim M. Hezam, Karam M. Sallam, and Ibrahim A. Hameed. 2024. Binary metaheuristic algorithms for 0-1 knapsack problems: Performance analysis, hybrid variants, and real-world application. Journal of King Saud University - Computer and Information Sciences 36, 6 (2024), 102093.","journal-title":"Journal of King Saud University - Computer and Information Sciences"},{"key":"e_1_3_2_1_2_1","volume-title":"Combinatorial Optimization Problems and Their Approximability Properties","author":"Ausiello Giorgio","unstructured":"Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, and Viggo Kann. 1999. Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Harun Bayraktar Ali Charara David Clark Saul Cohen Timothy Costa Yao-Lung L. Fang Yang Gao Jack Guan John Gunnels Azzam Haidar Andreas Hehn Markus Hohnerbach Matthew Jones Tom Lubowe Dmitry Lyakh Shinya Morino Paul Springer Sam Stanwyck Igor Terentyev Satya Varadhan Jonathan Wong and Takuma Yamaguchi. 2023. cuQuantum SDK: A High-Performance Library for Accelerating Quantum Science. (2023). arXiv:quant-ph\/2308.01999","DOI":"10.1109\/QCE57702.2023.00119"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/OJNANO.2022.3178545"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the ACM Practice and Experience in Advanced Research Computing (PEARC).","author":"Chiu Shin-Wei","year":"2025","unstructured":"Shin-Wei Chiu, Chuo-Min Yang, Shan-Jung Hou, Po-Hsuan Huang, Chuan-Chi Wang, Chia-Heng Tu, and Shih-Hao Hung. 2025. FOR-QAOA: Fully Optimized Resource-Efficient QAOA Circuit Simulation for Solving the Max-Cut Problems. In Proceedings of the ACM Practice and Experience in Advanced Research Computing (PEARC)."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of IEEE International Conference on Quantum Computing and Engineering (QCE). 160\u2013170","author":"van Dam Wim","year":"2021","unstructured":"Wim van Dam, Karim Eldefrawy, Nicholas Genise, and Natalie Parham. 2021. Quantum Optimization Heuristics with an Application to Knapsack Problems. In Proceedings of IEEE International Conference on Quantum Computing and Engineering (QCE). 160\u2013170."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-06-17-479"},{"key":"e_1_3_2_1_9_1","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A Quantum Approximate Optimization Algorithm. (2014). arXiv:quant-ph\/1411.4028"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(94)00117-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321909"},{"key":"e_1_3_2_1_14_1","volume-title":"Gambetta","author":"Javadi-Abhari Ali","year":"2024","unstructured":"Ali Javadi-Abhari, Matthew Treinish, Kevin Krsulich, Christopher J. Wood, Jake Lishman, Julien Gacon, Simon Martiel, Paul D. Nation, Lev S. Bishop, Andrew W. Cross, Blake R. Johnson, and Jay M. Gambetta. 2024. Quantum computing with Qiskit. (2024). arXiv:quant-ph\/2405.08810"},{"key":"e_1_3_2_1_15_1","volume-title":"Benjamin","author":"Jones Tyson","year":"2019","unstructured":"Tyson Jones, Anna Brown, Ian Bush, and Simon C. Benjamin. 2019. QuEST and High Performance Simulation of Quantum Computers. Scientific Reports 9, 1 (2019)."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the International Conference on Neural Networks (ICNN)","volume":"4","author":"Kennedy J.","year":"1942","unstructured":"J. Kennedy and R. Eberhart. 1995. Particle swarm optimization. In Proceedings of the International Conference on Neural Networks (ICNN), Vol. 4. 1942\u20131948."},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the International Conference on Intelligent Systems and Applications (ICISA). 417\u2013422","author":"Aayush","unstructured":"Aayush P. Khandekar and Aniket Nargundkar. 2023. Dynamic Programming Approach to Solve Real-World Application of Multi-Objective Unbounded Knapsack Problem. In Proceedings of the International Conference on Intelligent Systems and Applications (ICISA). 417\u2013422."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick C. D. Gelatt and M. P. Vecchi. 1983. Optimization by Simulated Annealing. Science 220 4598 (1983) 671\u2013680.","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3605098.3635897"},{"key":"e_1_3_2_1_20_1","volume-title":"Knapsack problems: algorithms and computer implementations","author":"Martello Silvano","unstructured":"Silvano Martello and Paolo Toth. 1990. Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Inc."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"e_1_3_2_1_22_1","volume-title":"Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms. Quantum Science and Technology 9","author":"Montanez-Barrera Alejandro","year":"2024","unstructured":"Alejandro Montanez-Barrera, Dennis Willsch, A Maldonado-Romo, and Kristel Michielsen. 2024. Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms. Quantum Science and Technology 9 (2024)."},{"key":"e_1_3_2_1_23_1","volume-title":"Chuang","author":"Nielsen Michael A.","year":"2010","unstructured":"Michael A. Nielsen and Isaac L. Chuang. 2010. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press."},{"key":"e_1_3_2_1_24_1","volume-title":"O'Brien","author":"Peruzzo Alberto","year":"2014","unstructured":"Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Al\u00e1n Aspuru-Guzik, and Jeremy L. O'Brien. 2014. A variational eigenvalue solver on a photonic quantum processor. Nature Communications 5, 1 (2014)."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings 35th Annual Symposium on Foundations of Computer Science (SFCS). 124\u2013134","author":"Shor P.W.","year":"1994","unstructured":"P.W. Shor. 1994. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th Annual Symposium on Foundations of Computer Science (SFCS). 124\u2013134."},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. ACM Meas. Anal. Comput. Syst. 6, 3, Article 57","author":"Sun Bo","year":"2022","unstructured":"Bo Sun, Lin Yang, Mohammad Hajiesmaili, Adam Wierman, John C. S. Lui, Don Towsley, and Danny H.K. Tsang. 2022. The Online Knapsack Problem with Departures. Proc. ACM Meas. Anal. Comput. Syst. 6, 3, Article 57 (2022), 32 pages."}],"event":{"name":"RACS '25: International Conference on Research in Adaptive and Convergent Systems","location":"Ho Chi Minh Vietnam","acronym":"RACS '25","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the International Conference on Research in Adaptive and Convergent Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3769002.3769984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T19:17:20Z","timestamp":1770232640000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3769002.3769984"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,16]]},"references-count":26,"alternative-id":["10.1145\/3769002.3769984","10.1145\/3769002"],"URL":"https:\/\/doi.org\/10.1145\/3769002.3769984","relation":{},"subject":[],"published":{"date-parts":[[2025,11,16]]},"assertion":[{"value":"2026-02-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}