Related papers: Fully Quantum Lattice Gas Automata Building Blocks…
Lattice gas algorithms (LGA) are a class of algorithms including, in chronological order, binary lattice gas cellular automata (LGCA), integer lattice gas algorithms (ILGA) and lattice Boltzmann method (LBM). They are largely used for…
As the scope of Computational Fluid Dynamics (CFD) grows to encompass ever larger problem scales, so does the interest in whether quantum computing can provide an advantage. In recent years, Quantum Lattice Gas Automata (QLGA) and Quantum…
Lattice Gas Cellular Automata (LGCA) is a classical numerical method widely known and applied to simulate several physical phenomena. In this paper, we study the translation of LGCA on quantum computers (QC) using computational basis…
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…
Building upon the Integer Lattice Gas Automata framework of Blommel \textit{et al.} \cite{PhysRevE.97.023310}, we introduce a simplified, fluctuation-free variant. This approach relies on floating-point numbers and closely mirrors the…
This study presents a novel quantum algorithm for lattice gas automata simulation with a single time step, demonstrating logarithmic complexity in terms of $CX$ gates. The algorithm is composed of three main steps: collision, mapping, and…
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…
The past two decades showed a rapid growing of physically-based modeling of fluids for computer graphics applications. In this area, a common top down approach is to model the fluid dynamics by Navier-Stokes equations and apply a numerical…
Classical lattice gas automata effectively simulate physical processes such as diffusion and fluid flow (in certain parameter regimes) despite their simplicity at the microscale. Motivated by current interest in quantum computation we…
Quantum cellular automata (QCA) constitute space and time homogeneous discrete models for quantum field theories (QFTs). Although QFTs are defined without reference to particles, computations are done in terms of Feynman diagrams, which are…
Quantum computing holds great promise to accelerate scientific computations in fluid dynamics and other classical physical systems. While various quantum algorithms have been proposed for linear flows, developing quantum algorithms for…
Reactive lattice gas automata provide a microscopic approachto the dynamics of spatially-distributed reacting systems. After introducing the subject within the wider framework of lattice gas automata (LGA) as a microscopic approach to the…
Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based…
Simulating quantum dynamics of lattice gauge theories (LGTs) is an exciting frontier in quantum science. Programmable quantum simulators based on neutral atom arrays are a promising approach to achieve this goal, since strong Rydberg…
The Quantum Lattice Boltzmann Method (QLBM) is one of the most promising approaches for realizing the potential of quantum computing in simulating computational fluid dynamics. Many recent works mostly focus on classical simulation, and…
A quantum finite-state automaton (QFA) is a theoretical model designed to simulate the evolution of a quantum system with finite memory in response to sequential input strings. We define the language of a QFA as the set of strings that lead…
Lattice models or structures are geometrical objects with mathematical forms, that are used to represent physical systems. They have been used widely in diverse fields, namely, in condensed matter physics, to study degrees of freedom of…
Quantum linear system algorithms (QLSAs) for gate-based quantum computing can provide exponential speedups for solving linear systems but face challenges when applied to finite element problems due to the growth of the condition number with…
Lattice gas cellular automata (Lgca) are particular cellular automata that imitate the behavior of par- ticles moving on a lattice. We used a particular set of Lgca rules, called hpp, to mix bits in data blocks and obtain a symmetric…
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…