Hybrid Quantum-Classical Algorithm for Hamiltonian Simulation
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913011592069120 |
|---|---|
| author | Nghiem, Nhat A. Wei, Tzu-Chieh |
| author_facet | Nghiem, Nhat A. Wei, Tzu-Chieh |
| contents | We introduce a hybrid classical-quantum algorithm for simulating a Hamiltonian of the form $H= \sum_{i=1}^K H_i = \sum_{i=1}^K H_{i_1} \otimes H_{i_2} \otimes \cdots \otimes H_{i_M}$. Given that the entries of all $\{ H_{i_1}, H_{i_2} , \cdots , H_{i_M}\}$ (for all $i$) are classically known, we present a procedure (with three variants) in which these operators are classically diagonalized, and then this information is fed into three possible quantum procedures to obtain the block-encoding of $H$. The evolution operator $\exp(-iHt)$ is then obtained using the standard block-encoding/quantum singular value transformation framework. In the case where $\{H_i\}_{i=1}^K$ commute pairwise, our method can be trivially extended to the case with time-dependent coefficients. We provide a detailed discussion of the efficient regime of our hybrid framework and compare it with existing quantum simulation algorithms. Our algorithm can serve as a useful complement to existing quantum simulation algorithms, thereby expanding the reach of quantum computers for practically simulating physical systems. As a side contribution, we will show how the recent technique called \textit{randomized truncation to a quantum state} developed by Harrow, Lowe, and Witteveen [arXiv preprint arXiv:2510.08518, 2025] can be applied to the context of quantum simulation and particularly quantum state preparation, for which the latter can be of independent interest. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_05881 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Hybrid Quantum-Classical Algorithm for Hamiltonian Simulation Nghiem, Nhat A. Wei, Tzu-Chieh Quantum Physics We introduce a hybrid classical-quantum algorithm for simulating a Hamiltonian of the form $H= \sum_{i=1}^K H_i = \sum_{i=1}^K H_{i_1} \otimes H_{i_2} \otimes \cdots \otimes H_{i_M}$. Given that the entries of all $\{ H_{i_1}, H_{i_2} , \cdots , H_{i_M}\}$ (for all $i$) are classically known, we present a procedure (with three variants) in which these operators are classically diagonalized, and then this information is fed into three possible quantum procedures to obtain the block-encoding of $H$. The evolution operator $\exp(-iHt)$ is then obtained using the standard block-encoding/quantum singular value transformation framework. In the case where $\{H_i\}_{i=1}^K$ commute pairwise, our method can be trivially extended to the case with time-dependent coefficients. We provide a detailed discussion of the efficient regime of our hybrid framework and compare it with existing quantum simulation algorithms. Our algorithm can serve as a useful complement to existing quantum simulation algorithms, thereby expanding the reach of quantum computers for practically simulating physical systems. As a side contribution, we will show how the recent technique called \textit{randomized truncation to a quantum state} developed by Harrow, Lowe, and Witteveen [arXiv preprint arXiv:2510.08518, 2025] can be applied to the context of quantum simulation and particularly quantum state preparation, for which the latter can be of independent interest. |
| title | Hybrid Quantum-Classical Algorithm for Hamiltonian Simulation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2604.05881 |