{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T12:09:20Z","timestamp":1766491760914,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","funder":[{"name":"EPSRC","award":["EP\/X024539\/1"],"award-info":[{"award-number":["EP\/X024539\/1"]}]},{"name":"RoaRQ"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,17]]},"DOI":"10.1145\/3727967.3756820","type":"proceedings-article","created":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T11:53:17Z","timestamp":1766490797000},"page":"61-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["QAOA-PCA: Enhancing Efficiency in the Quantum Approximate Optimization Algorithm via Principal Component Analysis"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0917-1274","authenticated-orcid":false,"given":"Owain","family":"Parry","sequence":"first","affiliation":[{"name":"The University of Sheffield, Sheffield, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9137-7433","authenticated-orcid":false,"given":"Phil","family":"McMinn","sequence":"additional","affiliation":[{"name":"The University of Sheffield, Sheffield, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2025,12,23]]},"reference":[{"key":"e_1_3_3_2_2_2","unstructured":"2025. Replication Package https:\/\/doi.org\/10.5281\/zenodo.15269564."},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"H. Abdi and L.\u00a0J Williams. 2010. Principal Component Analysis. Wiley Interdisciplinary Reviews: Computational Statistics (2010).","DOI":"10.1002\/wics.101"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/FUZZ52849.2023.10309767"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"V. Akshay D. Rabinovich E. Campos and J. Biamonte. 2021. Parameter Concentrations in Quantum Approximate Optimization. Physical Review A (2021).","DOI":"10.1103\/PhysRevA.104.L010401"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"O. Amosy T. Danzig O. Lev E. Porat G. Chechik and A. Makmal. 2024. Iteration-Free Quantum Approximate Optimization Algorithm Using Neural Networks. Quantum Machine Intelligence (2024).","DOI":"10.1007\/s42484-024-00159-y"},{"key":"e_1_3_3_2_7_2","unstructured":"F.\u00a0G. S.\u00a0L. Brandao M. Broughton E. Farhi S. Gutmann and H. Neven. 2018. For Fixed Control Parameters the Quantum Approximate Optimization Algorithm\u2019s Objective Function Value Concentrates for Typical Instances. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1812.04170 (2018)."},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSA-C54293.2022.00035"},{"key":"e_1_3_3_2_9_2","unstructured":"E. Farhi J. Goldstone and S. Gutmann. 2014. A Quantum Approximate Optimization Algorithm. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1411.4028 (2014)."},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"crossref","unstructured":"A. Galda E. Gupta J. Falla X. Liu D. Lykov Y. Alexeev and I. Safro. 2023. Similarity-Based Parameter Transferability in the Quantum Approximate Optimization Algorithm. Frontiers in Quantum Science and Technology (2023).","DOI":"10.3389\/frqst.2023.1200975"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/QCE52317.2021.00034"},{"key":"e_1_3_3_2_12_2","unstructured":"T. Hao Z. He R. Shaydulin J. Larson and M. Pistoia. 2024. End-to-End Protocol for High-Quality QAOA Parameters With Few Shots. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2408.00557 (2024)."},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Z. He R. Shaydulin D. Herman C. Li R. Raymond S.\u00a0H. Sureshbabu and M. Pistoia. 2024. Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2408.09538 (2024).","DOI":"10.1145\/3676536.3697128"},{"key":"e_1_3_3_2_14_2","unstructured":"A. Javadi-Abhari M. Treinish K. Krsulich C.\u00a0J. Wood J. Lishman J. Gacon S. Martiel P.\u00a0D. Nation L.\u00a0S. Bishop A.\u00a0W. Cross Johnson\u00a0B. R. and Gambetta\u00a0J. M.2024. Quantum Computing With Qiskit. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2405.08810 (2024)."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"I. Lyngfelt and L. Garc\u00eda-\u00c1lvarez. 2025. Symmetry-Informed Transferability of Optimal Parameters in the Quantum Approximate Optimization Algorithm. Physical Review A (2025).","DOI":"10.1103\/PhysRevA.111.022418"},{"key":"e_1_3_3_2_16_2","unstructured":"B.\u00a0D. McKay. 1983. Applications of a Technique for Labelled Enumeration. Congressus Numerantium (1983)."},{"key":"e_1_3_3_2_17_2","unstructured":"J.\u00a0A. Montanez-Barrera D. Willsch and K. Michielsen. 2024. Transfer Learning of Optimal QAOA Parameters in Combinatorial Optimization. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2402.05549 (2024)."},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"crossref","unstructured":"C. Moussa H. Wang T. B\u00e4ck and V. Dunjko. 2022. Unsupervised Strategies for Identifying Optimal Parameters in Quantum Approximate Optimization Algorithm. EPJ Quantum Technology (2022).","DOI":"10.21203\/rs.3.rs-1407056\/v1"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.5555\/1972505"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"crossref","unstructured":"A. Pellow-Jarman I. Sinayskiy A. Pillay and F. Petruccione. 2021. A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver. Quantum Information Processing (2021).","DOI":"10.1007\/s11128-021-03140-x"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"crossref","unstructured":"J. Preskill. 2018. Quantum Computing in the NISQ Era and Beyond. Quantum (2018).","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"S.\u00a0H. Sack and M. Serbyn. 2021. Quantum Annealing Initialization of the Quantum Approximate Optimization Algorithm. Quantum (2021).","DOI":"10.22331\/q-2021-07-01-491"},{"key":"e_1_3_3_2_23_2","unstructured":"T. Schw\u00e4gerl Y. Chai T. Hartung K. Jansen and S. K\u00fchn. 2024. Benchmarking Variational Quantum Algorithms for Combinatorial Optimization in Practice. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2408.03073 (2024)."},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"crossref","unstructured":"R. Shaydulin P.\u00a0C. Lotshaw J. Larson J. Ostrowski and T.\u00a0S. Humble. 2023. Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut. Transactions on Quantum Computing (2023).","DOI":"10.1145\/3584706"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/SEC54971.2022.00062"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"crossref","unstructured":"S.\u00a0H. Sureshbabu D. Herman R. Shaydulin J. Basso S. Chakrabarti Y. Sun and M. Pistoia. 2024. Parameter Setting in Quantum Approximate Optimization of Weighted Problems. Quantum (2024).","DOI":"10.22331\/q-2024-01-18-1231"},{"key":"e_1_3_3_2_27_2","unstructured":"Rui-Sheng W. and Li-Min W.2010. Maximum Cut in Fuzzy Nature: Models and Algorithms. J. Comput. Appl. Math. (2010)."},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"H. Zeng F. Meng T. Luan X. Yu and Z. Zhang. 2024. Improved Quantum Approximate Optimization Algorithm for Low-Density Parity-Check Channel Decoding. Advanced Quantum Technologies (2024).","DOI":"10.1002\/qute.202300262"}],"event":{"name":"EASE Companion '25: Evaluation and Assessment in Software Engineering","acronym":"EASE Companion '25","location":"Istanbul Turkiye"},"container-title":["Proceedings of the 2025 29th International Conference on Evaluation and Assessment in Software Engineering Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3727967.3756820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T12:07:45Z","timestamp":1766491665000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3727967.3756820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":27,"alternative-id":["10.1145\/3727967.3756820","10.1145\/3727967"],"URL":"https:\/\/doi.org\/10.1145\/3727967.3756820","relation":{},"subject":[],"published":{"date-parts":[[2025,6,17]]},"assertion":[{"value":"2025-12-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}