{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T03:49:43Z","timestamp":1777002583385,"version":"3.51.4"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100012352","name":"Universit\u00e0 degli Studi di Milano","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100012352","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The measurement-based quantum computing paradigm relies on entangling the qubits of a register into a graph state and on measuring subsets of such register in order to condition the unmeasured qubits. The computation therefore, instead of being carried on only by one-qubit and two-qubits logic gates, is largely based on entanglement and measurement processes. Compared to the gate model architecture, in MBQC the overhead in terms of computation resources to synthesize logical qubits is higher. While gate model relies on a register of logical qubits whose number is set at the beginning of the computation and remains constant during the computation, in the MBQC the input qubits outnumber the output ones, due to the destructive nature of measurement processes. Still, we analytically prove and experimentally confirm that MBQC can be efficiently emulated on a classical software, reaching equal loads with respect to the gate-based approach in terms of average runtime and storage of memory. The numerical results confirm that despite the potential computational overhead due to the high entanglement of the initial graph state, the MBQC paradigm carries similar computational complexity, both in terms of time and memory, with respect to the gate-based approach.<\/jats:p>","DOI":"10.1007\/s11128-025-05011-1","type":"journal-article","created":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T05:58:18Z","timestamp":1765432698000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Benchmarking the emulation of measurement-based quantum computing through the Max K-Cut algorithm"],"prefix":"10.1007","volume":"24","author":[{"given":"Sebastiano","family":"Corli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Dragoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Proietti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Dispenza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Cavazzoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Prati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"key":"5011_CR1","doi-asserted-by":"publisher","unstructured":"Browne, D.E., Kashefi, E., Mhalla, M., Perdrix, S.: Generalized flow and determinism in measurement-based quantum computation. New Journal of Physics 9(8), 250 (2007). https:\/\/doi.org\/10.1088\/1367-2630\/9\/8\/250\/pdf","DOI":"10.1088\/1367-2630\/9\/8\/250\/pdf"},{"key":"5011_CR2","doi-asserted-by":"crossref","unstructured":"Browne, D., Briegel, H.: One-way Quantum Computation. Quantum Information: From Foundations to Quantum Technology Applications, 449\u2013473 (2016) https:\/\/arxiv.org\/pdf\/quant-ph\/0603226.pdf","DOI":"10.1002\/9783527805785.ch21"},{"key":"5011_CR3","unstructured":"Danos, V., Kashefi, E., Panangaden, P.: The measurement calculus. Journal of the ACM (JACM) 54(2), 8 (2007) https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1219092.1219096?casa_token=q9tOFI8E0DcAAAAA:4yZrucaJImwu76wcg7TTuJ_6o_M5Chlva5exjUQAZgKfrrhRCnn4i3lordL-QPeobI9U-Rdrl9M"},{"key":"5011_CR4","doi-asserted-by":"crossref","unstructured":"Corli, S., Prati, E.: An efficient algebraic representation for graph states for measurement-based quantum computing. In: 2022 IEEE International Conference on Rebooting Computing (ICRC), pp. 1\u20136 (2022). IEEE","DOI":"10.1109\/ICRC57508.2022.00015"},{"key":"5011_CR5","doi-asserted-by":"crossref","unstructured":"Corli, S., Prati, E.: Measurement-based quantum compiling via gauge invariance. arXiv preprint arXiv:2411.12485 (2024)","DOI":"10.1088\/1742-6596\/3017\/1\/012043"},{"issue":"22","key":"5011_CR6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.126.220501","volume":"126","author":"RR Ferguson","year":"2021","unstructured":"Ferguson, R.R., Dellantonio, L., Balushi, A.A., Jansen, K., D\u00fcr, W., Muschik, C.A.: Measurement-based variational quantum eigensolver. Phys. Rev. Lett. 126(22), 220501 (2021). https:\/\/doi.org\/10.1103\/PhysRevLett.126.220501","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"5011_CR7","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ace2e6\/pdf","volume":"8","author":"FK Marqversen","year":"2023","unstructured":"Marqversen, F.K., Zinner, N.T.: Applications and resource reductions in measurement-based variational quantum eigensolvers. Quantum Sci. Technol. 8(4), 045001 (2023). https:\/\/doi.org\/10.1088\/2058-9565\/ace2e6\/pdf","journal-title":"Quantum Sci. Technol."},{"issue":"1","key":"5011_CR8","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ad802b\/pdf","volume":"10","author":"TN Kaldenbach","year":"2024","unstructured":"Kaldenbach, T.N., Heller, M.: Mapping quantum circuits to shallow-depth measurement patterns based on graph states. Quantum Sci. Technol. 10(1), 015010 (2024). https:\/\/doi.org\/10.1088\/2058-9565\/ad802b\/pdf","journal-title":"Quantum Sci. Technol."},{"key":"5011_CR9","doi-asserted-by":"crossref","unstructured":"Markham, D., Kashefi, E.: Entanglement, flow and classical simulatability in measurement based quantum computation. Horizons of the Mind. A Tribute to Prakash Panangaden: Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday, 427\u2013453 (2014)https:\/\/arxiv.org\/pdf\/1311.3610.pdf","DOI":"10.1007\/978-3-319-06880-0_22"},{"key":"5011_CR10","doi-asserted-by":"crossref","unstructured":"Zwerger, M., Briegel, H., D\u00fcr, W.: Hybrid architecture for encoded measurement-based quantum computation. Scientific reports 4(1), 1\u20135 (2014)https:\/\/www.nature.com\/articles\/srep05364","DOI":"10.1038\/srep05364"},{"issue":"5","key":"5011_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.74.052316","volume":"74","author":"C Kruszynska","year":"2006","unstructured":"Kruszynska, C., Miyake, A., Briegel, H.J., D\u00fcr, W.: Entanglement purification protocols for all graph states. Phys. Rev. A 74(5), 052316 (2006). https:\/\/doi.org\/10.1103\/PhysRevA.74.052316","journal-title":"Phys. Rev. A"},{"issue":"10","key":"5011_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.91.107903","volume":"91","author":"W D\u00fcr","year":"2003","unstructured":"D\u00fcr, W., Aschauer, H., Briegel, H.-J.: Multiparticle entanglement purification for graph states. Phys. Rev. Lett. 91(10), 107903 (2003). https:\/\/doi.org\/10.1103\/PhysRevLett.91.107903","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"5011_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.012319","volume":"71","author":"H Aschauer","year":"2005","unstructured":"Aschauer, H., D\u00fcr, W., Briegel, H.-J.: Multiparticle entanglement purification for two-colorable graph states. Phys. Rev. A 71(1), 012319 (2005). https:\/\/doi.org\/10.1103\/PhysRevA.71.012319","journal-title":"Phys. Rev. A"},{"issue":"3","key":"5011_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.74.032319","volume":"74","author":"S Glancy","year":"2006","unstructured":"Glancy, S., Knill, E., Vasconcelos, H.M.: Entanglement purification of any stabilizer state. Phys. Rev. A 74(3), 032319 (2006). https:\/\/doi.org\/10.1103\/PhysRevA.74.032319","journal-title":"Phys. Rev. A"},{"key":"5011_CR15","doi-asserted-by":"crossref","unstructured":"Bera, A., Wudarski, F.A., Sarbicki, G., Chru\u015bci\u0144ski, D.: Class of Bell-diagonal entanglement witnesses in $$C^4\\otimes C^4$$: Optimization and the spanning property. Physical Review A 105(5), 052401 (2022) https:\/\/journals.aps.org\/pra\/pdf\/10.1103\/PhysRevA.105.052401?casa_token=_qlzw2B0jiMAAAAA%3Au1kf72yBNtP00_LIOUEvZoAF_lsLcnUCVpmeEVyIK88Zi66aYezid0o4mf3aJrpy5tSDYLSXz-4VyA","DOI":"10.1103\/PhysRevA.105.052401"},{"issue":"1","key":"5011_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.3390\/quantum4010006","volume":"4","author":"G Agliardi","year":"2022","unstructured":"Agliardi, G., Prati, E.: Optimal tuning of quantum generative adversarial networks for multivariate distribution loading. Quantum Reports 4(1), 75\u2013105 (2022)","journal-title":"Quantum Reports"},{"key":"5011_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2023.128713","volume":"465","author":"R Molteni","year":"2023","unstructured":"Molteni, R., Destri, C., Prati, E.: Optimization of the memory reset rate of a quantum echo-state network for time sequential tasks. Phys. Lett. A 465, 128713 (2023)","journal-title":"Phys. Lett. A"},{"key":"5011_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2022.128056","volume":"434","author":"M Lazzarin","year":"2022","unstructured":"Lazzarin, M., Galli, D.E., Prati, E.: Multi-class quantum classifiers with tensor network circuits for quantum phase recognition. Phys. Lett. A 434, 128056 (2022)","journal-title":"Phys. Lett. A"},{"key":"5011_CR19","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014)https:\/\/arxiv.org\/pdf\/1411.4028.pdf"},{"key":"5011_CR20","doi-asserted-by":"crossref","unstructured":"Choi, J., Kim, J.: A tutorial on quantum approximate optimization algorithm (QAOA): Fundamentals and applications. In: 2019 International Conference on Information and Communication Technology Convergence (ICTC), pp. 138\u2013142 (2019). IEEE https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?tp=&arnumber=8939749","DOI":"10.1109\/ICTC46691.2019.8939749"},{"issue":"2","key":"5011_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.021067","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou, L., Wang, S.-T., Choi, S., Pichler, H., Lukin, M.D.: Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. Phys. Rev. X 10(2), 021067 (2020). https:\/\/doi.org\/10.1103\/PhysRevX.10.021067","journal-title":"Phys. Rev. X"},{"key":"5011_CR22","doi-asserted-by":"crossref","unstructured":"Zentilini, P., Corli, S., Prati, E.: https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=10821210Emulating QAOA via graph neural networks. In: 2024 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 2, pp. 472\u2013473 (2024). IEEE","DOI":"10.1109\/QCE60285.2024.10361"},{"key":"5011_CR23","doi-asserted-by":"crossref","unstructured":"Corli, S., Moro, L., Dragoni, D., Dispenza, M., Prati, E.: Quantum machine learning algorithms for anomaly detection: A review. Future Generation Computer Systems, 107632 (2024)https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167739X2400596X","DOI":"10.1016\/j.future.2024.107632"},{"key":"5011_CR24","doi-asserted-by":"crossref","unstructured":"Marwaha, K.: Local classical MAX-CUT algorithm outperforms $$ p= 2$$ QAOA on high-girth regular graphs. Quantum 5, 437 (2021)https:\/\/quantum-journal.org\/papers\/q-2021-04-20-437\/pdf\/","DOI":"10.22331\/q-2021-04-20-437"},{"issue":"3","key":"5011_CR25","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s11128-024-04286-0","volume":"23","author":"E Bae","year":"2024","unstructured":"Bae, E., Lee, S.: Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs. Quantum Inf. Process. 23(3), 78 (2024). https:\/\/doi.org\/10.1007\/s11128-024-04286-0","journal-title":"Quantum Inf. Process."},{"key":"5011_CR26","doi-asserted-by":"crossref","unstructured":"Wang, J., Lai, J.-S., Zhang, M., Yao, F., Li, F.: Analysis of influence factors in Quantum Approximate Optimization Algorithm for Solving Max-cut Problem. In: 2023 21st International Conference on Optical Communications and Networks (ICOCN), pp. 1\u20133 (2023). IEEE https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=10236124","DOI":"10.1109\/ICOCN59242.2023.10236124"},{"issue":"4","key":"5011_CR27","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/acf59c\/pdf","volume":"8","author":"M Bechtold","year":"2023","unstructured":"Bechtold, M., Barzen, J., Leymann, F., Mandl, A., Obst, J., Truger, F., Weder, B.: Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices. Quantum Science and Technology 8(4), 045022 (2023). https:\/\/doi.org\/10.1088\/2058-9565\/acf59c\/pdf","journal-title":"Quantum Science and Technology"},{"key":"5011_CR28","doi-asserted-by":"crossref","unstructured":"Verghese, A., Byron, D., Amann, A., Popovici, E.: Max-cut problem implementation and analysis on a quantum computer. In: 2022 33rd Irish Signals and Systems Conference (ISSC), pp. 1\u20136 (2022). IEEE https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=9826192","DOI":"10.1109\/ISSC55427.2022.9826192"},{"key":"5011_CR29","doi-asserted-by":"crossref","unstructured":"Saleem, Z.H.: Max-independent set and the quantum alternating operator ansatz. International Journal of Quantum Information 18(04), 2050011 (2020) https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219749920500112?casa_token=mayA5IXC3ZYAAAAA:WnzjhhQYzDcFZhJZ5UNQENu1Loq6rSdbqpj7tqfIGZQvbL7D6JqJhEI6bVL_cUNfKXs706ejICNpMw","DOI":"10.1142\/S0219749920500112"},{"issue":"4","key":"5011_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.105.042415","volume":"105","author":"Y Chai","year":"2022","unstructured":"Chai, Y., Han, Y.-J., Wu, Y.-C., Li, Y., Dou, M., Guo, G.-P.: Shortcuts to the quantum approximate optimization algorithm. Phys. Rev. A 105(4), 042415 (2022). https:\/\/doi.org\/10.1103\/PhysRevA.105.042415","journal-title":"Phys. Rev. A"},{"issue":"2","key":"5011_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.106.022437","volume":"106","author":"M Proietti","year":"2022","unstructured":"Proietti, M., Cerocchi, F., Dispenza, M.: Native measurement-based quantum approximate optimization algorithm applied to the Max K-Cut problem. Phys. Rev. A 106(2), 022437 (2022). https:\/\/doi.org\/10.1103\/PhysRevA.106.022437","journal-title":"Phys. Rev. A"},{"key":"5011_CR32","doi-asserted-by":"crossref","unstructured":"Mahmud, N., El-Araby, E.: A scalable high-precision and high-throughput architecture for emulation of quantum algorithms. In: 2018 31st IEEE International System-on-Chip Conference (SOCC), pp. 206\u2013212 (2018). IEEEhttps:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=8618545","DOI":"10.1109\/SOCC.2018.8618545"},{"issue":"3","key":"5011_CR33","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8505\/pdf","volume":"5","author":"GG Guerreschi","year":"2020","unstructured":"Guerreschi, G.G., Hogaboam, J., Baruffa, F., Sawaya, N.P.: Intel Quantum Simulator: A cloud-ready high-performance simulator of quantum circuits. Quantum Science and Technology 5(3), 034007 (2020). https:\/\/doi.org\/10.1088\/2058-9565\/ab8505\/pdf","journal-title":"Quantum Science and Technology"},{"key":"5011_CR34","doi-asserted-by":"publisher","unstructured":"H\u00e4ner, T., Steiger, D.S.: 5 petabyte simulation of a 45-qubit quantum circuit. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201310 (2017)https:\/\/doi.org\/10.1145\/3126908.3126947","DOI":"10.1145\/3126908.3126947"},{"key":"5011_CR35","doi-asserted-by":"crossref","unstructured":"Corli, S., Dragoni, D., Proietti, M., Dispenza, M., Cavazzoni, C., Prati, E.: A max k-cut implementation for qaoa in the measurement based quantum computing formalism. In: 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 2, pp. 284\u2013285 (2023). IEEE","DOI":"10.1109\/QCE57702.2023.10244"},{"key":"5011_CR36","doi-asserted-by":"crossref","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G., Ribeiro, C.C.: Randomized heuristics for the MAX-CUT problem. Optimization methods and software 17(6), 1033\u20131058 (2002)https:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.19.9810&rep=rep1 &type=pdf","DOI":"10.1080\/1055678021000090033"},{"issue":"2","key":"5011_CR37","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/s1052623400382467","volume":"12","author":"S Burer","year":"2002","unstructured":"Burer, S., Monteiro, R.D., Zhang, Y.: Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM J. Optim. 12(2), 503\u2013521 (2002). https:\/\/doi.org\/10.1137\/s1052623400382467","journal-title":"SIAM J. Optim."},{"key":"5011_CR38","doi-asserted-by":"crossref","unstructured":"Ding, C.H., He, X., Zha, H., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings 2001 IEEE International Conference on Data Mining, pp. 107\u2013114 (2001). IEEEhttps:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=989507","DOI":"10.1109\/ICDM.2001.989507"},{"key":"5011_CR39","unstructured":"Beaulieu, D., Pham, A.: Max-cut clustering utilizing warm-start qaoa and ibm runtime. arXiv preprint arXiv:2108.13464 (2021)https:\/\/arxiv.org\/pdf\/2108.13464.pdf"},{"issue":"2","key":"5011_CR40","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s42979-020-00437-z","volume":"2","author":"FG Fuchs","year":"2021","unstructured":"Fuchs, F.G., Kolden, H.\u00d8., Aase, N.H., Sartor, G.: Efficient encoding of the weighted max k-cut on a quantum computer using qaoa. SN Computer Science 2(2), 89 (2021). https:\/\/doi.org\/10.1007\/s42979-020-00437-z","journal-title":"SN Computer Science"},{"key":"5011_CR41","doi-asserted-by":"crossref","unstructured":"Jain, N., Coyle, B., Kashefi, E., Kumar, N.: Graph neural network initialisation of quantum approximate optimisation. Quantum 6, 861 (2022)https:\/\/quantum-journal.org\/papers\/q-2022-11-17-861\/pdf\/","DOI":"10.22331\/q-2022-11-17-861"},{"key":"5011_CR42","doi-asserted-by":"crossref","unstructured":"Galda, A., Liu, X., Lykov, D., Alexeev, Y., Safro, I.: Transferability of optimal QAOA parameters between random graphs. In: 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 171\u2013180 (2021). IEEEhttps:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=9605328","DOI":"10.1109\/QCE52317.2021.00034"},{"issue":"2","key":"5011_CR43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.97.022304","volume":"97","author":"Z Wang","year":"2018","unstructured":"Wang, Z., Hadfield, S., Jiang, Z., Rieffel, E.G.: Quantum approximate optimization algorithm for MaxCut: A fermionic view. Phys. Rev. A 97(2), 022304 (2018). https:\/\/doi.org\/10.1103\/PhysRevA.97.022304","journal-title":"Phys. Rev. A"},{"key":"5011_CR44","doi-asserted-by":"crossref","unstructured":"Sack, S.H., Serbyn, M.: Quantum annealing initialization of the quantum approximate optimization algorithm. quantum 5, 491 (2021)https:\/\/quantum-journal.org\/papers\/q-2021-07-01-491\/pdf\/","DOI":"10.22331\/q-2021-07-01-491"},{"issue":"5","key":"5011_CR45","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.104.052419","volume":"104","author":"J Wurtz","year":"2021","unstructured":"Wurtz, J., Lykov, D.: Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs. Phys. Rev. A 104(5), 052419 (2021). https:\/\/doi.org\/10.1103\/PhysRevA.104.052419","journal-title":"Phys. Rev. A"},{"key":"5011_CR46","doi-asserted-by":"crossref","unstructured":"Campbell, C., Dahl, E.: QAOA of the Highest Order. In: 2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C), pp. 141\u2013146 (2022). IEEEhttps:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=9779809","DOI":"10.1109\/ICSA-C54293.2022.00035"},{"issue":"3","key":"5011_CR47","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.033029","volume":"4","author":"L Zhu","year":"2022","unstructured":"Zhu, L., Tang, H.L., Barron, G.S., Calderon-Vargas, F., Mayhall, N.J., Barnes, E., Economou, S.E.: Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer. Physical Review Research 4(3), 033029 (2022). https:\/\/doi.org\/10.1103\/PhysRevResearch.4.033029","journal-title":"Physical Review Research"},{"issue":"2","key":"5011_CR48","doi-asserted-by":"publisher","first-page":"2000133","DOI":"10.1002\/qute.202000133","volume":"4","author":"L Rocutto","year":"2021","unstructured":"Rocutto, L., Destri, C., Prati, E.: Quantum semantic learning by reverse annealing of an adiabatic quantum computer. Advanced Quantum Technologies 4(2), 2000133 (2021)","journal-title":"Advanced Quantum Technologies"},{"issue":"04","key":"5011_CR49","doi-asserted-by":"publisher","first-page":"2141003","DOI":"10.1142\/S0219749921410033","volume":"19","author":"L Rocutto","year":"2021","unstructured":"Rocutto, L., Prati, E.: A complete restricted boltzmann machine on an adiabatic quantum computer. International Journal of Quantum Information 19(04), 2141003 (2021)","journal-title":"International Journal of Quantum Information"},{"key":"5011_CR50","doi-asserted-by":"crossref","unstructured":"Van\u00a0Dam, W., Mosca, M., Vazirani, U.: How powerful is adiabatic quantum computation? In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 279\u2013287 (2001). IEEEhttps:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=959902","DOI":"10.1109\/SFCS.2001.959902"},{"key":"5011_CR51","doi-asserted-by":"crossref","unstructured":"Wurtz, J., Love, P.J.: Counterdiabaticity and the quantum approximate optimization algorithm. Quantum 6, 635 (2022)https:\/\/quantum-journal.org\/papers\/q-2022-01-27-635\/pdf\/","DOI":"10.22331\/q-2022-01-27-635"},{"key":"5011_CR52","doi-asserted-by":"crossref","unstructured":"Weggemans, J.R., Urech, A., Rausch, A., Spreeuw, R., Boucherie, R., Schreck, F., Schoutens, K., Min\u00e1\u0159, J., Speelman, F.: Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach. Quantum 6, 687 (2022)https:\/\/quantum-journal.org\/papers\/q-2022-04-13-687\/pdf\/","DOI":"10.22331\/q-2022-04-13-687"},{"key":"5011_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-021-03342-3","volume":"20","author":"PC Lotshaw","year":"2021","unstructured":"Lotshaw, P.C., Humble, T.S., Herrman, R., Ostrowski, J., Siopsis, G.: Empirical performance bounds for quantum approximate optimization. Quantum Inf. Process. 20, 1\u201332 (2021). https:\/\/doi.org\/10.1007\/s11128-021-03342-3","journal-title":"Quantum Inf. Process."},{"key":"5011_CR54","doi-asserted-by":"crossref","unstructured":"Lee, X., Saito, Y., Cai, D., Asai, N.: Parameters fixing strategy for quantum approximate optimization algorithm. In: 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 10\u201316 (2021). IEEEhttps:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=9605323&casa_token=iWJftq_6VNQAAAAA:uGBGtKU68lmUTxg1or5rr1lXv_quqmxAoNhX7gfquLGVqXZmaX2_UFNezsQslzvES1IAvL3M","DOI":"10.1109\/QCE52317.2021.00016"},{"key":"5011_CR55","unstructured":"Pan, Y., Tong, Y., Yang, Y.: Automatic depth optimization for a quantum approximate optimization algorithm. Physical Review A 105(3), 032433 (2022)https:\/\/journals.aps.org\/pra\/pdf\/10.1103\/PhysRevA.105.032433?casa_token=bQ3bl-M6mOkAAAAA%3AzicmVpAZtoNpv4yul-JfQ2RqM3-Jph_NBAXbebuA8h95iMwnjGO1FkzDa0fa_WInc7FH21PaYpCmJg"},{"issue":"3","key":"5011_CR56","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.3.033221","volume":"3","author":"SL Wu","year":"2021","unstructured":"Wu, S.L., Sun, S., Guan, W., Zhou, C., Chan, J., Cheng, C.L., Pham, T., Qian, Y., Wang, A.Z., Zhang, R., et al.: Application of quantum machine learning using the quantum kernel algorithm on high energy physics analysis at the LHC. Physical Review Research 3(3), 033221 (2021). https:\/\/doi.org\/10.1103\/PhysRevResearch.3.033221","journal-title":"Physical Review Research"},{"issue":"2","key":"5011_CR57","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.68.022312","volume":"68","author":"R Raussendorf","year":"2003","unstructured":"Raussendorf, R., Browne, D.E., Briegel, H.J.: Measurement-based quantum computation on cluster states. Phys. Rev. A 68(2), 022312 (2003)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"5011_CR58","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1038\/s41534-017-0023-5","volume":"3","author":"D Rotta","year":"2017","unstructured":"Rotta, D., Sebastiano, F., Charbon, E., Prati, E.: Quantum information density scaling and qubit operation time constraints of CMOS silicon-based quantum computer architectures. npj Quantum Inf. 3(1), 26 (2017). https:\/\/doi.org\/10.1038\/s41534-017-0023-5","journal-title":"npj Quantum Inf."},{"key":"5011_CR59","doi-asserted-by":"crossref","unstructured":"Corli, S., Prati, E.: Gauge freedom in measurement based quantum compiling. In: Journal of Physics: Conference Series, vol. 3017, p. 012043 (2025). IOP Publishing","DOI":"10.1088\/1742-6596\/3017\/1\/012043"},{"issue":"5","key":"5011_CR60","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.052328","volume":"70","author":"S Aaronson","year":"2004","unstructured":"Aaronson, S., Gottesman, D.: Improved simulation of stabilizer circuits. Phys. Rev. A 70(5), 052328 (2004). https:\/\/doi.org\/10.1103\/PhysRevA.70.052328","journal-title":"Phys. Rev. A"},{"issue":"2","key":"5011_CR61","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.73.022334","volume":"73","author":"S Anders","year":"2006","unstructured":"Anders, S., Briegel, H.J.: Fast simulation of stabilizer circuits using a graph-state representation. Phys. Rev. A 73(2), 022334 (2006). https:\/\/doi.org\/10.1103\/PhysRevA.73.022334","journal-title":"Phys. Rev. A"},{"key":"5011_CR62","doi-asserted-by":"crossref","unstructured":"Liang, Z., Song, Z., Cheng, J., He, Z., Liu, J., Wang, H., Qin, R., Wang, Y., Han, S., Qian, X., et al.: Hybrid gate-pulse model for variational quantum algorithms. In: 2023 60th ACM\/IEEE Design Automation Conference (DAC), pp. 1\u20136 (2023). IEEEhttps:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=10247923","DOI":"10.1109\/DAC56929.2023.10247923"},{"key":"5011_CR63","doi-asserted-by":"crossref","unstructured":"Alam, M., Ash-Saki, A., Ghosh, S.: Accelerating quantum approximate optimization algorithm using machine learning. In: 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 686\u2013689 (2020). IEEEhttps:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=9116348","DOI":"10.23919\/DATE48585.2020.9116348"},{"issue":"1","key":"5011_CR64","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8e92\/pdf","volume":"6","author":"S Sivarajah","year":"2020","unstructured":"Sivarajah, S., Dilkes, S., Cowtan, A., Simmons, W., Edgington, A., Duncan, R.: t-ket>: a retargetable compiler for NISQ devices. Quantum Science and Technology 6(1), 014003 (2020). https:\/\/doi.org\/10.1088\/2058-9565\/ab8e92\/pdf","journal-title":"Quantum Science and Technology"},{"key":"5011_CR65","doi-asserted-by":"crossref","unstructured":"Koretsky, S., Gokhale, P., Baker, J.M., Viszlai, J., Zheng, H., Gurung, N., Burg, R., Paaso, E.A., Khodaei, A., Eskandarpour, R., et al.: Adapting quantum approximation optimization algorithm (qaoa) for unit commitment. In: 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 181\u2013187 (2021). IEEEhttps:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=9605315","DOI":"10.1109\/QCE52317.2021.00035"},{"key":"5011_CR66","doi-asserted-by":"crossref","unstructured":"Ghimire, B., Mahmood, A., Elleithy, K.: Hybrid Quantum Approximate Optimization Using Enhanced Ant Colony Optimization to Solve Large-Scale Combinatorial Optimization Problems. In: 2021 8th International Conference on Soft Computing & Machine Intelligence (ISCMI), pp. 108\u2013113 (2021). IEEE https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?arnumber=9654824","DOI":"10.1109\/ISCMI53840.2021.9654824"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-05011-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-05011-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-05011-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T14:58:36Z","timestamp":1767020316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-05011-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,11]]},"references-count":66,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["5011"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-05011-1","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,11]]},"assertion":[{"value":"14 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"396"}}