Surrogate optimization of variational quantum circuits
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_ | 1866914740536606720 |
|---|---|
| author | Gustafson, Erik J. Tiihonen, Juha Chamaki, Diana Sorourifar, Farshud Mullinax, J. Wayne Li, Andy C. Y. Maciejewski, Filip B. Sawaya, Nicolas PD Krogel, Jaron T. Neira, David E. Bernal Tubman, Norm M. |
| author_facet | Gustafson, Erik J. Tiihonen, Juha Chamaki, Diana Sorourifar, Farshud Mullinax, J. Wayne Li, Andy C. Y. Maciejewski, Filip B. Sawaya, Nicolas PD Krogel, Jaron T. Neira, David E. Bernal Tubman, Norm M. |
| contents | Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_02951 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Surrogate optimization of variational quantum circuits Gustafson, Erik J. Tiihonen, Juha Chamaki, Diana Sorourifar, Farshud Mullinax, J. Wayne Li, Andy C. Y. Maciejewski, Filip B. Sawaya, Nicolas PD Krogel, Jaron T. Neira, David E. Bernal Tubman, Norm M. Quantum Physics Strongly Correlated Electrons Chemical Physics Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits. |
| title | Surrogate optimization of variational quantum circuits |
| topic | Quantum Physics Strongly Correlated Electrons Chemical Physics |
| url | https://arxiv.org/abs/2404.02951 |