Quantum conjugate gradient method using the positive-side quantum eigenvalue transformation
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_ | 1866914752976912384 |
|---|---|
| author | Toyoizumi, Kiichiro Wada, Kaito Yamamoto, Naoki Hoshino, Kazuo |
| author_facet | Toyoizumi, Kiichiro Wada, Kaito Yamamoto, Naoki Hoshino, Kazuo |
| contents | Quantum algorithms are still challenging to solve linear systems of equations on real devices. This challenge arises from the need for deep circuits and numerous ancilla qubits. We introduce the quantum conjugate gradient (QCG) method using the quantum eigenvalue transformation (QET). The circuit depth of this algorithm depends on the square root of the coefficient matrix's condition number $κ$, representing a square root improvement compared to the previous quantum algorithms, while the total query complexity worsens. The number of ancilla qubits is constant, similar to other QET-based algorithms. Additionally, to implement the QCG method efficiently, we devise a QET-based technique that uses only the positive side of the polynomial (denoted by $P(x)$ for $x\in[0,1]$). We conduct numerical experiments by applying our algorithm to the one-dimensional Poisson equation and successfully solve it. Based on the numerical results, our algorithm significantly improves circuit depth, outperforming another QET-based algorithm by three to four orders of magnitude. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_02713 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum conjugate gradient method using the positive-side quantum eigenvalue transformation Toyoizumi, Kiichiro Wada, Kaito Yamamoto, Naoki Hoshino, Kazuo Quantum Physics Quantum algorithms are still challenging to solve linear systems of equations on real devices. This challenge arises from the need for deep circuits and numerous ancilla qubits. We introduce the quantum conjugate gradient (QCG) method using the quantum eigenvalue transformation (QET). The circuit depth of this algorithm depends on the square root of the coefficient matrix's condition number $κ$, representing a square root improvement compared to the previous quantum algorithms, while the total query complexity worsens. The number of ancilla qubits is constant, similar to other QET-based algorithms. Additionally, to implement the QCG method efficiently, we devise a QET-based technique that uses only the positive side of the polynomial (denoted by $P(x)$ for $x\in[0,1]$). We conduct numerical experiments by applying our algorithm to the one-dimensional Poisson equation and successfully solve it. Based on the numerical results, our algorithm significantly improves circuit depth, outperforming another QET-based algorithm by three to four orders of magnitude. |
| title | Quantum conjugate gradient method using the positive-side quantum eigenvalue transformation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2404.02713 |