Efficient classical simulation of Fermi-Hubbard models with Kramers symmetry
cs.DS, cond-mat.stat-mech, cond-mat.str-el, quant-ph
Submitted: 2026-11-05
Updated: 2026-11-05
Terminology
Sources
- Quantum impurity models: easy at equilibrium, universal in motion
- Complexity of quantum impurity problems
- Polynomial-time classical simulation of quantum ferromagnets
- Efficient quantum algorithm for Heisenberg spin systems
- The Fermi-Hubbard model at unitarity
- Monte Carlo simulation of stoquastic Hamiltonians
- Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians
- An FPRAS for Counting Common Bases of Two Matroids
- Convergence of the Cumulant Expansion and Polynomial-Time Algorithm for Weakly Interacting Fermions
- Obstructions To Classically Simulating The Quantum Adiabatic Algorithm
- Weakly interacting fermionic Gibbs states are Gaussian mixtures and classically simulable
- Polynomial-time classical and quantum simulation of quantum impurity models
- Majorana-time-reversal symmetries: a fundamental principle for sign-problem-free quantum Monte Carlo simulations
- Lee-Yang theorem for fermions
- Fast mixing of operator-loop path-integral quantum Monte Carlo for stoquastic XY Hamiltonians
- Spectral gap of Lee-Yang Hamiltonians
- Stochastic series expansion method with operator-loop update
- Polynomial-time classical algorithms for mean-field models up to the glass transition
- Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs
- Majorana Positivity and the Fermion sign problem of Quantum Monte Carlo Simulations
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time