Discovering optimal fermion-qubit mappings through algorithmic enumeration

Abstract

Simulating fermionic systems on a quantum computer requires a high-performing mapping of fermionic states to qubits. A characteristic of an efficient mapping is its ability to translate local fermionic interactions into local qubit interactions, leading to easy-to-simulate qubit Hamiltonians. All fermion-qubit mappings must use a numbering scheme for the fermionic modes in order for translation to qubit operations. We make a distinction between the unordered labelling of fermions and the ordered labelling of the qubits. This separation shines light on a new way to design fermion-qubit mappings by making use of the enumeration scheme for the fermionic modes. The purpose of this paper is to demonstrate that this concept permits notions of fermion-qubit mappings that are optimal with regard to any cost function one might choose. Our main example is the minimisation of the average number of Pauli matrices in the Jordan-Wigner transformations of Hamiltonians for fermions interacting in square lattice arrangements. In choosing the best ordering of fermionic modes for the Jordan-Wigner transformation, and unlike other popular modifications, our prescription does not cost additional resources such as ancilla qubits. We demonstrate how Mitchison and Durbin's enumeration pattern minimises the average Pauli weight of Jordan-Wigner transformations of systems interacting in square lattices. This leads to qubit Hamiltonians consisting of terms with average Pauli weights 13.9% shorter than previously known. By adding only two ancilla qubits we introduce a new class of fermion-qubit mappings, and reduce the average Pauli weight of Hamiltonian terms by 37.9% compared to previous methods. For $n$-mode fermionic systems in cellular arrangements, we find enumeration patterns which result in $n^{1/4}$ improvement in average Pauli weight over naïve schemes.

arXiv comment57 pages, 27 figures

References in corpus (39)

• A variational eigenvalue solver on a quantum processor
• The theory of variational hybrid quantum-classical algorithms
• Simulated Quantum Computation of Molecular Energies
• Fermionic quantum computation
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Towards Quantum Chemistry on a Quantum Computer
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Quantum measurements and the Abelian Stabilizer Problem
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Simulating chemistry using quantum computers
• Digital quantum simulation of fermionic models with a superconducting circuit
• Quantum Algorithms for Fermionic Simulations
• Solving strongly correlated electron models on a quantum computer
• Mapping local Hamiltonians of fermions to local Hamiltonians of spins
• Adiabatic Quantum Simulation of Quantum Chemistry
• Fermionic mode entanglement in quantum information
• Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
• A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
• Exploiting locality in quantum computation for quantum chemistry
• Quantum Algorithm for Obtaining the Energy Spectrum of Molecular Systems
• A Compact Fermion to Qubit Mapping
• Exact bosonization in two spatial dimensions and a new class of lattice gauge theories
• Quantum Algorithm for Molecular Properties and Geometry Optimization
• Local spin operators for fermion simulations
• Bosonization in three spatial dimensions and a 2-form gauge theory
• Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
• On the qubit routing problem
• Quantum codes for quantum simulation of Fermions on a square lattice of qubits
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations
• Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer
• The Feynman problem and Fermionic entanglement: Fermionic theory versus qubit theory
• Exact bosonization in arbitrary dimensions
• Faster Quantum Algorithm to simulate Fermionic Quantum Field Theory
• Equivalence between fermion-to-qubit mappings in two spatial dimensions
• The Bonsai algorithm: grow your own fermion-to-qubit mapping
• Quantum simulations of Fermionic Hamiltonians with efficient encoding and ansatz schemes
• Renormalization in Condensed Matter: Fermionic Systems - from Mathematics to Materials
• Fermionic Hamiltonians for quantum simulations: a general reduction scheme
• Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis

Cited by in corpus (10)

• Error-correcting codes for fermionic quantum simulation
• Reducing Entanglement With Physically-Inspired Fermion-To-Qubit Mappings
• Ultrafast Hybrid Fermion-to-Qubit mapping
• A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation
• Local Jordan-Wigner transformations on the torus
• Clifford circuit based heuristic optimization of fermion-to-qubit mappings
• Mitigating the measurement overhead of ADAPT-VQE with optimised informationally complete generalised measurements
• Local fermion-to-qudit mappings: a practical recipe for four-level systems
• Improved Strategies for Fermionic Quantum Simulation with Global Interactions
• Digital Quantum Simulations of the Non-Resonant Open Tavis-Cummings Model