Compressed sensing enhanced by quantum approximate optimization algorithm
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912146938396672 |
|---|---|
| author | Chevalier, Baptiste Roga, Wojciech Takeoka, Masahiro |
| author_facet | Chevalier, Baptiste Roga, Wojciech Takeoka, Masahiro |
| contents | We present a framework to deal with a range of large scale compressive sensing problems using a quantum subroutine. We apply a quantum approximate optimization algorithm (QAOA) to support detection in a sparse signal reconstruction algorithm: matching pursuit. The constrained optimization required in this algorithm is difficult to handle when the size of the problem is large and constraints are given by unstructured patterns. Our framework utilizes specially designed structured constraints that are easy to manipulate and reduce the optimization problem to the solution of an Ising model which can be found using Ising solvers. In this research, we test the performance of QAOA for this purpose on a simulator of quantum computer. We observe that our method can outperform reference classical methods. Our results explore a promising path of applying quantum computers in the compressive sensing field. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_17399 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Compressed sensing enhanced by quantum approximate optimization algorithm Chevalier, Baptiste Roga, Wojciech Takeoka, Masahiro Quantum Physics We present a framework to deal with a range of large scale compressive sensing problems using a quantum subroutine. We apply a quantum approximate optimization algorithm (QAOA) to support detection in a sparse signal reconstruction algorithm: matching pursuit. The constrained optimization required in this algorithm is difficult to handle when the size of the problem is large and constraints are given by unstructured patterns. Our framework utilizes specially designed structured constraints that are easy to manipulate and reduce the optimization problem to the solution of an Ising model which can be found using Ising solvers. In this research, we test the performance of QAOA for this purpose on a simulator of quantum computer. We observe that our method can outperform reference classical methods. Our results explore a promising path of applying quantum computers in the compressive sensing field. |
| title | Compressed sensing enhanced by quantum approximate optimization algorithm |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2403.17399 |