{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:42:11Z","timestamp":1773193331523,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T00:00:00Z","timestamp":1714176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,4,27]]},"DOI":"10.1145\/3620665.3640363","type":"proceedings-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T14:18:06Z","timestamp":1713795486000},"page":"980-998","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Red-QAOA: Efficient Variational Optimization through Circuit Reduction"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-1749-7929","authenticated-orcid":false,"given":"Meng","family":"Wang","sequence":"first","affiliation":[{"name":"University of British Columbia, Vancouver, Canada"},{"name":"Pacific Northwest National Laboratory, Richland, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9721-3982","authenticated-orcid":false,"given":"Bo","family":"Fang","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3734-9137","authenticated-orcid":false,"given":"Ang","family":"Li","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1732-4314","authenticated-orcid":false,"given":"Prashant J.","family":"Nair","sequence":"additional","affiliation":[{"name":"University of British Columbia, Vancouver, Canada"}]}],"member":"320","published-online":{"date-parts":[[2024,4,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"e_1_3_2_1_2_1","first-page":"6","article-title":"Trapped-ion quantum computing: Progress and challenges","author":"Bruzewicz Colin D.","year":"2019","unstructured":"Colin D. Bruzewicz, John Chiaverini, Robert McConnell, and Jeremy M. Sage. Trapped-ion quantum computing: Progress and challenges. Applied Physics Reviews, 6, 2019.","journal-title":"Applied Physics Reviews"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.chemrev.8b00803"},{"key":"e_1_3_2_1_4_1","first-page":"292","article-title":"A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem","author":"Farhi E.","year":"2001","unstructured":"E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda. A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem. Science, 292, 2001.","journal-title":"Science"},{"key":"e_1_3_2_1_5_1","first-page":"21","article-title":"Simulating physics with computers","author":"Feynman Richard P.","year":"1982","unstructured":"Richard P. Feynman. Simulating physics with computers. International Journal of Theoretical Physics, 21, 1982.","journal-title":"International Journal of Theoretical Physics"},{"key":"e_1_3_2_1_6_1","volume-title":"Expanding the IBM Quantum roadmap to anticipate the future of quantum-centric supercomputing. https:\/\/research.ibm.com\/blog\/ibm-quantum-roadmap-2025","author":"Gambetta Jay","year":"2022","unstructured":"Jay Gambetta. Expanding the IBM Quantum roadmap to anticipate the future of quantum-centric supercomputing. https:\/\/research.ibm.com\/blog\/ibm-quantum-roadmap-2025, 2022. [Online; accessed 1-April-2023]."},{"key":"e_1_3_2_1_7_1","volume-title":"A fast quantum mechanical algorithm for database search. arXiv preprint quant-ph\/9605043","author":"Grover Lov K","year":"1996","unstructured":"Lov K Grover. A fast quantum mechanical algorithm for database search. arXiv preprint quant-ph\/9605043, 1996."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358287"},{"key":"e_1_3_2_1_10_1","volume-title":"A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028","author":"Farhi Edward","year":"2014","unstructured":"Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028, 2014."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118723203"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-021-03342-3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.022304"},{"key":"e_1_3_2_1_14_1","volume-title":"APS Meeting Abstracts","author":"Ward Jonathan","year":"2018","unstructured":"Jonathan Ward, Johannes Otterbach, Gavin Crooks, Nicholas Rubin, and Marcus da Silva. QAOA Performance Benchmarks using Max-Cut. In APS Meeting Abstracts, 2018."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-021-00348-9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.010501"},{"key":"e_1_3_2_1_18_1","first-page":"2211","article-title":"Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation","author":"Huang He-Liang","year":"2022","unstructured":"He-Liang Huang, Xiao-Yue Xu, Chu Guo, Guojing Tian, Shi-Jie Wei, Xiaoming Sun, Wan-Su Bao, and Gui-Lu Long. Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation, December 2022. arXiv:2211.08737 [quant-ph].","journal-title":"Benchmarking and Classical Simulation"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3624062.3624221"},{"key":"e_1_3_2_1_20_1","volume-title":"Tqsim: a case for reuse-focused tree-based quantum circuit simulation. arXiv preprint arXiv:2203.13892","author":"Wang Meng","year":"2022","unstructured":"Meng Wang, Rui Huang, Swamit Tannu, and Prashant Nair. Tqsim: a case for reuse-focused tree-based quantum circuit simulation. arXiv preprint arXiv:2203.13892, 2022."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588983.3596680"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3123939.3123940"},{"key":"e_1_3_2_1_23_1","first-page":"987","volume-title":"Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS '19","author":"Swamit","year":"2019","unstructured":"Swamit S. Tannu and Moinuddin K. Qureshi. Not all qubits are created equal: A case for variability-aware policies for nisq-era quantum computers. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS '19, page 987--999, New York, NY, USA, 2019. Association for Computing Machinery."},{"key":"e_1_3_2_1_24_1","first-page":"279","volume-title":"Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture, MICRO '52","author":"Swamit","year":"2019","unstructured":"Swamit S. Tannu and Moinuddin K. Qureshi. Mitigating measurement errors in quantum computers by exploiting state-dependent bias. In Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture, MICRO '52, page 279--290, New York, NY, USA, 2019. Association for Computing Machinery."},{"key":"e_1_3_2_1_25_1","first-page":"253","volume-title":"Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture, MICRO '52","author":"Swamit","year":"2019","unstructured":"Swamit S. Tannu and Moinuddin Qureshi. Ensemble of diverse mappings: Improving reliability of quantum computers by orchestrating dissimilar mistakes. In Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture, MICRO '52, page 253--265, New York, NY, USA, 2019. Association for Computing Machinery."},{"key":"e_1_3_2_1_26_1","volume-title":"December","author":"Brandao Fernando G. S. L.","year":"2018","unstructured":"Fernando G. S. L. Brandao, Michael Broughton, Edward Farhi, Sam Gutmann, and Hartmut Neven. For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances, December 2018. arXiv:1812.04170 [quant-ph]."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCS54837.2021.00011"},{"key":"e_1_3_2_1_28_1","volume-title":"June","author":"Galda Alexey","year":"2021","unstructured":"Alexey Galda, Xiaoyuan Liu, Danylo Lykov, Yuri Alexeev, and Ilya Safro. Transferability of optimal QAOA parameters between random graphs, June 2021. arXiv:2106.07531 [quant-ph]."},{"key":"e_1_3_2_1_29_1","volume-title":"Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut. ACM Transactions on Quantum Computing, page","author":"Shaydulin Ruslan","year":"2023","unstructured":"Ruslan Shaydulin, Phillip C. Lotshaw, Jeffrey Larson, James Ostrowski, and Travis S. Humble. Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut. ACM Transactions on Quantum Computing, page 3584706, February 2023. arXiv:2201.11785 [quant-ph]."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA56546.2023.10071025"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480059"},{"key":"e_1_3_2_1_32_1","first-page":"362","volume-title":"Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","volume":"4","author":"Dangwal Siddharth","year":"2024","unstructured":"Siddharth Dangwal, Gokul Subramanian Ravi, Poulami Das, Kaitlin N. Smith, Jonathan Mark Baker, and Frederic T. Chong. Varsaw: Application-tailored measurement error mitigation for variational quantum algorithms. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 4, ASPLOS '23, page 362--377, New York, NY, USA, 2024. Association for Computing Machinery."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507703"},{"key":"e_1_3_2_1_34_1","volume-title":"Graph theory with applications to engineering and computer science","author":"Deo Narsingh","year":"2016","unstructured":"Narsingh Deo. Graph theory with applications to engineering and computer science. Dover Publications, Inc, Mineola New York, 2016."},{"key":"e_1_3_2_1_35_1","volume-title":"February","author":"Ranjan Ekagra","year":"2020","unstructured":"Ekagra Ranjan, Soumya Sanyal, and Partha Pratim Talukdar. ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations, February 2020. arXiv:1911.07979 [cs, stat]."},{"key":"e_1_3_2_1_36_1","first-page":"1905","author":"Knyazev Boris","year":"2019","unstructured":"Boris Knyazev, Graham W. Taylor, and Mohamed R. Amer. Understanding Attention and Generalization in Graph Neural Networks, October 2019. arXiv:1905.02850 [cs, stat].","journal-title":"Amer. Understanding Attention and Generalization in Graph Neural Networks"},{"key":"e_1_3_2_1_37_1","volume-title":"June","author":"Lee Junhyun","year":"2019","unstructured":"Junhyun Lee, Inyeop Lee, and Jaewoo Kang. Self-Attention Graph Pooling, June 2019. arXiv:1904.08082 [cs, stat]."},{"key":"e_1_3_2_1_38_1","volume-title":"November","author":"Cangea C\u0103t\u0103lina","year":"2018","unstructured":"C\u0103t\u0103lina Cangea, Petar Veli\u010dkovi\u0107, Nikola Jovanovi\u0107, Thomas Kipf, and Pietro Li\u00f2. Towards Sparse Hierarchical Graph Classifiers, November 2018. arXiv:1811.01287 [cs, stat]."},{"key":"e_1_3_2_1_39_1","volume-title":"arXiv","author":"Gao Hongyang","year":"1905","unstructured":"Hongyang Gao and Shuiwang Ji. Graph U-Nets, May 2019. arXiv:1905.05178 [cs, stat]."},{"key":"e_1_3_2_1_40_1","volume-title":"Empirical performance bounds for quantum approximate optimization. Quantum Information Processing, 20(12), nov","author":"Lotshaw Phillip C.","year":"2021","unstructured":"Phillip C. Lotshaw, Travis S. Humble, Rebekah Herrman, James Ostrowski, and George Siopsis. Empirical performance bounds for quantum approximate optimization. Quantum Information Processing, 20(12), nov 2021."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_2_1_42_1","volume-title":"Simulated annealing: theory and applications. Number 37 in Mathematics and its applications <Dordrecht>","author":"van Laarhoven Peter J. M.","year":"1988","unstructured":"Peter J. M. van Laarhoven, Peter J. M. van Laarhoven, and Emile H. L. Aarts. Simulated annealing: theory and applications. Number 37 in Mathematics and its applications <Dordrecht>. Kluwer, Dordrecht, reprinted with corr. 1988, reprinted edition, 1992."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"e_1_3_2_1_44_1","first-page":"210","volume-title":"Hai Jin. An Efficient Graph Indexing Method. In 2012 IEEE 28th International Conference on Data Engineering","author":"Wang Xiaoli","year":"2012","unstructured":"Xiaoli Wang, Xiaofeng Ding, Anthony K.H. Tung, Shanshan Ying, and Hai Jin. An Efficient Graph Indexing Method. In 2012 IEEE 28th International Conference on Data Engineering, pages 210--221, Arlington, VA, USA, April 2012. IEEE."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"issue":"1","key":"e_1_3_2_1_46_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151s Paul","year":"1960","unstructured":"Paul Erd\u0151s, Alfr\u00e9d R\u00e9nyi, et al. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci, 5(1):17--60, 1960.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"e_1_3_2_1_47_1","volume-title":"Qiskit: An open-source framework for quantum computing","author":"Qiskit","year":"2023","unstructured":"Qiskit contributors. Qiskit: An open-source framework for quantum computing, 2023."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480044"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304023"},{"key":"e_1_3_2_1_50_1","volume-title":"ICLR Workshop on Representation Learning on Graphs and Manifolds","author":"Fey Matthias","year":"2019","unstructured":"Matthias Fey and Jan E. Lenssen. Fast graph representation learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds, 2019."},{"key":"e_1_3_2_1_51_1","volume-title":"Quality, speed, and scale: three key attributes to measure the performance of near-term quantum computers","author":"Wack Andrew","year":"2021","unstructured":"Andrew Wack, Hanhee Paik, Ali Javadi-Abhari, Petar Jurcevic, Ismael Faro, Jay M. Gambetta, and Blake R. Johnson. Quality, speed, and scale: three key attributes to measure the performance of near-term quantum computers, 2021."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266.2020.00029"},{"key":"e_1_3_2_1_54_1","volume-title":"Frozenqubits: Boosting fidelity of qaoa by skipping hotspot nodes","author":"Ayanzadeh Ramin","year":"2023","unstructured":"Ramin Ayanzadeh, Narges Alavisamani, Poulami Das, and Moinuddin Qureshi. Frozenqubits: Boosting fidelity of qaoa by skipping hotspot nodes, 2023."},{"key":"e_1_3_2_1_55_1","volume-title":"Error mitigation for short-depth quantum circuits. Physical review letters, 119(18):180509","author":"Temme Kristan","year":"2017","unstructured":"Kristan Temme, Sergey Bravyi, and Jay M Gambetta. Error mitigation for short-depth quantum circuits. Physical review letters, 119(18):180509, 2017."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-11-17-861"},{"key":"e_1_3_2_1_57_1","volume-title":"Cafqa: A classical simulation bootstrap for variational quantum algorithms","author":"Ravi Gokul Subramanian","year":"2022","unstructured":"Gokul Subramanian Ravi, Pranav Gokhale, Yi Ding, William M. Kirby, Kaitlin N. Smith, Jonathan M. Baker, Peter J. Love, Henry Hoffmann, Kenneth R. Brown, and Frederic T. Chong. Cafqa: A classical simulation bootstrap for variational quantum algorithms, 2022."},{"key":"e_1_3_2_1_58_1","volume-title":"Jakub Mare\u010d ek, and Stefan Woerner. Warm-starting quantum optimization. Quantum, 5:479, jun","author":"Egger Daniel J.","year":"2021","unstructured":"Daniel J. Egger, Jakub Mare\u010d ek, and Stefan Woerner. Warm-starting quantum optimization. Quantum, 5:479, jun 2021."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507715"},{"key":"e_1_3_2_1_60_1","volume-title":"2qan: A quantum compiler for 2-local qubit hamiltonian simulation algorithms","author":"Lao Lingling","year":"2021","unstructured":"Lingling Lao and Dan E. Browne. 2qan: A quantum compiler for 2-local qubit hamiltonian simulation algorithms, 2021."},{"key":"e_1_3_2_1_61_1","volume-title":"Efficient classical computation of quantum mean values for shallow qaoa circuits","author":"Zhuang Wei-Feng","year":"2021","unstructured":"Wei-Feng Zhuang, Ya-Nan Pu, Hong-Ze Xu, Xudan Chai, Yanwu Gu, Yunheng Ma, Shahid Qamar, Chen Qian, Peng Qian, Xiao Xiao, Meng-Jun Hu, and Dong E. Liu. Efficient classical computation of quantum mean values for shallow qaoa circuits, 2021."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/acb22c"},{"key":"e_1_3_2_1_63_1","volume-title":"Advances in Neural Information Processing Systems","author":"Zass Ron","year":"2006","unstructured":"Ron Zass and Amnon Shashua. Doubly stochastic normalization for spectral clustering. In B. Sch\u00f6lkopf, J. Platt, and T. Hoffman, editors, Advances in Neural Information Processing Systems, volume 19. MIT Press, 2006."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS691"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.45"},{"key":"e_1_3_2_1_66_1","volume-title":"Tightening lp relaxations for map using message passing","author":"Sontag David","year":"2012","unstructured":"David Sontag, Talya Meltzer, Amir Globerson, Tommi S. Jaakkola, and Yair Weiss. Tightening lp relaxations for map using message passing, 2012."},{"key":"e_1_3_2_1_67_1","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Raiko Tapani","year":"2012","unstructured":"Tapani Raiko, Harri Valpola, and Yann LeCun. Deep learning made easier by linear transformations in perceptrons. In International Conference on Artificial Intelligence and Statistics, 2012."},{"key":"e_1_3_2_1_68_1","volume-title":"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization","author":"Dauphin Yann","year":"2014","unstructured":"Yann Dauphin, Razvan Pascanu, Caglar Gulcehre, Kyunghyun Cho, Surya Ganguli, and Yoshua Bengio. Identifying and attacking the saddle point problem in high-dimensional non-convex optimization, 2014."}],"event":{"name":"ASPLOS '24: 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2","location":"La Jolla CA USA","acronym":"ASPLOS '24","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGOPS ACM Special Interest Group on Operating Systems","SIGPLAN ACM Special Interest Group on Programming Languages","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3620665.3640363","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3620665.3640363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:41Z","timestamp":1750291421000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3620665.3640363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,27]]},"references-count":68,"alternative-id":["10.1145\/3620665.3640363","10.1145\/3620665"],"URL":"https:\/\/doi.org\/10.1145\/3620665.3640363","relation":{},"subject":[],"published":{"date-parts":[[2024,4,27]]},"assertion":[{"value":"2024-04-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}