This is the authors' abstract. We don't add key points for this paper.
We provide fast algorithms for simulating many-body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for antisymmetrization is given. Finally, a simulation of the Hubbard model is discussed in detail.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Abrams et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: