Related papers: Intrinsically universal one-dimensional quantum ce…
Quantum-dot Cellular Automata (QCA) provides a basis for classical computation without transistors. Many simulations of QCA rely upon the so-called Intercellular Hartree Approximation (ICHA), which neglects the possibility of entanglement…
We extend the model of Ancilla Driven Quantum Computation (ADQC) by considering gates with arbitrary entangling power. By giving up stepwise determinism, universal QC can still be achieved through a variable length sequence of single qubit…
This study presents a unitary quantum cellular automaton (QCA) that, in the continuum limit, converges to the (1+1)-dimensional Generalized Dirac Equation (GDE). We outline the construction of the unitary, discrete-time evolution and derive…
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…
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution…
A quantum finite-state automaton (QFA) is a theoretical model designed to simulate the evolution of a quantum system with finite memory in response to sequential input strings. We define the language of a QFA as the set of strings that lead…
Here we study the thermodynamic cost of computation and control using 'physically universal' cellular automata or Hamiltonians. The latter were previously defined as systems that admit the implementation of any desired transformation on a…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
In one-way quantum computation (1WQC) model, universal quantum computations are performed using measurements to designated qubits in a highly entangled state. The choices of bases for these measurements as well as the structure of the…
We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed…
We provide an introduction to Quantum Cellular Automata.
Quantum computing promises to exploit the laws of quantum mechanics for processing information in ways fundamentally different from today's classical computers, leading to unprecedented efficiency. One-way quantum computation, sometimes…
We propose a new environment for information encoding and transmission via a novel type of molecular Quantum Dot Cellular Automata (QCA) wire, composed of a single row of head-to-tail interacting 2-dots molecular switches. While most of the…
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…
We implement in a reactive programming framework a simulation of three aspects of quantum mechanics: self-interference, state superposition, and entanglement. The simulation basically consists in a cellular automaton embedded in a…
We introduce a quantum analogue of a classical synchronizing automaton. In classical case the state of a system evolves according to a set of rules forming an alphabet, and sequences of these rules, called words, govern its evolution.…
We consider a graph with a single quantum system at each node. The entire compound system evolves in discrete time steps by iterating a global evolution $U$. We require that this global evolution $U$ be unitary, in accordance with quantum…
Taking the excess electron spin in a unit cell of semiconductor multiple quantum-dot structure as a qubit, we can implement scalable quantum computation without resorting to spin-spin interactions. The technique of single electron…
We build a quantum cellular automaton (QCA) which coincides with 1+1 QED on its known continuum limits. It consists in a circuit of unitary gates driving the evolution of particles on a one dimensional lattice, and having them interact with…