Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
1IBM Quantum, IBM Research Europe – Zurich
2ETH Zurich
3Institute of Physics, Ecole Polytechnique Fédérale de Lausanne (EPFL)
| Published: | 2022-12-07, volume 6, page 870 |
| Eprint: | arXiv:2202.03459v2 |
| Doi: | https://doi.org/10.22331/q-2022-12-07-870 |
| Citation: | Quantum 6, 870 (2022). |
Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.
Abstract
Quantum computers may provide good solutions to combinatorial optimization problems by leveraging the Quantum Approximate Optimization Algorithm (QAOA). The QAOA is often presented as an algorithm for noisy hardware. However, hardware constraints limit its applicability to problem instances that closely match the connectivity of the qubits. Furthermore, the QAOA must outpace classical solvers. Here, we investigate swap strategies to map dense problems into linear, grid and heavy-hex coupling maps. A line-based swap strategy works best for linear and two-dimensional grid coupling maps. Heavy-hex coupling maps require an adaptation of the line swap strategy. By contrast, three-dimensional grid coupling maps benefit from a different swap strategy. Using known entropic arguments we find that the required gate fidelity for dense problems lies deep below the fault-tolerant threshold. We also provide a methodology to reason about the execution-time of QAOA. Finally, we present a QAOA Qiskit Runtime program and execute the closed-loop optimization on cloud-based quantum computers with transpiler settings optimized for QAOA. This work highlights some obstacles to improve to make QAOA competitive, such as gate fidelity, gate speed, and the large number of shots needed. The Qiskit Runtime program gives us a tool to investigate such issues at scale on noisy superconducting qubit hardware.
Featured image: QAOA on a hardware native optimization problem with 27 decision variables executed on ibmq_mumbai with the Qiskit Runtime.
Popular summary
► BibTeX data
► References
[1] Nikolaj Moll, Panagiotis Barkoutsos, Lev S. Bishop, Jerry M. Chow, Andrew Cross, Daniel J. Egger, Stefan Filipp, Andreas Fuhrer, Jay M. Gambetta, Marc Ganzhorn, and et al. Quantum optimization using variational algorithms on near-term quantum devices. Quantum Sci. Technol., 3 (3): 030503, 2018. 10.1088/2058-9565/aab822.
https://doi.org/10.1088/2058-9565/aab822
[2] Abhinav Kandala, Kristan Temme, Antonio D. Corcoles, Antonio Mezzacapo, Jerry M. Chow, and Jay M. Gambetta. Error mitigation extends the computational reach of a noisy quantum processor. Nature, 567: 491–495, 2018. 10.1038/s41586-019-1040-7.
https://doi.org/10.1038/s41586-019-1040-7
[3] Marc Ganzhorn, Daniel J. Egger, Panagiotis Kl. Barkoutsos, Pauline Ollitrault, Gian Salis, Nikolaj Moll, Andreas Fuhrer, Peter Mueller, Stefan Woerner, Ivano Tavernelli, and Stefan Filipp. Gate-efficient simulation of molecular eigenstates on a quantum computer. Phys. Rev. Applied, 11: 044092, Apr 2019. 10.1103/PhysRevApplied.11.044092.
https://doi.org/10.1103/PhysRevApplied.11.044092
[4] Stefan Woerner and Daniel J. Egger. Quantum risk analysis. npj Quantum Inf., 5: 15, 2019. 10.1038/s41534-019-0130-6.
https://doi.org/10.1038/s41534-019-0130-6
[5] Lee Braine, Daniel J. Egger, Jennifer Glick, and Stefan Woerner. Quantum algorithms for mixed binary optimization applied to transaction settlement. IEEE Trans. on Quantum Eng., 2: 1–8, 2021. 10.1109/TQE.2021.3063635.
https://doi.org/10.1109/TQE.2021.3063635
[6] Daniel J. Egger, Claudio Gambella, Jakub Mareček, Scott McFaddin, Martin Mevissen, Rudy Raymond, Aandrea Simonetto, Sefan Woerner, and Elena Yndurain. Quantum computing for finance: State-of-the-art and future prospects. IEEE Trans. on Quantum Eng., 1: 1–24, 2020. 10.1109/TQE.2020.3030314.
https://doi.org/10.1109/TQE.2020.3030314
[7] Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A quantum approximate optimization algorithm. 2014a. 10.48550/ARXIV.1411.4028.
https://doi.org/10.48550/ARXIV.1411.4028
[8] Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem. 2014b. 10.48550/ARXIV.1412.6062.
https://doi.org/10.48550/ARXIV.1412.6062
[9] Zhi-Cheng Yang, Armin Rahmani, Alireza Shabani, Hartmut Neven, and Claudio Chamon. Optimizing variational quantum algorithms using pontryagin's minimum principle. Phys. Rev. X, 7: 021027, May 2017. 10.1103/PhysRevX.7.021027.
https://doi.org/10.1103/PhysRevX.7.021027
[10] Andrew Lucas. Ising formulations of many NP problems. Front. Phys., 2: 5, 2014. ISSN 2296-424X. 10.3389/fphy.2014.00005.
https://doi.org/10.3389/fphy.2014.00005
[11] Bas Lodewijks. Mapping NP-hard and NP-complete optimisation problems to quadratic unconstrained binary optimisation problems. arXiv:1911.08043, 2019. 10.48550/ARXIV.1911.08043.
https://doi.org/10.48550/ARXIV.1911.08043
arXiv:1911.08043
[12] IBM ILOG CPLEX Optimizer. URL https://www.ibm.com/analytics/cplex-optimizer.
https://www.ibm.com/analytics/cplex-optimizer
[13] Andrey Kardashin, Anastasiia Pervishko, Jacob Biamonte, and Dmitry Yudin. Numerical hardware-efficient variational quantum simulation of a soliton solution. Phys. Rev. A, 104: L020402, Aug 2021. 10.1103/PhysRevA.104.L020402.
https://doi.org/10.1103/PhysRevA.104.L020402
[14] Matthew P. Harrigan, Kevin J. Sung, Matthew Neeley, Kevin J. Satzinger, Frank Arute, Kunal Arya, Juan Atalaya, Joseph C. Bardin, Rami Barends, Sergio Boixo, and et al. Quantum approximate optimization of non-planar graph problems on a planar superconducting processor. Nat. Phys., 17 (3): 332–336, Mar 2021. ISSN 1745-2481. 10.1038/s41567-020-01105-y.
https://doi.org/10.1038/s41567-020-01105-y
[15] Krishanu Sankar, Artur Scherer, Satoshi Kako, Sam Reifenstein, Navid Ghadermarzy, Willem B. Krayenhoff, Yoshitaka Inui, Edwin Ng, Tatsuhiro Onodera, Pooya Ronagh, and Yoshihisa Yamamoto. Benchmark study of quantum algorithms for combinatorial optimization: Unitary versus dissipative. 2021. 10.48550/ARXIV.2105.03528.
https://doi.org/10.48550/ARXIV.2105.03528
[16] Hazel A. Chieza, Maxine T. Khumalo, Krupa Prag, and Matthew Woolway. On the computational performance of IBM quantum devices applied to combinatorial optimisation problems. In 2020 7th International Conference on Soft Computing Machine Intelligence (ISCMI), pages 260–264, 2020. 10.1109/ISCMI51676.2020.9311605.
https://doi.org/10.1109/ISCMI51676.2020.9311605
[17] Harry Markowitz. Portfolio selection. J. Finance, 7 (1): 77–91, 1952. 10.2307/2975974.
https://doi.org/10.2307/2975974
[18] Francisco Barahona, Martin Grötschel, Michael Jünger, and Gerhard Reinelt. An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res., 36 (3): 493–513, 2021/11/19/ 1988. 10.1287/opre.36.3.493.
https://doi.org/10.1287/opre.36.3.493
[19] Michel Devoret and Robert J. Schoelkopf. Superconducting circuits for quantum information: An outlook. Science, 339: 1169–1174, 2013. 10.1126/science.1231930.
https://doi.org/10.1126/science.1231930
[20] Philip Krantz, Morten Kjaergaard, Fei Yan, Terry P. Orlando, Simon Gustavsson, and William D. Oliver. A quantum engineer's guide to superconducting qubits. Appl. Phys. Rev., 6 (2): 021318, 2019. 10.1063/1.5089550.
https://doi.org/10.1063/1.5089550
[21] Larry Isenhower, Mark Saffman, and Klaus Mølmer. Multibit CkNOT quantum gates via Rydberg blockade. Quantum Inf. Process., 10 (6): 755, Sep 2011. 10.1007/s11128-011-0292-4.
https://doi.org/10.1007/s11128-011-0292-4
[22] Guido Pagano, Aniruddha Bapat, Patrick Becker, Katherine S. Collins, Arinjoy De, Paul W. Hess, Harvey B. Kaplan, Antonis Kyprianidis, Wen Lin Tan, Christopher Baldwin, and et al. Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator. Proc. Natl. Acad. Sci. U.S.A., 117 (41): 25396–25401, 2020. ISSN 0027-8424. 10.1073/pnas.2006373117.
https://doi.org/10.1073/pnas.2006373117
[23] Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail D. Lukin. Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. Phys. Rev. X, 10: 021067, Jun 2020. 10.1103/PhysRevX.10.021067.
https://doi.org/10.1103/PhysRevX.10.021067
[24] Henning Labuhn, Daniel Barredo, Sylvain Ravets, Sylvain de Léséleuc, Tommaso Macrì, Thierry Lahaye, and Antoine Browaeys. Tunable two-dimensional arrays of single rydberg atoms for realizing quantum ising models. Nature, 534 (7609): 667–670, Jun 2016. 10.1038/nature18274.
https://doi.org/10.1038/nature18274
[25] Christopher Chamberland, Guanyu Zhu, Theodore J. Yoder, Jared B. Hertzberg, and Andrew W. Cross. Topological and subsystem codes on low-degree graphs with flag qubits. Phys. Rev. X, 10: 011022, Jan 2020. 10.1103/PhysRevX.10.011022.
https://doi.org/10.1103/PhysRevX.10.011022
[26] Ron Schutjens, Fadi Abu Dagga, Daniel J. Egger, and Frank K. Wilhelm. Single-qubit gates in frequency-crowded transmon systems. Phys. Rev. A, 88: 052330, Nov 2013. 10.1103/PhysRevA.88.052330.
https://doi.org/10.1103/PhysRevA.88.052330
[27] David C. McKay, Sarah Sheldon, John A. Smolin, Jerry M. Chow, and Jay M. Gambetta. Three-qubit randomized benchmarking. Phys. Rev. Lett., 122: 200502, May 2019. 10.1103/PhysRevLett.122.200502.
https://doi.org/10.1103/PhysRevLett.122.200502
[28] Peng Zhao, Kehuan Linghu, Zhiyuan Li, Peng Xu, Ruixia Wang, Guangming Xue, Yirong Jin, and Haifeng Yu. Quantum crosstalk analysis for simultaneous gate operations on superconducting qubits. PRX Quantum, 3: 020301, Apr 2022. 10.1103/PRXQuantum.3.020301.
https://doi.org/10.1103/PRXQuantum.3.020301
[29] Alexander Cowtan, Silas Dilkes, Ross Duncan, Alexandre Krajenbrink, Will Simmons, and Seyon Sivarajah. On the Qubit Routing Problem. In Wim van Dam and Laura Mancinska, editors, 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019), volume 135 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1–5:32, Dagstuhl, Germany, 2019. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. ISBN 978-3-95977-112-2. 10.4230/LIPIcs.TQC.2019.5.
https://doi.org/10.4230/LIPIcs.TQC.2019.5
[30] Alwin Zulehner, Alexandru Paler, and Robert Wille. An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 38 (7): 1226–1236, 2019. 10.1109/TCAD.2018.2846658.
https://doi.org/10.1109/TCAD.2018.2846658
[31] Jens Koch, Terri M. Yu, Jay Gambetta, Andrew A. Houck, David I. Schuster, Johannes Majer, Alexandre Blais, Michel H. Devoret, Steven M. Girvin, and Robert J. Schoelkopf. Charge-insensitive qubit design derived from the cooper pair box. Phys. Rev. A, 76: 042319, Oct 2007. 10.1103/PhysRevA.76.042319.
https://doi.org/10.1103/PhysRevA.76.042319
[32] Aaron Lye, Robert Wille, and Rolf Drechsler. Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits. In The 20th Asia and South Pacific Design Automation Conference, pages 178–183, 2015. 10.1109/ASPDAC.2015.7059001.
https://doi.org/10.1109/ASPDAC.2015.7059001
[33] Abhoy Kole, Kamalika Datta, and Indranil Sengupta. A heuristic for linear nearest neighbor realization of quantum circuits by swap gate insertion using $N$-gate lookahead. IEEE Trans. Emerg. Sel. Topics Circuits Syst., 6 (1): 62–72, 2016. 10.1109/JETCAS.2016.2528720.
https://doi.org/10.1109/JETCAS.2016.2528720
[34] Anirban Bhattacharjee, Chandan Bandyopadhyay, Robert Wille, Rolf Drechsler, and Hafizur Rahaman. A novel approach for nearest neighbor realization of 2D quantum circuits. In 2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pages 305–310, 2018. 10.1109/ISVLSI.2018.00063.
https://doi.org/10.1109/ISVLSI.2018.00063
[35] Azim Farghadan and Naser Mohammadzadeh. Mapping quantum circuits on 3D nearest-neighbor architectures. Quantum Sci. Technol., 4 (3): 035001, apr 2019. 10.1088/2058-9565/ab177a.
https://doi.org/10.1088/2058-9565/ab177a
[36] Lingling Lao and Dan E. Browne. 2QAN: A quantum compiler for 2-local qubit hamiltonian simulation algorithms. In Proceedings of the 49th Annual International Symposium on Computer Architecture, ISCA '22, page 351–365, New York, NY, USA, 2022. Association for Computing Machinery. ISBN 9781450386104. 10.1145/3470496.3527394.
https://doi.org/10.1145/3470496.3527394
[37] Yuwei Jin, Lucent Fong, Yanhao Chen, Ari B. Hayes, Shuo Zhang, Chi Zhang, Fei Hua, Zheng, and Zhang. A structured method for compilation of QAOA circuits in quantum computing. 2021. 10.48550/ARXIV.2112.06143.
https://doi.org/10.48550/ARXIV.2112.06143
[38] Mahabubul Alam, Abdullah Ash-Saki, and Swaroop Ghosh. Circuit compilation methodologies for quantum approximate optimization algorithm. In 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO), pages 215–228, 2020. 10.1109/MICRO50266.2020.00029.
https://doi.org/10.1109/MICRO50266.2020.00029
[39] Yuichi Hirata, Masaki Nakanishi, Shigeru Yamashita, and Yasuhiko Nakashima. An efficient method to convert arbitrary quantum circuits to ones on a linear nearest neighbor architecture. In 2009 Third International Conference on Quantum, Nano and Micro Technologies, pages 26–33, 2009. 10.1109/ICQNM.2009.25.
https://doi.org/10.1109/ICQNM.2009.25
[40] Loïc Henriet, Lucas Beguin, Adrien Signoles, Thierry Lahaye, Antoine Browaeys, Georges-Olivier Reymond, and Christophe Jurczak. Quantum computing with neutral atoms. Quantum, 4: 327, September 2020. ISSN 2521-327X. 10.22331/q-2020-09-21-327.
https://doi.org/10.22331/q-2020-09-21-327
[41] Seyon Sivarajah, Silas Dilkes, Alexander Cowtan, Will Simmons, Alec Edgington, and Ross Duncan. t$\vert$ket$\rangle$: a retargetable compiler for NISQ devices. Quantum Sci. Technol., 6 (1): 014003, nov 2020. 10.1088/2058-9565/ab8e92.
https://doi.org/10.1088/2058-9565/ab8e92
[42] Gushu Li, Yufei Ding, and Yuan Xie. Tackling the qubit mapping problem for NISQ-era quantum devices. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS '19, pages 1001–1014, New York, NY, USA, 2019. Association for Computing Machinery. ISBN 9781450362405. 10.1145/3297858.3304023.
https://doi.org/10.1145/3297858.3304023
[43] Johan Håstad. Some optimal inapproximability results. J. ACM, 48 (4): 798–859, 2001. 10.1145/502090.502098.
https://doi.org/10.1145/502090.502098
[44] Dorit Aharonov, Michael Ben-Or, Russell Impagliazzo, and Noam Nisan. Limitations of noisy reversible computation, 1996. URL https://arxiv.org/abs/quant-ph/9611028.
arXiv:quant-ph/9611028
[45] Daniel S. França and Raul García-Patrón. Limitations of optimization algorithms on noisy quantum devices. Nat. Phys., 17 (11): 1221–1227, Nov 2021. ISSN 1745-2481. 10.1038/s41567-021-01356-3.
https://doi.org/10.1038/s41567-021-01356-3
[46] Daochen Wang, Oscar Higgott, and Stephen Brierley. Accelerated variational quantum eigensolver. Phys. Rev. Lett., 122: 140504, Apr 2019. 10.1103/PhysRevLett.122.140504.
https://doi.org/10.1103/PhysRevLett.122.140504
[47] Aram W. Harrow and John C. Napp. Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms. Phys. Rev. Lett., 126: 140502, Apr 2021. 10.1103/PhysRevLett.126.140502.
https://doi.org/10.1103/PhysRevLett.126.140502
[48] Easwar Magesan, Jay M. Gambetta, and Joseph Emerson. Scalable and robust randomized benchmarking of quantum processes. Phys. Rev. Lett., 106: 180504, May 2011. 10.1103/PhysRevLett.106.180504.
https://doi.org/10.1103/PhysRevLett.106.180504
[49] Easwar Magesan, Jay M. Gambetta, and Joseph Emerson. Characterizing quantum gates via randomized benchmarking. Phys. Rev. A, 85: 042311, Apr 2012. 10.1103/PhysRevA.85.042311.
https://doi.org/10.1103/PhysRevA.85.042311
[50] Antonio D. Córcoles, Jay M. Gambetta, Jerry M. Chow, John A. Smolin, Matthew Ware, Joel Strand, Britton L. T. Plourde, and Matthias Steffen. Process verification of two-qubit quantum gates by randomized benchmarking. Phys. Rev. A, 87: 030301, Mar 2013. 10.1103/PhysRevA.87.030301.
https://doi.org/10.1103/PhysRevA.87.030301
[51] Alexander Erhard, Joel J. Wallman, Lukas Postler, Michael Meth, Roman Stricker, Esteban A. Martinez, Philipp Schindler, Thomas Monz, Joseph Emerson, and Rainer Blatt. Characterizing large-scale quantum computers via cycle benchmarking. Nat. Commun., 10 (1): 5347, Nov 2019. ISSN 2041-1723. 10.1038/s41467-019-13068-7.
https://doi.org/10.1038/s41467-019-13068-7
[52] Prakash Murali, David C. Mckay, Margaret Martonosi, and Ali Javadi-Abhari. Software mitigation of crosstalk on noisy intermediate-scale quantum computers. In Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS '20, pages 1001–1016, New York, NY, USA, 2020. Association for Computing Machinery. ISBN 9781450371025. 10.1145/3373376.3378477.
https://doi.org/10.1145/3373376.3378477
[53] Panos Aliferis and Andrew W. Cross. Subsystem fault tolerance with the Bacon-Shor code. Phys. Rev. Lett., 98: 220502, May 2007. 10.1103/PhysRevLett.98.220502.
https://doi.org/10.1103/PhysRevLett.98.220502
[54] Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland. Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A, 86: 032324, Sep 2012. 10.1103/PhysRevA.86.032324.
https://doi.org/10.1103/PhysRevA.86.032324
[55] Andrew Wack, Hanhee Paik, Ali Javadi-Abhari, Petar Jurcevic, Ismael Faro, Jay M. Gambetta, and Blake R. Johnson. Quality, speed, and scale: three key attributes to measure the performance of near-term quantum computers. 2021. 10.48550/ARXIV.2110.14108.
https://doi.org/10.48550/ARXIV.2110.14108
[56] Daniel J. Egger, Max Werninghaus, Marc Ganzhorn, Gian Salis, Andreas Fuhrer, Peter Müller, and Stefan Filipp. Pulsed reset protocol for fixed-frequency superconducting qubits. Phys. Rev. Applied, 10: 044030, Oct 2018. 10.1103/PhysRevApplied.10.044030.
https://doi.org/10.1103/PhysRevApplied.10.044030
[57] Max Werninghaus, Daniel J. Egger, Federico Roy, Shai Machnes, Frank K. Wilhelm, and Stefan Filipp. Leakage reduction in fast superconducting qubit gates via optimal control. npj Quantum Inf., 7, 2021. 10.1038/s41534-020-00346-2.
https://doi.org/10.1038/s41534-020-00346-2
[58] Susanna Kirchhoff, Torsten Keßler, Per J. Liebermann, Elie Assémat, Shai Machnes, Felix Motzoi, and Frank K. Wilhelm. Optimized cross-resonance gate for coupled transmon systems. Phys. Rev. A, 97: 042348, Apr 2018. 10.1103/PhysRevA.97.042348.
https://doi.org/10.1103/PhysRevA.97.042348
[59] Chad Rigetti and Michel Devoret. Fully microwave-tunable universal gates in superconducting qubits with linear couplings and fixed transition frequencies. Phys. Rev. B, 81: 134507, Apr 2010. 10.1103/PhysRevB.81.134507.
https://doi.org/10.1103/PhysRevB.81.134507
[60] Sarah Sheldon, Easwar Magesan, Jerry M. Chow, and Jay M. Gambetta. Procedure for systematically tuning up cross-talk in the cross-resonance gate. Phys. Rev. A, 93: 060302, Jun 2016. 10.1103/PhysRevA.93.060302.
https://doi.org/10.1103/PhysRevA.93.060302
[61] Matthew B. Hastings. Classical and quantum bounded depth approximation algorithms. Quantum Inf. Comput., 19, 2019. 10.26421/QIC19.13-14-3.
https://doi.org/10.26421/QIC19.13-14-3
[62] Sergey Bravyi, Alexander Kliesch, Robert Koenig, and Eugene Tang. Obstacles to variational quantum optimization from symmetry protection. Phys. Rev. Lett., 125: 260505, Dec 2020. 10.1103/PhysRevLett.125.260505.
https://doi.org/10.1103/PhysRevLett.125.260505
[63] Edward Farhi, David Gamarnik, and Sam Gutmann. The quantum approximate optimization algorithm needs to see the whole graph: A typical case. 2020. 10.48550/ARXIV.2005.08747.
https://doi.org/10.48550/ARXIV.2005.08747
[64] Kurtis Geerlings, Zaki Leghtas, Ioan M. Pop, Shyam Shankar, Luigi Frunzio, Robert J. Schoelkopf, Mazyar Mirrahimi, and Michel H. Devoret. Demonstrating a driven reset protocol for a superconducting qubit. Phys. Rev. Lett., 110: 120501, Mar 2013. 10.1103/PhysRevLett.110.120501.
https://doi.org/10.1103/PhysRevLett.110.120501
[65] Antonio D. Córcoles, Maika Takita, Ken Inoue, Scott Lekuch, Zlatko K. Minev, Jerry M. Chow, and Jay M. Gambetta. Exploiting dynamic quantum circuits in a quantum algorithm with superconducting qubits. Phys. Rev. Lett., 127: 100501, Aug 2021. 10.1103/PhysRevLett.127.100501.
https://doi.org/10.1103/PhysRevLett.127.100501
[66] Ryan Sweke, Frederik Wilde, Johannes Meyer, Maria Schuld, Paul K. Faehrmann, Barthélémy Meynard-Piganeau, and Jens Eisert. Stochastic gradient descent for hybrid quantum-classical optimization. Quantum, 4: 314, aug 2020. ISSN 2521-327X. 10.22331/q-2020-08-31-314.
https://doi.org/10.22331/q-2020-08-31-314
[67] Héctor Abraham and et al. Qiskit: An open-source framework for quantum computing. 2021. 10.5281/zenodo.2573505.
https://doi.org/10.5281/zenodo.2573505
[68] Gian Giacomo Guerreschi and Mikhail Smelyanskiy. Practical optimization for hybrid quantum-classical algorithms. 2017. 10.48550/ARXIV.1701.01450.
https://doi.org/10.48550/ARXIV.1701.01450
[69] Jonathan Romero, Ryan Babbush, Jarrod R. McClean, Cornelius Hempel, Peter J. Love, and Alán Aspuru-Guzik. Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz. Quantum Sci. Technol., 4 (1): 014008, oct 2018. 10.1088/2058-9565/aad3e4.
https://doi.org/10.1088/2058-9565/aad3e4
[70] Jonas M. Kübler, Andrew Arrasmith, Lukasz Cincio, and Patrick J. Coles. An adaptive optimizer for measurement-frugal variational algorithms. Quantum, 4: 263, May 2020. ISSN 2521-327X. 10.22331/q-2020-05-11-263.
https://doi.org/10.22331/q-2020-05-11-263
[71] Fernando G. S. L. Brandao, Michael Broughton, Edward Farhi, Sam Gutmann, and Hartmut Neven. For fixed control parameters the quantum approximate optimization algorithm's objective function value concentrates for typical instances, 2018.
[72] Stefan H. Sack and Maksym Serbyn. Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum, 5: 491, July 2021. ISSN 2521-327X. 10.22331/q-2021-07-01-491.
https://doi.org/10.22331/q-2021-07-01-491
[73] Gregory Quiroz, Paraj Titum, Phillip Lotshaw, Pavel Lougovski, Kevin Schultz, Eugene Dumitrescu, and Itay Hen. Quantifying the impact of precision errors on quantum approximate optimization algorithms. 2021. 10.48550/ARXIV.2109.04482.
https://doi.org/10.48550/ARXIV.2109.04482
[74] Julien Gacon, Christa Zoufal, Giuseppe Carleo, and Stefan Woerner. Simultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information. Quantum, 5: 567, October 2021. ISSN 2521-327X. 10.22331/q-2021-10-20-567.
https://doi.org/10.22331/q-2021-10-20-567
[75] Kristan Temme, Sergey Bravyi, and Jay M. Gambetta. Error mitigation for short-depth quantum circuits. Phys. Rev. Lett., 119: 180509, Nov 2017. 10.1103/PhysRevLett.119.180509.
https://doi.org/10.1103/PhysRevLett.119.180509
[76] Sanjeeb Dash and Jean-François Puget. On quadratic unconstrained binary optimization problems defined on chimera graphs. OPTIMA, 98, 2015. URL http://www.mathopt.org/Optima-Issues/optima98.pdf.
http://www.mathopt.org/Optima-Issues/optima98.pdf
[77] Alain Billionnet and Sourour Elloumi. Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem. Math. Program., 109 (1): 55–68, Jan 2007. ISSN 1436-4646. 10.1007/s10107-005-0637-9.
https://doi.org/10.1007/s10107-005-0637-9
[78] Vishwanathan Akshay, Daniil Rabinovich, Ernesto Campos, and Jacob Biamonte. Parameter concentrations in quantum approximate optimization. Phys. Rev. A, 104: L010401, Jul 2021. 10.1103/PhysRevA.104.L010401.
https://doi.org/10.1103/PhysRevA.104.L010401
[79] Alexey Galda, Xiaoyuan Liu, Danylo Lykov, Yuri Alexeev, and Ilya Safro. Transferability of optimal qaoa parameters between random graphs. pages 171–180, 2021. 10.1109/QCE52317.2021.00034.
https://doi.org/10.1109/QCE52317.2021.00034
[80] Michael Streif and Martin Leib. Training the quantum approximate optimization algorithm without access to a quantum processing unit. Quantum Sci. Technol., 5 (3): 034008, may 2020. 10.1088/2058-9565/ab8c2b.
https://doi.org/10.1088/2058-9565/ab8c2b
[81] Ruslan Shaydulin, Phillip C. Lotshaw, Jeffrey Larson, James Ostrowski, and Travis S. Humble. Parameter transfer for quantum approximate optimization of weighted MaxCut. 2022. 10.48550/ARXIV.2201.11785.
https://doi.org/10.48550/ARXIV.2201.11785
[82] James C. Spall. Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Trans. Autom. Control, 37 (3): 332–341, 1992. 10.1109/9.119632.
https://doi.org/10.1109/9.119632
[83] James C. Spall. Accelerated second-order stochastic optimization using only function measurements. In Proceedings of the 36th IEEE Conference on Decision and Control, volume 2, pages 1417–1424 vol.2, 1997. 10.1109/CDC.1997.657661.
https://doi.org/10.1109/CDC.1997.657661
[84] Nathan Earnest, Caroline Tornow, and Daniel J. Egger. Pulse-efficient circuit transpilation for quantum applications on cross-resonance-based hardware. Phys. Rev. Research, 3: 043088, Oct 2021. 10.1103/PhysRevResearch.3.043088.
https://doi.org/10.1103/PhysRevResearch.3.043088
[85] Panagiotis Kl. Barkoutsos, Giacomo Nannicini, Anton Robert, Ivano Tavernelli, and Stefan Woerner. Improving variational quantum optimization using CVaR. Quantum, 4: 256, Apr 2020. 10.22331/q-2020-04-20-256.
https://doi.org/10.22331/q-2020-04-20-256
[86] Sergey Bravyi, Sarah Sheldon, Abhinav Kandala, David C. McKay, and Jay M. Gambetta. Mitigating measurement errors in multiqubit experiments. Phys. Rev. A, 103: 042605, Apr 2021. 10.1103/PhysRevA.103.042605.
https://doi.org/10.1103/PhysRevA.103.042605
[87] George S. Barron and Christopher J. Wood. Measurement error mitigation for variational quantum algorithms, 2020.
[88] Michel X. Goemans and David P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42 (6): 1115–1145, nov 1995. 10.1145/227683.227684.
https://doi.org/10.1145/227683.227684
[89] Mario S. Könz, Wolfgang Lechner, Helmut G. Katzgraber, and Matthias Troyer. Embedding overhead scaling of optimization problems in quantum annealing. PRX Quantum, 2: 040322, Nov 2021. 10.1103/PRXQuantum.2.040322.
https://doi.org/10.1103/PRXQuantum.2.040322
[90] Akel Hashim, Rich Rines, Victory Omole, Ravi K. Naik, John Mark Kreikebaum, David I. Santiago, Frederic T. Chong, Irfan Siddiqi, and Pranav Gokhale. Optimized swap networks with equivalent circuit averaging for qaoa. Phys. Rev. Research, 4: 033028, Jul 2022. 10.1103/PhysRevResearch.4.033028.
https://doi.org/10.1103/PhysRevResearch.4.033028
[91] Gopal Chandra Santra, Fred Jendrzejewski, Philipp Hauke, and Daniel J. Egger. Squeezing and quantum approximate optimization. 2022. 10.48550/ARXIV.2205.10383.
https://doi.org/10.48550/ARXIV.2205.10383
[92] Phillip C. Lotshaw, Thien Nguyen, Anthony Santana, Alexander McCaskey, Rebekah Herrman, James Ostrowski, George Siopsis, and Travis S. Humble. Scaling quantum approximate optimization on near-term hardware. Scientific Reports, 12 (1): 12388, Jul 2022. 10.1038/s41598-022-14767-w.
https://doi.org/10.1038/s41598-022-14767-w
[93] Thomas Alexander, Naoki Kanazawa, Daniel J. Egger, Lauren Capelluto, Christopher J. Wood, Ali Javadi-Abhari, and David C. McKay. Qiskit pulse: programming quantum computers through the cloud with pulses. Quantum Sci. Technol., 5 (4): 044006, Aug 2020. 10.1088/2058-9565/aba404.
https://doi.org/10.1088/2058-9565/aba404
[94] John P. T. Stenger, Nicholas T. Bronn, Daniel J. Egger, and David Pekker. Simulating the dynamics of braiding of majorana zero modes using an ibm quantum computer. Phys. Rev. Research, 3: 033171, Aug 2021. 10.1103/PhysRevResearch.3.033171.
https://doi.org/10.1103/PhysRevResearch.3.033171
[95] P. Chandarana, N. N. Hegade, K. Paul, F. Albarrán-Arriagada, E. Solano, A. del Campo, and Xi Chen. Digitized-counterdiabatic quantum approximate optimization algorithm. Phys. Rev. Research, 4: 013141, Feb 2022. 10.1103/PhysRevResearch.4.013141.
https://doi.org/10.1103/PhysRevResearch.4.013141
[96] Jonathan Wurtz and Peter J. Love. Counterdiabaticity and the quantum approximate optimization algorithm. Quantum, 6: 635, jan 2022. 10.22331/q-2022-01-27-635.
https://doi.org/10.22331/q-2022-01-27-635
[97] Yuval R. Sanders, Dominic W. Berry, Pedro C.S. Costa, Louis W. Tessler, Nathan Wiebe, Craig Gidney, Hartmut Neven, and Ryan Babbush. Compilation of fault-tolerant quantum heuristics for combinatorial optimization. PRX Quantum, 1: 020312, Nov 2020. 10.1103/PRXQuantum.1.020312.
https://doi.org/10.1103/PRXQuantum.1.020312
[98] David Amaro, Carlo Modica, Matthias Rosenkranz, Mattia Fiorentini, Marcello Benedetti, and Michael Lubasch. Filtering variational quantum algorithms for combinatorial optimization. Quantum Sci. Technol., 7 (1): 015021, jan 2022. 10.1088/2058-9565/ac3e54.
https://doi.org/10.1088/2058-9565/ac3e54
[99] Daniel J. Egger, Jakub Mareček, and Stefan Woerner. Warm-starting quantum optimization. Quantum, 5: 479, Jun 2021. 10.22331/q-2021-06-17-479.
https://doi.org/10.22331/q-2021-06-17-479
[100] 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, jun 2022. 10.1145/3549554.
https://doi.org/10.1145/3549554
[101] Reuben Tate, Bryan Gard, Greg Mohler, and Swati Gupta. Classically-inspired mixers for QAOA beat Goemans-Williamson's Max-Cut at low circuit depths. 2021. 10.48550/ARXIV.2112.11354.
https://doi.org/10.48550/ARXIV.2112.11354
[102] Almudena Carrera Vazquez, Daniel J. Egger, David Ochsner, and Stefan Woerner. Well-conditioned multi-product formulas for hardware-friendly hamiltonian simulation. 2022. 10.48550/ARXIV.2207.11268.
https://doi.org/10.48550/ARXIV.2207.11268
[103] Youngseok Kim, Christopher J. Wood, Theodore J. Yoder, Seth T. Merkel, Jay M. Gambetta, Kristan Temme, and Abhinav Kandala. Scalable error mitigation for noisy quantum circuits produces competitive expectation values. 2021. 10.48550/ARXIV.2108.09197.
https://doi.org/10.48550/ARXIV.2108.09197
[104] Ewout van den Berg, Zlatko K. Minev, Abhinav Kandala, and Kristan Temme. Probabilistic error cancellation with sparse pauli-lindblad models on noisy quantum processors. 2022. 10.48550/ARXIV.2201.09866.
https://doi.org/10.48550/ARXIV.2201.09866
[105] Paul D. Nation, Hwajung Kang, Neereja Sundaresan, and Jay M. Gambetta. Scalable mitigation of measurement errors on quantum computers. PRX Quantum, 2: 040326, Nov 2021. 10.1103/PRXQuantum.2.040326.
https://doi.org/10.1103/PRXQuantum.2.040326
[106] Raban Iten, Romain Moyard, Tony Metger, David Sutter, and Stefan Woerner. Exact and practical pattern matching for quantum circuit optimization. ACM Transactions on Quantum Computing, 3 (1), jan 2022. ISSN 2643-6809. 10.1145/3498325.
https://doi.org/10.1145/3498325
[107] Sung-Pil Hong. Inapproximability of the max-cut problem with negative weights. Management Science and Financial Engineering, 14 (1): 87–90, 2008. URL https://koreascience.kr/article/JAKO200822179194611.page.
https://koreascience.kr/article/JAKO200822179194611.page
Cited by
[1] Shao-Hen Chiew, Kilian Poirier, Rajesh Mishra, Ulrike Bornheimer, Ewan Munro, Si Han Foon, Christopher Wanru Chen, Wei Sheng Lim, and Chee Wei Nga, "Multiobjective Optimization and Network Routing With Near-Term Quantum Computers", IEEE Transactions on Quantum Engineering 5, 1 (2024).
[2] Josh Cudby, James Bonfield, Chenxi Zhou, Richard Durbin, and Sergii Strelchuk, "Pangenome-guided sequence assembly via binary optimisation", (2025).
[3] Rishab Dutta, Brandon Allen, Chuzhi Xu, Nam P. Vu, Kun Liu, Fei Miao, Bing Wang, Amit Surana, Chen Wang, Yongshan Ding, and Victor S. Batista, "Solving Constrained Optimization Problems Using Hybrid Qubit-Qumode Quantum Devices", Journal of Chemical Theory and Computation 22 10, 5073 (2026).
[4] Arunita Das, Rebika Rai, Buddhadev Sasmal, Krishna Gopal Dhal, Ruba Abu Khurma, and Ramesh Saha, "Metaheuristic Algorithms Since 2020: Development, Taxonomy, Analysis, and Applications", Archives of Computational Methods in Engineering (2025).
[5] Diego Ibarra-Hoyos, Peter Connors, Ho Jang, Nathan Grain, Israel Klich, Gia-Wei Chern, Peter K. Liaw, John R. Scully, and Joseph Poon, "From Quantum Annealing to Alloy Discovery: Towards Accelerated Design of High-Entropy Alloys", (2025).
[6] Daniil Rabinovich, Andrey Kardashin, and Soumik Adhikary, "Role of overparametrization in quantum approximate optimization", Physical Review A 113 6, 062617 (2026).
[7] Chen Liyan, Lecture Notes in Electrical Engineering 1037, 441 (2023) ISBN:978-981-99-1982-6.
[8] Christoph Fleckenstein, Florian Dreier, Gregor Aigner, Michael Fellner, Reinhard Stahn, Martin Lanthaler, and Wolfgang Lechner, 2025 IEEE International Conference on Quantum Computing and Engineering (QCE) 394 (2025) ISBN:979-8-3315-5736-2.
[9] 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).
[10] Anita Weidinger, Glen Bigan Mbeng, Michael Fellner, Davit Khachatryan, and Wolfgang Lechner, "Performance of parity QAOA for the signed Max-Cut problem", New Journal of Physics 28 3, 034514 (2026).
[11] Hans M. Amman, "Signing Off", Computational Economics 68 1, 1 (2026).
[12] 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).
[13] Yanjun Ji, Xi Chen, Ilia Polian, and Yue Ban, "Algorithm-oriented qubit mapping for variational quantum algorithms", Physical Review Applied 23 3, 034022 (2025).
[14] Tom Krüger and Wolfgang Mauerer, "Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation", Quantum 9, 1903 (2025).
[15] Yanjun Ji, Kathrin F. Koenig, and Ilia Polian, "Improving the performance of digitized counterdiabatic quantum optimization via algorithm-oriented qubit mapping", Physical Review A 110 3, 032421 (2024).
[16] Filip B. Maciejewski, Stuart Hadfield, Benjamin Hall, Mark Hodson, Maxime Dupont, Bram Evert, James Sud, M. Sohaib Alam, Zhihui Wang, Stephen Jeffrey, Bhuvanesh Sundar, P. Aaron Lott, Shon Grabbe, Eleanor G. Rieffel, Matthew J. Reagor, and Davide Venturelli, "Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems", Physical Review Applied 22 4, 044074 (2024).
[17] Joris Kattemölle, "Edge coloring lattice graphs", Journal of Mathematical Physics 66 5, 051901 (2025).
[18] Friedrich Wagner, Daniel J. Egger, and Frauke Liers, "Optimized Noise Suppression for Quantum Circuits", INFORMS Journal on Computing 37 1, 22 (2025).
[19] Pranav Chandarana, Narendra N. Hegade, Iraitz Montalban, Enrique Solano, and Xi Chen, "Digitized Counterdiabatic Quantum Algorithm for Protein Folding", Physical Review Applied 20 1, 014024 (2023).
[20] Naeimeh Mohseni, Thomas Morstyn, Corey O’Meara, David Bucher, Jonas Nüßlein, and Giorgio Cortiana, "Evidence of quantum scaling advantage in approximate optimization for energy coalition formation with 100+ agents", Quantum Science and Technology 11 1, 015009 (2026).
[21] Ward van der Schoot, Robert Wezeman, Niels Neumann, Frank Phillipson, and Rob Kooij, 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) 941 (2024) ISBN:979-8-3315-4137-8.
[22] André Melo, Nathan Earnest-Noble, and Francesco Tacchino, "Pulse-efficient quantum machine learning", Quantum 7, 1130 (2023).
[23] Yuwei Jin, Fei Hua, Yanhao Chen, Ari Hayes, Chi Zhang, and Eddy Z. Zhang, Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 4 108 (2023) ISBN:9798400703942.
[24] Michael Renger, Jeroen Verjauw, Nicola Wurz, Amin Hosseinkhani, Caspar Ockeloen-Korppi, Wei Liu, Aniket Rath, Manish J. Thapa, Florian Vigneau, Elisabeth Wybo, Ville Bergholm, Chun Fai Chan, Bálint Csatári, Saga Dahl, Rakhim Davletkaliyev, Rakshyakar Giri, Daria Gusenkova, Hermanni Heimonen, Tuukka Hiltunen, Hao Hsu, Eric Hyyppä, Joni Ikonen, Tyler Jones, Shabeeb Khalid, Seung-Goo Kim, Miikka Koistinen, Anton Komlev, Janne Kotilahti, Vladimir Kukushkin, Julia Lamprich, Alessandro Landra, Lan-Hsuan Lee, Tianyi Li, Per Liebermann, Sourav Majumder, Janne Mäntylä, Fabian Marxer, Arianne Meijer - van de Griend, Vladimir Milchakov, Jakub Mrożek, Jayshankar Nath, Tuure Orell, Miha Papič, Matti Partanen, Alexander Plyushch, Stefan Pogorzalek, Jussi Ritvas, Pedro Figueroa Romero, Ville Sampo, Marko Seppälä, Ville Selinmaa, Linus Sundström, Ivan Takmakov, Brian Tarasinski, Jani Tuorila, Olli Tyrkkö, Alpo Välimaa, Jaap Wesdorp, Ping Yang, Liuqi Yu, Johannes Heinsoo, Antti Vepsäläinen, William Kindel, Hsiang-Sheng Ku, and Frank Deppe, "Superconducting qubit-resonator quantum processor with effective all-to-all connectivity", Physical Review Research 8 1, 013148 (2026).
[25] Ali Al-Bayaty and Marek Perkowski, "BHT-QAOA: The Generalization of Quantum Approximate Optimization Algorithm to Solve Arbitrary Boolean Problems as Hamiltonians", Entropy 26 10, 843 (2024).
[26] Almudena Carrera Vazquez, Daniel J. Egger, David Ochsner, and Stefan Woerner, "Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation", Quantum 7, 1067 (2023).
[27] Tahereh Abad, Yoni Schattner, Anton Frisk Kockum, and Göran Johansson, "Impact of decoherence on the fidelity of quantum gates leaving the computational subspace", Quantum 9, 1684 (2025).
[28] Yovav Tene-Cohen, Tomer Kelman, Ohad Lev, and Adi Makmal, "A Variational Qubit-Efficient MaxCut Heuristic Algorithm", npj Quantum Information 12 1, 50 (2026).
[29] 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).
[30] Gabriel Matos, Chris N. Self, Zlatko Papić, Konstantinos Meichanetzidis, and Henrik Dreyer, "Characterization of variational quantum algorithms using free fermions", Quantum 7, 966 (2023).
[31] Alberto Di Meglio, Karl Jansen, Ivano Tavernelli, Constantia Alexandrou, Srinivasan Arunachalam, Christian W. Bauer, Kerstin Borras, Stefano Carrazza, Arianna Crippa, Vincent Croft, Roland de Putter, Andrea Delgado, Vedran Dunjko, Daniel J. Egger, Elias Fernández-Combarro, Elina Fuchs, Lena Funcke, Daniel González-Cuadra, Michele Grossi, Jad C. Halimeh, Zoë Holmes, Stefan Kühn, Denis Lacroix, Randy Lewis, Donatella Lucchesi, Miriam Lucio Martinez, Federico Meloni, Antonio Mezzacapo, Simone Montangero, Lento Nagano, Vincent R. Pascuzzi, Voica Radescu, Enrique Rico Ortega, Alessandro Roggero, Julian Schuhmacher, Joao Seixas, Pietro Silvi, Panagiotis Spentzouris, Francesco Tacchino, Kristan Temme, Koji Terashi, Jordi Tura, Cenk Tüysüz, Sofia Vallecorsa, Uwe-Jens Wiese, Shinjae Yoo, and Jinglei Zhang, "Quantum Computing for High-Energy Physics: State of the Art and Challenges", PRX Quantum 5 3, 037001 (2024).
[32] Frederik Koch, Shahram Panahiyan, Rick Mukherjee, Joseph Doetsch, and Dieter Jaksch, "Resource-efficient quantum optimization via higher-order encoding", EPJ Quantum Technology 13 1, 59 (2026).
[33] Burhan Gülbahar, "Maximum-Likelihood Detection With QAOA for Massive MIMO and Sherrington-Kirkpatrick Model With Local Field at Infinite Size", IEEE Transactions on Wireless Communications 23 9, 11567 (2024).
[34] Vijendran V, Dax Enshan Koh, Eunok Bae, Hyukjoon Kwon, Ping Koy Lam, and Syed M Assad, "Near-Optimal Parameter Tuning of Level-1 QAOA for Ising Models", Quantum 10, 2158 (2026).
[35] Yahui Chai, Karl Jansen, Stefan Kühn, Tim Schwägerl, and Tobias Stollenwerk, "Warm start of variational quantum algorithms for quadratic unconstrained binary optimization problems", EPJ Quantum Technology 13 1, 9 (2026).
[36] Elijah Pelofske, Andreas Bärtschi, Lukasz Cincio, John Golden, and Stephan Eidenbenz, "Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs", npj Quantum Information 10 1, 109 (2024).
[37] Huijie Guan, Fei Zhou, Francisco Albarrán-Arriagada, Xi Chen, Enrique Solano, Narendra N Hegade, and He-Liang Huang, "Single-layer digitized-counterdiabatic quantum optimization for p-spin models", Quantum Science and Technology 10 1, 015006 (2025).
[38] Elijah Pelofske, Andreas Bärtschi, and Stephan Eidenbenz, Lecture Notes in Computer Science 13948, 240 (2023) ISBN:978-3-031-32040-8.
[39] Julien Rauch, Brice Chichereau, Stephane Vialle, Patrick Carribault, and Damien Rontani, 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) 199 (2024) ISBN:979-8-3315-4137-8.
[40] Atsushi MATSUO, Shigeru YAMASHITA, and Daniel J. EGGER, "A SAT Approach to the Initial Mapping Problem in SWAP Gate Insertion for Commuting Gates", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E106.A 11, 1424 (2023).
[41] 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).
[42] 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).
[43] Cenk Tüysüz, Giuseppe Clemente, Arianna Crippa, Tobias Hartung, Stefan Kühn, and Karl Jansen, "Classical splitting of parametrized quantum circuits", Quantum Machine Intelligence 5 2, 34 (2023).
[44] Juan Borge, Unai Aseguinolaza, Nahual Sobrino, Gabriel Sobrino, and Joaquim Jornet-Somoza, "Error Estimation in Current Noisy Quantum Computers", (2023).
[45] Dilnoz Muhamediyeva, P. Stanimirović, A. Stupina, and I. Kovalev, "Quantum optimization methods in energy systems", ITM Web of Conferences 59, 01009 (2024).
[46] Tiffany Khou and Christopher Stuetzle, Quantum Computing in Medicine 71 (2026) ISBN:9780443341939.
[47] Yanjun Ji, Marco Roth, David A. Kreplin, Ilia Polian, and Frank K. Wilhelm, "Data-efficient quantum noise modeling via machine learning", Physical Review Applied 25 3, 034051 (2026).
[48] Maxime Dupont, Bhuvanesh Sundar, Bram Evert, David E. Bernal Neira, Zedong Peng, Stephen Jeffrey, and Mark J. Hodson, "Benchmarking quantum optimization for the maximum-cut problem on a superconducting quantum computer", Physical Review Applied 23 1, 014045 (2025).
[49] 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).
[50] Jonathan Wurtz, Stefan H. Sack, and Sheng-Tao Wang, "Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms", IEEE Transactions on Quantum Engineering 5, 1 (2024).
[51] Maxime Dupont, Tina Oberoi, and Bhuvanesh Sundar, "Optimization via quantum preconditioning", Physical Review Applied 24 4, 044013 (2025).
[52] Burhan Gülbahar, "Majority Voting With Recursive QAOA and Cost-Restricted Uniform Sampling for Maximum-Likelihood Detection in Massive MIMO", IEEE Transactions on Wireless Communications 24 3, 2620 (2025).
[53] Phillip C. Lotshaw, Kevin D. Battles, Bryan Gard, Gilles Buchs, Travis S. Humble, and Creston D. Herold, "Modeling noise in global Mølmer-Sørensen interactions applied to quantum approximate optimization", Physical Review A 107 6, 062406 (2023).
[54] Phillip C. Lotshaw, Hanjing Xu, Bilal Khalid, Gilles Buchs, Travis S. Humble, and Arnab Banerjee, "Simulations of frustrated Ising Hamiltonians using quantum approximate optimization", Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 381 2241, 20210414 (2023).
[55] Mara Vizzuso, Gianluca Passarelli, Giovanni Cantele, and Procolo Lucignano, "Convergence of digitized-counterdiabatic QAOA: circuit depth versus free parameters", New Journal of Physics 26 1, 013002 (2024).
[56] 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).
[57] 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).
[58] Manish Kesarwani and Jayant R. Haritsa, "Index Advisors on Quantum Platforms", Proceedings of the VLDB Endowment 17 11, 3615 (2024).
[59] Joshua A. C. Behler, Ali F. Al-Ramadan, Betis Baheri, Michael L. Collard, Qiang Guan, and Jonathan I. Maletic, "Static Analysis and Transformation for Quantum Programming Languages [Focus: Quantum Software and Its Engineering]", IEEE Software 42 5, 58 (2025).
[60] Massimiliano Cutugno, Annarita Giani, Paul Alsing, Laura Wessing, and Austar Schnore, "Quantum Computing Approaches for Mission Covering Optimization", Algorithms 15 7, 224 (2022).
[61] 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).
[62] Benjamin Rempfer and Kevin M. Obenland, 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) 583 (2024) ISBN:979-8-3315-4137-8.
[63] Zheng-Hang Sun, Yong-Yi Wang, Yu-Ran Zhang, Franco Nori, and Heng Fan, "Variational generation of spin squeezing on one-dimensional quantum devices with nearest-neighbor interactions", Physical Review Research 5 4, 043285 (2023).
[64] Daniel J. Egger, Chiara Capecci, Bibek Pokharel, Panagiotis Kl. Barkoutsos, Laurin E. Fischer, Leonardo Guidoni, and Ivano Tavernelli, "Pulse variational quantum eigensolver on cross-resonance-based hardware", Physical Review Research 5 3, 033159 (2023).
[65] Florian Ginzel, Michael Fellner, Christian Ertler, Lars R. Schreiber, Hendrik Bluhm, and Wolfgang Lechner, "Scalable parity architecture with a shuttling-based spin qubit processor", Physical Review B 110 7, 075302 (2024).
[66] Gopal Chandra Santra, Sudipto Singha Roy, Daniel J. Egger, and Philipp Hauke, "Genuine multipartite entanglement in quantum optimization", Physical Review A 111 2, 022434 (2025).
[67] Yuxiang Liu, Yinuo Qian, Lu Wang, Zaichen Zhang, and Xutao Yu, "Rapidly trainable and shallow-compiled quantum approximate optimization algorithm for maximum likelihood detection", Physics Letters A 548, 130541 (2025).
[68] M. A. Maltseva, E. Blanzieri, and A. S. Rumyantsev, "Quantum Circuit Optimization Via Graph Partitioning by Quantum Annealing", Lobachevskii Journal of Mathematics 45 10, 5126 (2024).
[69] Simon Thelen and Wolfgang Mauerer, 2025 IEEE International Conference on Quantum Computing and Engineering (QCE) 591 (2025) ISBN:979-8-3315-5736-2.
[70] 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).
[71] Blas Trigueros, Pedro Juan Roig, Salvador Alcaraz, and Katja Gilly, 2026 International Conference on Integrated Intelligence and Cognitive Engineering (ICIICE) 1 (2026) ISBN:979-8-3315-4531-4.
[72] Berend Klaver, Stefan M. A. Rombouts, Michael Fellner, Anette Messinger, Kilian Ender, Katharina Ludwig, and Wolfgang Lechner, "SWAP-less implementation of quantum algorithms", Physical Review A 113 1, 012443 (2026).
[73] Elijah Pelofske, Andreas Bärtschi, John Golden, and Stephan Eidenbenz, 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) 506 (2023) ISBN:979-8-3503-4323-6.
[74] Unai Aseguinolaza, Nahual Sobrino, Gabriel Sobrino, Joaquim Jornet-Somoza, and Juan Borge, "Error estimation in current noisy quantum computers", Quantum Information Processing 23 5, 181 (2024).
[75] Daniil Rabinovich, Ernesto Campos, Soumik Adhikary, Ekaterina Pankovets, Dmitry Vinichenko, and Jacob Biamonte, "Robustness of variational quantum algorithms against stochastic parameter perturbation", Physical Review A 109 4, 042426 (2024).
[76] Conrad J. Haupt and Daniel J. Egger, "Leakage in restless quantum gate calibration", Physical Review A 108 2, 022614 (2023).
[77] 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).
[78] Gopal Chandra Santra, Fred Jendrzejewski, Philipp Hauke, and Daniel J. Egger, "Squeezing and quantum approximate optimization", Physical Review A 109 1, 012413 (2024).
[79] Yuwei Jin, Xiangyu Gao, Minghao Guo, Henry Chen, Fei Hua, Chi Zhang, and Eddy Z. Zhang, SC24: International Conference for High Performance Computing, Networking, Storage and Analysis 1 (2024) ISBN:979-8-3503-5291-7.
[80] Ivelina Stoyanova, Orkun Şensebat, Yanjun Ji, Priyanka Arkalgud Ganeshamurthy, Sonja Kajganic, Dennis Willsch, and Antonello Monti, 2025 IEEE PES Innovative Smart Grid Technologies Conference Europe (ISGT Europe) 1 (2025) ISBN:979-8-3315-2503-3.
[81] Josh Cudby, James Bonfield, Chenxi Zhou, Richard Durbin, and Sergii Strelchuk, "Pangenome-guided sequence assembly via binary optimization", Briefings in Bioinformatics 27 1, bbag084 (2026).
[82] Oumayma Bouchmal, Bruno Cimoli, Ripalta Stabile, Juan Jose Vegas Olmos, and Idelfonso Tafur Monroy, "Quantum Approximate Optimization Algorithm applied to multi-objective routing for large scale 6G networks", Computer Networks 267, 111345 (2025).
[83] Natasha Sachdeva, Gavin S Hartnett, Smarak Maity, Samuel Marsh, Yulun Wang, Adam Winick, Ryan Dougherty, Daniel Canuto, You Quan Chong, G Adam Cox, Michael Hush, Pranav S Mundada, Christopher D B Bentley, Michael J Biercuk, and Yuval Baum, "Integrated error-suppressed pipeline for quantum optimization of nontrivial binary combinatorial optimization problems on gate-model hardware at the 156-qubit scale", New Journal of Physics 28 6, 064506 (2026).
[84] Diego Ibarra-Hoyos, Peter F. Connors, Ho Jang, Nathan Grain, Israel Klich, Gia-Wei Chern, Peter K. Liaw, John R. Scully, and Joseph Poon, "Quantum-annealed machine learning discovers ductile, high strength and corrosion-resistant high-entropy alloy", npj Computational Materials 12 1, 159 (2026).
[85] Thorsten Koch, David E. Bernal Neira, Ying Chen, Giorgio Cortiana, Daniel J. Egger, Raoul Heese, Narendra N. Hegade, Alejandro Gomez Cadavid, Rhea Huang, Toshinari Itoko, Thomas Kleinert, Pedro Maciel Xavier, Naeimeh Mohseni, Jhon A. Montanez-Barrera, Koji Nakano, Giacomo Nannicini, Corey O’Meara, Justin Pauckert, Manuel Proissl, Anurag Ramesh, Maximilian Schicker, Noriaki Shimada, Mitsuharu Takeori, Víctor Valls, David Van Bulck, Stefan Woerner, and Christa Zoufal, "The Quantum Optimization Benchmarking Library", Nature Computational Science 6 6, 653 (2026).
[86] Sabina Drăgoi, Alberto Baiardi, and Daniel J. Egger, "Approximate quadratization of high-order Hamiltonians for combinatorial quantum optimization", Physical Review Research 8 2, 023159 (2026).
[87] Philippe Poulin, Simon R. Cowell, and Valeriu Beiu, Springer Proceedings in Mathematics & Statistics 446, 195 (2024) ISBN:978-3-031-52964-1.
[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] Maxime Dupont, Bram Evert, Mark J. Hodson, Bhuvanesh Sundar, Stephen Jeffrey, Yuki Yamaguchi, Dennis Feng, Filip B. Maciejewski, Stuart Hadfield, M. Sohaib Alam, Zhihui Wang, Shon Grabbe, P. Aaron Lott, Eleanor G. Rieffel, Davide Venturelli, and Matthew J. Reagor, "Quantum-enhanced greedy combinatorial optimization solver", Science Advances 9 45, eadi0487 (2023).
[90] Hao Zhong and Qi Zhang, "Penalty-enhanced quantum approximate optimization algorithm framework for maximization and minimization problems", Theoretical Computer Science 1061, 115649 (2026).
[91] Nahual Sobrino, Unai Aseginolaza, Joaquim Jornet-Somoza, and Juan Borge, "A useful metric for the NISQ era: Qubit error probability and its role in zero noise extrapolation", AVS Quantum Science 8 1, 013803 (2026).
[92] Leonid Abdurakhimov, Janos Adam, Hasnain Ahmad, Olli Ahonen, Manuel Algaba, Guillermo Alonso, Ville Bergholm, Rohit Beriwal, Matthias Beuerle, Clinton Bockstiegel, Alessio Calzona, Chun Fai Chan, Daniele Cucurachi, Saga Dahl, Rakhim Davletkaliyev, Olexiy Fedorets, Alejandro Gomez Frieiro, Zheming Gao, Johan Guldmyr, Andrew Guthrie, Juha Hassel, Hermanni Heimonen, Johannes Heinsoo, Tuukka Hiltunen, Keiran Holland, Juho Hotari, Hao Hsu, Antti Huhtala, Eric Hyyppä, Aleksi Hämäläinen, Joni Ikonen, Sinan Inel, David Janzso, Teemu Jaakkola, Mate Jenei, Shan Jolin, Kristinn Juliusson, Jaakko Jussila, Shabeeb Khalid, Seung-Goo Kim, Miikka Koistinen, Roope Kokkoniemi, Anton Komlev, Caspar Ockeloen-Korppi, Otto Koskinen, Janne Kotilahti, Toivo Kuisma, Vladimir Kukushkin, Kari Kumpulainen, Ilari Kuronen, Joonas Kylmälä, Niclas Lamponen, Julia Lamprich, Alessandro Landra, Martin Leib, Tianyi Li, Per Liebermann, Aleksi Lintunen, Wei Liu, Jürgen Luus, Fabian Marxer, Arianne Meijer-van de Griend, Kunal Mitra, Jalil Khatibi Moqadam, Jakub Mrożek, Henrikki Mäkynen, Janne Mäntylä, Tiina Naaranoja, Francesco Nappi, Janne Niemi, Lucas Ortega, Mario Palma, Miha Papič, Matti Partanen, Jari Penttilä, Alexander Plyushch, Wei Qiu, Aniket Rath, Kari Repo, Tomi Riipinen, Jussi Ritvas, Pedro Figueroa Romero, Jarkko Ruoho, Jukka Räbinä, Sampo Saarinen, Indrajeet Sagar, Hayk Sargsyan, Matthew Sarsby, Niko Savola, Mykhailo Savytskyi, Ville Selinmaa, Pavel Smirnov, Marco Marín Suárez, Linus Sundström, Sandra Słupińska, Eelis Takala, Ivan Takmakov, Brian Tarasinski, Manish Thapa, Jukka Tiainen, Francesca Tosto, Jani Tuorila, Carlos Valenzuela, David Vasey, Edwin Vehmaanperä, Antti Vepsäläinen, Aapo Vienamo, Panu Vesanen, Alpo Välimaa, Jaap Wesdorp, Nicola Wurz, Elisabeth Wybo, Lily Yang, and Ali Yurtalan, "Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer", arXiv:2408.12433, (2024).
[93] Yue Yao, Yuqing Wang, Jixin Shi, Bo Liang, and Yixiang Shi, "A Novel Multi-Physics Coupled 10-Cell Stack Numerical Model for Microtubular Solid Oxide Fuel Cell Based on Single Rectangle Current Collector", Quantum Science and Technology 11 1, 79 (2026).
[94] Maxime Dupont, Nicolas Didier, Mark J. Hodson, Joel E. Moore, and Matthew J. Reagor, "Entanglement perspective on the quantum approximate optimization algorithm", Physical Review A 106 2, 022423 (2022).
[95] Laurin E. Fischer, Daniel Miller, Francesco Tacchino, Panagiotis Kl. Barkoutsos, Daniel J. Egger, and Ivano Tavernelli, "Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space", Physical Review Research 4 3, 033027 (2022).
[96] Laurin E. Fischer, "Enabling large-scale digital quantum simulations with superconducting qubits", arXiv:2602.04719, (2026).
[97] Nishant Jain, Brian Coyle, Elham Kashefi, and Niraj Kumar, "Graph neural network initialisation of quantum approximate optimisation", Quantum 6, 861 (2022).
[98] Jacob L. Scott, Zhongtian Dong, Taejoon Kim, Kyoungchul Kong, and Myeonghun Park, "Hybrid quantum-classical approach for combinatorial problems at hadron colliders", arXiv:2410.22417, (2024).
[99] Maxime Dupont, Nicolas Didier, Mark J. Hodson, Joel E. Moore, and Matthew J. Reagor, "Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm", PRX Quantum 3 4, 040339 (2022).
[100] Zeynab Kaseb, Matthias Moller, Peter Palensky, and Pedro P. Vergara, "Performance Comparison of Gate-Based and Adiabatic Quantum Computing for AC Power Flow Problem", arXiv:2510.13378, (2025).
[101] Cenk Tüysüz, Giuseppe Clemente, Arianna Crippa, Tobias Hartung, Stefan Kühn, and Karl Jansen, "Classical Splitting of Parametrized Quantum Circuits", arXiv:2206.09641, (2022).
[102] Josh Cudby and Sergii Strelchuk, "Nonvariational quantum optimisation approaches to pangenome-guided sequence assembly", arXiv:2604.06106, (2026).
[103] Friedrich Wagner, Daniel J. Egger, and Frauke Liers, "Optimized Noise Suppression for Quantum Circuits", arXiv:2401.06423, (2024).
[104] Moritz Stargalla and Friedrich Wagner, "Optimized Qubit Routing for Commuting Gates via Integer Programming", arXiv:2507.12199, (2025).
[105] 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).
[106] Christos Aravanis, Georgios Korpas, and Jakub Marecek, "Transpiling Quantum Circuits using the Pentagon Equation", arXiv:2209.14356, (2022).
[107] Josh Cudby, James Bonfield, Chenxi Zhou, Richard Durbin, and Sergii Strelchuk, "Pangenome-guided sequence assembly via binary optimisation", arXiv:2508.08200, (2025).
[108] Yuwei Jin, Jason Luo, Lucent Fong, Yanhao Chen, Ari B. Hayes, Chi Zhang, Fei Hua, and Eddy Z. Zhang, "A Structured Method for Compilation of QAOA Circuits in Quantum Computing", arXiv:2112.06143, (2021).
[109] Hugo José Ribeiro, "Empirical Evaluation of QAOA with Zero Noise Extrapolation on NISQ Hardware for Carbon Credit Portfolio Optimization in the Brazilian Cerrado", arXiv:2602.09047, (2026).
[110] Fernando Alonso, Colomán Samprón, Jacobo Veiga, Mariamo Mussa Juane, and Andrés Gómez, "Benchmark of Pauli Correlation Encoding for different optimisation problems", arXiv:2606.18914, (2026).
[111] Elijah Pelofske, Andreas Bärtschi, John Golden, and Stephan Eidenbenz, "High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices", arXiv:2306.03238, (2023).
[112] Daniele Loco, Kisa Barkemeyer, Andre R. R. Carvalho, and Jean-Philip Piquemal, "Practical protein-pocket hydration-site prediction for drug discovery on a quantum computer", arXiv:2512.08390, (2025).
[113] Diego Ibarra-Hoyos, Peter Connors, Ho Jang, Nathan Grain, Israel Klich, Gia-Wei Chern, Peter K. Liaw, John R. Scully, and Joseph Poon, "From Quantum Annealing to Alloy Discovery: Towards Accelerated Design of High-Entropy Alloys", arXiv:2511.05750, (2025).
[114] András Czégel, Dávid Sipos, and Boglárka G. -Tóth, "A quantum-classical hybrid branch & bound algorithm", arXiv:2511.19501, (2025).
The above citations are from Crossref's cited-by service (last updated successfully 2026-07-16 20:47:53) and SAO/NASA ADS (last updated successfully 2026-07-16 20:48:02). The list may be incomplete as not all publishers provide suitable and complete citation data.
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.