Pith. sign in

REVIEW

A Quantum Algorithm with Polylogarithmic Depth per Trotter Step for the Extended Hubbard Model

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2512.03898 v5 pith:4FE24VBM submitted 2025-12-03 quant-ph cond-mat.str-el

A Quantum Algorithm with Polylogarithmic Depth per Trotter Step for the Extended Hubbard Model

classification quant-ph cond-mat.str-el
keywords boxesinteractionsmodelquantumtrotteralgorithmcircuitdepth
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The extended Hubbard model on a two-dimensional lattice captures key physical phenomena, but its simulation remains challenging because long-range interactions give rise to a large number of interaction terms. Here we present Q2FMM, an efficient quantum algorithm for simulating this model within the Trotter product formula. Inspired by the fast multipole method, Q2FMM replaces site-site interactions with interactions between hierarchical coarse-grained boxes across multiple length scales. In addition, the multipole expansions of boxes are reused for their parent boxes, further enhancing the efficiency. To enable this hierarchical reuse coherently, we design a reversible quantum circuit that removes garbage information through uncomputing. The resulting circuit depth for a single Trotter step scales polylogarithmically with system size.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.