Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2601.18060 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912971791269888 |
|---|---|
| author | Boabang, Francis Gyamerah, Samuel Asante |
| author_facet | Boabang, Francis Gyamerah, Samuel Asante |
| contents | Variational Quantum Algorithms are a vital part of quantum computing. It is a blend of quantum and classical methods for tackling tough problems in machine learning, chemistry, and combinatorial optimization. Yet as these algorithms scale up, they cannot escape the barren-plateau phenomenon. As systems grow, gradients can vanish so quickly that training deep or randomly initialized circuits becomes nearly impossible. To overcome the barren plateau problem, we introduce a two-stage optimization framework. First comes the convex initialization stage. Here, we shape the quantum energy landscape, the Hilmaton landscape, into a smooth, low-energy basin. This step makes gradients easier to spot and keeps noise from derailing the process. Once we have gotten a stable gradient flow, we move to the second stage: nonconvex refinement. In this phase, we let the algorithm wander through different energy minima, making the model more expressive. We show that our proposed algorithm theoretically reduces the dependence on the condition number of the underlying quantum least squares approximate matrix via Riemannian manifold optimization. Finally, we used our two-stage solution to perform quantum cryptanalysis of quantum key distribution protocol (i.e., BB84) to determine the optimal cloning strategies. The simulation results showed that our proposed two-stage solution outperforms its random initialization counterpart. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_18060 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Overcoming Barren Plateaus in Variational Quantum Circuits using a Two-Step Least Squares Approach Boabang, Francis Gyamerah, Samuel Asante Quantum Physics Information Theory Variational Quantum Algorithms are a vital part of quantum computing. It is a blend of quantum and classical methods for tackling tough problems in machine learning, chemistry, and combinatorial optimization. Yet as these algorithms scale up, they cannot escape the barren-plateau phenomenon. As systems grow, gradients can vanish so quickly that training deep or randomly initialized circuits becomes nearly impossible. To overcome the barren plateau problem, we introduce a two-stage optimization framework. First comes the convex initialization stage. Here, we shape the quantum energy landscape, the Hilmaton landscape, into a smooth, low-energy basin. This step makes gradients easier to spot and keeps noise from derailing the process. Once we have gotten a stable gradient flow, we move to the second stage: nonconvex refinement. In this phase, we let the algorithm wander through different energy minima, making the model more expressive. We show that our proposed algorithm theoretically reduces the dependence on the condition number of the underlying quantum least squares approximate matrix via Riemannian manifold optimization. Finally, we used our two-stage solution to perform quantum cryptanalysis of quantum key distribution protocol (i.e., BB84) to determine the optimal cloning strategies. The simulation results showed that our proposed two-stage solution outperforms its random initialization counterpart. |
| title | Overcoming Barren Plateaus in Variational Quantum Circuits using a Two-Step Least Squares Approach |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2601.18060 |