Efficient Quantum Lattice Gas Automata
arXiv:2402.16488 · doi:10.1016/j.compfluid.2024.106476
Abstract
This study presents a novel quantum algorithm for lattice gas automata simulation with a single time step, demonstrating logarithmic complexity in terms of gates. The algorithm is composed of three main steps: collision, mapping, and propagation. A computational complexity analysis and a comparison using different error rates and number of shots are provided. Despite the impact of noise, our findings indicate that accurate simulations could be achieved already on current noisy devices. This suggests potential for efficient simulation of classical fluid dynamics using quantum lattice gas automata, conditional on advancements to expand the current method to multiple time steps and state preparation.
Corrected minor typos on page 11
References in corpus (9)
- Universal computation by quantum walk
- Synthesis of Quantum Logic Circuits
- Efficient quantum algorithm for dissipative nonlinear differential equations
- Simple Mitigation of Global Depolarizing Errors in Quantum Simulations
- Improved quantum algorithms for linear and nonlinear differential equations
- Variational Quantum Algorithms for Computational Fluid Dynamics
- On the importance of data encoding in quantum Boltzmann methods
- Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices
- Efficient parallelization of quantum basis state shift
Cited by in corpus (6)
- A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method
- Quantum collision circuit, quantum invariants and quantum phase estimation procedure for fluid dynamic lattice gas automata
- Quantum Iterative Methods for Solving Differential Equations with Application to Computational Fluid Dynamics
- Adaptive Lattice Gas Algorithm: Classical and Quantum implementations
- Float Lattice Gas Automata: A connection between Molecular Dynamics and Lattice Boltzmann Method for quantum computers
- Fully Quantum Lattice Gas Automata Building Blocks for Computational Basis State Encodings