Related papers: Partitioned quantum cellular automata are intrinsi…
This paper introduces a simple formalism for dealing with deterministic, non- deterministic and stochastic cellular automata in an unified and composable manner. This formalism allows for local probabilistic correlations, a feature which is…
In the near future the era of Beyond CMOS will start as the scaling of the current CMOS technology will reach the fundamental limit. QCA (Quantum-dot Cellular Automata) is the transistor less computation paradigm and viable candidate for…
We propose a physical realization of quantum cellular automata (QCA) using arrays of ultracold atoms excited to Rydberg states. The key ingredient is the use of programmable multifrequency couplings which generalize the Rydberg blockade and…
Quantum-dot cellular automata (QCA) is a low-power, non-von-Neumann, general-purpose paradigm for classical computing using transistor-free logic. An elementary QCA device called a "cell" is made from a system of coupled quantum dots with a…
We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…
Quantum-dot cellular automata (QCAs) offer a diffusive computing paradigm with picosecond transmission speed, making them an ideal candidate for moving diffusive computing to real-world applications. By implementing a trainable associative…
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small…
It is known that both quantum and classical cellular automata (CA) exist that are computationally universal in the sense that they can simulate, after appropriate initialization, any quantum or classical computation, respectively. Here we…
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian…
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…
This paper introduces a new formalism for quantum cellular automata (QCAs), based on evolving tensor products of qubits using local unitary operators. It subsequently uses this formalism to analyze and validate several conjectures, stemming…
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the…
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…
We consider the group structure of quantum cellular automata (QCA) modulo circuits and show that it is abelian even without assuming the presence of ancillas, at least for most reasonable choices of control space; this is a corollary of a…
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…
Very much as its classical counterpart, quantum cellular automata are expected to be a great tool for simulating complex quantum systems. Here we introduce a partitioned model of quantum cellular automata and show how it can simulate, with…
Clifford quantum cellular automata (CQCAs) are a special kind of quantum cellular automata (QCAs) that incorporate Clifford group operations for the time evolution. Despite being classically simulable, they can be used as basic building…
Simulations of one quantum system by an other has an implication in realization of quantum machine that can imitate any quantum system and solve problems that are not accessible to classical computers. One of the approach to engineer…
In this work, we develop a method to use Quantum- Dot Cellular Automata (QCA) for universal quantum computing. This method is based conceptually on refocusing in NMR systems. We show how an array of QCA cells can be used for isolated single…
Quantum Cellular Automaton (QCA) is a model for universal quantum computation and a natural candidate for digital quantum simulation of relativistic quantum fields. Here we introduce the first photonic platform for implementing…