Quantum block Krylov subspace projector algorithm for computing low-lying eigenenergies
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915635959693312 |
|---|---|
| author | Oliveira, Maria Gabriela Jordão Glaser, Nina |
| author_facet | Oliveira, Maria Gabriela Jordão Glaser, Nina |
| contents | Computing eigenvalues is a computationally intensive task central to numerous applications in the natural sciences. Toward this end, we investigate the quantum block Krylov subspace projector (QBKSP) algorithm - a multireference quantum Lanczos method designed to accurately compute low-lying eigenenergies, including degenerate ones, of quantum systems. We present three compact quantum circuits tailored to different problem settings for evaluating the required expectation values. To assess the impact of the number and fidelity of initial reference states, as well as time evolution duration, we perform error-free and limited-precision numerical simulations and quantum circuit simulations. Our results show that using multiple reference states significantly enhances convergence, particularly in precision-limited scenarios and in cases where a single reference state fails to capture all target eigenvalues. Additionally, the QBKSP algorithm allows for the determination of degenerate eigenstates and their multiplicities through appropriate convergence conditions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_09971 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum block Krylov subspace projector algorithm for computing low-lying eigenenergies Oliveira, Maria Gabriela Jordão Glaser, Nina Quantum Physics Chemical Physics Computational Physics Computing eigenvalues is a computationally intensive task central to numerous applications in the natural sciences. Toward this end, we investigate the quantum block Krylov subspace projector (QBKSP) algorithm - a multireference quantum Lanczos method designed to accurately compute low-lying eigenenergies, including degenerate ones, of quantum systems. We present three compact quantum circuits tailored to different problem settings for evaluating the required expectation values. To assess the impact of the number and fidelity of initial reference states, as well as time evolution duration, we perform error-free and limited-precision numerical simulations and quantum circuit simulations. Our results show that using multiple reference states significantly enhances convergence, particularly in precision-limited scenarios and in cases where a single reference state fails to capture all target eigenvalues. Additionally, the QBKSP algorithm allows for the determination of degenerate eigenstates and their multiplicities through appropriate convergence conditions. |
| title | Quantum block Krylov subspace projector algorithm for computing low-lying eigenenergies |
| topic | Quantum Physics Chemical Physics Computational Physics |
| url | https://arxiv.org/abs/2506.09971 |