跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.26382 · v1

Efficient Classical Algorithms for Ground Energy Estimation of Fermions with Conjugate-Pair Orbital Interactions

首次提交 2026-11-20 00:40
版本更新 2026-11-20 00:40
雷达观测 2026-11-20 12:52
arXiv ↗PDF ↗

摘要

Estimating the ground energy of interacting fermions is central to quantum many-body physics, and recent quantum algorithms provide polynomial-time guarantees for some structured families. Classical approaches commonly rely on quantum Monte Carlo, where the sign problem is a major obstacle. However, even when a nonnegative expansion without sign problem is available, rigorous guarantees for rapid mixing are still far from well understood. In this paper, we give an efficient classical randomized algorithm for approximating the ground energy of fermionic Hamiltonians with conjugate hopping matrices and conjugate-paired orbital interactions, which includes the attractive Hubbard models. This guarantee not only holds without a physical spectral gap or a weak-coupling assumption, but also covers interactions beyond onsite density attractions. Technically, we first reduce ground-energy estimation to partition-function estimation and then use a discretization with controlled energy error to obtain a nonnegative weighted sum of squared determinant moduli and then apply the Chen--Liu log-concave counting theorem. In addition, we obtain a sharper arithmetic bound by controlling how many independent sampling runs and matrix updates are needed, and using sparse matrices to reduce the cost of each update.

作者备注:41 pages, 1 figure

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-20 00:40 · 最新观测版本

Efficient Classical Algorithms for Ground Energy Estimation of Fermions with Conjugate-Pair Orbital Interactions

Estimating the ground energy of interacting fermions is central to quantum many-body physics, and recent quantum algorithms provide polynomial-time guarantees for some structured families. Classical approaches commonly rely on quantum Monte Carlo, where the sign problem is a major obstacle. However, even when a nonnegative expansion without sign problem is available, rigorous guarantees for rapid mixing are still far from well understood. In this paper, we give an efficient classical randomized algorithm for approximating the ground energy of fermionic Hamiltonians with conjugate hopping matrices and conjugate-paired orbital interactions, which includes the attractive Hubbard models. This guarantee not only holds without a physical spectral gap or a weak-coupling assumption, but also covers interactions beyond onsite density attractions. Technically, we first reduce ground-energy estimation to partition-function estimation and then use a discretization with controlled energy error to obtain a nonnegative weighted sum of squared determinant moduli and then apply the Chen--Liu log-concave counting theorem. In addition, we obtain a sharper arithmetic bound by controlling how many independent sampling runs and matrix updates are needed, and using sparse matrices to reduce the cost of each update.

查看此版本解读 →查看此版本原文 ↗