Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2206.10576 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916455168081920 |
|---|---|
| author | Borle, Ajinkya Lomonaco, Samuel J. |
| author_facet | Borle, Ajinkya Lomonaco, Samuel J. |
| contents | With the increasing popularity of quantum computing and in particular quantum annealing, there has been growing research to evaluate the meta-heuristic for various problems in linear algebra: from linear least squares to matrix and tensor factorization. At the core of this effort is to evaluate quantum annealing for solving linear least squares and linear systems of equations. In this work, we focus on the viability of using quantum annealing for solving these problems. We use simulations based on the adiabatic principle to provide new insights for previously observed phenomena with the D-wave machines, such as quantum annealing being robust against ill-conditioned systems of equations and scaling quite well against the number of rows in a system. We then propose a hybrid approach which uses a quantum annealer to provide a initial guess of the solution $x_0$, which would then be iteratively improved with classical fixed point iteration methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_10576 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | How viable is quantum annealing for solving linear algebra problems? Borle, Ajinkya Lomonaco, Samuel J. Quantum Physics With the increasing popularity of quantum computing and in particular quantum annealing, there has been growing research to evaluate the meta-heuristic for various problems in linear algebra: from linear least squares to matrix and tensor factorization. At the core of this effort is to evaluate quantum annealing for solving linear least squares and linear systems of equations. In this work, we focus on the viability of using quantum annealing for solving these problems. We use simulations based on the adiabatic principle to provide new insights for previously observed phenomena with the D-wave machines, such as quantum annealing being robust against ill-conditioned systems of equations and scaling quite well against the number of rows in a system. We then propose a hybrid approach which uses a quantum annealer to provide a initial guess of the solution $x_0$, which would then be iteratively improved with classical fixed point iteration methods. |
| title | How viable is quantum annealing for solving linear algebra problems? |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2206.10576 |