Multi-level quantum signal processing with applications to ground state preparation using fast-forwarded Hamiltonian evolution
Yulong Dong, Lin Lin

TL;DR
This paper introduces a multi-level quantum signal processing algorithm that efficiently prepares ground states of Hamiltonians by leveraging fast-forwarded Hamiltonian evolution, surpassing traditional methods in query complexity.
Contribution
Develops a novel multi-level QSP algorithm that exploits fast-forwarding to reduce the cost of ground state preparation, eliminating the need for PREPARE oracle construction.
Findings
Achieves a query complexity of O(log(||H||/Δ)) with fast-forwarding.
Matches LCU approach efficiency when ideal fast-forwarding is available.
Reduces the implementation cost of single qubit rotations.
Abstract
The preparation of the ground state of a Hamiltonian with a large spectral radius has applications in many areas such as electronic structure theory and quantum field theory. Given an initial state with a constant overlap with the ground state, and assuming that the Hamiltonian can be efficiently simulated with an ideal fast-forwarding protocol, we first demonstrate that employing a linear combination of unitaries (LCU) approach can prepare the ground state at a cost of queries to controlled Hamiltonian evolution. Here is the spectral radius of and the spectral gap. However, traditional Quantum Signal Processing (QSP)-based methods fail to capitalize on this efficient protocol, and its cost scales as . To bridge this gap, we develop a multi-level QSP-based algorithm that exploits the…
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.
Taxonomy
TopicsSpectroscopy and Quantum Chemical Studies · Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography
