Quantum annealing initialization of the quantum approximate optimization algorithm
IST Austria, Am Campus 1, 3400 Klosterneuburg, Austria
| Published: | 2021-07-01, volume 5, page 491 |
| Eprint: | arXiv:2101.05742v3 |
| Doi: | https://doi.org/10.22331/q-2021-07-01-491 |
| Citation: | Quantum 5, 491 (2021). |
Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.
Abstract
The quantum approximate optimization algorithm (QAOA) is a prospective near-term quantum algorithm due to its modest circuit depth and promising benchmarks. However, an external parameter optimization required in QAOA could become a performance bottleneck. This motivates studies of the optimization landscape and search for heuristic ways of parameter initialization. In this work we visualize the optimization landscape of the QAOA applied to the MaxCut problem on random graphs, demonstrating that random initialization of the QAOA is prone to converging to local minima with sub-optimal performance. We introduce the initialization of QAOA parameters based on the Trotterized quantum annealing (TQA) protocol, parameterized by the Trotter time step. We find that the TQA initialization allows to circumvent the issue of false minima for a broad range of time steps, yielding the same performance as the best result out of an exponentially scaling number of random initializations. Moreover, we demonstrate that the optimal value of the time step coincides with the point of proliferation of Trotter errors in quantum annealing. Our results suggest practical ways of initializing QAOA protocols on near-term quantum devices and reveals new connections between QAOA and quantum annealing.
Featured image: The figure schematically displays the quantum circuit that implements the QAOA ansatz (left), the variational parameters before and after optimization (middle) and a cartoon of the optimization landscape (right).
Popular summary
► BibTeX data
► References
[1] F. Arute et al., Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor, arXiv e-prints , arXiv:2004.04197 (2020a), arXiv:2004.04197 [quant-ph].
https://doi.org/10.1038/s41567-020-01105-y
arXiv:2004.04197
[2] F. Arute et al., Hartree-Fock on a superconducting qubit quantum computer, Science 369, 1084 (2020b), arXiv:2004.04174 [quant-ph].
https://doi.org/10.1126/science.abb9811
arXiv:2004.04174
[3] F. Arute et al., Observation of separated dynamics of charge and spin in the Fermi-Hubbard model, arXiv e-prints , arXiv:2010.07965 (2020c), arXiv:2010.07965 [quant-ph].
arXiv:2010.07965
[4] K. Wright et al., Benchmarking an 11-qubit quantum computer, Nature Communications 10, 5464 (2019), arXiv:1903.08181 [quant-ph].
https://doi.org/10.1038/s41467-019-13534-2
arXiv:1903.08181
[5] J. Preskill, Quantum Computing in the NISQ era and beyond, arXiv e-prints , arXiv:1801.00862 (2018), arXiv:1801.00862 [quant-ph].
https://doi.org/10.22331/q-2018-08-06-79
arXiv:1801.00862
[6] E. Farhi, J. Goldstone, and S. Gutmann, A Quantum Approximate Optimization Algorithm, arXiv e-prints , arXiv:1411.4028 (2014), arXiv:1411.4028 [quant-ph].
arXiv:1411.4028
[7] L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices, Phys. Rev. X 10, 021067 (2020).
https://doi.org/10.1103/PhysRevX.10.021067
[8] G. E. Crooks, Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem, arXiv e-prints , arXiv:1811.08419 (2018), arXiv:1811.08419 [quant-ph].
arXiv:1811.08419
[9] M. Willsch, D. Willsch, F. Jin, H. De Raedt, and K. Michielsen, Benchmarking the quantum approximate optimization algorithm, Quantum Information Processing 19, 197 (2020), arXiv:1907.02359 [quant-ph].
https://doi.org/10.1007/s11128-020-02692-8
arXiv:1907.02359
[10] S. Bravyi, A. Kliesch, R. Koenig, and E. Tang, Obstacles to State Preparation and Variational Optimization from Symmetry Protection, arXiv e-prints , arXiv:1910.08980 (2019), arXiv:1910.08980 [quant-ph].
https://doi.org/10.1103/PhysRevLett.125.260505
arXiv:1910.08980
[11] G. G. Guerreschi and A. Y. Matsuura, QAOA for Max-Cut requires hundreds of qubits for quantum speed-up, Scientific Reports 9, 6903 (2019).
https://doi.org/10.1038/s41598-019-43176-9
[12] R. Shaydulin, I. Safro, and J. Larson, Multistart methods for quantum approximate optimization, in 2019 IEEE High Performance Extreme Computing Conference (HPEC) (2019) pp. 1–8.
https://doi.org/10.1109/HPEC.2019.8916288
[13] J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, Barren plateaus in quantum neural network training landscapes, Nature Communications 9, 4812 (2018), arXiv:1803.11173 [quant-ph].
https://doi.org/10.1038/s41467-018-07090-4
arXiv:1803.11173
[14] Z. Holmes, K. Sharma, M. Cerezo, and P. J. Coles, Connecting ansatz expressibility to gradient magnitudes and barren plateaus, arXiv e-prints , arXiv:2101.02138 (2021), arXiv:2101.02138 [quant-ph].
arXiv:2101.02138
[15] M. Cerezo, A. Sone, T. Volkoff, L. Cincio, and P. J. Coles, Cost function dependent barren plateaus in shallow parametrized quantum circuits, Nature Communications 12, 1791 (2021), arXiv:2001.00550 [quant-ph].
https://doi.org/10.1038/s41467-021-21728-w
arXiv:2001.00550
[16] F. G. S. L. Brandao, M. Broughton, E. Farhi, S. Gutmann, and H. Neven, For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances, arXiv e-prints , arXiv:1812.04170 (2018), arXiv:1812.04170 [quant-ph].
arXiv:1812.04170
[17] D. J. Egger, J. Marecek, and S. Woerner, Warm-starting quantum optimization, arXiv e-prints , arXiv:2009.10095 (2020), arXiv:2009.10095 [quant-ph].
https://doi.org/10.22331/q-2021-06-17-479
arXiv:2009.10095
[18] M. Alam, A. Ash-Saki, and S. Ghosh, Accelerating Quantum Approximate Optimization Algorithm using Machine Learning, arXiv e-prints , arXiv:2002.01089 (2020), arXiv:2002.01089 [cs.ET].
arXiv:2002.01089
[19] S. Khairy, R. Shaydulin, L. Cincio, Y. Alexeev, and P. Balaprakash, Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems, arXiv e-prints , arXiv:1911.11071 (2019), arXiv:1911.11071 [cs.LG].
https://doi.org/10.1609/aaai.v34i03.5616
arXiv:1911.11071
[20] T. Albash and D. A. Lidar, Adiabatic quantum computation, Rev. Mod. Phys. 90, 015002 (2018).
https://doi.org/10.1103/RevModPhys.90.015002
[21] D. Liang, L. Li, and S. Leichenauer, Investigating quantum approximate optimization algorithms under bang-bang protocols, Phys. Rev. Research 2, 033402 (2020).
https://doi.org/10.1103/PhysRevResearch.2.033402
[22] M. Heyl, P. Hauke, and P. Zoller, Quantum localization bounds Trotter errors in digital quantum simulation, Science Advances 5, 10.1126/sciadv.aau8342 (2019).
https://doi.org/10.1126/sciadv.aau8342
[23] M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42, 1115 (1995).
https://doi.org/10.1145/227683.227684
[24] J. Wurtz and P. J. Love, Bounds on MAXCUT QAOA performance for $p>1$, arXiv e-prints , arXiv:2010.11209 (2020), arXiv:2010.11209 [quant-ph].
https://doi.org/10.1103/PhysRevA.103.042612
arXiv:2010.11209
[25] C. G. BROYDEN, The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations, IMA Journal of Applied Mathematics 6, 76 (1970).
https://doi.org/10.1093/imamat/6.1.76
[26] R. Fletcher, A new approach to variable metric algorithms, The Computer Journal 13, 317 (1970).
https://doi.org/10.1093/comjnl/13.3.317
[27] D. Goldfarb, A family of variable-metric methods derived by variational means, Mathematics of Computation 24, 23 (1970).
https://doi.org/10.2307/2004873
http://www.jstor.org/stable/2004873
[28] D. F. Shanno, Conditioning of quasi-Newton methods for function minimization, Mathematics of Computation 24, 647 (1970).
https://doi.org/10.2307/2004840
http://www.jstor.org/stable/2004840
[29] P. Virtanen, R. Gommers, T. E. Oliphant, M. Haberland, T. Reddy, D. Cournapeau, E. Burovski, P. Peterson, W. Weckesser, J. Bright, S. J. van der Walt, M. Brett, J. Wilson, K. J. Millman, N. Mayorov, A. R. J. Nelson, E. Jones, R. Kern, E. Larson, C. J. Carey, İ. Polat, Y. Feng, E. W. Moore, J. VanderPlas, D. Laxalde, J. Perktold, R. Cimrman, I. Henriksen, E. A. Quintero, C. R. Harris, A. M. Archibald, A. H. Ribeiro, F. Pedregosa, P. van Mulbregt, and SciPy 1.0 Contributors, SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python, Nature Methods 17, 261 (2020).
https://doi.org/10.1038/s41592-019-0686-2
[30] M. Rosenblatt, Remarks on some nonparametric estimates of a density function, Ann. Math. Statist. 27, 832 (1956).
https://doi.org/10.1214/aoms/1177728190
[31] E. Parzen, On estimation of a probability density function and mode, Ann. Math. Statist. 33, 1065 (1962).
https://doi.org/10.1214/aoms/1177704472
[32] T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model, Phys. Rev. E 58, 5355 (1998).
https://doi.org/10.1103/PhysRevE.58.5355
[33] J. Brooke, D. Bitko, T. F. Rosenbaum, and G. Aeppli, Quantum Annealing of a Disordered Magnet, Science 284, 779 (1999).
https://doi.org/10.1126/science.284.5415.779
[34] E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem, Science 292, 472 (2001), arXiv:quant-ph/0104129 [quant-ph].
https://doi.org/10.1126/science.1057726
arXiv:quant-ph/0104129
[35] E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum Computation by Adiabatic Evolution, arXiv e-prints , quant-ph/0001106 (2000), arXiv:quant-ph/0001106 [quant-ph].
arXiv:quant-ph/0001106
[36] D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation, SIAM Review 50, 755 (2008).
https://doi.org/10.1137/080734479
[37] A. Smith, M. S. Kim, F. Pollmann, and J. Knolle, Simulating quantum many-body dynamics on a current digital quantum computer, npj Quantum Information 5, 106 (2019), arXiv:1906.06343 [quant-ph].
https://doi.org/10.1038/s41534-019-0217-0
arXiv:1906.06343
[38] U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Annals of Physics 326, 96 (2011), arXiv:1008.3477 [cond-mat.str-el].
https://doi.org/10.1016/j.aop.2010.09.012
arXiv:1008.3477
[39] G. Carleo and M. Troyer, Solving the quantum many-body problem with artificial neural networks, Science 355, 602 (2017), arXiv:1606.02318 [cond-mat.dis-nn].
https://doi.org/10.1126/science.aag2302
arXiv:1606.02318
[40] M. Medvidovic and G. Carleo, Classical variational simulation of the Quantum Approximate Optimization Algorithm, arXiv e-prints , arXiv:2009.01760 (2020), arXiv:2009.01760 [quant-ph].
https://doi.org/10.1038/s41534-021-00440-z
arXiv:2009.01760
[41] A. Abbas, D. Sutter, C. Zoufal, A. Lucchi, A. Figalli, and S. Woerner, The power of quantum neural networks, arXiv e-prints , arXiv:2011.00027 (2020), arXiv:2011.00027 [quant-ph].
https://doi.org/10.1038/s43588-021-00084-1
arXiv:2011.00027
[42] D. Guéry-Odelin, A. Ruschhaupt, A. Kiely, E. Torrontegui, S. Martínez-Garaot, and J. G. Muga, Shortcuts to adiabaticity: Concepts, methods, and applications, Rev. Mod. Phys. 91, 045001 (2019).
https://doi.org/10.1103/RevModPhys.91.045001
[43] D. Sels and A. Polkovnikov, Minimizing irreversible losses in quantum systems by local counterdiabatic driving, Proceedings of the National Academy of Sciences 114, E3909 (2017).
https://doi.org/10.1073/pnas.1619826114
[44] P. W. Claeys, M. Pandey, D. Sels, and A. Polkovnikov, Floquet-engineering counterdiabatic protocols in quantum many-body systems, Phys. Rev. Lett. 123, 090602 (2019).
https://doi.org/10.1103/PhysRevLett.123.090602
[45] Z.-C. Yang, A. Rahmani, A. Shabani, H. Neven, and C. Chamon, Optimizing variational quantum algorithms using Pontryagin's minimum principle, Phys. Rev. X 7, 021027 (2017).
https://doi.org/10.1103/PhysRevX.7.021027
[46] S. H. Sack, Trotterized quantum annealing initialization of the QAOA, https://github.com/shsack/TQA-init.-for-QAOA (2021).
https://github.com/shsack/TQA-init.-for-QAOA
[47] A. Hagberg, P. Swart, and D. S Chult, Exploring network structure, dynamics, and function using NetworkX, Tech. Rep. (Los Alamos National Lab.(LANL), Los Alamos, NM (United States), 2008).
https://networkx.org/
[48] D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, Efficient Quantum Algorithms for Simulating Sparse Hamiltonians, Communications in Mathematical Physics 270, 359 (2007), arXiv:quant-ph/0508139 [quant-ph].
https://doi.org/10.1007/s00220-006-0150-x
arXiv:quant-ph/0508139
Cited by
[1] Antonio A. Mele, Glen B. Mbeng, Giuseppe E. Santoro, Mario Collura, and Pietro Torta, "Avoiding barren plateaus via transferability of smooth solutions in a Hamiltonian variational ansatz", Physical Review A 106 6, L060401 (2022).
[2] Huy Phuc Nguyen Ha, Viet Hung Nguyen, and Anh Son Ta, Lecture Notes in Computer Science 14753 , 246 (2024) ISBN:978-3-031-62911-2.
[3] Vrinda Mehta, Fengping Jin, Hans De Raedt, and Kristel Michielsen, "Quantum annealing with trigger Hamiltonians: Application to 2-satisfiability and nonstoquastic problems", Physical Review A 104 3, 032421 (2021).
[4] Laith Abualigah, Saif AlNajdawi, Abiodun M. Ikotun, Agostino Forestiero, Faiza Gul, Absalom E. Ezugwu, Heming Jia, Mohsen Zare, Shubham Mahajan, and Mohammad Alshinwan, Metaheuristic Optimization Algorithms 147 (2024) ISBN:9780443139253.
[5] Yao Lu, Wentao Chen, Shuaining Zhang, Kuan Zhang, Jialiang Zhang, Jing-Ning Zhang, and Kihwan Kim, "Implementing Arbitrary Ising Models with a Trapped-Ion Quantum Processor", Physical Review Letters 134 5, 050602 (2025).
[6] Tobias Köppl, René Zander, and Nikolay Tcholtchev, 2024 IEEE Symposium on Computers and Communications (ISCC) 1 (2024) ISBN:979-8-3503-5423-2.
[7] Alicia B. Magann, Kenneth M. Rudinger, Matthew D. Grace, and Mohan Sarovar, "Lyapunov-control-inspired strategies for quantum combinatorial optimization", Physical Review A 106 6, 062414 (2022).
[8] Reuben Tate, Jai Moondra, Bryan Gard, Greg Mohler, and Swati Gupta, "Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths", Quantum 7, 1121 (2023).
[9] Johannes Weidenfeller, Lucia C. Valor, Julien Gacon, Caroline Tornow, Luciano Bello, Stefan Woerner, and Daniel J. Egger, "Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware", Quantum 6, 870 (2022).
[10] Runsheng Zhao, Tao Cheng, Rui Wang, Xingkui Fan, and Hongyang Ma, "Artificial intelligence warm-start approach: optimizing the generalization capability of QAOA in complex energy landscapes", New Journal of Physics 26 5, 053016 (2024).
[11] Kostas Blekos, Dean Brand, Andrea Ceschini, Chiao-Hui Chou, Rui-Hao Li, Komal Pandya, and Alessandro Summer, "A review on Quantum Approximate Optimization Algorithm and its variants", Physics Reports 1068, 1 (2024).
[12] Maximilian Hess, Lilly Palackal, Abhishek Awasthi, and Karen Wintersperger, 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) 221 (2024) ISBN:979-8-3315-4137-8.
[13] Paolo Zentilini, Sebastiano Corli, and Enrico Prati, 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) 472 (2024) ISBN:979-8-3315-4137-8.
[14] Elisabeth Wybo and Martin Leib, "Vanishing performance of the parity-encoded quantum approximate optimization algorithm applied to spin-glass models", Quantum 8, 1554 (2024).
[15] Noah L. Wach, Manuel S. Rudolph, Fred Jendrzejewski, and Sebastian Schmitt, "Data re-uploading with a single qudit", Quantum Machine Intelligence 5 2, 36 (2023).
[16] Xiao‐Hui Ni, Bin‐Bin Cai, Hai‐Ling Liu, Su‐Juan Qin, Fei Gao, and Qiao‐Yan Wen, "Multilevel Leapfrogging Initialization Strategy for Quantum Approximate Optimization Algorithm", Advanced Quantum Technologies 7 5, 2300419 (2024).
[17] Nishant Jain, Brian Coyle, Elham Kashefi, and Niraj Kumar, "Graph neural network initialisation of quantum approximate optimisation", Quantum 6, 861 (2022).
[18] Maximilian Zorn, Jonas Stein, Philipp Altmann, Michael Kölle, Claudia Linnhoff-Popien, and Thomas Gabor, 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) 1721 (2024) ISBN:979-8-3315-4137-8.
[19] V Vijendran, Aritra Das, Dax Enshan Koh, Syed M Assad, and Ping Koy Lam, "An expressive ansatz for low-depth quantum approximate optimisation", Quantum Science and Technology 9 2, 025010 (2024).
[20] Elijah Pelofske, Andreas Bärtschi, and Stephan Eidenbenz, "Short-depth QAOA circuits and quantum annealing on higher-order ising models", npj Quantum Information 10 1, 30 (2024).
[21] Xiumei Zhao, Yongmei Li, Jing Li, Shasha Wang, Song Wang, Sujuan Qin, and Fei Gao, "Near-term quantum algorithm for solving the MaxCut problem with fewer quantum resources", Physica A: Statistical Mechanics and its Applications 648, 129951 (2024).
[22] Leonardo Lavagna, Andrea Ceschini, Antonello Rosato, and Massimo Panella, 2024 International Joint Conference on Neural Networks (IJCNN) 1 (2024) ISBN:979-8-3503-5931-2.
[23] Zhenduo Wang, Pei-Lin Zheng, Biao Wu, and Yi Zhang, "Quantum dropout: On and over the hardness of quantum approximate optimization algorithm", Physical Review Research 5 2, 023171 (2023).
[24] Ioannis Kolotouros and Petros Wallden, "Evolving objective function for improved variational quantum optimization", Physical Review Research 4 2, 023225 (2022).
[25] Sebastiano Corli, Daniele Dragoni, Massimiliano Proietti, Massimiliano Dispenza, Carlo Cavazzoni, and Enrico Prati, 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) 284 (2023) ISBN:979-8-3503-4323-6.
[26] Zewen Zhang, Roger Paredes, Bhuvanesh Sundar, David Quiroga, Anastasios Kyrillidis, Leonardo Duenas-Osorio, Guido Pagano, and Kaden R A Hazzard, "Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering", Quantum Science and Technology 10 1, 015022 (2025).
[27] Alexander Miessen, Daniel J. Egger, Ivano Tavernelli, and Guglielmo Mazzola, "Benchmarking Digital Quantum Simulations Above Hundreds of Qubits Using Quantum Critical Dynamics", PRX Quantum 5 4, 040320 (2024).
[28] Peter Gleißner, Georg Kruse, and Andreas Roßkopf, "Restricted global optimization for QAOA", APL Quantum 1 2, 026106 (2024).
[29] Jonathan Wurtz and Peter J. Love, "Counterdiabaticity and the quantum approximate optimization algorithm", Quantum 6, 635 (2022).
[30] Ioannis Kolotouros, Ioannis Petrongonas, Miloš Prokop, and Petros Wallden, "Simulating adiabatic quantum computing with parameterized quantum circuits", Quantum Science and Technology 10 1, 015003 (2025).
[31] Reuben Tate, Majid Farhadi, Creston Herold, Greg Mohler, and Swati Gupta, "Bridging Classical and Quantum with SDP initialized warm-starts for QAOA", ACM Transactions on Quantum Computing 4 2, 1 (2023).
[32] Stefan H. Sack and Daniel J. Egger, "Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation", Physical Review Research 6 1, 013223 (2024).
[33] Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti, Matthew DeCross, Dylan Herman, Niraj Kumar, Jeffrey Larson, Danylo Lykov, Pierre Minssen, Yue Sun, Yuri Alexeev, Joan M. Dreiling, John P. Gaebler, Thomas M. Gatterman, Justin A. Gerber, Kevin Gilmore, Dan Gresh, Nathan Hewitt, Chandler V. Horst, Shaohan Hu, Jacob Johansen, Mitchell Matheny, Tanner Mengle, Michael Mills, Steven A. Moses, Brian Neyenhuis, Peter Siegfried, Romina Yalovetzky, and Marco Pistoia, "Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem", Science Advances 10 22, eadm6761 (2024).
[34] Yunlong Yu, Chenfeng Cao, Xiang-Bin Wang, Nic Shannon, and Robert Joynt, "Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm", Physical Review Research 5 2, 023147 (2023).
[35] Xinwei Lee, Ningyi Xie, Dongsheng Cai, Yoshiyuki Saito, and Nobuyoshi Asai, "A Depth-Progressive Initialization Strategy for Quantum Approximate Optimization Algorithm", Mathematics 11 9, 2176 (2023).
[36] Ramin Fakhimi and Hamidreza Validi, Encyclopedia of Optimization 1 (2023) ISBN:978-3-030-54621-2.
[37] Kamaleswari Pandurangan, A. Priyadharshini, Rakheeba Taseen, B. Galebathullah, Haseeba Yaseen, and P. Ravichandran, Advances in Mechatronics and Mechanical Engineering 79 (2024) ISBN:9798369370766.
[38] Anh Son Ta and Huy Phuc Nguyen Ha, Lecture Notes on Data Engineering and Communications Technologies 187, 192 (2023) ISBN:978-3-031-46572-7.
[39] James Sud, Jeffrey Marshall, Zhihui Wang, Eleanor Rieffel, and Filip A. Wudarski, "Dual-map framework for noise characterization of quantum computers", Physical Review A 106 1, 012606 (2022).
[40] Elijah Pelofske, Georg Hahn, and Hristo Djidjev, "Initial State Encoding via Reverse Quantum Annealing and H-Gain Features", IEEE Transactions on Quantum Engineering 4, 1 (2023).
[41] Nguyen Ha Huy Phuc, Anh Son Ta, and Viet Hung Nguyen, Proceedings of the 12th International Symposium on Information and Communication Technology 655 (2023) ISBN:9798400708916.
[42] Huy Phuc Nguyen Ha, Viet Hung Nguyen, and Anh Son Ta, Lecture Notes in Computer Science 14753 , 268 (2024) ISBN:978-3-031-62911-2.
[43] Qing Xie, Kazuhiro Seki, and Seiji Yunoki, "Variational counterdiabatic driving of the Hubbard model for ground-state preparation", Physical Review B 106 15, 155153 (2022).
[44] Ashkan Safari and Mohammad Ali Badamchizadeh, "NeuroQuMan: quantum neural network-based consumer reaction time demand response predictive management", Neural Computing and Applications 36 30, 19121 (2024).
[45] Danylo Lykov, Ruslan Shaydulin, Yue Sun, Yuri Alexeev, and Marco Pistoia, Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis 1443 (2023) ISBN:9798400707858.
[46] Sami Boulebnane, Xavier Lucas, Agnes Meyder, Stanislaw Adaszewski, and Ashley Montanaro, "Peptide conformational sampling using the Quantum Approximate Optimization Algorithm", npj Quantum Information 9 1, 70 (2023).
[47] Ohad Amosy, Tamuz Danzig, Ohad Lev, Ely Porat, Gal Chechik, and Adi Makmal, "Iteration-Free quantum approximate optimization algorithm using neural networks", Quantum Machine Intelligence 6 2, 38 (2024).
[48] Júlia Barberà-Rodríguez, Nicolas Gama, Anand Kumar Narayanan, and David Joseph, "Finding dense sublattices as low energy states of a Hamiltonian", Physical Review Research 6 4, 043279 (2024).
[49] Huy Phuc Nguyen Ha, Viet Hung Nguyen, and Anh Son Ta, Lecture Notes in Computer Science 14825, 244 (2024) ISBN:978-3-031-65342-1.
[50] Samantha V. Barron, Daniel J. Egger, Elijah Pelofske, Andreas Bärtschi, Stephan Eidenbenz, Matthis Lehmkuehler, and Stefan Woerner, "Provable bounds for noise-free expectation values computed from noisy samples", Nature Computational Science 4 11, 865 (2024).
[51] Sebastian Schulz, Dennis Willsch, and Kristel Michielsen, "Guided quantum walk", Physical Review Research 6 1, 013312 (2024).
[52] Brice Chichereau, Stéphane Vialle, and Patrick Carribault, 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) 134 (2023) ISBN:979-8-3503-4323-6.
[53] James Sud, Stuart Hadfield, Eleanor Rieffel, Norm Tubman, and Tad Hogg, "Parameter-setting heuristic for the quantum alternating operator ansatz", Physical Review Research 6 2, 023171 (2024).
[54] Xinwei Lee, Yoshiyuki Saito, Dongsheng Cai, and Nobuyoshi Asai, 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) 10 (2021) ISBN:978-1-6654-1691-7.
[55] Giovanni Pecci, Ruiyi Wang, Pietro Torta, Glen Bigan Mbeng, and Giuseppe Santoro, "Beyond quantum annealing: optimal control solutions to maxcut problems", Quantum Science and Technology 9 4, 045013 (2024).
[56] Stefan H. Sack, Raimel A. Medina, Alexios A. Michailidis, Richard Kueng, and Maksym Serbyn, "Avoiding Barren Plateaus Using Classical Shadows", PRX Quantum 3 2, 020365 (2022).
[57] Xinwei Lee, Xinjian Yan, Ningyi Xie, Dongsheng Cai, Yoshiyuki Saito, and Nobuyoshi Asai, "Iterative layerwise training for the quantum approximate optimization algorithm", Physical Review A 109 5, 052406 (2024).
[58] Pengnian Cai, Kang Shen, Tao Yang, Yuanming Hu, Bin Lv, Liuhuan Fan, Zeyu Liu, Qi Hu, Shixian Chen, Yunlai Zhu, Zuheng Wu, Yuehua Dai, Fei Yang, Jun Wang, and Zuyu Xu, "Enhancing quantum approximate optimization with CNN-CVaR integration", Quantum Information Processing 24 2, 37 (2025).
[59] Vivek Katial, Kate Smith-Miles, Charles Hill, and Lloyd Hollenberg, "On the Instance Dependence of Parameter Initialization for the Quantum Approximate Optimization Algorithm: Insights via Instance Space Analysis", INFORMS Journal on Computing ijoc.2024.0564 (2024).
[60] Ningyi Xie, Xinwei Lee, Dongsheng Cai, Yoshiyuki Saito, and Nobuyoshi Asai, "Quantum approximate optimization algorithm parameter prediction using a convolutional neural network", Journal of Physics: Conference Series 2595 1, 012001 (2023).
[61] Haoqian Pan and Changhong Lu, "Solving the Independent Domination Problem by the Quantum Approximate Optimization Algorithm", Entropy 26 12, 1057 (2024).
[62] Gopal Chandra Santra, Fred Jendrzejewski, Philipp Hauke, and Daniel J. Egger, "Squeezing and quantum approximate optimization", Physical Review A 109 1, 012413 (2024).
[63] Jonas Stein, Jonas Blenninger, David Bucher, Peter J. Eder, Elif Çetiner, Maximilian Zorn, and Claudia Linnhoff-Popien, 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) 280 (2024) ISBN:979-8-3315-4137-8.
[64] Huy Phuc Nguyen Ha and Anh Son Ta, "Hybrid QAOA and Genetic Algorithm for Solving Max-Cut Problem", (2023).
[65] Sebastiano Corli, Lorenzo Moro, Daniele Dragoni, Massimiliano Dispenza, and Enrico Prati, "Quantum machine learning algorithms for anomaly detection: A review", Future Generation Computer Systems 166, 107632 (2025).
[66] Zuyu Xu, Pengnian Cai, Kang Shen, Tao Yang, Yuanming Hu, Maogao Gong, Yunlai Zhu, Zuheng Wu, Yuehua Dai, and Fei Yang, "Hybrid GRU-CNN bilinear parameters initialization for quantum approximate optimization algorithm", Physica Scripta 99 8, 085105 (2024).
[67] Shree Hari Sureshbabu, Dylan Herman, Ruslan Shaydulin, Joao Basso, Shouvanik Chakrabarti, Yue Sun, and Marco Pistoia, "Parameter Setting in Quantum Approximate Optimization of Weighted Problems", Quantum 8, 1231 (2024).
[68] John Golden, Andreas Baertschi, Dan O'Malley, Elijah Pelofske, and Stephan Eidenbenz, Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis 1454 (2023) ISBN:9798400707858.
[69] Zheng-Hang Sun, Yong-Yi Wang, Jian Cui, and Heng Fan, "Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry", New Journal of Physics 25 1, 013015 (2023).
[70] Camille Grange, Michael Poss, and Eric Bourreau, "An introduction to variational quantum algorithms for combinatorial optimization problems", Annals of Operations Research 343 2, 847 (2024).
[71] Igor Gaidai and Rebekah Herrman, "Performance analysis of multi-angle QAOA for $$p > 1$$", Scientific Reports 14 1, 18911 (2024).
[72] Brian García Sarmina, Guo-Hua Sun, and Shi-Hai Dong, "Principal Component Analysis and t-Distributed Stochastic Neighbor Embedding Analysis in the Study of Quantum Approximate Optimization Algorithm Entangled and Non-Entangled Mixing Operators", Entropy 25 11, 1499 (2023).
[73] Zichang He, Ruslan Shaydulin, Shouvanik Chakrabarti, Dylan Herman, Changhao Li, Yue Sun, and Marco Pistoia, "Alignment between initial state and mixer improves QAOA performance for constrained optimization", npj Quantum Information 9 1, 121 (2023).
[74] Giuseppe Scriva, Nikita Astrakhantsev, Sebastiano Pilati, and Guglielmo Mazzola, "Challenges of variational quantum optimization with measurement shot noise", Physical Review A 109 3, 032408 (2024).
[75] Stefan H. Sack, Raimel A. Medina, Richard Kueng, and Maksym Serbyn, "Recursive greedy initialization of the quantum approximate optimization algorithm with guaranteed improvement", Physical Review A 107 6, 062404 (2023).
[76] Daniel Koch, Massimiliano Cutugno, Saahil Patel, Laura Wessing, and Paul M. Alsing, "Variational Amplitude Amplification for Solving QUBO Problems", Quantum Reports 5 4, 625 (2023).
[77] Kehan Wang, Shuang Wang, Qinghui Chen, Xingyu Qiao, Hongyang Ma, and Tianhui Qiu, "Implementation and analysis of quantum-classical hybrid interactive image segmentation algorithm based on quantum annealer", Quantum Information Processing 23 8, 301 (2024).
[78] Benjamin C B Symons, David Galvin, Emre Sahin, Vassil Alexandrov, and Stefano Mensa, "A practitioner’s guide to quantum algorithms for optimisation problems", Journal of Physics A: Mathematical and Theoretical 56 45, 453001 (2023).
[79] Pranav Chandarana, Pablo Suárez Vieites, Narendra N Hegade, Enrique Solano, Yue Ban, and Xi Chen, "Meta-learning digitized-counterdiabatic quantum optimization", Quantum Science and Technology 8 4, 045007 (2023).
[80] Yingli Yang, Zongkang Zhang, Anbang Wang, Xiaosi Xu, Xiaoting Wang, and Ying Li, "Maximizing quantum-computing expressive power through randomized circuits", Physical Review Research 6 2, 023098 (2024).
[81] Massimiliano Incudini, Fabio Tarocco, Riccardo Mengoni, Alessandra Di Pierro, and Antonio Mandarino, "Computing graph edit distance on quantum devices", Quantum Machine Intelligence 4 2, 24 (2022).
[82] Utkarsh Azad, Bikash K. Behera, Emad A. Ahmed, Prasanta K. Panigrahi, and Ahmed Farouk, "Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm", IEEE Transactions on Intelligent Transportation Systems 24 7, 7564 (2023).
[83] Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw, Tobias Haug, Sumner Alperin-Lea, Abhinav Anand, Matthias Degroote, Hermanni Heimonen, Jakob S. Kottmann, Tim Menke, Wai-Keong Mok, Sukin Sim, Leong-Chuan Kwek, and Alán Aspuru-Guzik, "Noisy intermediate-scale quantum algorithms", Reviews of Modern Physics 94 1, 015004 (2022).
[84] J. A. Montañez-Barrera, Dennis Willsch, and Kristel Michielsen, "Transfer learning of optimal QAOA parameters in combinatorial optimization", Quantum Information Processing 24 5, 129 (2025).
[85] V. Akshay, D. Rabinovich, E. Campos, and J. Biamonte, "Parameter concentrations in quantum approximate optimization", Physical Review A 104 1, L010401 (2021).
[86] Alejandro Gomez Cadavid, Archismita Dalal, Anton Simen, Enrique Solano, and Narendra N. Hegade, "Bias-field digitized counterdiabatic quantum optimization", Physical Review Research 7 2, L022010 (2025).
[87] Anton Frisk Kockum, Ariadna Soro, Laura García-Álvarez, Pontus Vikstål, Tom Douce, Göran Johansson, and Giulia Ferrini, "Lecture notes on quantum computing", arXiv:2311.08445, (2023).
[88] Elijah Pelofske, Marek M. Rams, Andreas Bärtschi, Piotr Czarnik, Paolo Braccia, Lukasz Cincio, and Stephan Eidenbenz, "Evaluating the limits of Quantum Approximate Optimization Algorithm parameter transfer at high rounds on sparse Ising models with geometrically local cubic terms", Physical Review Research 8 2, 023023 (2026).
[89] Elijah Pelofske, "Depth One Quantum Alternating Operator Ansatz as an Approximate Gibbs Distribution Sampler", arXiv:2510.10345, (2025).
[90] Etienne Granet and Henrik Dreyer, "Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem", Scientific Reports 15 1, 31983 (2025).
[91] Adelina Bärligea, Benedikt Poggel, and Jeanette Miriam Lorenz, "Scalability challenges in variational quantum optimization under stochastic noise", Physical Review A 112 3, 032407 (2025).
[92] Ruiyi Wang, Vincenzo Roberto Arezzo, Kiran Thengil, Giovanni Pecci, and Giuseppe E. Santoro, "From exponential to quadratic: optimal control for a frustrated Ising ring model", Quantum Science and Technology 10 3, 035052 (2025).
[93] Dennis Willsch, Madita Willsch, Fengping Jin, Kristel Michielsen, and Hans De Raedt, "GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm", Computer Physics Communications 278, 108411 (2022).
[94] Guanghui Li, Shasha Wang, Xiumei Zhao, Fei Gao, Sujuan Qin, Fenzhuo Guo, and Zhengping Jin, "Quantum alternating operator ansatz for solving the minimum dominating set problem on sparse graphs with a specific structure", Quantum Information Processing 24 6, 166 (2025).
[95] David Bucher, Daniel Porawski, Maximilian Janetschek, Jonas Stein, Corey O'Meara, Giorgio Cortiana, and Claudia Linnhoff-Popien, "Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems", arXiv:2506.03115, (2025).
[96] Sebastian Nagies, Kevin T. Geier, Javed Akram, Dimitrios Bantounas, Michael Johanning, and Philipp Hauke, "Boosting quantum annealing performance through direct polynomial unconstrained binary optimization", Quantum Science and Technology 10 3, 035008 (2025).
[97] Emanuele Costa, Axel Perez-Obiol, Javier Menendez, Arnau Rios, Artur Garcia-Saez, and Bruno Juliá-Díaz, "A quantum annealing protocol to solve the nuclear shell model", SciPost Physics 19 2, 062 (2025).
[98] Daniil Rabinovich, Andrey Kardashin, and Soumik Adhikary, "Role of overparametrization in quantum approximate optimization", Physical Review A 113 6, 062617 (2026).
[99] Naphan Benchasattabuse, Andreas Bärtschi, Luis Pedro García-Pintos, John Golden, Nathan Lemons, and Stephan Eidenbenz, "Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios", Physical Review A 111 6, 062411 (2025).
[100] Malick A. Gaye, Omar Shehab, Paraj Titum, and Gregory Quiroz, "Quantum optimization with classical chaos", Quantum Science and Technology 11 2, 025039 (2026).
[101] Ryo Sakai, Hiromichi Matsuyama, Wai-Hong Tam, Yu Yamashiro, and Keisuke Fujii, "Linearly simplified QAOA parameters and transferability", arXiv:2405.00655, (2024).
[102] David Bucher, Jonas Stein, Sebastian Feld, and Claudia Linnhoff-Popien, "Penalty-free approach to accelerating constrained quantum optimization", Physical Review A 112 6, 062605 (2025).
[103] David Bucher, Nico Kraus, Jonas Blenninger, Michael Lachner, Jonas Stein, and Claudia Linnhoff-Popien, "Towards Robust Benchmarking of Quantum Optimization Algorithms", arXiv:2405.07624, (2024).
[104] Reuben Tate, Majid Farhadi, Creston Herold, Greg Mohler, and Swati Gupta, "Bridging Classical and Quantum with SDP initialized warm-starts for QAOA", arXiv:2010.14021, (2020).
[105] Danylo Lykov, Ruslan Shaydulin, Yue Sun, Yuri Alexeev, and Marco Pistoia, "Fast Simulation of High-Depth QAOA Circuits", arXiv:2309.04841, (2023).
[106] Yiren Lu, Guojing Tian, and Xiaoming Sun, "QAOA with fewer qubits: a coupling framework to solve larger-scale Max-Cut problem", arXiv:2307.15260, (2023).
[107] Andoni Agirre, Evert van Nieuwenburg, and Matteo M. Wauters, "A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack", New Journal of Physics 27 4, 043014 (2025).
[108] Naphan Benchasattabuse, "Resource Management in Heterogeneous Quantum Repeater Networks", arXiv:2605.25132, (2026).
[109] Reuben Tate and Stephan Eidenbenz, "Theoretical Approximation Ratios for Warm-Started QAOA on 3-Regular Max-Cut Instances at Depth $p=1$", arXiv:2402.12631, (2024).
[110] Sebastian Nagies, Chiara Capecci, Marcel Seelbach Benkner, Javed Akram, Sebastian Rubbert, Dimitrios Bantounas, Michael Moeller, Michael Johanning, and Philipp Hauke, "Practical noise mitigation for quantum annealing via dynamical decoupling: Toward industry-relevant optimization using trapped ions", Physical Review A 113 1, 012621 (2026).
[111] Vanessa Dehn, Martin Zaefferer, Gerhard Hellstern, Karthik Jayadevan, Florentin Reiter, and Thomas Wellens, "Extrapolation method to optimize linear-ramp quantum approximate optimization algorithm parameters: Evaluation of runtime scaling", Physical Review A 113 3, 032413 (2026).
[112] Elijah Pelofske and Vincent Russo, "Digital Zero-Noise Extrapolation with Quantum Circuit Unoptimization", arXiv:2503.06341, (2025).
[113] Xiao-Hui Ni, Yu-Sen Wu, Bin-Bin Cai, Wen-Min Li, Su-Juan Qin, and Fei Gao, "An Adaptive Mixer Allocation Algorithm for the Quantum Alternating Operator Ansatz", arXiv:2412.19621, (2024).
[114] Dhanvi Bharadwaj, Yuewen Hou, Guang-Yi Li, and Gokul Subramanian Ravi, "Scalable Clifford-Based Classical Initialization for the Quantum Approximate Optimization Algorithm", arXiv:2602.14327, (2026).
[115] Xiao-Hui Ni, Jia-Cheng Fan, Ling-Xiao Li, Zi-Wen Huang, Su-Juan Qin, Bing-Jie Xu, Wei-Huang, and Fei Gao, "Quantum-Assisted Recursive Algorithm for Solving the Exact Cover Problem", arXiv:2509.10811, (2025).
[116] Po-Hsuan Huang, Xie-Ru Li, Chi Chuang, Chia-Heng Tu, and Shih-Hao Hung, "ParaQAOA: Efficient Parallel Divide-and-Conquer QAOA for Large-Scale Max-Cut Problems Beyond 10,000 Vertices", arXiv:2603.26232, (2026).
[117] Julien Gacon, "Scalable Quantum Algorithms for Noisy Quantum Computers", arXiv:2403.00940, (2024).
[118] Francesco Aldo Venturelli, Sreetama Das, and Filippo Caruso, "Investigating layer-selective transfer learning of quantum approximate optimization algorithm parameters for the Max-Cut problem", Physical Review A 112 4, 042428 (2025).
[119] Xinwei Lee, Xinjian Yan, Ningyi Xie, Yoshiyuki Saito, Leo Kurosawa, Nobuyoshi Asai, Dongsheng Cai, and Hoong Chuin Lau, "Light cone cancellation for variational quantum eigensolver in solving noisy Max-Cut", Scientific Reports 16 1, 9597 (2026).
[120] Samantha V. Barron, Daniel J. Egger, Elijah Pelofske, Andreas Bärtschi, Stephan Eidenbenz, Matthis Lehmkuehler, and Stefan Woerner, "Provable bounds for noise-free expectation values computed from noisy samples", arXiv:2312.00733, (2023).
[121] Alexey Bochkarev, Raoul Heese, Sven Jäger, Philine Schiewe, and Anita Schöbel, "Quantum Computing for Discrete Optimization: A Highlight of Three Technologies", arXiv:2409.01373, (2024).
[122] Ohad Amosy, Tamuz Danzig, Ely Porat, Gal Chechik, and Adi Makmal, "Iterative-Free Quantum Approximate Optimization Algorithm Using Neural Networks", arXiv:2208.09888, (2022).
[123] Yunlong Yu, Xiang-Bin Wang, Nic Shannon, and Robert Joynt, "Warm-start adaptive-bias quantum approximate optimization algorithm", Physical Review A 112 1, 012422 (2025).
[124] Julien Drapeau, Shreya Banerjee, and Stefanos Kourtis, "Counting with the quantum alternating operator ansatz", Quantum Science and Technology 11 2, 025037 (2026).
[125] Noah L. Wach, Manuel S. Rudolph, Fred Jendrzejewski, and Sebastian Schmitt, "Data re-uploading with a single qudit", arXiv:2302.13932, (2023).
[126] John Golden, Andreas Bärtschi, Daniel O'Malley, Elijah Pelofske, and Stephan Eidenbenz, "JuliQAOA: Fast, Flexible QAOA Simulation", arXiv:2312.06451, (2023).
[127] Xinwei Lee, Ningyi Xie, Yoshiyuki Saito, Dongsheng Cai, and Nobuyoshi Asai, "A Depth-Progressive Initialization Strategy for Quantum Approximate Optimization Algorithm", arXiv:2209.11348, (2022).
[128] Brian García Sarmina, Guo-Hua Sun, and Shi-Hai Dong, "Parameter optimization comparison in QAOA using Stochastic Hill Climbing with Random Re-starts and Local Search with entangled and non-entangled mixing operators", arXiv:2405.08941, (2024).
[129] Wei Fu, Haipeng Xie, Chen Chen, and Zhaohong Bie, "Quantum-Embedded Robust Optimization for Resilience-Constrained Unit Commitment", IEEE Transactions on Power Systems 40 5, 3778 (2025).
[130] Tom Krüger and Wolfgang Mauerer, "Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation", Quantum 9, 1903 (2025).
[131] Ryo Sakai, Hiromichi Matsuyama, Wai-Hong Tam, and Yu Yamashiro, "Transferring linearly fixed QAOA angles: performance and real device results", arXiv:2504.12632, (2025).
[132] Vivek Katial, Kate Smith-Miles, and Charles Hill, "On the Instance Dependence of Optimal Parameters for the Quantum Approximate Optimisation Algorithm: Insights via Instance Space Analysis", arXiv:2401.08142, (2024).
[133] Minhui Gou, Zeyang Li, Hong-Ze Xu, Changbin Lu, Jing-Bo Wang, Yukun Wang, Meng-Jun Hu, Dong E Liu, and Wei-Feng Zhuang, "Hierarchical Quantum Optimization via Backbone-Driven Problem Decomposition: Integrating Tabu-Search with QAOA", arXiv:2504.09575, (2025).
[134] Yovav Tene-Cohen, Tomer Kelman, Ohad Lev, and Adi Makmal, "A Variational Qubit-Efficient MaxCut Heuristic Algorithm", npj Quantum Information 12 1, 50 (2026).
[135] Shubham Patel and Utkarsh Mishra, "Improving the efficiency of QAOA using efficient parameter transfer initialization and targeted-single-layer regularized optimization with minimal performance degradation", arXiv:2601.15760, (2026).
[136] Gino Kwun, Dhanvi Bharadwaj, and Gokul Subramanian Ravi, "Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning", arXiv:2605.23138, (2026).
[137] Inbar Chefer, Uri Shaham, and Adi Makmal, "Measurements Number Scaling in the Quantum Approximate Optimization Algorithm for MaxCut: A Statistical Analysis", arXiv:2607.03340, (2026).
The above citations are from Crossref's cited-by service (last updated successfully 2026-07-15 09:58:34) and SAO/NASA ADS (last updated successfully 2026-07-14 21:06:40). The list may be incomplete as not all publishers provide suitable and complete citation data.
Could not fetch ADS cited-by data during last attempt 2026-07-15 09:58:34: Cannot retrieve data from ADS due to rate limitations.
This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.