{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T18:54:32Z","timestamp":1767207272326,"version":"3.48.0"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100010418","name":"nstitute for Information and Communications Technology Planning and Evaluation (IITP) grant funded by Korea Government [Ministry of Science and ICT (MSIT)]","doi-asserted-by":"publisher","award":["2020-0-00014"],"award-info":[{"award-number":["2020-0-00014"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Research Foundation of Korea (NRF) through the Quantum Computing Based on Quantum Advantage Challenge Research funded by Korean Government","award":["RS-2023-00257994"],"award-info":[{"award-number":["RS-2023-00257994"]}]},{"name":"NRF through the Creation of the Quantum Information Science Research and Development Ecosystem funded by Korean Government","award":["RS-2023-00256050"],"award-info":[{"award-number":["RS-2023-00256050"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3647901","type":"journal-article","created":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T18:46:53Z","timestamp":1766602013000},"page":"216916-216936","source":"Crossref","is-referenced-by-count":0,"title":["Strategies for Noise-Resilient Quantum Approximate Optimization Algorithms: A Review and Classification of Error Mitigation"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5907-8869","authenticated-orcid":false,"given":"Kimchhor","family":"Chiv","sequence":"first","affiliation":[{"name":"Department of AI Convergence, Pukyong National University, Nam-gu, Busan, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5670-7481","authenticated-orcid":false,"given":"Leanghok","family":"Hour","sequence":"additional","affiliation":[{"name":"Department of AI Convergence, Pukyong National University, Nam-gu, Busan, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7258-0521","authenticated-orcid":false,"given":"Sanghyeon","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of AI Convergence, Pukyong National University, Nam-gu, Busan, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5240-015X","authenticated-orcid":false,"given":"Tara","family":"Kit","sequence":"additional","affiliation":[{"name":"Department of AI Convergence, Pukyong National University, Nam-gu, Busan, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9962-1066","authenticated-orcid":false,"given":"Tae-Kyung","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Management Information Systems, Chungbuk National University, Seowon-gu, Cheongju-si, Chungcheongbuk-do, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7712-2514","authenticated-orcid":false,"given":"Youngsun","family":"Han","sequence":"additional","affiliation":[{"name":"Department of AI Convergence, Pukyong National University, Nam-gu, Busan, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-021-00348-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/18\/2\/023023"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.22331\/q-2023-11-22-1188"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"ref5","article-title":"A quantum approximate optimization algorithm","author":"Farhi","year":"2014","journal-title":"arXiv:1411.4028"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5616"},{"key":"ref7","article-title":"Variational quantum algorithms for combinatorial optimization","author":"Perez-Ramirez","year":"2024","journal-title":"arXiv:2407.06421"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3605098.3635897"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1140\/epjqt\/s40507-022-00131-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac3e54"},{"key":"ref11","article-title":"The quantum approximate optimization algorithm at high depth for MaxCut on large-girth regular graphs and the sherrington-kirkpatrick model","author":"Basso","year":"2021","journal-title":"arXiv:2110.14206"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-020-01105-y"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/nature23879"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/revmodphys.95.045005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.119.180509"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.105.042406"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.98.062339"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abi8009"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.105.012419"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1140\/epjqt\/s40507-025-00368-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/physrevx.8.031027"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1103\/physrevx.10.021067"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-06-17-479"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-10555-8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10988-2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.97.022304"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.111.012427"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1103\/physrevresearch.4.023249"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1103\/physrevresearch.5.023147"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.124.090504"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1063\/1.5089550"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-07090-4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/QCE49297.2020.00041"},{"issue":"4","key":"ref36","first-page":"482","article-title":"An overview of the simultaneous perturbation method for efficient optimization","volume":"19","author":"Spall","year":"1998","journal-title":"Johns Hopkins Apl. Tech. Dig."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-05-25-269"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1088\/0256-307X\/38\/3\/030302"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.122.180501"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378477"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.3390\/a12020034"},{"key":"ref42","article-title":"A variational eigenvalue solver on a quantum processor","author":"Peruzzo","year":"2013","journal-title":"arXiv:1304.3061"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/qce49297.2020.00045"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.102.012426"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.103.042605"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.109.062617"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/qcs56647.2022.00015"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-08-11-774"},{"key":"ref49","article-title":"Hardware-aware compilation for chip-to-chip coupler-connected modular quantum systems","author":"Du","year":"2025","journal-title":"arXiv:2505.09036"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2846658"},{"key":"ref51","article-title":"Depth optimized ansatz circuit in QAOA for max-cut","author":"Majumdar","year":"2021","journal-title":"arXiv:2110.04637"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.108.032408"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1103\/physrevresearch.4.033028"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415745"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.109.062436"},{"key":"ref56","article-title":"Reducing QAOA circuit depth by factoring out semi-symmetries","author":"N\u00fc\u00dflein","year":"2024","journal-title":"arXiv:2411.08824"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.2022eap1159"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1103\/physrevresearch.6.013223"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/qce60285.2024.10338"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-06-01-464"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1103\/prxquantum.2.040326"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/qce52317.2021.00046"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.105.022441"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-11-26-592"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1103\/physrevresearch.3.033098"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac969c"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1103\/physrevresearch.7.023240"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-023-00785-7"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06096-3"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3031607"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1088\/2632-2153\/ae16fc"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1140\/epjqt\/s40507-024-00256-8"},{"key":"ref73","article-title":"Sample-efficient quantum error mitigation via classical learning surrogates","author":"Liao","year":"2025","journal-title":"arXiv:2511.07092"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11314116.pdf?arnumber=11314116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T18:45:24Z","timestamp":1767206724000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11314116\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":73,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3647901","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}