hardware algorithms simulation

Hardware-Aware Fermion-to-Qubit Mappings for Simulating the 2D Hubbard Model on Heavy-Hexagon Quantum Processors

Curator's Take

AI Commentary

This article shows that the choice of fermion‑to‑qubit mapping can make or break near‑term simulations of the 2D Hubbard model on today’s superconducting chips, and it identifies the Bonsai transformation as the clear winner for IBM’s heavy‑hexagon topology once routing overhead is accounted for. By coupling the Bonsai encoding with a simulated‑annealing layout optimizer, the authors cut the Pauli‑weight cost by almost half and demonstrate time‑evolution experiments on lattices up to 6 × 6 qubits—an unprecedented scale for hardware‑aware fermionic simulations. The work not only provides a practical recipe for squeezing more physics out of existing devices but also highlights that algorithmic design must be co‑optimized with processor connectivity, a lesson that will shape future quantum‑simulation software stacks.

— Mark Eatherly

Summary

Quantum simulation of strongly correlated fermionic systems is among the most promising near- term applications of quantum computing, but its practical efficiency depends critically on the choice of fermion-to-qubit mapping and on the connectivity of the underlying hardware. In this work we address this problem in the context of the two-dimensional Hubbard model, simulated on IBM superconducting quantum processors with heavy-hexagon connectivity. We numerically benchmark the Jordan-Wigner, Bravyi-Kitaev, and Bonsai transformations, evaluating their Pauli weight and SWAP overhead across seven heavy-hexagon chips of increasing size. We show that, while the Bravyi-Kitaev mapping initially exhibits a lower Pauli weight, this advantage is eliminated once routing costs are taken into account, confirming the Bonsai mapping as the most hardware-efficient baseline transformation for this architecture. We then use the Bonsai mapping to construct the qubit Hamiltonian of the 2D spinful Fermi-Hubbard model, introducing a simulated annealing algorithm that optimizes the assignment of Majorana strings to lattice sites, reducing the cost function by nearly 50% percent. Finally, we simulate on quantum hardware the time evolution of fermionic states up to 6x6 lattices, confirming the viability of the Bonsai encoding for hardware-aware large-scale two-dimensional simulations.