aiqbench analysis
This research introduces a generalized spin-boson mapping that allows for the efficient evaluation of Quantum Approximate Optimization Algorithm (QAOA) energies at high depths using tensor networks, overcoming previous computational bottlenecks in analyzing large-scale spin glass problems. While this analytical framework significantly expands our ability to predict performance metrics for deep circuits, it clarifies that classical simulation alone cannot yet replace the need for actual quantum hardware to sample final bitstrings. The findings provide a crucial theoretical foundation for understanding many-body physics in QAOA and guide future strategies for optimizing angles on intractable problem instances.
Decoupling of the QAOA into independent spin-boson systems and high-depth performance on pure and mixed spin glasses
arXiv:2609.40309v1 Announce Type: new Abstract: The Quantum Approximate Optimization Algorithm (QAOA) is regarded as a promising candidate for near-term quantum advantage in combinatorial optimization, yet our ability to study it at scale is limited. Exact recursive formulas have been introduced for predicting QAOA performance on large spin glasses, but the computational cost of evaluating them grows exponentially with the number of QAOA layers, preventing the study of QAOA in the promising high-depth regime. In this work, we show that for the task of computing QAOA energy on any mixed dense spin glass problem, spins approximately decouple into independent spin-boson systems. In the infinite-size limit, the decoupling becomes exact, establishing the spin-boson mapping as a natural framework for the many-body physics of QAOA. This generalized spin-boson mapping gives a recursive procedure for computing QAOA energies that can be executed at modest cost using tensor networks. As a numerical application, we optimize QAOA on pure and mixed spin glasses at depths intractable for prior techniques, observing that higher-degree problems require more layers for a comparable approximation ratio while angle optimization becomes more challenging. While decoupling enables the evaluations of QAOA energies at large size and depth, it does not enable strong simulation of QAOA; a quantum computer is required to sample the bitstring corresponding to the predicted energy.
Abstract:The Quantum Approximate Optimization Algorithm (QAOA) is regarded as a promising candidate for near-term quantum advantage in combinatorial optimization, yet our ability to study it at scale is limited. Exact recursive formulas have been introduced for predicting QAOA performance on large spin glasses, but the computational cost of evaluating them grows exponentially with the number of QAOA layers, preventing the study of QAOA in the promising high-depth regime. In this work, we show that for the task of computing QAOA energy on any mixed dense spin glass problem, spins approximately decouple into independent spin-boson systems. In the infinite-size limit, the decoupling becomes exact, establishing the spin-boson mapping as a natural framework for the many-body physics of QAOA. This generalized spin-boson mapping gives a recursive procedure for computing QAOA energies that can be executed at modest cost using tensor networks. As a numerical application, we optimize QAOA on pure and mixed spin glasses at depths intractable for prior techniques, observing that higher-degree problems require more layers for a comparable approximation ratio while angle optimization becomes more challenging. While decoupling enables the evaluations of QAOA energies at large size and depth, it does not enable strong simulation of QAOA; a quantum computer is required to sample the bitstring corresponding to the predicted energy.
arXiv:2609.40309 [quant-ph]
(or arXiv:2609.40309v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.40309 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 302 words
Related coverage

News
Quantum Computing Report · Jun 7, 2026

News
Quantum Computing Report · Jul 25, 2026

Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
Quantum Journal · Oct 13, 2026

Top Superconducting Quantum Computing Companies 2026: Complete Vendor Guide
Quantum Zeitgeist · May 27, 2026