ﻻ يوجد ملخص باللغة العربية
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. The encoding is linear and hence does not carry any of the cost of the computation. We do this in two flavours: a weak one which requires an infinite but periodic initial configuration and a strong one which needs only a finite initial configuration. KEYWORDS: Quantum cellular automata, Intrinsic universality, Quantum computation.
This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with respect to Tur
Given a (finite) string of zeros and ones, we report a way to determine if the number of ones is less than, greater than, or equal to a prescribed number by applying two sets of cellular automaton rules in succession. Thus, we solve the general densi
We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1-to-2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations for improving the performance with given resources.
There exists an index theory to classify strictly local quantum cellular automata in one dimension. We consider two classification questions. First, we study to what extent this index theory can be applied in higher dimensions via dimensional reducti
One can think of some physical evolutions as being the emergent-effective result of a microscopic discrete model. Inspired by classical coarse-graining procedures, we provide a simple procedure to coarse-grain color-blind quantum cellular automata th