Ground State Preparation via Qubitization
Charles Marteau

TL;DR
This paper introduces a quantum algorithm leveraging qubitization to efficiently prepare the ground state of a Hamiltonian by approximating imaginary time evolution, demonstrated on specific models.
Contribution
It presents a novel quantum protocol combining qubitization and Chebyshev polynomial expansion for ground state preparation.
Findings
Successfully prepares ground states of models tested
Uses qubitization to implement imaginary time evolution
Achieves projection onto ground state with initial overlap
Abstract
We describe a protocol for preparing the ground state of a Hamiltonian on a quantum computer. This is done by designing a quantum algorithm that implements the imaginary time evolution operator: . The method relies on the so-called ``qubitization'' procedure of Low and Chuang which, assuming the existence of a unitary encoding of the Hamiltonian , produces a new operator whose moments are the Chebyshev polynomials of when projected on . Using this result and the expansion of in terms of Chebyshev polynomials we construct a circuit that implements an approximation of the imaginary time evolution operator which, at large time, projects any state on the ground state, provided a non-trivial initial overlap between the two. We illustrate our method on two models: the transverse field Ising model and a single…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum many-body systems
