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 (28)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum computational advantage using photons
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Strong quantum computational advantage using a superconducting quantum processor
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Fermionic quantum computation
• Hartree-Fock on a superconducting qubit quantum computer
• Practical Quantum Error Mitigation for Near-Future Applications
• Hybrid quantum-classical algorithms and quantum error mitigation
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Quantum equation of motion for computing molecular excitation energies on a noisy quantum processor
• Quantum simulations of materials on near-term quantum computers
• Low rank representations for quantum simulation of electronic structure
• Lowering qubit requirements for quantum simulations of fermionic systems
• Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum Algorithms
• Operator Locality in Quantum Simulation of Fermionic Models
• Bravyi-Kitaev Superfast simulation of fermions on a quantum computer
• Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
• Quantum codes for quantum simulation of Fermions on a square lattice of qubits
• Fermionic systems for quantum information people
• A Dynamic Systems Approach to Fermions and Their Relation to Spins
• A unified framework of transformations based on the Jordan-Wigner transformation
• Clifford algebras, Spin groups and qubit trees

Cited by in corpus (17)

• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive
• HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
• Discovering optimal fermion-qubit mappings through algorithmic enumeration
• 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