Hybrid Quantum-Classical Algorithm for Hamiltonian Simulation
Nhat A. Nghiem, Tzu-Chieh Wei

TL;DR
This paper presents a hybrid classical-quantum algorithm for Hamiltonian simulation that diagonalizes operators classically and then uses quantum procedures to simulate evolution, expanding quantum simulation capabilities.
Contribution
It introduces a novel hybrid framework combining classical diagonalization with quantum block-encoding for Hamiltonian simulation, including variants and efficiency analysis.
Findings
The algorithm can simulate Hamiltonians with pairwise commuting operators.
It extends to time-dependent coefficients in certain cases.
Comparison shows advantages over existing quantum simulation algorithms.
Abstract
We introduce a hybrid classical-quantum algorithm for simulating a Hamiltonian of the form . Given that the entries of all (for all ) 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 . The evolution operator is then obtained using the standard block-encoding/quantum singular value transformation framework. In the case where 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
