{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,19]],"date-time":"2026-11-19T15:24:29Z","timestamp":1795101869992,"version":"4.10.3"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T00:00:00Z","timestamp":1682294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Defense Advanced Research Project Agency ONISQ program","award":["W911NF-20-2-0051"],"award-info":[{"award-number":["W911NF-20-2-0051"]}],"id":[{"id":"https:\/\/ror.org\/02caytj08","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Air Force Office of Scientific Research award","award":["AF-FA9550-19-1-0147"],"award-info":[{"award-number":["AF-FA9550-19-1-0147"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation award","doi-asserted-by":"crossref","award":["OMA-1937008"],"award-info":[{"award-number":["OMA-1937008"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"name":"U.S. Department of Energy (DOE), Office of Science, Office of Advanced Scientific Computing Research AIDE-QC and FAR-QC","id":[{"id":"https:\/\/ror.org\/0012c7r22","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Argonne LDRD program","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Quantum Comput."],"published-print":{"date-parts":[[2023,9,30]]},"abstract":"<jats:p>Finding high-quality parameters is a central obstacle to using the quantum approximate optimization algorithm (QAOA). Previous work partially addresses this issue for QAOA on unweighted MaxCut problems by leveraging similarities in the objective landscape among different problem instances. However, we show that the more general weighted MaxCut problem has significantly modified objective landscapes, with a proliferation of poor local optima. Our main contribution is a simple rescaling scheme that overcomes these deleterious effects of weights. We show that for a given QAOA depth, a single \u201ctypical\u201d vector of QAOA parameters can be successfully transferred to weighted MaxCut instances. This transfer leads to a median decrease in the approximation ratio of only 2.0 percentage points relative to a considerably more expensive direct optimization on a dataset of 34,701 instances with up to 20 nodes and multiple weight distributions. This decrease can be reduced to 1.2 percentage points at the cost of only 10 additional QAOA circuit evaluations with parameters sampled from a pretrained metadistribution, or the transferred parameters can be used as a starting point for a single local optimization run to obtain approximation ratios equivalent to those achieved by exhaustive optimization in 96.35% of our cases.<\/jats:p>","DOI":"10.1145\/3584706","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T07:00:02Z","timestamp":1676617202000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":98,"title":["Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8657-2848","authenticated-orcid":false,"given":"Ruslan","family":"Shaydulin","sequence":"first","affiliation":[{"name":"Argonne National Laboratory and JPMorgan Chase, New York, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7594-2735","authenticated-orcid":false,"given":"Phillip C.","family":"Lotshaw","sequence":"additional","affiliation":[{"name":"Oak Ridge National Laboratory, Oak Ridge, TN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9924-2082","authenticated-orcid":false,"given":"Jeffrey","family":"Larson","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory, Lemont, IL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5636-555X","authenticated-orcid":false,"given":"James","family":"Ostrowski","sequence":"additional","affiliation":[{"name":"University of Tennessee at Knoxville, Knoxville, TN"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9449-0498","authenticated-orcid":false,"given":"Travis S.","family":"Humble","sequence":"additional","affiliation":[{"name":"Oak Ridge National Laboratory, Oak Ridge, TN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,4,24]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1666-5"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-020-01105-y"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1103\/prxquantum.2.017001"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0020-0255(00)00052-9"},{"key":"e_1_3_2_6_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:1411.4028 (2014).","journal-title":"arXiv:1411.4028"},{"key":"e_1_3_2_7_2","article-title":"Counterdiabaticity and the quantum approximate optimization algorithm","author":"Wurtz Jonathan","year":"2021","unstructured":"Jonathan Wurtz and Peter Love. 2021. Counterdiabaticity and the quantum approximate optimization algorithm. arXiv:2106.15645 (2021).","journal-title":"arXiv:2106.15645"},{"key":"e_1_3_2_8_2","article-title":"Predicting parameters for the quantum approximate optimization algorithm for Max-Cut from the infinite-size limit","author":"Boulebnane Sami","year":"2021","unstructured":"Sami Boulebnane and Ashley Montanaro. 2021. Predicting parameters for the quantum approximate optimization algorithm for Max-Cut from the infinite-size limit. arXiv:2110.10685 (2021).","journal-title":"arXiv:2110.10685"},{"key":"e_1_3_2_9_2","article-title":"The quantum approximate optimization algorithm and the Sherrington\u2013Kirkpatrick model at infinite size","author":"Farhi E.","year":"2020","unstructured":"E. Farhi, J. Goldstone, S. Gutmann, and L. Zhou. 2020. The quantum approximate optimization algorithm and the Sherrington\u2013Kirkpatrick model at infinite size. arXiv:1910.08187 (2020).","journal-title":"arXiv:1910.08187"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.042612"},{"key":"e_1_3_2_11_2","article-title":"Tensor network quantum simulator with step-dependent parallelization","author":"Lykov Danylo","year":"2020","unstructured":"Danylo Lykov, Roman Schutski, Alexey Galda, Valerii Vinokur, and Yuri Alexeev. 2020. Tensor network quantum simulator with step-dependent parallelization. arXiv:2012.02430 (2020).","journal-title":"arXiv:2012.02430"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-021-00440-z"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-021-03298-4"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/IGSC48788.2019.8957201"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067"},{"key":"e_1_3_2_16_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:1811.08419 (2018).","journal-title":"arXiv:1811.08419"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/hpec.2019.8916288"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/tqe.2021.3066275"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-021-03342-3"},{"key":"e_1_3_2_20_2","article-title":"Transferability of optimal QAOA parameters between random graphs","author":"Galda Alexey","year":"2021","unstructured":"Alexey Galda, Xiaoyuan Liu, Danylo Lykov, Yuri Alexeev, and Ilya Safro. 2021. Transferability of optimal QAOA parameters between random graphs. arXiv:2106.07531 (2021).","journal-title":"arXiv:2106.07531"},{"key":"e_1_3_2_21_2","article-title":"The fixed angle conjecture for QAOA on regular MaxCut graphs","author":"Wurtz Jonathan","year":"2021","unstructured":"Jonathan Wurtz and Danylo Lykov. 2021. The fixed angle conjecture for QAOA on regular MaxCut graphs. arXiv:2107.00677 (2021).","journal-title":"arXiv:2107.00677"},{"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":"Brand\u00e3o Fernando G. S. L.","year":"2018","unstructured":"Fernando G. S. L. Brand\u00e3o, 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:1812.04170 (2018).","journal-title":"arXiv:1812.04170"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/QCS54837.2021.00011"},{"key":"e_1_3_2_26_2","unstructured":"GitHub. 2022. QAOAKit. Retrieved February 25 2023 from https:\/\/github.com\/QAOAKit\/QAOAKit\/blob\/7bdede1b4ca2a3e1aedfdbdb2282ee89ce0fc5f2\/examples\/weighted_transfer.ipynb. (2022)."},{"key":"e_1_3_2_27_2","volume-title":"Quantum Algorithms for Scientific Computing and Approximate Optimization","author":"Hadfield Stuart","year":"2018","unstructured":"Stuart Hadfield. 2018. Quantum Algorithms for Scientific Computing and Approximate Optimization. Ph.D. Dissertation. Columbia University."},{"key":"e_1_3_2_28_2","article-title":"Expectation values from the single-layer quantum approximate optimization algorithm on Ising problems","author":"Ozaeta Asier","year":"2021","unstructured":"Asier Ozaeta, Wim van Dam, and Peter L. McMahon. 2021. Expectation values from the single-layer quantum approximate optimization algorithm on Ising problems. arXiv:2012.03421v2 (2021).","journal-title":"arXiv:2012.03421v2"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.97.022304"},{"key":"e_1_3_2_30_2","article-title":"The quantum approximate optimization algorithm at high depth for MaxCut on large-girth regular graphs and the Sherrington\u2013Kirkpatrick model","author":"Basso Joao","year":"2021","unstructured":"Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, and Leo Zhou. 2021. The quantum approximate optimization algorithm at high depth for MaxCut on large-girth regular graphs and the Sherrington\u2013Kirkpatrick model. arXiv:2110.14206 (2021).","journal-title":"arXiv:2110.14206"},{"key":"e_1_3_2_31_2","unstructured":"GitHub. 2022. QAOAKit\/data. Retrieved February 25 2023 from https:\/\/github.com\/QAOAKit\/data\/blob\/bdd9220 486b456ce93727d75ede9308a4fc8a9c8\/transfer_qaoa_weighted\/all_transfer.zip. (2022)."},{"key":"e_1_3_2_32_2","unstructured":"GitHub. 2022. QAOAKit\/data. Retrieved February 25 2023 from https:\/\/github.com\/QAOAKit\/data\/blob\/bdd922048 6b456ce93727d75ede9308a4fc8a9c8\/transfer_qaoa_weighted\/bfgs.zip. (2022)."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5616"},{"key":"e_1_3_2_34_2","unstructured":"GitHub. 2022. QAOAKit\/examples. Retrieved February 25 2023 from https:\/\/github.com\/QAOAKit\/QAOAKit\/blob\/7bdede1b4ca2a3e1aedfdbdb2282ee89ce0fc5f2\/examples\/_reproduce_all_figures_from_Parameter_Transfer_for_Quantum_Approximate_Optimization_of_Weighted_MaxCut.ipynb. (2022)."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.5555\/563041"},{"key":"e_1_3_2_36_2","unstructured":"Steven G. Johnson. 2022. The NLopt Nonlinear-Optimization Package. Retrieved February 25 2023 from http:\/\/github.com\/stevengj\/nlopt."},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1980-0572855-7"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584706","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T13:51:37Z","timestamp":1750168297000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,24]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9,30]]}},"alternative-id":["10.1145\/3584706"],"URL":"https:\/\/doi.org\/10.1145\/3584706","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,24]]},"assertion":[{"value":"2022-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-09","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-04-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}