Answers are grounded in this paper and cite their sources.
We show how to perform reversible universal quantum computation on a translationally invariant pure state, using only global operations based on next-neighbor interactions. We do not need to break the translational symmetry of the state at any time during the computation. Since the proposed scheme fulfills the locality condition of a quantum cellular automata, we present a reversible quantum cellular automaton capable of universal quantum computation.
No takes yet. Share an insight, caveat, or question.
Vollbrecht et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: