Scaling Quantum Algorithms via Dissipation: Avoiding Barren Plateaus
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909696028311552 |
|---|---|
| author | Zapusek, Elias Rojkov, Ivan Reiter, Florentin |
| author_facet | Zapusek, Elias Rojkov, Ivan Reiter, Florentin |
| contents | Variational quantum algorithms (VQAs) have enabled a wide range of applications on near-term quantum devices. However, their scalability is fundamentally limited by barren plateaus, where the probability of encountering large gradients vanishes exponentially with system size. In addition, noise induces barren plateaus, deterministically flattening the cost landscape. Dissipative quantum algorithms that leverage nonunitary dynamics to prepare quantum states via engineered cooling offer a complementary framework with remarkable robustness to noise. We demonstrate that dissipative quantum algorithms based on non-unital channels can avoid both unitary and noise-induced barren plateaus. Periodically resetting ancillary qubits actively extracts entropy from the system, maintaining gradient magnitudes and enabling scalable optimization. We provide analytic conditions ensuring they remain trainable even in the presence of noise. Numerical simulations confirm our predictions and illustrate scenarios where unitary algorithms fail but dissipative algorithms succeed. Our framework positions dissipative quantum algorithms as a scalable, noise-resilient alternative to traditional VQAs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_02043 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Scaling Quantum Algorithms via Dissipation: Avoiding Barren Plateaus Zapusek, Elias Rojkov, Ivan Reiter, Florentin Quantum Physics Variational quantum algorithms (VQAs) have enabled a wide range of applications on near-term quantum devices. However, their scalability is fundamentally limited by barren plateaus, where the probability of encountering large gradients vanishes exponentially with system size. In addition, noise induces barren plateaus, deterministically flattening the cost landscape. Dissipative quantum algorithms that leverage nonunitary dynamics to prepare quantum states via engineered cooling offer a complementary framework with remarkable robustness to noise. We demonstrate that dissipative quantum algorithms based on non-unital channels can avoid both unitary and noise-induced barren plateaus. Periodically resetting ancillary qubits actively extracts entropy from the system, maintaining gradient magnitudes and enabling scalable optimization. We provide analytic conditions ensuring they remain trainable even in the presence of noise. Numerical simulations confirm our predictions and illustrate scenarios where unitary algorithms fail but dissipative algorithms succeed. Our framework positions dissipative quantum algorithms as a scalable, noise-resilient alternative to traditional VQAs. |
| title | Scaling Quantum Algorithms via Dissipation: Avoiding Barren Plateaus |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2507.02043 |