Provable avoidance of barren plateaus for the Quantum Approximate Optimization Algorithm with Grover mixers
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914084972134400 |
|---|---|
| author | Tsvelikhovskiy, Boris Nuyten, Matthew Bakalov, Bojko N. |
| author_facet | Tsvelikhovskiy, Boris Nuyten, Matthew Bakalov, Bojko N. |
| contents | We analyze the dynamical Lie algebras (DLAs) associated with the Grover-mixer variant of the Quantum Approximate Optimization Algorithm (GM-QAOA). When the initial state is the uniform superposition of computational basis states, we show that the corresponding DLA is isomorphic to $\mathfrak{su}(d) \oplus \mathfrak{u}(1)\oplus \mathfrak{u}(1)$, where $d$ denotes the number of distinct values of the objective function. We also establish an analogous result for other choices of initial states and Grover-type mixers. Furthermore, we prove that the DLA of GM-QAOA has the largest possible commutant among all QAOA variants initialized with the same state, corresponding physically to the maximal set of conserved quantities. We derive an explicit formula for the variance of the GM-QAOA loss function in terms of the objective function values, and we show that for a broad class of optimization problems, GM-QAOA with sufficiently many layers avoids barren plateaus. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_10424 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Provable avoidance of barren plateaus for the Quantum Approximate Optimization Algorithm with Grover mixers Tsvelikhovskiy, Boris Nuyten, Matthew Bakalov, Bojko N. Quantum Physics We analyze the dynamical Lie algebras (DLAs) associated with the Grover-mixer variant of the Quantum Approximate Optimization Algorithm (GM-QAOA). When the initial state is the uniform superposition of computational basis states, we show that the corresponding DLA is isomorphic to $\mathfrak{su}(d) \oplus \mathfrak{u}(1)\oplus \mathfrak{u}(1)$, where $d$ denotes the number of distinct values of the objective function. We also establish an analogous result for other choices of initial states and Grover-type mixers. Furthermore, we prove that the DLA of GM-QAOA has the largest possible commutant among all QAOA variants initialized with the same state, corresponding physically to the maximal set of conserved quantities. We derive an explicit formula for the variance of the GM-QAOA loss function in terms of the objective function values, and we show that for a broad class of optimization problems, GM-QAOA with sufficiently many layers avoids barren plateaus. |
| title | Provable avoidance of barren plateaus for the Quantum Approximate Optimization Algorithm with Grover mixers |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2509.10424 |