Solving Free Fermion Problems on a Quantum Computer

Abstract: Simulating noninteracting fermion systems is a basic computational tool in many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often moderate, these costs can be prohibitive in practice when large systems are considered. We present several noninteracting fermion problems that can be solved by a quantum algorithm with exponentially-improved, poly log$(N)$ cost. We point out that the simulation of free-fermion dynamics belongs to the BQP-hard complexity class, implying that our discovered exponential speedup is robust. The key technique in our algorithm is the block-encoding of the correlation matrix into a unitary. We demonstrate how such a unitary can be efficiently realized as a quantum circuit, in the context of dynamics and thermal states of tight-binding Hamiltonians. The special cases of disordered and inhomogeneous lattices, as well as large non-lattice graphs, are presented in detail. Finally, we show that our simulation algorithm generalizes to other promising targets, including free boson systems.