HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping

Abstract

This paper introduces the Hamiltonian-Adaptive Ternary Tree (HATT) framework to compile optimized Fermion-to-qubit mapping for specific Fermionic Hamiltonians. In the simulation of Fermionic quantum systems, efficient Fermion-to-qubit mapping plays a critical role in transforming the Fermionic system into a qubit system. HATT utilizes ternary tree mapping and a bottom-up construction procedure to generate Hamiltonian aware Fermion-to-qubit mapping to reduce the Pauli weight of the qubit Hamiltonian, resulting in lower quantum simulation circuit overhead. Additionally, our optimizations retain the important vacuum state preservation property in our Fermion-to-qubit mapping and reduce the complexity of our algorithm from $O(N^4)$ to $O(N^3)$. Evaluations and simulations of various Fermionic systems demonstrate $5\sim 20\%$ reduction in Pauli weight, gate count, and circuit depth, alongside excellent scalability to larger systems. Experiments on the Ionq quantum computer also show the advantages of our approach in noise resistance in quantum simulations.

References in corpus (9)

• Fermionic quantum computation
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Automated optimization of large quantum circuits with continuous parameters
• Phase Gadget Synthesis for Shallow Circuits
• Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
• The Bonsai algorithm: grow your own fermion-to-qubit mapping
• Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices
• Faster and shorter synthesis of Hamiltonian simulation circuits

Cited by in corpus (1)

• Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions