Stochastic noise can be helpful for variational quantum algorithms
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908375475814400 |
|---|---|
| author | Liu, Junyu Wilde, Frederik Mele, Antonio Anna Jin, Xin Jiang, Liang Eisert, Jens |
| author_facet | Liu, Junyu Wilde, Frederik Mele, Antonio Anna Jin, Xin Jiang, Liang Eisert, Jens |
| contents | Saddle points constitute a crucial challenge for first-order gradient descent algorithms. In notions of classical machine learning, they are avoided for example by means of stochastic gradient descent methods. In this work, we provide evidence that the saddle points problem can be naturally avoided in variational quantum algorithms by exploiting the presence of stochasticity. We prove convergence guarantees and present practical examples in numerical simulations and on quantum hardware. We argue that the natural stochasticity of variational algorithms can be beneficial for avoiding strict saddle points, i.e., those saddle points with at least one negative Hessian eigenvalue. This insight that some levels of shot noise could help is expected to add a new perspective to notions of near-term variational quantum algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2210_06723 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Stochastic noise can be helpful for variational quantum algorithms Liu, Junyu Wilde, Frederik Mele, Antonio Anna Jin, Xin Jiang, Liang Eisert, Jens Quantum Physics Machine Learning Saddle points constitute a crucial challenge for first-order gradient descent algorithms. In notions of classical machine learning, they are avoided for example by means of stochastic gradient descent methods. In this work, we provide evidence that the saddle points problem can be naturally avoided in variational quantum algorithms by exploiting the presence of stochasticity. We prove convergence guarantees and present practical examples in numerical simulations and on quantum hardware. We argue that the natural stochasticity of variational algorithms can be beneficial for avoiding strict saddle points, i.e., those saddle points with at least one negative Hessian eigenvalue. This insight that some levels of shot noise could help is expected to add a new perspective to notions of near-term variational quantum algorithms. |
| title | Stochastic noise can be helpful for variational quantum algorithms |
| topic | Quantum Physics Machine Learning |
| url | https://arxiv.org/abs/2210.06723 |