Quantum Simulators, Continuous-Time Automata, and Translationally Invariant Systems
Quantum Simulators, Continuous-Time Automata, and Translationally Invariant Systems
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 …