EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm

Anuj Apte, Shree Hari Sureshbabu, Ruslan Shaydulin, Sami Boulebnane, Zichang He, Dylan Herman, James Sud, Marco Pistoia

ACM Transactions on Quantum Computing · 31.12.2026 · 7 (4) · 1-18

DOI: 10.1145/3815778 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Quantum Computing, online erschienen am 10.08.2026. Verfasst von Anuj Apte und 7 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 66 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum heuristic with empirical evidence of speedup over classical state-of-the-art for some problems. QAOA uses a parameterized circuit with p layers, where higher p yields better solutions, but requires optimizing 2p independent parameters, which is challenging at large p . We present an iterative interpolation method that exploits the smoothness of optimal parameter schedules by expressing them in a basis of orthogonal functions, generalizing the work of Zhou et al. By optimizing a small number of basis coefficients and iteratively increasing both circuit depth and coefficient count until convergence, our method constructs high-quality schedules for large p . We provide theoretical justification using Jackson’s theorem and Lipschitz continuity to bound the required number of basis coefficients for a given accuracy. Our approach achieves better performance with fewer optimization steps than existing methods across three benchmark problems: the Sherrington-Kirkpatrick (SK) model, portfolio optimization, and Low Autocorrelation Binary Sequences (LABS). For the largest LABS instance, we achieve near-optimal merit factors with schedules exceeding 1,000 layers, an order of magnitude beyond previous methods. Additionally, we observe that a mild growth in QAOA depth suffices to solve the SK model exactly, a result of independent theoretical interest.

Zitieren

APA

Apte, A., Sureshbabu, S. H., Shaydulin, R., Boulebnane, S., He, Z., Herman, D., Sud, J., & Pistoia, M. (2026). Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm. ACM Transactions on Quantum Computing, 7(4), 1-18. https://doi.org/10.1145/3815778

Vancouver

Apte A, Sureshbabu SH, Shaydulin R, Boulebnane S, He Z, Herman D, et al. Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm. ACM Transactions on Quantum Computing. 2026;7(4):1-18. doi:10.1145/3815778

BibTeX
@article{Apte2026,
  author = {Apte, Anuj and Sureshbabu, Shree Hari and Shaydulin, Ruslan and Boulebnane, Sami and He, Zichang and Herman, Dylan and Sud, James and Pistoia, Marco},
  title = {Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm},
  journal = {ACM Transactions on Quantum Computing},
  year = {2026},
  volume = {7},
  number = {4},
  pages = {1--18},
  doi = {10.1145/3815778}
}
Kostenlos starten →