arXiv:2610.00950
Sublinear-depth Quantum Simulation of Electrons with Atomic Orbitals
Jakob Günther, Aram W. Harrow
Abstract
Discretizing electronic degrees of freedom into atomic orbitals is the default choice to accurately model electrons in molecules in a compact and flexible way. We consider the task of simulating such electronic structure models on a quantum computer for $N$ orbitals, keeping the number of orbitals per atom constant. Atomic orbitals give rise to Hamiltonians with potentially up to $\mathcal{O}(N^4)$ terms and little structure, which made it challenging to match the complexity of methods based on plane waves and real-space grids. In this work, we show that a Trotter step for atomic orbitals can be implemented in depth $\mathcal{O}(\mathrm{polylog}(N))$ without ancillas by combining a rigorous treatment of orbital localization, a hierarchical Hamiltonian decomposition based on the Fast Multipole Method, and shallow quantum Fourier arithmetic circuits. By bounding the Trotter error, we obtain sublinear simulation depth, and our total gate count $N^{5/3 + o(1)}$ matches the best scaling known for any basis.
AI Summary
The paper asks whether electronic-structure Hamiltonians in atomic-orbital bases can match the system-size scaling available for plane-wave and real-space representations. It studies the thermodynamic limit with $N$ orbitals, a constant number of orbitals per atom, minimum nuclear separation, exponential orbital localization, and an overlap-matrix eigenvalue bounded below independently of $N$. The construction first proves that Löwdin orthogonalization preserves exponential localization under these assumptions. Truncating orbital support at radius $O(\log(N/\epsilon))$ produces sparse orbital-pair overlaps. A Fast Multipole Method–inspired hierarchical decomposition then expresses long-range Coulomb interactions through multipole operators, requiring expansion degree $O(\log(N/\epsilon))$. Edge coloring reduces these operators to one-sparse pieces. Their products are implemented using shallow Fourier-arithmetic circuits for rank-one $ZZ$ interactions, with dirty workspace borrowed from idle system qubits. A Trotter stage has depth $O(\operatorname{polylog}(Nt/\epsilon))$. Combining this implementation with nested-commutator error bounds and optimized higher-order product formulas gives gate count $N^{(2d-1)/d}t(Nt/\epsilon)^{o(1)}$ and depth $N^{(d-1)/d}t(Nt/\epsilon)^{o(1)}$, without additional ancillas. In three dimensions, these become $N^{5/3+o(1)}$ gates and $N^{2/3+o(1)}$ depth for fixed time and accuracy, matching the best stated gate-count scaling across bases. The analysis excludes increasing basis resolution at fixed atom count. Uniform overlap conditioning remains an assumption, with a sufficient bound proved for sufficiently separated orbitals. Constants, logarithmic overheads, and practical crossover sizes are not evaluated.
Error found: The abstract omits the uniform localization, separation, and Gram-conditioning assumptions required by the body’s simulation theorem; constant orbitals per atom alone is insufficient. The short-range implementation treats potentially non-Hermitian products T_pq T_rs as individual simulation terms, although grouping each with its adjoint repairs this without changing the asymptotic scaling.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.