Salvato in:
| Autori principali: | , , , , , , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2508.02578 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917224280752128 |
|---|---|
| author | Piccinelli, Samuele Baiardi, Alberto Barison, Stefano Rossmannek, Max Vazquez, Almudena Carrera Tacchino, Francesco Mensa, Stefano Altamura, Edoardo Alavi, Ali Motta, Mario Robledo-Moreno, Javier Kirby, William Sharma, Kunal Mezzacapo, Antonio Tavernelli, Ivano |
| author_facet | Piccinelli, Samuele Baiardi, Alberto Barison, Stefano Rossmannek, Max Vazquez, Almudena Carrera Tacchino, Francesco Mensa, Stefano Altamura, Edoardo Alavi, Ali Motta, Mario Robledo-Moreno, Javier Kirby, William Sharma, Kunal Mezzacapo, Antonio Tavernelli, Ivano |
| contents | Quantum algorithms based on classical processing of individual samples have recently emerged as the most effective and robust methods to approximate ground-state wave functions of many-body quantum systems on pre-fault-tolerant and early-fault-tolerant quantum devices. In these algorithms, the quantum computer acts as a sampling engine that generates the subspace in which the Hamiltonian is classically diagonalized. The recently proposed Sample-based Krylov Quantum Diagonalization (SKQD), uses quantum Krylov states as circuits from which samples are collected. Convergence guarantees can be derived for SKQD under similar assumptions to those of quantum phase estimation, provided that the ground-state wave function is well approximated by a polynomial subset of the full Hilbert space. However, implementations of SKQD for complex many-body Hamiltonians, such as quantum chemistry ones, are limited by the depths of time-evolution circuits needed to generate Krylov vectors. In this work, we introduce a method that combines SKQD with a qDRIFT randomized compilation of the Hamiltonian propagator. The resulting algorithm, termed SqDRIFT, enables quantum chemistry experiments on quantum processors, while preserving the convergence guarantees similar to the phase estimation algorithm. We demonstrate its viability by applying SqDRIFT to calculate the electronic ground-state energy of several polycyclic aromatic hydrocarbons, up to system sizes beyond the reach of exact diagonalization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_02578 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum chemistry with provable convergence via randomized sample-based Krylov quantum diagonalization Piccinelli, Samuele Baiardi, Alberto Barison, Stefano Rossmannek, Max Vazquez, Almudena Carrera Tacchino, Francesco Mensa, Stefano Altamura, Edoardo Alavi, Ali Motta, Mario Robledo-Moreno, Javier Kirby, William Sharma, Kunal Mezzacapo, Antonio Tavernelli, Ivano Quantum Physics Chemical Physics Quantum algorithms based on classical processing of individual samples have recently emerged as the most effective and robust methods to approximate ground-state wave functions of many-body quantum systems on pre-fault-tolerant and early-fault-tolerant quantum devices. In these algorithms, the quantum computer acts as a sampling engine that generates the subspace in which the Hamiltonian is classically diagonalized. The recently proposed Sample-based Krylov Quantum Diagonalization (SKQD), uses quantum Krylov states as circuits from which samples are collected. Convergence guarantees can be derived for SKQD under similar assumptions to those of quantum phase estimation, provided that the ground-state wave function is well approximated by a polynomial subset of the full Hilbert space. However, implementations of SKQD for complex many-body Hamiltonians, such as quantum chemistry ones, are limited by the depths of time-evolution circuits needed to generate Krylov vectors. In this work, we introduce a method that combines SKQD with a qDRIFT randomized compilation of the Hamiltonian propagator. The resulting algorithm, termed SqDRIFT, enables quantum chemistry experiments on quantum processors, while preserving the convergence guarantees similar to the phase estimation algorithm. We demonstrate its viability by applying SqDRIFT to calculate the electronic ground-state energy of several polycyclic aromatic hydrocarbons, up to system sizes beyond the reach of exact diagonalization. |
| title | Quantum chemistry with provable convergence via randomized sample-based Krylov quantum diagonalization |
| topic | Quantum Physics Chemical Physics |
| url | https://arxiv.org/abs/2508.02578 |