{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:08:38Z","timestamp":1770815318243,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":74,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"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,10,27]]},"DOI":"10.1145\/3676536.3697128","type":"proceedings-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T12:53:56Z","timestamp":1744203236000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1723-6568","authenticated-orcid":false,"given":"Zichang","family":"He","sequence":"first","affiliation":[{"name":"Global Technology Applied Research, JPMorganChase, New York, New York, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8657-2848","authenticated-orcid":false,"given":"Ruslan","family":"Shaydulin","sequence":"additional","affiliation":[{"name":"Global Technology Applied Research, JPMorganChase, New York, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8721-7848","authenticated-orcid":false,"given":"Dylan","family":"Herman","sequence":"additional","affiliation":[{"name":"Global Technology Applied Research, JPMorganChase, New York, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3019-5887","authenticated-orcid":false,"given":"Changhao","family":"Li","sequence":"additional","affiliation":[{"name":"Global Technology Applied Research, JPMorganChase, New York, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1005-6705","authenticated-orcid":false,"given":"Rudy","family":"Raymond","sequence":"additional","affiliation":[{"name":"Global Technology Applied Research, JPMorganChase, New York, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6265-8268","authenticated-orcid":false,"given":"Shree Hari","family":"Sureshbabu","sequence":"additional","affiliation":[{"name":"Global Technology Applied Research, JPMorganChase, New York, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9002-1128","authenticated-orcid":false,"given":"Marco","family":"Pistoia","sequence":"additional","affiliation":[{"name":"Global Technology Applied Research, JPMorganChase, New York, New York, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,4,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Apr","author":"DARPA Broad Agency Announcement","year":"2019","unstructured":"DARPA Broad Agency Announcement: Optimization with noisy intermediate-scale quantum devices (ONISQ), Apr 2019."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 37th International Conference on Neural Information Processing Systems, NIPS '23","author":"Abbas A.","year":"2024","unstructured":"A. Abbas, R. King, H.-Y. Huang, W. J. Huggins, R. Movassagh, D. Gilboa, and J. R. McClean. On quantum backpropagation, information reuse, and cheating measurement collapse. In Proceedings of the 37th International Conference on Neural Information Processing Systems, NIPS '23, Red Hook, NY, USA, 2024. Curran Associates Inc."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1002116107"},{"key":"e_1_3_2_1_4_1","volume-title":"Mar.","author":"Babbush R.","year":"2021","unstructured":"R. Babbush, J. R. McClean, M. Newman, C. Gidney, S. Boixo, and H. Neven. Focus beyond quadratic speedups for error-corrected quantum advantage. PRX Quantum, 2(1), Mar. 2021."},{"key":"e_1_3_2_1_5_1","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"1","volume-title":"17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC","author":"Basso J.","year":"2022","unstructured":"J. Basso, E. Farhi, K. Marwaha, B. Villalonga, and L. Zhou. The quantum approximate optimization algorithm at high depth for maxcut on large-girth regular graphs and the Sherrington-Kirkpatrick model. In F. Le Gall and T. Morimae, editors, 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022), volume 232 of Leibniz International Proceedings in Informatics (LIPIcs), pages 7:1--7:21, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.127.120502"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2024.03.002"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06927-3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.107.032407"},{"key":"e_1_3_2_1_10_1","volume-title":"Predicting parameters for the quantum approximate optimization algorithm for MaxCut from the infinite-size limit. arXiv:2110.10685","author":"Boulebnane S.","year":"2021","unstructured":"S. Boulebnane and A. Montanaro. Predicting parameters for the quantum approximate optimization algorithm for MaxCut from the infinite-size limit. arXiv:2110.10685, 2021."},{"key":"e_1_3_2_1_11_1","volume-title":"Solving Boolean satisfiability problems with the quantum approximate optimization algorithm. arXiv:2208.06909","author":"Boulebnane S.","year":"2022","unstructured":"S. Boulebnane and A. Montanaro. Solving Boolean satisfiability problems with the quantum approximate optimization algorithm. arXiv:2208.06909, 2022."},{"key":"e_1_3_2_1_12_1","volume-title":"For fixed control parameters the quantum approximate optimization algorithm's objective function value concentrates for typical instances. arXiv preprint arXiv:1812.04170","author":"Brandao F. G.","year":"2018","unstructured":"F. G. Brandao, M. Broughton, E. Farhi, S. Gutmann, and H. Neven. For fixed control parameters the quantum approximate optimization algorithm's objective function value concentrates for typical instances. arXiv preprint arXiv:1812.04170, 2018."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.260505"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42005-024-01577-x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.3.040303"},{"key":"e_1_3_2_1_16_1","volume-title":"Jan.","author":"Palma G. De","year":"2023","unstructured":"G. De Palma, M. Marvian, C. Rouz\u00e9, and D. S. Fran\u00e7a. Limitations of variational quantum algorithms: A quantum optimal transport approach. PRX Quantum, 4(1), Jan. 2023."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.13.041057"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.532382"},{"key":"e_1_3_2_1_19_1","volume-title":"The quantum approximate optimization algorithm needs to see the whole graph: A typical case. arXiv preprint arXiv:2004.09002","author":"Farhi E.","year":"2020","unstructured":"E. Farhi, D. Gamarnik, and S. Gutmann. The quantum approximate optimization algorithm needs to see the whole graph: A typical case. arXiv preprint arXiv:2004.09002, 2020."},{"key":"e_1_3_2_1_20_1","volume-title":"The quantum approximate optimization algorithm needs to see the whole graph: Worst case examples","author":"Farhi E.","year":"2020","unstructured":"E. Farhi, D. Gamarnik, and S. Gutmann. The quantum approximate optimization algorithm needs to see the whole graph: Worst case examples, 2020."},{"key":"e_1_3_2_1_21_1","volume-title":"A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028","author":"Farhi E.","year":"2014","unstructured":"E. Farhi, J. Goldstone, and S. Gutmann. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028, 2014."},{"key":"e_1_3_2_1_22_1","volume-title":"Quantum computation by adiabatic evolution. arXiv preprint quant-ph\/0001106","author":"Farhi E.","year":"2000","unstructured":"E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. Quantum computation by adiabatic evolution. arXiv preprint quant-ph\/0001106, 2000."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-07-07-759"},{"key":"e_1_3_2_1_24_1","volume-title":"The adjoint is all you need: Characterizing barren plateaus in quantum ans\u00e4tze. arXiv preprint arXiv:2309.07902","author":"Fontana E.","year":"2023","unstructured":"E. Fontana, D. Herman, S. Chakrabarti, N. Kumar, R. Yalovetzky, J. Heredge, S. H. Sureshbabu, and M. Pistoia. The adjoint is all you need: Characterizing barren plateaus in quantum ans\u00e4tze. arXiv preprint arXiv:2309.07902, 2023."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316366"},{"key":"e_1_3_2_1_26_1","volume-title":"Practical optimization for hybrid quantum-classical algorithms. arXiv:1701.01450","author":"Guerreschi G. G.","year":"2017","unstructured":"G. G. Guerreschi and M. Smelyanskiy. Practical optimization for hybrid quantum-classical algorithms. arXiv:1701.01450, 2017."},{"key":"e_1_3_2_1_27_1","volume-title":"Quantum algorithms for scientific computing and approximate optimization","author":"Hadfield S.","year":"2018","unstructured":"S. Hadfield. Quantum algorithms for scientific computing and approximate optimization, 2018."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.3390\/a12020034"},{"key":"e_1_3_2_1_29_1","volume-title":"Fault-tolerant compiling of classically hard IQP circuits on hypercubes. arXiv preprint arXiv:2404.19005","author":"Hangleiter D.","year":"2024","unstructured":"D. Hangleiter, M. Kalinowski, D. Bluvstein, M. Cain, N. Maskara, X. Gao, A. Kubica, M. D. Lukin, and M. J. Gullans. Fault-tolerant compiling of classically hard IQP circuits on hypercubes. arXiv preprint arXiv:2404.19005, 2024."},{"key":"e_1_3_2_1_30_1","volume-title":"End-to-end protocol for high-quality QAOA parameters with few shots. arXiv preprint arXiv:2408.00557","author":"Hao T.","year":"2024","unstructured":"T. Hao, Z. He, R. Shaydulin, J. Larson, and M. Pistoia. End-to-end protocol for high-quality QAOA parameters with few shots. arXiv preprint arXiv:2408.00557, 2024."},{"key":"e_1_3_2_1_31_1","volume-title":"Variational quantum algorithm landscape reconstruction by low-rank tensor completion. arXiv preprint arXiv:2405.10941","author":"Hao T.","year":"2024","unstructured":"T. Hao, Z. He, R. Shaydulin, M. Pistoia, and S. Tannu. Variational quantum algorithm landscape reconstruction by low-rank tensor completion. arXiv preprint arXiv:2405.10941, 2024."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-020-01105-y"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3649329.3664193"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TQE.2024.3409309"},{"key":"e_1_3_2_1_35_1","volume-title":"Alignment between initial state and mixer improves QAOA performance for constrained optimization. npj Quantum Information, 9(1):121","author":"He Z.","year":"2023","unstructured":"Z. He, R. Shaydulin, S. Chakrabarti, D. Herman, C. Li, Y. Sun, and M. Pistoia. Alignment between initial state and mixer improves QAOA performance for constrained optimization. npj Quantum Information, 9(1):121, 2023."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-023-00603-1"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(00)00052-9"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.5.020101"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5616"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2017.07.001"},{"key":"e_1_3_2_1_41_1","volume-title":"Quantum alternating operator ansatz (QAOA) beyond low depth with gradually changing unitaries","author":"Kremenetski V.","year":"2023","unstructured":"V. Kremenetski, A. Apte, T. Hogg, S. Hadfield, and N. M. Tubman. Quantum alternating operator ansatz (QAOA) beyond low depth with gradually changing unitaries, 2023."},{"key":"e_1_3_2_1_42_1","volume-title":"Quantum alternating operator ansatz (QAOA) phase diagrams and applications for quantum chemistry. arXiv preprint arXiv:2108.13056","author":"Kremenetski V.","year":"2021","unstructured":"V. Kremenetski, T. Hogg, S. Hadfield, S. J. Cotton, and N. M. Tubman. Quantum alternating operator ansatz (QAOA) phase diagrams and applications for quantum chemistry. arXiv preprint arXiv:2108.13056, 2021."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-09-29-824"},{"key":"e_1_3_2_1_44_1","volume-title":"Benchmarking logical three-qubit quantum fourier transform encoded in the steane code on a trappedion quantum computer. arXiv preprint arXiv:2404.08616","author":"Mayer K.","year":"2024","unstructured":"K. Mayer, C. Ryan-Anderson, N. Brown, E. Durso-Sabina, C. H. Baldwin, D. Hayes, J. M. Dreiling, C. Foltz, J. P. Gaebler, T. M. Gatterman, et al. Benchmarking logical three-qubit quantum fourier transform encoded in the steane code on a trappedion quantum computer. arXiv preprint arXiv:2404.08616, 2024."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-07090-4"},{"key":"e_1_3_2_1_46_1","volume-title":"Towards a universal QAOA protocol: Evidence of quantum advantage in solving combinatorial optimization problems. arXiv preprint arXiv:2405.09169","author":"Montanez-Barrera J.","year":"2024","unstructured":"J. Montanez-Barrera and K. Michielsen. Towards a universal QAOA protocol: Evidence of quantum advantage in solving combinatorial optimization problems. arXiv preprint arXiv:2405.09169, 2024."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.13.041052"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.99.013304"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-20853-w"},{"key":"e_1_3_2_1_50_1","volume-title":"Mar.","author":"Pelofske E.","year":"2024","unstructured":"E. Pelofske, A. B\u00e4rtschi, and S. Eidenbenz. Short-depth QAOA circuits and quantum annealing on higher-order ising models. npj Quantum Information, 10(1), Mar. 2024."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE57702.2023.00064"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213"},{"key":"e_1_3_2_1_53_1","volume-title":"The QAOA with slow measurements. arXiv:2205.06845","author":"Polloreno A. M.","year":"2022","unstructured":"A. M. Polloreno and G. Smith. The QAOA with slow measurements. arXiv:2205.06845, 2022."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"e_1_3_2_1_55_1","volume-title":"Technical Report NA2009\/06, Department of Applied Mathematics and Theoretical Physics","author":"Powell M. J. D.","year":"2009","unstructured":"M. J. D. Powell. The BOBYQA algorithm for bound constrained optimization without derivatives. Technical Report NA2009\/06, Department of Applied Mathematics and Theoretical Physics, Cambridge University, Cambridge, UK, 2009."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-024-02536-7"},{"key":"e_1_3_2_1_57_1","volume-title":"Optimal ancilla-free Clifford+T approximation of z-rotations. Quantum Info. Comput., 16(11--12):901--953, sep","author":"Ross N. J.","year":"2016","unstructured":"N. J. Ross and P. Selinger. Optimal ancilla-free Clifford+T approximation of z-rotations. Quantum Info. Comput., 16(11--12):901--953, sep 2016."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-07-01-491"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.1.020312"},{"key":"e_1_3_2_1_60_1","volume-title":"Oct.","author":"Shaydulin R.","year":"2021","unstructured":"R. Shaydulin, S. Hadfield, T. Hogg, and I. Safro. Classical symmetries and the quantum approximate optimization algorithm. Quantum Information Processing, 20(11), Oct. 2021."},{"key":"e_1_3_2_1_61_1","volume-title":"Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem. Science Advances, 10(22):eadm6761","author":"Shaydulin R.","year":"2024","unstructured":"R. Shaydulin, C. Li, S. Chakrabarti, M. DeCross, D. Herman, N. Kumar, J. Larson, D. Lykov, P. Minssen, Y. Sun, et al. Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem. Science Advances, 10(22):eadm6761, 2024."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3584706"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCS54837.2021.00011"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE57702.2023.00121"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916288"},{"key":"e_1_3_2_1_66_1","volume-title":"Connecting the Hamiltonian structure to the QAOA energy and Fourier landscape structure. arXiv preprint arXiv:2305.13594","author":"St\u0119ch\u0142y M.","year":"2023","unstructured":"M. St\u0119ch\u0142y, L. Gao, B. Yogendran, E. Fontana, and M. Rudolph. Connecting the Hamiltonian structure to the QAOA energy and Fourier landscape structure. arXiv preprint arXiv:2305.13594, 2023."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-021-01356-3"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2024-01-18-1231"},{"key":"e_1_3_2_1_69_1","unstructured":"M. Szegedy. What do QAOA energies reveal about graphs? arXiv:1912.12277 2019."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.022304"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.033446"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-01-27-635"},{"key":"e_1_3_2_1_73_1","volume-title":"Proceedings of The First Mathematical and Scientific Machine Learning Conference","volume":"107","author":"Yao J.","year":"2020","unstructured":"J. Yao, M. Bukov, and L. Lin. Policy gradient based quantum approximate optimization algorithm. In J. Lu and R. Ward, editors, Proceedings of The First Mathematical and Scientific Machine Learning Conference, volume 107 of Proceedings of Machine Learning Research, pages 605--634. PMLR, 20--24 Jul 2020."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067"}],"event":{"name":"ICCAD '24: 43rd IEEE\/ACM International Conference on Computer-Aided Design","location":"Newark Liberty International Airport Marriott New York NY USA","acronym":"ICCAD '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE CEDA","IEEE EDS"]},"container-title":["Proceedings of the 43rd IEEE\/ACM International Conference on Computer-Aided Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3676536.3697128","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3676536.3697128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:45Z","timestamp":1750295925000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3676536.3697128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,27]]},"references-count":74,"alternative-id":["10.1145\/3676536.3697128","10.1145\/3676536"],"URL":"https:\/\/doi.org\/10.1145\/3676536.3697128","relation":{},"subject":[],"published":{"date-parts":[[2024,10,27]]},"assertion":[{"value":"2025-04-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}