Skip to content
DraconiticResearch
Search Sources API
189,105 studies31 sourcesUpdated 1 h ago
PreprintarXiv licencearXiv

Compiling the 2D Fermi-Hubbard ground-state energy estimation algorithm for active volume quantum architectures

2 more authors

Abstract

As quantum computing enters the early fault-tolerant era, circuit compilation choices will increasingly depend on details of the underlying architecture rather than solely optimizing for generic proxies such as non-Clifford count. We present an active-volume-aware compilation of the ground-state energy estimation algorithm for the two-dimensional Fermi-Hubbard model using quantum phase estimation and Trotterized time evolution. The proposed compilation reduces the active volume across L× L square lattices with L=4 to $20$, achieving up to a 3.9× reduction over prior work optimized for non-Clifford cost. As a by-product of these compilation improvements, the resulting circuits also achieve state-of-the-art Toffoli counts, with a ~2× reduction for the L=20 case. Lastly, the active volume architecture and recent execution scheduling advances provide a means of translating these reduction trends into runtime. This demonstrates the increasing importance of architecture-aware compilation for practical early fault-tolerant quantum computing.

Related

  1. Chern-number estimation: nearly optimal quantum algorithm and provable quantum speedup
    Soichiro Imamura, Shintaro Ae, Kazuki Sakamoto +2
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Measurement-dependent reduction of open dynamics in the quantum phase estimation algorithm: the visible subspace and the damped Fejér kernel
    Marina O. Gordeichuk, Oleg M. Kiselev
    arXivPreprintarXiv licenceFull textMathematical physicsNumerical analysis & scientific computingarXiv
  3. Toward Efficient End-to-End Quantum Elliptic PDE Solvers: a Multilevel Correction Algorithm for Direct Observable Estimation
    Xiantao Li
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Computational Complexity of Clifford Template Compilation: Are Quantum Computers Useful for Compiling Quantum Circuits?
    Keisuke Fujii
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. COΦ - COmpiling PHotonics into dIgital quantum circuits
    Grzegorz Czelusta, Marcin Markiewicz, Jakub Mielczarek +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{apel2026compiling,
  title = {{Compiling the 2D Fermi-Hubbard ground-state energy estimation algorithm for active volume quantum architectures}},
  author = {Harriet Apel and Athena Caesura and Carys Harvey and Sam Heavey and Angus Kan and Jessica Lemieux and Ryan Levy and Sam Pallister and Joseph Peetz and William Pol and Sukin Sim and William A. Simon and Mark Steudtner and Gideon Uchehara},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.05316},
  eprint = {2609.05316},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.05316},
}
RIS
TY  - UNPB
TI  - Compiling the 2D Fermi-Hubbard ground-state energy estimation algorithm for active volume quantum architectures
AU  - Harriet Apel
AU  - Athena Caesura
AU  - Carys Harvey
AU  - Sam Heavey
AU  - Angus Kan
AU  - Jessica Lemieux
AU  - Ryan Levy
AU  - Sam Pallister
AU  - Joseph Peetz
AU  - William Pol
AU  - Sukin Sim
AU  - William A. Simon
AU  - Mark Steudtner
AU  - Gideon Uchehara
PY  - 2026
DA  - 2026/09/25
PB  - arXiv
DO  - 10.48550/arxiv.2609.05316
UR  - https://arxiv.org/abs/2609.05316
AB  - As quantum computing enters the early fault-tolerant era, circuit compilation choices will increasingly depend on details of the underlying architecture rather than solely optimizing for generic proxies such as non-Clifford count. We present an active-volume-aware compilation of the ground-state energy estimation algorithm for the two-dimensional Fermi-Hubbard model using quantum phase estimation and Trotterized time evolution. The proposed compilation reduces the active volume across L× L square lattices with L=4 to $20$, achieving up to a 3.9× reduction over prior work optimized for non-Clifford cost. As a by-product of these compilation improvements, the resulting circuits also achieve state-of-the-art Toffoli counts, with a ~2× reduction for the L=20 case. Lastly, the active volume architecture and recent execution scheduling advances provide a means of translating these reduction trends into runtime. This demonstrates the increasing importance of architecture-aware compilation for practical early fault-tolerant quantum computing.
ER  -