Tuesday, September 25, 2012

1209.5367 (Asif Shakeel et al.)

When is a Quantum Cellular Automaton (QCA) a Quantum Lattice Gas
Automaton (QLGA)?

Asif Shakeel, Peter J. Love
Quantum cellular automata (QCA) are models of quantum computation of particular interest from the point of view of quantum simulation. Quantum lattice gas automata (QLGA - equivalently partitioned quantum cellular automata) represent an interesting subclass of QCA. Prior work on QCA has investigated the relationship between these two classes of models. In the present paper we establish necessary and sufficient conditions for unbounded, finite Quantum Cellular Automata (QCA) (finitely many active cells in a quiescent background) to be Quantum Lattice Gas Automata. We define a local condition that classifies those QCA that are QLGA, and we show that there are QCA that are not QLGA. We use a number of tools from functional analysis of separable Hilbert spaces and representation theory of associative algebras that enable us to treat QCA on finite but unbounded configurations in full detail.
View original: http://arxiv.org/abs/1209.5367

No comments:

Post a Comment