Parts | Days | Selection | Search | Updates | Downloads | Help
THU: Thursday Contributed Sessions
THU 13: Poster Session: Applications
THU 13.5: Poster
Thursday, September 11, 2025, 16:30–18:30, ZHG Foyer 1. OG
A Near-Constant-Depth Quantum Algorithm for Quantum Chemistry — •Yu Wang1, Martina Nibbi1, Maxine Luo3,4, and Christian Mendl1,2 — 1Technical University of Munich, CIT, Department of Computer Science, Boltzmannstrasse 3, 85748 Garching, Germany — 2Technical University of Munich, Institute for Advanced Study, Lichtenbergstrasse 2a, 85748 Garching, Germany — 3Max Planck Institute of Quantum Optics, Hans-Kopfermann-Strasse 1, 85748 Garching, Germany — 4Munich Center for Quantum Science and Technology, Schellingstrasse 4, 80799 Munich, Germany
In this work, we present an efficient quantum algorithm for simulating time evolution in quantum chemistry. Its circuit depth scales logarithmically with the system size, which can be viewed as effectively constant for large molecules. The approach is inspired by the fast multipole method, in which we aggregate the one-to-one interactions between grids in two regions into region-to-region interactions. Following this strategy and assuming a two-dimensional structured quantum computer, we estimate the number of electrons in each area and then compute the corresponding time evolution when working with the discretized form of the electronic Hamiltonian. Moreover, the estimation of electron numbers can be implemented in constant depth if the fan-out gate is available, which is realized in recent experiments on various hardware platforms. Consequently, the circuit depth for a single-step time evolution simulation is determined by the number of levels that scale logarithmically in the fast multipole method.
Keywords: Quantum algorithm; Quantum chemistry