Quantum Search in Superposed Quantum Lattice Gas Automata and Lattice Boltzmann Systems

TL;DR

This work marries Quantum CFD concepts (QLGA/QLBM) with discrete optimization by proposing a parallel, coherent quantum framework to sample many lattice configurations and optimize a QoI without measuring flow fields. It introduces a gate-efficient linear encoding, a parallel time-evolution scheme, and a coherent accumulation of QoIs, enabling the use of Quantum Amplitude Estimation and Dürr–Høyer minimum finding to achieve a quadratic speedup over classical approaches. The authors provide detailed circuit designs, discuss encoding trade-offs (marker and base registers), and analyze the overall query and gate complexities, highlighting practical considerations for implementation. The approach offers a principled path to applying quantum computing to CFD-inspired optimization tasks, with potential impact on design optimization and parametric studies where flow-field tomography is impractical.

Abstract

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 Boltzmann Methods (QLBM) have emerged as promising candidates for quantum-native implementations of CFD solvers. Though the progress in developing QLGA and QLBM algorithms has been significant, it has largely focused on the development of models rather than applications. As a result, the zoo of QLGA and QLBM algorithms has grown to target several equations and to support many extensions, but the practical use of these models is largely limited to quantum state tomography and observable measurement. This limitation is crucial in practice, because unless very specific criteria are met, such measurements may cancel out any potential quantum advantage. In this paper, we propose an application based on discrete optimization and quantum search, which circumvents flow field measurement altogether. We propose methods for simulating many different lattice configurations simultaneously and describe how the usage of amplitude estimation and quantum search can provide an asymptotic quantum advantage. Throughout the paper, we provide detailed complexity analyses of gate-level implementations of our circuits and consider the benefits and costs of several encodings.

Figures (5)

• Figure 1: Overview of the quantum search algorithm with over superposed QLGA states.
• Figure 2: Example of lattice states, streaming, and collision in the FHP model frisch1986lattice.
• Figure 3: Example of the parallel QLGA circuit for a set of 3 lattices with intersecting initial and boundary conditions.
• Figure 4: Schematic of Modified Hamming Weight Adder quantum circuit.
• Figure 5: Amplitude mapping quantum circuits.