Optimal fermionic swap networks for Hubbard models
arXiv:2001.08324
Abstract
We propose an efficient variation of the fermionic swap network scheme used to efficiently simulate n-dimensional Fermi-Hubbard-model Hamiltonians encoded using the Jordan-Wigner transform. For the two-dimensional versions, we show that our choices minimize swap depth and number of Hamiltonian interaction layers. The proofs, along with the choice of swap network, rely on isoperimetric inequality results from the combinatorics literature, and are closely related to graph bandwidth problems. The machinery has the potential to be extended to maximize swap network efficiency for other types of lattices.
arXiv comment9 pages, 2 figures. Corrected minor typos
References in corpus (7)
- Fermionic quantum computation
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- A Compact Fermion to Qubit Mapping
- Superfast encodings for fermionic quantum simulation
- Fermions without fermi fields
- Quantum codes for quantum simulation of Fermions on a square lattice of qubits