Clifford circuit based heuristic optimization of fermion-to-qubit mappings
arXiv:2502.11933 · doi:10.1021/acs.jctc.5c00794
Abstract
Simulation of interacting fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analysing fermionic systems with a quantum computer hinges on the efficiency of fermion-to-qubit mappings that encode non-local fermionic degrees of freedom in local qubit degrees of freedom. While recent works have highlighted the importance of designing fermion-to-qubit mappings that are tailored to specific problem Hamiltonians, the methods proposed so far are either restricted to a narrow class of mappings or they use computationally expensive and unscalable brute-force search algorithms. Here, we address this challenge by designing a numerical optimization framework for fermion-to-qubit mappings. To this end, we first translate the fermion-to-qubit mapping problem to a Clifford circuit optimization problem, and then use simulated annealing to optimize the average Pauli weight of the problem Hamiltonian. For all fermionic Hamiltonians we have considered, the numerically optimized mappings outperform their conventional counterparts, including ternary-tree-based mappings that are known to be optimal for single creation and annihilation operators. We find that our optimized mappings yield between to improvements on the average Pauli weight when the simulation Hamiltonian has an intermediate level of complexity. Most remarkably, the optimized mappings improve the average Pauli weight for nearest-neighbor hopping and Hubbard models by more than and , respectively. Surprisingly, we also find specific interaction Hamiltonians for which the optimized mapping outperform ternary-tree-based mapping. Our results establish heuristic numerical optimization as an effective method for obtaining mappings tailored for specific fermionic Hamiltonian.
16 pages, 12 figures, Comments welcome
References in corpus (9)
- Cold molecules: Progress in Quantum Engineering of Chemistry and Quantum Matter
- Quantum computing with Qiskit
- Tapering off qubits to simulate fermionic Hamiltonians
- The Bonsai algorithm: grow your own fermion-to-qubit mapping
- Hierarchical Clifford transformations to reduce entanglement in quantum chemistry wavefunctions
- Optimizing fermionic encodings for both Hamiltonian and hardware
- Towards chemical accuracy with shallow quantum circuits: A Clifford-based Hamiltonian engineering approach
- Ultrafast Hybrid Fermion-to-Qubit mapping
- Treespilation: Architecture- and State-Optimised Fermion-to-Qubit Mappings