Quantum Cellular Automata

经典的细胞自动机是模拟复杂分布式系统的通用工具。他们的量子模拟最近成为焦点，因为这种架构特别适合于通过许多相等成分的晶格系统进行量子计算，这些成分可能不容易单独解决。这样的系统现在正在实现（见项目E1，E2），所以有一个直接的需求来评估的潜力，分布式lattice systems.In对比经典的情况下，然而，量子细胞自动机的一般形式是不那么容易描述，特别是当可逆和不可逆的演化都被承认.在这个项目中，量子元胞自动机将被研究在一个自下而上的方法，调查简单的自动机，如量子行走的详细属性，和自上而下的方法，其中一般自动机的结构进行了分析，从第一原理。

Classical cellular automata are a very versatile tool for simulating complex distributed systems. Their quantum analogue has come into focus more recently, because this architecture is especially suited to allow quantum computation by a lattice system of many equal constituents, which are, perhaps, not easily addressed individually. Such systems are now getting realized (see projects El, E2), so there is a direct need to assess the potential of distributed lattice systems.In contrast to the classical case, however, the general form of a quantum cellular automaton is not so easy to describe, especially when both reversible and irreversible evolutions are admitted. In this project quantum cellular automata will be studied both in a bottom-up approach of investigating detailed properties of simple automata such as quantum walks, and a top-down approach, in which the structure of general automata is analyzed from first principles.