Related papers: Quantum Cellular Automata Pseudo-Random Maps
Quantum architecture search (QAS) is desired to construct a powerful and general QAS platform which can significantly accelerate quantum advantages in error-prone and depth limited quantum circuits in today Noisy Intermediate-Scale Quantum…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
It is shown that irreversible classical cellular automata can be performed by quantum algorithm using additional ancilla registers. The algorithm for cellular automata states analysis has been proposed. This algorithm is based on the…
Near zero-energy computing describes the concept of executing logic operations below the (kBT ln 2) energy limit. Landauer discussed that it is impossible to break this limit as long as the computations are performed in the conventional,…
The emergence of quantum computing proposes a revolutionary paradigm that can radically transform numerous scientific and industrial application domains. The ability of quantum computers to scale computations implies better performance and…
We show that quantum cellular automata naturally form the degree-zero part of a coarse homology theory. The recent result of Ji and Yang that the space of QCA forms an Omega-spectrum in the sense of algebraic topology is a direct…
Quantum devices featuring mid-circuit measurement and reset capabilities, such as quantum computers and dual-species Rydberg quantum simulators, enable the realization of quantum cellular automata. These systems evolve in discrete time…
Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have…
Molecular quantum-dot Cellular Automata (QCA) may provide low-power, high-speed computational hardware for processing classical information. Simulation and modeling play an important role in the design of QCA circuits because fully-coherent…
Implementing fast and high-fidelity quantum operations using open-loop quantum optimal control relies on having an accurate model of the quantum dynamics. Any deviations between this model and the complete dynamics of the device, such as…
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…
Quantum dot cellular automata (QCA) computing schemes use arrays of quantum dots as computational devices. Typically, these operate ideally by maintaining arrays in their ground state to ensure correct computational output. For large QCA…
Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
Goldilocks quantum cellular automata (QCA) have been simulated on quantum hardware and produce emergent small-world correlation networks. In Goldilocks QCA, a single-qubit unitary is applied to each qubit in a one-dimensional chain subject…
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…
Quantitative automata model beyond-boolean aspects of systems: every execution is mapped to a real number by incorporating weighted transitions and value functions that generalize acceptance conditions of boolean $\omega$-automata. Despite…
We show on the example of the Arnold cat map that classical chaotic systems can be simulated with exponential efficiency on a quantum computer. Although classical computer errors grow exponentially with time, the quantum algorithm with…
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…
Conventional computers are ill suited to run CA models, and so discourage their development. By creating a hardware platform that makes a broad range of new CA algorithms practical for real applications, we hope to whet the appetite of…