{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,4]],"date-time":"2026-11-04T22:05:00Z","timestamp":1793829900415,"version":"4.6.1"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0020312"],"award-info":[{"award-number":["DE-SC0020312"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.<\/jats:p>","DOI":"10.1038\/s41598-022-20853-w","type":"journal-article","created":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T11:03:20Z","timestamp":1665659000000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":63,"title":["Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer"],"prefix":"10.1038","volume":"12","author":[{"given":"Pradeep","family":"Niroula","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruslan","family":"Shaydulin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Romina","family":"Yalovetzky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Minssen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dylan","family":"Herman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaohan","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Pistoia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,13]]},"reference":[{"key":"20853_CR1","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505\u2013510. https:\/\/doi.org\/10.1038\/s41586-019-1666-5 (2019).","journal-title":"Nature"},{"key":"20853_CR2","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.127.180501","author":"Y Wu","year":"2021","unstructured":"Wu, Y. et al. Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett.https:\/\/doi.org\/10.1103\/physrevlett.127.180501 (2021).","journal-title":"Phys. Rev. Lett."},{"key":"20853_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1038\/s41586-022-04725-x","volume":"606","author":"LS Madsen","year":"2022","unstructured":"Madsen, L. S. et al. Quantum computational advantage with a programmable photonic processor. Nature 606, 75\u201381. https:\/\/doi.org\/10.1038\/s41586-022-04725-x (2022).","journal-title":"Nature"},{"key":"20853_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10288-007-0047-3","volume":"5","author":"A Sbihi","year":"2007","unstructured":"Sbihi, A. & Eglese, R. W. Combinatorial optimization and green logistics. 4OR 5, 99\u2013116. https:\/\/doi.org\/10.1007\/s10288-007-0047-3 (2007).","journal-title":"4OR"},{"key":"20853_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.omega.2015.01.006","volume":"54","author":"M Eskandarpour","year":"2015","unstructured":"Eskandarpour, M., Dejax, P., Miemczyk, J. & P\u00e9ton, O. Sustainable supply chain network design: An optimization-oriented review. Omega 54, 11\u201332. https:\/\/doi.org\/10.1016\/j.omega.2015.01.006 (2015).","journal-title":"Omega"},{"key":"20853_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1021\/cc700187t","volume":"10","author":"JP Kennedy","year":"2008","unstructured":"Kennedy, J. P. et al. Application of combinatorial chemistry science on modern drug discovery. J. Comb. Chem. 10, 345\u2013354. https:\/\/doi.org\/10.1021\/cc700187t (2008).","journal-title":"J. Comb. Chem."},{"key":"20853_CR7","doi-asserted-by":"publisher","DOI":"10.1145\/3054133","author":"A Soler-Dominguez","year":"2017","unstructured":"Soler-Dominguez, A., Juan, A. A. & Kizys, R. A survey on financial applications of metaheuristics. ACM Comput. Surv.https:\/\/doi.org\/10.1145\/3054133 (2017).","journal-title":"ACM Comput. Surv."},{"key":"20853_CR8","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, 022304. https:\/\/doi.org\/10.1103\/PhysRevA.97.022304 (2018).","journal-title":"Phys. Rev. A"},{"key":"20853_CR9","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, 021067. https:\/\/doi.org\/10.1103\/PhysRevX.10.021067 (2020).","journal-title":"Phys. Rev. X"},{"key":"20853_CR10","doi-asserted-by":"publisher","unstructured":"Crooks, G.\u00a0E. Performance of the quantum approximate optimization algorithm on the maximum cut problem. https:\/\/doi.org\/10.48550\/ARXIV.1811.08419 (2018).","DOI":"10.48550\/ARXIV.1811.08419"},{"key":"20853_CR11","doi-asserted-by":"publisher","unstructured":"Shaydulin, R., Marwaha, K., Wurtz, J. & Lotshaw, P.\u00a0C. QAOAKit: A toolkit for reproducible study, application, and verification of the QAOA. In 2021 IEEE\/ACM Second International Workshop on Quantum Computing Software (QCS). https:\/\/doi.org\/10.1109\/qcs54837.2021.00011 (IEEE, 2021).","DOI":"10.1109\/qcs54837.2021.00011"},{"key":"20853_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.103.042612","volume":"103","author":"J Wurtz","year":"2021","unstructured":"Wurtz, J. & Love, P. MaxCut quantum approximate optimization algorithm performance guarantees for $$p > 1$$. Phys. Rev. A 103, 042612. https:\/\/doi.org\/10.1103\/PhysRevA.103.042612 (2021).","journal-title":"Phys. Rev. A"},{"key":"20853_CR13","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1038\/s41567-020-01105-y","volume":"17","author":"MP Harrigan","year":"2021","unstructured":"Harrigan, M. P. et al. Quantum approximate optimization of non-planar graph problems on a planar superconducting processor. Nat. Phys 17, 332\u2013336 (2021).","journal-title":"Nat. Phys"},{"key":"20853_CR14","doi-asserted-by":"publisher","unstructured":"Shaydulin, R. & Galda, A. Error mitigation for deep quantum optimization circuits by leveraging problem symmetries. In IEEE International Conference on Quantum Computing and Engineering, 291\u2013300. https:\/\/doi.org\/10.1109\/QCE52317.2021.00046 (2021).","DOI":"10.1109\/QCE52317.2021.00046"},{"key":"20853_CR15","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1126\/science.abo6587","volume":"376","author":"S Ebadi","year":"2022","unstructured":"Ebadi, S. et al. Quantum optimization of maximum independent set using rydberg atom arrays. Science 376, 1209\u20131215. https:\/\/doi.org\/10.1126\/science.abo6587 (2022).","journal-title":"Science"},{"key":"20853_CR16","doi-asserted-by":"publisher","first-page":"678","DOI":"10.22331\/q-2022-03-30-678","volume":"6","author":"S Bravyi","year":"2022","unstructured":"Bravyi, S., Kliesch, A., Koenig, R. & Tang, E. Hybrid quantum-classical algorithms for approximate graph coloring. Quantum 6, 678. https:\/\/doi.org\/10.22331\/q-2022-03-30-678 (2022).","journal-title":"Quantum"},{"key":"20853_CR17","doi-asserted-by":"publisher","unstructured":"Filippova, K., Surdeanu, M., Ciaramita, M. & Zaragoza, H. Company-oriented extractive summarization of financial news. In Proceedings of the 12th Conference of the European Chapter of the ACL (EACL 2009), 246\u2013254. (Association for Computational Linguistics, Athens, Greece, 2009) https:\/\/doi.org\/10.5555\/1609067.1609094.","DOI":"10.5555\/1609067.1609094"},{"key":"20853_CR18","doi-asserted-by":"crossref","unstructured":"Bhattacharya, P., Poddar, S., Rudra, K., Ghosh, K. & Ghosh, S. Incorporating domain knowledge for extractive summarization of legal case documents. In Proceedings of the Eighteenth International Conference on Artificial Intelligence and Law, 22\u201331 (Association for Computing Machinery, New York, NY, USA, 2021).","DOI":"10.1145\/3462757.3466092"},{"key":"20853_CR19","doi-asserted-by":"publisher","first-page":"557","DOI":"10.5555\/1763653.1763720","volume-title":"Advances in Information Retrieval, ECIR\u201907","author":"R McDonald","year":"2007","unstructured":"McDonald, R. A study of global inference algorithms in multi-document summarization. In Advances in Information Retrieval, ECIR\u201907 557\u2013564 (Springer, Berlin, 2007). https:\/\/doi.org\/10.5555\/1763653.1763720."},{"key":"20853_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-021-03298-4","author":"R Shaydulin","year":"2021","unstructured":"Shaydulin, R., Hadfield, S., Hogg, T. & Safro, I. Classical symmetries and the quantum approximate optimization algorithm. Quantum Inf. Process.https:\/\/doi.org\/10.1007\/s11128-021-03298-4 (2021).","journal-title":"Quantum Inf. Process."},{"key":"20853_CR21","doi-asserted-by":"publisher","unstructured":"Shaydulin, R., Lotshaw, P.\u00a0C., Larson, J., Ostrowski, J. & Humble, T.\u00a0S. Parameter transfer for quantum approximate optimization of weighted MaxCut. https:\/\/doi.org\/10.48550\/ARXIV.2201.11785 (2022).","DOI":"10.48550\/ARXIV.2201.11785"},{"key":"20853_CR22","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/a12020034","volume":"12","author":"S Hadfield","year":"2019","unstructured":"Hadfield, S. et al. From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12, 34. https:\/\/doi.org\/10.3390\/a12020034 (2019).","journal-title":"Algorithms"},{"key":"20853_CR23","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.101.012320","author":"Z Wang","year":"2020","unstructured":"Wang, Z., Rubin, N. C., Dominy, J. M. & Rieffel, E. G. XY-mixers: Analytical and numerical results for the quantum alternating operator ansatz. Phys. Rev. A.https:\/\/doi.org\/10.1103\/physreva.101.012320 (2020).","journal-title":"Phys. Rev. A."},{"key":"20853_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/tqe.2021.3140190","volume":"3","author":"X Liu","year":"2022","unstructured":"Liu, X. et al. Layer VQE: A variational approach for combinatorial optimization on noisy quantum computers. IEEE Trans. Quantum Eng. 3, 1\u201320. https:\/\/doi.org\/10.1109\/tqe.2021.3140190 (2022).","journal-title":"IEEE Trans. Quantum Eng."},{"key":"20853_CR25","doi-asserted-by":"publisher","unstructured":"Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm. https:\/\/doi.org\/10.48550\/ARXIV.1411.4028(2014).","DOI":"10.48550\/ARXIV.1411.4028"},{"key":"20853_CR26","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/s0020-0255(00)00052-9","volume":"128","author":"T Hogg","year":"2000","unstructured":"Hogg, T. & Portnov, D. Quantum optimization. Inf. Sci. 128, 181\u2013197. https:\/\/doi.org\/10.1016\/s0020-0255(00)00052-9 (2000).","journal-title":"Inf. Sci."},{"key":"20853_CR27","doi-asserted-by":"publisher","unstructured":"Shaydulin, R., Safro, I. & Larson, J. Multistart methods for quantum approximate optimization. In IEEE High Performance Extreme Computing Conference, 1\u20138. https:\/\/doi.org\/10.1109\/hpec.2019.8916288 (2019).","DOI":"10.1109\/hpec.2019.8916288"},{"key":"20853_CR28","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, 052419. https:\/\/doi.org\/10.1103\/PhysRevA.104.052419 (2021).","journal-title":"Phys. Rev. A"},{"key":"20853_CR29","doi-asserted-by":"publisher","first-page":"1792","DOI":"10.1103\/PhysRevLett.35.1792","volume":"35","author":"D Sherrington","year":"1975","unstructured":"Sherrington, D. & Kirkpatrick, S. Solvable model of a spin-glass. Phys. Rev. Lett. 35, 1792\u20131796. https:\/\/doi.org\/10.1103\/PhysRevLett.35.1792 (1975).","journal-title":"Phys. Rev. Lett."},{"key":"20853_CR30","doi-asserted-by":"publisher","unstructured":"Farhi, E., Goldstone, J., Gutmann, S. & Zhou, L. The quantum approximate optimization algorithm and the Sherrington-Kirkpatrick model at infinite size. https:\/\/doi.org\/10.48550\/ARXIV.1910.08187 (2019).","DOI":"10.48550\/ARXIV.1910.08187"},{"key":"20853_CR31","doi-asserted-by":"publisher","unstructured":"Basso, J., Farhi, E., Marwaha, K., Villalonga, B. & Zhou, L. The quantum approximate optimization algorithm at high depth for MaxCut on large-girth regular graphs and the Sherrington\u2013Kirkpatrick model. https:\/\/doi.org\/10.48550\/arXiv.2110.14206 (2021).","DOI":"10.48550\/arXiv.2110.14206"},{"key":"20853_CR32","doi-asserted-by":"publisher","unstructured":"Xu, J., Gan, Z., Cheng, Y. & Liu, J. Discourse-aware neural extractive text summarization. In Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 5021\u20135031 (Association for Computational Linguistics, Online, 2020) https:\/\/doi.org\/10.18653\/v1\/2020.acl-main.451.","DOI":"10.18653\/v1\/2020.acl-main.451"},{"key":"20853_CR33","doi-asserted-by":"publisher","unstructured":"Zhong, M. et\u00a0al. Extractive summarization as text matching. In Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 6197\u20136208 (Association for Computational Linguistics, Online, 2020) https:\/\/doi.org\/10.18653\/v1\/2020.acl-main.552.","DOI":"10.18653\/v1\/2020.acl-main.552"},{"key":"20853_CR34","doi-asserted-by":"publisher","unstructured":"Liu, Y. Fine-tune BERT for extractive summarization. https:\/\/doi.org\/10.48550\/ARXIV.1903.10318 (2019).","DOI":"10.48550\/ARXIV.1903.10318"},{"key":"20853_CR35","unstructured":"Document summarization on cnn\/daily mail. https:\/\/paperswithcode.com\/sota\/document-summarization-on-cnn-daily-mail. Accessed 6 Oct 2022."},{"key":"20853_CR36","unstructured":"Hermann, K.\u00a0M. et\u00a0al. Teaching machines to read and comprehend. In Proceedings of the 28th International Conference on Neural Information Processing Systems\u2014Volume 1, NIPS\u201915, 1693\u20131701 (MIT Press, Cambridge, MA, USA, 2015)."},{"key":"20853_CR37","doi-asserted-by":"publisher","unstructured":"Reimers, N. & Gurevych, I. Sentence-BERT: Sentence embeddings using Siamese BERT-networks. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), 3982\u20133992 (Association for Computational Linguistics, Hong Kong, China, 2019) https:\/\/doi.org\/10.18653\/v1\/D19-1410.","DOI":"10.18653\/v1\/D19-1410"},{"key":"20853_CR38","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0306-4573(02)00021-3","volume":"39","author":"A Aizawa","year":"2003","unstructured":"Aizawa, A. An information-theoretic perspective of tf-idf measures. Inf. Process. Manage 39, 45\u201365. https:\/\/doi.org\/10.1016\/S0306-4573(02)00021-3 (2003).","journal-title":"Inf. Process. Manage"},{"key":"20853_CR39","doi-asserted-by":"publisher","unstructured":"Aleksandrowicz, G. et\u00a0al. Qiskit: An open-source framework for quantum computing. https:\/\/doi.org\/10.5281\/zenodo.2562111 (2019).","DOI":"10.5281\/zenodo.2562111"},{"key":"20853_CR40","doi-asserted-by":"publisher","first-page":"014003","DOI":"10.1088\/2058-9565\/ab8e92","volume":"6","author":"S Sivarajah","year":"2020","unstructured":"Sivarajah, S. et al. t|ket>: A retargetable compiler for NISQ devices. Quantum Sci. Technol. 6, 014003. https:\/\/doi.org\/10.1088\/2058-9565\/ab8e92 (2020).","journal-title":"Quantum Sci. Technol."},{"key":"20853_CR41","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-030-25027-0_9","volume-title":"Fundamentals of Computation Theory","author":"A B\u00e4rtschi","year":"2019","unstructured":"B\u00e4rtschi, A. & Eidenbenz, S. Deterministic preparation of Dicke states. In Fundamentals of Computation Theory 126\u2013139 (Springer International Publishing, 2019). https:\/\/doi.org\/10.1007\/978-3-030-25027-0_9."},{"key":"20853_CR42","doi-asserted-by":"publisher","unstructured":"Mukherjee, C.\u00a0S., Maitra, S., Gaurav, V. & Roy, D. On actual preparation of Dicke state on a quantum computer. https:\/\/doi.org\/10.48550\/ARXIV.2007.01681 (2020).","DOI":"10.48550\/ARXIV.2007.01681"},{"key":"20853_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2022.3174547","volume":"3","author":"S Aktar","year":"2022","unstructured":"Aktar, S., B\u00e4rtschi, A., Badawy, A.-H.A. & Eidenbenz, S. A divide-and-conquer approach to Dicke state preparation. IEEE Trans. Quantum Eng. 3, 1\u201316. https:\/\/doi.org\/10.1109\/TQE.2022.3174547 (2022).","journal-title":"IEEE Trans. Quantum Eng."},{"key":"20853_CR44","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-07090-4","author":"JR McClean","year":"2018","unstructured":"McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R. & Neven, H. Barren plateaus in quantum neural network training landscapes. Nat. Commun.https:\/\/doi.org\/10.1038\/s41467-018-07090-4 (2018).","journal-title":"Nat. Commun."},{"key":"20853_CR45","doi-asserted-by":"publisher","DOI":"10.1103\/prxquantum.3.010313","author":"Z Holmes","year":"2022","unstructured":"Holmes, Z., Sharma, K., Cerezo, M. & Coles, P. J. Connecting ansatz expressibility to gradient magnitudes and barren plateaus. PRX Quantum.https:\/\/doi.org\/10.1103\/prxquantum.3.010313 (2022).","journal-title":"PRX Quantum."},{"key":"20853_CR46","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1038\/s41586-021-03318-4","volume":"592","author":"JM Pino","year":"2021","unstructured":"Pino, J. M. et al. Demonstration of the trapped-ion quantum CCD computer architecture. Nature 592, 209\u2013213. https:\/\/doi.org\/10.1038\/s41586-021-03318-4 (2021).","journal-title":"Nature"},{"key":"20853_CR47","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.11.041058","volume":"11","author":"C Ryan-Anderson","year":"2021","unstructured":"Ryan-Anderson, C. et al. Realization of real-time fault-tolerant quantum error correction. Phys. Rev. X 11, 041058. https:\/\/doi.org\/10.1103\/PhysRevX.11.041058 (2021).","journal-title":"Phys. Rev. X"},{"key":"20853_CR48","doi-asserted-by":"publisher","unstructured":"Otterbach, J.\u00a0S. et\u00a0al. Unsupervised machine learning on a hybrid quantum computer. https:\/\/doi.org\/10.48550\/ARXIV.1712.05771 (2017).","DOI":"10.48550\/ARXIV.1712.05771"},{"key":"20853_CR49","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.1.020304","volume":"1","author":"N Lacroix","year":"2020","unstructured":"Lacroix, N. et al. Improving the performance of deep quantum optimization algorithms with continuous gate sets. PRX Quantum 1, 110304. https:\/\/doi.org\/10.1103\/PRXQuantum.1.020304 (2020).","journal-title":"PRX Quantum"},{"key":"20853_CR50","doi-asserted-by":"publisher","unstructured":"Baker, J.\u00a0S. & Radha, S.\u00a0K. Wasserstein solution quality and the quantum approximate optimization algorithm: A portfolio optimization case study. https:\/\/doi.org\/10.48550\/ARXIV.2202.06782 (2022).","DOI":"10.48550\/ARXIV.2202.06782"},{"key":"20853_CR51","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1038\/s41566-018-0236-y","volume":"12","author":"X Qiang","year":"2018","unstructured":"Qiang, X. et al. Large-scale silicon quantum photonics implementing arbitrary two-qubit processing. Nat. Photon. 12, 534\u2013539. https:\/\/doi.org\/10.1038\/s41566-018-0236-y (2018).","journal-title":"Nat. Photon."},{"key":"20853_CR52","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-020-02692-8","author":"M Willsch","year":"2020","unstructured":"Willsch, M., Willsch, D., Jin, F., Raedt, H. D. & Michielsen, K. Benchmarking the quantum approximate optimization algorithm. Quantum Inf. Process.https:\/\/doi.org\/10.1007\/s11128-020-02692-8 (2020).","journal-title":"Quantum Inf. Process."},{"key":"20853_CR53","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1038\/s41928-020-00498-1","volume":"3","author":"DM Abrams","year":"2020","unstructured":"Abrams, D. M., Didier, N., Johnson, B. R., da Silva, M. P. & Ryan, C. A. Implementation of XY entangling gates with a single calibrated pulse. Nat. Electron. 3, 744\u2013750. https:\/\/doi.org\/10.1038\/s41928-020-00498-1 (2020).","journal-title":"Nat. Electron."},{"key":"20853_CR54","doi-asserted-by":"publisher","DOI":"10.1103\/physrevapplied.14.034010","author":"A Bengtsson","year":"2020","unstructured":"Bengtsson, A. et al. Improved success probability with greater circuit depth for the quantum approximate optimization algorithm. Phys. Rev. Appl.https:\/\/doi.org\/10.1103\/physrevapplied.14.034010 (2020).","journal-title":"Phys. Rev. Appl."},{"key":"20853_CR55","doi-asserted-by":"publisher","DOI":"10.1103\/physrevresearch.3.043088","author":"N Earnest","year":"2021","unstructured":"Earnest, N., Tornow, C. & Egger, D. J. Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware. Phys. Rev. Res.https:\/\/doi.org\/10.1103\/physrevresearch.3.043088 (2021).","journal-title":"Phys. Rev. Res."},{"key":"20853_CR56","doi-asserted-by":"publisher","unstructured":"Santra, G.\u00a0C., Jendrzejewski, F., Hauke, P. & Egger, D.\u00a0J. Squeezing and quantum approximate optimization. https:\/\/doi.org\/10.48550\/ARXIV.2205.10383 (2022).","DOI":"10.48550\/ARXIV.2205.10383"},{"key":"20853_CR57","doi-asserted-by":"crossref","unstructured":"Kakkar, A., Larson, J., Galda, A. & Shaydulin, R. Characterizing error mitigation by symmetry verification in QAOA. arXiv:2204.05852 (2022).","DOI":"10.1109\/QCE53715.2022.00086"},{"key":"20853_CR58","doi-asserted-by":"publisher","first-page":"1900029","DOI":"10.1002\/qute.201900029","volume":"2","author":"R Shaydulin","year":"2019","unstructured":"Shaydulin, R., Ushijima-Mwesigwa, H., Safro, I., Mniszewski, S. & Alexeev, Y. Network community detection on small quantum computers. Adv. Quantum Technol. 2, 1900029. https:\/\/doi.org\/10.1002\/qute.201900029 (2019).","journal-title":"Adv. Quantum Technol."},{"key":"20853_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3425607","volume":"2","author":"H Ushijima-Mwesigwa","year":"2021","unstructured":"Ushijima-Mwesigwa, H. et al. Multilevel combinatorial optimization across quantum architectures. ACM Trans. Quantum Comput. 2, 1\u201329. https:\/\/doi.org\/10.1145\/3425607 (2021).","journal-title":"ACM Trans. Quantum Comput."},{"key":"20853_CR60","doi-asserted-by":"publisher","unstructured":"Golden, J., B\u00e4rtschi, A., O\u2019Malley, D. & Eidenbenz, S. QAOA-based fair sampling on NISQ devices. https:\/\/doi.org\/10.48550\/ARXIV.2101.03258 (2021).","DOI":"10.48550\/ARXIV.2101.03258"},{"key":"20853_CR61","doi-asserted-by":"publisher","unstructured":"Bartschi, A. & Eidenbenz, S. Grover mixers for QAOA: Shifting complexity from mixer design to state preparation. In 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) (IEEE, 2020) https:\/\/doi.org\/10.1109\/qce49297.2020.00020.","DOI":"10.1109\/qce49297.2020.00020"},{"key":"20853_CR62","doi-asserted-by":"publisher","unstructured":"Pelofske, E., Golden, J., B\u00e4rtschi, A., O\u2019Malley, D. & Eidenbenz, S. Sampling on nisq devices: \u201dwho\u2019s the fairest one of all?\u201d. In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), 207\u2013217. https:\/\/doi.org\/10.1109\/QCE52317.2021.00038 (2021).","DOI":"10.1109\/QCE52317.2021.00038"},{"key":"20853_CR63","doi-asserted-by":"publisher","unstructured":"Fingerhuth, M., Babej, T. & Ing, C. A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding. https:\/\/doi.org\/10.48550\/ARXIV.1810.13411 (2018).","DOI":"10.48550\/ARXIV.1810.13411"},{"key":"20853_CR64","doi-asserted-by":"publisher","first-page":"25396","DOI":"10.1073\/pnas.2006373117","volume":"117","author":"G Pagano","year":"2020","unstructured":"Pagano, G. et al. Quantum approximate optimization of the long-range ising model with a trapped-ion quantum simulator. Proc. Natl. Acad. Sci 117, 25396\u201325401. https:\/\/doi.org\/10.1073\/pnas.2006373117 (2020).","journal-title":"Proc. Natl. Acad. Sci"},{"key":"20853_CR65","doi-asserted-by":"publisher","unstructured":"Herman, D. et\u00a0al. A survey of quantum computing for finance. https:\/\/doi.org\/10.48550\/ARXIV.2201.02773 (2022).","DOI":"10.48550\/ARXIV.2201.02773"},{"key":"20853_CR66","doi-asserted-by":"publisher","unstructured":"Pistoia, M. et\u00a0al. Quantum machine learning for finance iccad special session paper. In 2021 IEEE\/ACM International Conference On Computer Aided Design (ICCAD), 1\u20139. https:\/\/doi.org\/10.1109\/ICCAD51958.2021.9643469 (2021).","DOI":"10.1109\/ICCAD51958.2021.9643469"},{"key":"20853_CR67","doi-asserted-by":"publisher","unstructured":"Devlin, J., Chang, M.-W., Lee, K. & Toutanova, K. BERT: Pre-training of deep bidirectional transformers for language understanding. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), 4171\u20134186 (Association for Computational Linguistics, Minneapolis, Minnesota, 2019) https:\/\/doi.org\/10.18653\/v1\/N19-1423.","DOI":"10.18653\/v1\/N19-1423"},{"key":"20853_CR68","volume-title":"Advances in Neural Information Processing Systems","author":"A Vaswani","year":"2017","unstructured":"Vaswani, A. et al. Attention is all you need. In Advances in Neural Information Processing Systems Vol. 30 (eds Guyon, I. et al.) (Curran Associates, Inc., 2017)."},{"key":"20853_CR69","doi-asserted-by":"publisher","unstructured":"Wang, C., Li, M. & Smola, A.\u00a0J. Language models with transformers. https:\/\/doi.org\/10.48550\/ARXIV.1904.09408 (2019).","DOI":"10.48550\/ARXIV.1904.09408"},{"key":"20853_CR70","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-85836-2_29","volume-title":"Data Warehousing and Knowledge Discovery","author":"P Achananuparp","year":"2008","unstructured":"Achananuparp, P., Hu, X. & Shen, X. The evaluation of sentence similarity measures. In Data Warehousing and Knowledge Discovery (eds Song, I.-Y. et al.) 305\u2013316 (Springer, 2008). https:\/\/doi.org\/10.1007\/978-3-540-85836-2_29."},{"key":"20853_CR71","doi-asserted-by":"publisher","unstructured":"Zheng, H. & Lapata, M. Sentence centrality revisited for unsupervised summarization. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, 6236\u20136247 (Association for Computational Linguistics, Florence, Italy, 2019) https:\/\/doi.org\/10.18653\/v1\/P19-1628.","DOI":"10.18653\/v1\/P19-1628"},{"key":"20853_CR72","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-94-015-8330-5_4","volume-title":"Advances in Optimization and Numerical Analysis","author":"MJD Powell","year":"1994","unstructured":"Powell, M. J. D. A direct search optimization method that models the objective and constraint functions by linear interpolation. In Advances in Optimization and Numerical Analysis (eds Gomez, S. & Hennart, J.-P.) 51\u201367 (Springer, 1994). https:\/\/doi.org\/10.1007\/978-94-015-8330-5_4."},{"key":"20853_CR73","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492900002841","volume":"7","author":"M Powell","year":"1998","unstructured":"Powell, M. Direct search algorithms for optimization calculations. Acta Numer. 7, 287\u2013336. https:\/\/doi.org\/10.1017\/S0962492900002841 (1998).","journal-title":"Acta Numer."},{"key":"20853_CR74","unstructured":"Quantinuum system model H1 product data sheet [retrieved 08\/30\/2022]. https:\/\/www.quantinuum.com\/products\/h1."},{"key":"20853_CR75","first-page":"74","volume-title":"Text Summarization Branches Out","author":"C-Y Lin","year":"2004","unstructured":"Lin, C.-Y. ROUGE: A package for automatic evaluation of summaries. In Text Summarization Branches Out 74\u201381 (Association for Computational Linguistics, 2004)."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-022-20853-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-022-20853-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-022-20853-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T05:06:39Z","timestamp":1678251999000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-022-20853-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,13]]},"references-count":75,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["20853"],"URL":"https:\/\/doi.org\/10.1038\/s41598-022-20853-w","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,13]]},"assertion":[{"value":"12 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"17171"}}