相关论文: Nontrivial Quantum Cellular Automata in Higher Dim…
We investigate the possibility to have electron-pairs in dephasing-free subspace (DFS), by means of the quantum-dot cellular automata (QCA) and single-spin rotations, to carry out a high-fidelity and deterministic universal quantum…
Quantum cellular automata (QCA) are reviewed, including early and more recent proposals. QCA are a generalization of (classical) cellular automata (CA) and in particular of reversible CA. The latter are reviewed shortly. An overview is…
Quantum-dot fabrication and characterization is a well-established technology, which is used in photonics, quantum optics and nanoelectronics. Four quantum-dots placed at the corners of a square form a unit cell, which can hold a bit of…
Quantum-dot Cellular Automata (QCA) may offer a viable alternative of traditional transistor-based technology at the nanoscale. When modeling a QCA circuit, the number of degrees of freedom necessary to describe the quantum mechanical state…
We study matrix product unitary operators (MPUs) for fermionic one-dimensional (1D) chains. In stark contrast with the case of 1D qudit systems, we show that (i) fermionic MPUs do not necessarily feature a strict causal cone and (ii) not…
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…
Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is…
Whether a given target state can be prepared by starting with a simple product state and acting with a finite-depth quantum circuit is a key question in condensed matter physics and quantum information science. It underpins classifications…
We consider discrete and integer-valued cellular automata (CA). A particular class of which comprises "Hamiltonian CA" with equations of motion that bear similarities to Hamilton's equations, while they present discrete updating rules. The…
One can think of some physical evolutions as being the emergent-effective result of a microscopic discrete model. Inspired by classical coarse-graining procedures, we provide a simple procedure to coarse-grain color-blind quantum cellular…
Quantum Information and the new informational paradigm are entering the domain of quantum field theory and gravity, suggesting the quantum automata framework. The quantum automaton is the minimal-assumption extension to the Planck and…
In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different…
We analytically diagonalize a discrete-time on-site interacting fermionic cellular automaton in the two-particle sector. Important features of the solutions sensibly differ from those of analogous Hamiltonian models. In particular, we found…
We construct infinitely many new exactly solvable local commuting projector lattice Hamiltonian models for general bosonic beyond group cohomology invertible topological phases of order two and four in any spacetime dimensions, whose…
We study variational quantum algorithms from the perspective of free fermions. By deriving the explicit structure of the associated Lie algebras, we show that the Quantum Approximate Optimization Algorithm (QAOA) on a one-dimensional…
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…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
We investigate the mean dimension of a cellular automaton (CA for short) with a compact non-discrete space of states. A formula for the mean dimension is established for (near) strongly permutative, permutative algebraic and unit…
We propose a discrete spacetime formulation of quantum electrodynamics in one-dimension (a.k.a the Schwinger model) in terms of quantum cellular automata, i.e. translationally invariant circuits of local quantum gates. These have exact…
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions…