The Bonsai algorithm: grow your own fermion-to-qubit mapping

Abstract

Fermion-to-qubit mappings are used to represent fermionic modes on quantum computers, an essential first step in many quantum algorithms for electronic structure calculations. In this work, we present a formalism to design flexible fermion-to-qubit mappings from ternary trees. We discuss in an intuitive manner the connection between the generating trees' structure and certain properties of the resulting mapping, such as Pauli weight and the delocalisation of mode occupation. Moreover, we introduce a recipe that guarantees Fock basis states are mapped to computational basis states in qubit space, a desirable property for many applications in quantum computing. Based on this formalism, we introduce the Bonsai algorithm, which takes as input the potentially limited topology of the qubit connectivity of a quantum device and returns a tailored fermion-to-qubit mapping that reduces the SWAP overhead with respect to other paradigmatic mappings. We illustrate the algorithm by producing mappings for the heavy-hexagon topology widely used in IBM quantum computers. The resulting mappings have a favourable Pauli weight scaling $\mathcal{O}(\sqrt{N})$ on this connectivity, while ensuring that no SWAP gates are necessary for single excitation operations.

References in corpus (4)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Strong quantum computational advantage using a superconducting quantum processor
• Hybrid quantum-classical algorithms and quantum error mitigation

Cited by in corpus (16)

• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive
• A general framework for active space embedding methods: applications in quantum computing
• Reducing Entanglement With Physically-Inspired Fermion-To-Qubit Mappings
• A Hybrid Qubit Encoding: Splitting Fock Space into Fermionic and Bosonic Subspaces
• Local Jordan-Wigner transformations on the torus
• Clifford circuit based heuristic optimization of fermion-to-qubit mappings
• HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping
• Simulating the Fermi-Hubbard model with long-range hopping on a quantum computer
• Improved Strategies for Fermionic Quantum Simulation with Global Interactions
• Mitigating the measurement overhead of ADAPT-VQE with optimised informationally complete generalised measurements
• Quantum information theory on sparse wavefunctions and applications for Quantum Chemistry
• Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions
• Fast-forwardability of Qubit-mapped Fermion models based on Cartan decomposition
• Accelerating Fermionic System Simulation on Quantum Computers