Answers are grounded in this paper and cite their sources.
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems in 1D. We also show that a quantum computer can be built in a 1D chain with a fixed, translationally invariant Hamitonian consisting of nearest-neighbor interactions only. The result of the computation is obtained after a prescribed time with high probability.
No takes yet. Share an insight, caveat, or question.
Vollbrecht et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: