|
| | | | |
| | | |
| Stat |
Members: 3669
Articles: 2'599'751
Articles rated: 2609
16 March 2025 |
|
| | | | |
|
Article overview
| |
|
|
Exact and efficient Lanczos method on a quantum computer | | William Kirby
; Mario Motta
; Antonio Mezzacapo
; | | Date: |
1 Aug 2022 | | Abstract: | We present an algorithm that uses block encoding on a quantum computer to
exactly construct a Krylov space, which can be used as the basis for the
Lanczos method to estimate extremal eigenvalues of Hamiltonians. While the
classical Lanczos method has exponential cost in the system size to represent
the Krylov states for quantum systems, our efficient quantum algorithm achieves
this in polynomial time and memory. The construction presented is exact in the
sense that the resulting Krylov space is identical to that of the Lanczos
method, so the only approximation with respect to the Lanczos method is due to
finite sample noise. This is possible because, unlike previous quantum versions
of the Lanczos method, our algorithm does not require simulating real or
imaginary time evolution. We provide an explicit error bound for the resulting
ground state energy estimate in the presence of noise. For this method to be
successful, the only requirement on the input problem is that the overlap of
the initial state with the true ground state must be $Omega(1/ ext{poly}(n))$
for $n$ qubits. | | Source: | arXiv, 2208.00567 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER