aiqbench analysis
This research presents a significant algorithmic breakthrough for quantum chemistry by achieving sublinear simulation depth for atomic orbital models using the Fast Multipole Method and shallow Fourier circuits. The approach successfully matches the optimal gate scaling of $N^{5/3}$ while avoiding ancilla qubits, directly addressing previous limitations in handling complex Hamiltonian structures on near-term hardware.
Sublinear-depth Quantum Simulation of Electrons with Atomic Orbitals
arXiv:2610.00950v1 Announce Type: new 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.
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.
arXiv:2610.00950 [quant-ph]
(or arXiv:2610.00950v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.00950 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 242 words
Related coverage
Running Variational Quantum Eigensolver with Qiskit Aer on AMD Instinct
AMD · May 29, 2026
Top Silicon Spin Quantum Computing Companies 2026: Complete Vendor Guide
Quantum Zeitgeist · Jun 9, 2026

Realizing the fermionic Laughlin state on a trapped-ion quantum processor
AWS · Jun 9, 2026

Trapped Ions Demonstrate First Digital Fermionic Laughlin State
Quantum Zeitgeist · Jun 10, 2026