Polylogarithmic-Depth Quantum Algorithm for Simulating the Extended Hubbard Model on a Two-Dimensional Lattice Using the Fast Multipole Method

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Wang, Yu, Nibbi, Martina, Luo, Maxine, Le, Isabel Nha Minh, Chen, Yanbin, Cirac, J. Ignacio, Mendl, Christian B.
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866908719645720576
author Wang, Yu
Nibbi, Martina
Luo, Maxine
Le, Isabel Nha Minh
Chen, Yanbin
Cirac, J. Ignacio
Mendl, Christian B.
author_facet Wang, Yu
Nibbi, Martina
Luo, Maxine
Le, Isabel Nha Minh
Chen, Yanbin
Cirac, J. Ignacio
Mendl, Christian B.
contents The extended Hubbard model on a two-dimensional lattice captures key physical phenomena, but is challenging to simulate due to the presence of long-range interactions. In this work, we present an efficient quantum algorithm for simulating the time evolution of this model. Our approach, inspired by the fast multipole method, approximates pairwise interactions by interactions between hierarchical levels of coarse-graining boxes. We discuss how to leverage recent advances in two-dimensional neutral atom quantum computing, supporting non-local operations such as long-range gates and shuttling. The resulting circuit depth for a single Trotter step scales polylogarithmically with system size.
format Preprint
id arxiv_https___arxiv_org_abs_2512_03898
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Polylogarithmic-Depth Quantum Algorithm for Simulating the Extended Hubbard Model on a Two-Dimensional Lattice Using the Fast Multipole Method
Wang, Yu
Nibbi, Martina
Luo, Maxine
Le, Isabel Nha Minh
Chen, Yanbin
Cirac, J. Ignacio
Mendl, Christian B.
Quantum Physics
Strongly Correlated Electrons
The extended Hubbard model on a two-dimensional lattice captures key physical phenomena, but is challenging to simulate due to the presence of long-range interactions. In this work, we present an efficient quantum algorithm for simulating the time evolution of this model. Our approach, inspired by the fast multipole method, approximates pairwise interactions by interactions between hierarchical levels of coarse-graining boxes. We discuss how to leverage recent advances in two-dimensional neutral atom quantum computing, supporting non-local operations such as long-range gates and shuttling. The resulting circuit depth for a single Trotter step scales polylogarithmically with system size.
title Polylogarithmic-Depth Quantum Algorithm for Simulating the Extended Hubbard Model on a Two-Dimensional Lattice Using the Fast Multipole Method
topic Quantum Physics
Strongly Correlated Electrons
url https://arxiv.org/abs/2512.03898