With a Feynman-Kitaev Hamiltonian, quantum computation does not need to apply any gates; you construct the Hamiltonian, initialize the system, and let it propagate on its own.
However, the Hamiltonian you can actually construct is probably not exactly the Hamiltonian you want. This will cause errors in the resulting computation. Has there been any analysis on how errors propagate in this model? E.g., if you need to apply 2-local terms and there is some model of errors in each term, how the system evolves?
Searching for things like "feynman-kitaev hamiltonian error propagation" doesn't yield anything useful. Is there a different search term I should use?
I can get some basic results analyzing this on my own but I don't want to duplicate effort or miss some good work.