Related papers: Nontrivial Quantum Cellular Automata in Higher Dim…
Quantum cellular automata (QCA) are models of quantum computation of particular interest from the point of view of quantum simulation. Quantum lattice gas automata (QLGA - equivalently partitioned quantum cellular automata) represent an…
We construct a qubit regularization of the $O(3)$ non-linear sigma model in two and three spatial dimensions using a quantum Hamiltonian with two qubits per lattice site. Using a worldline formulation and worm algorithms, we show that in…
We argue that all locality-preserving mappings between fermionic observables and Pauli matrices on a two-dimensional lattice can be generated from the exact bosonization in Ref. [1], whose gauge constraints project onto the subspace of the…
We provide a complete classification of Clifford quantum cellular automata (QCAs) on arbitrary metric spaces and any qudits (of prime or composite dimensions) in terms of algebraic L-theory. Building on the delooping formalism of Pedersen…
We present a systematic perturbative construction of the most general metric operator (and positive-definite inner product) for quasi-Hermitian Hamiltonians of the standard form, H= p^2/2 + v(x), in one dimension. We show that this problem…
Quantum cellular automata (QCA) evolve qubits in a quantum circuit depending only on the states of their neighborhoods and model how rich physical complexity can emerge from a simple set of underlying dynamical rules. For instance,…
Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize…
False vacuum decay in scalar quantum field theory (QFT) is a cornerstone of early Universe cosmology and high energy physics, yet its real-time dynamics is essentially inaccessible to classical computation due to its non-perturbative,…
We compute the effective hamiltonian for non-leptonic |Delta F| = 1 decays in the standard model including next-to-next-to-leading order QCD corrections. In particular, we present the complete three-loop anomalous dimension matrix…
Variational Quantum Algorithms (VQAs), such as the Quantum Approximate Optimization Algorithm (QAOA) of [Farhi, Goldstone, Gutmann, 2014], have seen intense study towards near-term applications on quantum hardware. A crucial parameter for…
We discuss the role of classical control in the context of reversible quantum cellular automata. Employing the structure theorem for quantum cellular automata, we give a general construction scheme to turn an arbitrary cellular automaton…
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…
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…
In this paper we present a quantization of Cellular Automata. Our formalism is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this…
Quantum-dot Cellular Automata (QCA) as a nanoscale transistor-less device technology offers distinguishing advantages over the limitations of CMOS circuits. While more than 2 decades of design progress have been achieved with QCA, a…
Current quantum devices execute specific tasks that are hard for classical computers and have the potential to solve problems such as quantum simulation of material science and chemistry, even without error correction. For practical…
We present a new way of encoding a quantum computation into a 3-local Hamiltonian. Our construction is novel in that it does not include any terms that induce legal-illegal clock transitions. Therefore, the weights of the terms in the…
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…
Quantum-dot cellular automata (QCAs) offer a diffusive computing paradigm with picosecond transmission speed, making them an ideal candidate for moving diffusive computing to real-world applications. By implementing a trainable associative…
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…