Related papers: Classification of qubit cellular automata on hyper…
This research describes a three dimensional quantum cellular automaton (QCA) which can simulate all other 3D QCA. This intrinsically universal QCA belongs to the simplest subclass of QCA: Partitioned QCA (PQCA). PQCA are QCA of a particular…
We present an architecture of QCPU(Quantum Central Processing Unit), based on the discrete quantum gate set, that can be programmed to approximate any n-qubit computation in a deterministic fashion. It can be built efficiently to implement…
Modeling non-Hermitian Hamiltonians is increasingly important in classical and quantum domains, especially when studying open systems, $PT$ symmetry, and resonances. However, the quantum simulation of these models has been limited by the…
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…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
Quantum cellular automata are important tools in understanding quantum dynamics, thanks to their simple and effective list of rules. Here we investigate explicitly how coherence is built and lost in the evolution of one-dimensional automata…
Superconducting quantum circuits are typically housed in conducting enclosures in order to control their electromagnetic environment. As devices grow in physical size, the electromagnetic modes of the enclosure come down in frequency and…
In this work, we use tools from non-standard analysis to introduce infinite-dimensional quantum systems and quantum fields within the framework of Categorical Quantum Mechanics. We define a dagger compact category *Hilb suitable for the…
Quantum computers hold promise to enable efficient simulations of the properties of molecules and materials; however, at present they only permit ab initio calculations of a few atoms, due to a limited number of qubits. In order to harness…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
(i) We point out that every local unitary circuit of depth smaller than the linear system size is easily distinguished from a global Haar random unitary if there is a conserved quantity that is a sum of local operators. This is always the…
Information in a Quantum Cellular Automata architecture is encoded in the polarizazion state of a cell, i.e., in the occupation numbers of the quantum dots of which the cell is made up. Non-invasive charge detectors of single electrons in a…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…
Characterizing the quantum complexity of local random quantum circuits is a very deep problem with implications to the seemingly disparate fields of quantum information theory, quantum many-body physics and high energy physics. While our…
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number…
This paper presents a new method for automatic quantification of ellipse-like cells in images, an important and challenging problem that has been studied by the computer vision community. The proposed method can be described by two main…
Clifford quantum circuits are elementary invertible transformations of quantum systems that map Pauli operators to Pauli operators. We study periodic one-parameter families of Clifford circuits, called loops of Clifford circuits, acting on…
This paper explores cellular automata (CA) constructed from Yang-Baxter maps over finite fields $F_{2^n}$. We define $R$-matrices using a map $f$ on $F_{2^n}$ and establish necessary and sufficient conditions for $f$ to satisfy the…
We present a scheme to perform universal quantum computation using global addressing techniques as applied to a physical system of endohedrally doped fullerenes. The system consists of an ABAB linear array of Group V endohedrally doped…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…