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 (32)
- Variational Quantum Algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Improved Simulation of Stabilizer Circuits
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Fermionic quantum computation
- Validating quantum computers using randomized model circuits
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Toward the first quantum simulation with quantum speedup
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Cold molecules: Progress in Quantum Engineering of Chemistry and Quantum Matter
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Quantum computing with Qiskit
- Mapping local Hamiltonians of fermions to local Hamiltonians of spins
- Tapering off qubits to simulate fermionic Hamiltonians
- A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
- A Compact Fermion to Qubit Mapping
- Lowering qubit requirements for quantum simulations of fermionic systems
- Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
- Phase Diagram of the Hubbard Model: Beyond the Dynamical Mean Field
- Local spin operators for fermion simulations
- Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
- Equivalence between fermion-to-qubit mappings in two spatial dimensions
- The Bonsai algorithm: grow your own fermion-to-qubit mapping
- Hierarchical Clifford transformations to reduce entanglement in quantum chemistry wavefunctions
- Variational solutions to fermion-to-qubit mappings in two spatial dimensions
- Optimizing fermionic encodings for both Hamiltonian and hardware
- Discovering optimal fermion-qubit mappings through algorithmic enumeration
- Clifford algebras, Spin groups and qubit trees
- 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