Searcharxiv⌕ Search

arXiv subjects

Antonio David Bastida Zamora

Publications and source records attributed to Antonio David Bastida Zamora.

4 recordsLinked to original sources

Quantum machine learning for the quantum lattice Boltzmann method: Trainability of variational quantum circuits for the nonlinear collision operator across multiple time steps

This study investigates the application of quantum machine learning (QML) to approximate the nonlinear component of the collision operator within the quantum lattice Boltzmann method (QLBM). To achieve this, we train a variational quantum circuit (VQC) to construct an operator $U$. When applied to the post-linear-collision quantum state $\ket{Ψ_i}$, this operator yields a final state $\ket{Ψ_f} = U\ket{Ψ_i}$ that successfully replicates the nonlinear collision dynamics derived from the Bhatnagar-Gross-Krook (BGK) approximation. Within this framework, we present two distinct architectures: the R1 model and the R2 model. The R1 model is designed for quantum simulations that involve multiple time steps without intermediate measurements, focusing on accurately capturing nonlinear dynamics in continuous evolution. In contrast, the R2 model is tailored to achieve the high-precision reconstruction of the nonlinear operator for a single time step with an unitary operator.

quant-ph↗

Quantum lattice Boltzmann method for several time steps: A local Carleman linearization algorithm

This article presents a novel encoding for quantum Lattice Boltzmann method algorithm using Carleman linearization. In contrast to previous articles \cite{Sanavio2024LatticeBC,sanavio2025carleman}, the encoding used allows for local collision rules while keeping a higher probability to obtain the right result, which is of the order of $10^{-2}$. The algorithm scales as $O(log_2^2(N)+Q^3)$ each time step with $N$ the number of lattice sites of the 2D lattice and $Q$ the number of channels with a constant number of qubits when using dynamical circuits.

quant-ph↗

Efficient Quantum Lattice Gas Automata

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 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.

quant-ph↗

Float Lattice Gas Automata: A connection between Molecular Dynamics and Lattice Boltzmann Method for quantum computers

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 Lattice Boltzmann Method (LBM), with the key distinction being a novel collision operator. This operator, derived from the ensemble average of transition probabilities, generates nonlinear terms. We propose this new Float Lattice Gas Automata (FLGA) collision as a computationally efficient alternative to traditional and quantum LBM implementations.

quant-ph↗