相关论文: Reversible quantum cellular automata

We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…

A discretized time evolution of the wave function for a Dirac particle on a cubic lattice is represented by a very simple quantum cellular automaton. In each evolution step the updated value of the wave function at a given site depends only…

In this dissertation, we study two of the global properties of 1-dimensional cellular automata (CAs) under periodic boundary condition, namely, reversibility and randomness. To address reversibility of finite CAs, we develop a mathematical…

If L=Z^D and A is a finite set, then A^L is a compact space. A cellular automaton (CA) is a continuous transformation F:A^L--> A^L that commutes with all shift maps. A quasisturmian (QS) subshift is a shift-invariant subset obtained by…

We introduce and describe a class of simple facilitated quantum spin models in which the dynamics is due to the repeated application of unitary gates. The gates are applied periodically in time, so their combined action constitutes a…

A Cellular Automata (CA) is a computing model of complex System using simple rule. In CA the problem space into number of cell and each cell can be one or several final state. Cells are affected by neighbours' to the simple rule. Cellular…

We study the dynamics of the Rule 150 reversible cellular automaton (RCA). This is a one-dimensional lattice system of binary variables with synchronous (Floquet) dynamics, corresponding to a bulk deterministic and reversible discrete…

Probabilistic cellular automata (CA) provides a classic framework for studying non-equilibrium statistical physics on a lattices. A notable example is the Domany-Kinzel CA, which has been used to investigate the process of directed…

We study a quantum cellular automaton (QCA) whose time-evolution is defined from global transition function of classical cellular automata (CA). In order to investigate natural transformations from CA to QCA, the present QCA includes CA…

A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. Searching in this mathematical framework has interested the community since a long time. However, most results consider spatial search…

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 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…

Cellular automata are arrays of finite state machines that can exist in a finite number of states. These machines update their states simultaneously based on specific local rules that govern their interactions. This framework provides a…

We introduce a scheme to perform universal quantum computation in quantum cellular automata (QCA) fashion in arbitrary subsystem dimension (not necessarily finite). The scheme is developed over a one spatial dimension $N$-element array,…

A quantum cellular automaton (QCA) or a causal unitary is by definition an automorphism of local operator algebra, by which local operators are mapped to local operators. Quantum circuits of small depth, local Hamiltonian evolutions for…

We present a new cellular data processing scheme, a hybrid of existing cellular automata (CA) and gate array architectures, which is optimized for realization at the quantum scale. For conventional computing, the CA-like external clocking…

A class of fermionic quantum field theories with interactions is shown to be equivalent to probabilistic cellular automata, namely cellular automata with a probability distribution for the initial states. Probabilistic cellular automata on…

Quantum walks on lattices can give rise to one-particle relativistic wave equations in the long-wavelength limit. In going to multiple particles, quantum cellular automata (QCA) are natural generalizations of quantum walks. In one spatial…

We employ $(1 + 1)$-dimensional quantum cellular automata to study the evolution of entanglement and coherence near criticality in quantum systems that display non-equilibrium steady-state phase transitions. This construction permits direct…

Cellular automata with memory (CAM) are widely used in fields such as image processing, pattern recognition, simulation, and cryptography. The invertibility of CAM is generally considered to be chaotic. Paper [Invertible behavior in…