Related papers: Quantum cellular automata and quantum field theory…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but…
Inspired by various quantum gravity approaches, we explore quantum field theory where spacetime exhibits scaling properties and dimensional reduction with changing energy scales, effectively behaving as a multifractal manifold. Working…
A new family of discrete-time quantum walks (DTQWs) on the line with an exact discrete $U(N)$ gauge invariance is introduced. It is shown that the continuous limit of these DTQWs, when it exists, coincides with the dynamics of a Dirac…
We consider a network model, embedded on the Manhattan lattice, of a quantum localisation problem belonging to symmetry class C. This arises in the context of quasiparticle dynamics in disordered spin-singlet superconductors which are…
We classify quantum cellular automata whose cells are qubits, on hypercubic lattices $\mathbb Z^s$, with the von Neumann neighborhood scheme, in terms of realizability as finite-depth quantum circuits. We show the most general structure of…
We address the dynamics of continuous-time quantum walk (CTQW) on planar 2D lattice graphs, i.e. those forming a regular tessellation of the Euclidean plane (triangular, square, and honeycomb lattice graphs). We first consider the free…
We develop a framework to simulate quantum field theories (QFTs) with boundaries in $(1+1)$-dimenmsional curved spacetimes by employing open spin systems. Building upon our previous work that established a mapping from spin systems to QFTs…
We make a detailed study of the infinite dimensional Galilean Conformal Algebra (GCA) in the case of two spacetime dimensions. Classically, this algebra is precisely obtained from a contraction of the generators of the relativistic…
Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to their classical counterparts. Here, we demonstrate an…
We continue our analysis of the physics of quantum lattice gas automata (QLGA). Previous work has been restricted to periodic or infinite lattices; simulation of more realistic physical situations requires finite sizes and non-periodic…
We examine quantum field theory in spacetimes that are time nonorientable but have no other causal pathology. These are Lorentzian universes-from-nothing, spacetimes with a single spacelike boundary that nevertheless have a smooth…
Presented is a quantum computing representation of Dirac particle dynamics. The approach employs an operator splitting method that is an analytically closed-form product decomposition of the unitary evolution operator. This allows the Dirac…
Quantum-matter theory (QMT), based on the Schr\"odinger or Dirac equations, is firmly established for both intra- and intermolecular interactions. However, there are two key issues with QMT. First, its applicability to large molecular…
We propose an extension of the definition of vertex algebras in arbitrary space-time dimensions together with their basic structure theory. An one-to-one correspondence between these vertex algebras and axiomatic quantum field theory (QFT)…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This…
These talks present an overview of a tentative theory of large distance physics. For each large distance L (in dimensionless units), the theory gives two complementary descriptions of spacetime physics: quantum field theory at distances…
Quantum dot Cellular Automata (QCA) is a novel and potentially attractive technology for implementing computing architectures at the nanoscale. The basic Boolean primitive in QCA is the majority gate. In this paper we present a novel design…
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…
A Plastic Quantum Walk admits both continuous time and continuous spacetime. The model has been recently proposed by one of the authors in \cite{molfetta2019quantum}, leading to a general quantum simulation scheme for simulating fermions in…