Is it known whether the Fermi-Hubbard ground state can be prepared efficiently or not?

Question

Naturally, in general, ground state preparation is QMA-complete. There exists a paper by Andrew Childs, David Gosset & Zak Webb, which shows that ground state preparation for the Bose-Hubbard model is QMA-complete.

However, is it known what the complexity of ground state preparation for the Fermi-Hubbard model is? I could not find this in the literature directly, does this follow trivially from a general result which I am missing?

score 4 · Accepted Answer · answered Feb 03 '23 at 13:05

4

In this paper, Schuch and Verstraete determined the computational complexity of finding the ground state of the Fermi-Hubbard model, showing that it is among the hardest problems in the complexity class QMA, Quantum Merlin Arthur.

answered Feb 03 '23 at 13:05

bm442

1,317
1
6
17

Is it known whether the Fermi-Hubbard ground state can be prepared efficiently or not?

1 Answers1