One can think of some physical evolutions as being the emergent-effective result a microscopic discrete model. Inspired by classical coarse-graining procedures, we provide simple procedure to coarse-grain color-blind quantum cellular automata that follow Goldilocks rules. The consists in (i) space-time grouping automaton (QCA) cells size $N$; (ii) projecting states cell onto its borders, connec...

Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...

Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d reversible cellular automata with triplet local rules.

recently testing of quantum-dot cellular automata (qca) circuits has attracted a lot of attention. in this paper, qca is investigated for testable implementations of reversible logic. to amplify testability in reversible qca circuits, a test method regarding to built in self test technique is developed for detecting all simulated defects. a new reversible qca mux 2×1 design is proposed for the ...

We report here on the structure of reversible quantum cellular automata with the additional restriction that these are also Clifford operations. This means that tensor products of Weyl operators (projective representation of a finite abelian symplectic group) are mapped to multiples of tensor products of Weyl operators. Therefore Clifford quantum cellular automata are induced by symplectic cell...

Since Richard Feynman introduced the notion of quantum computation in 1982, various models of \quantum computers" have been proposed. These models include quantum Turing machines and quantum circuits. In this paper we deene another quantum computational model, one-dimensional quantum cellular automata, and demonstrate that any quantum Turing machine can be eeciently simulated by a one-dimension...