Answers are grounded in this paper and cite their sources.
This study proposes a quantum annealing-based algorithm for flow computation based on lattice-gas automata (LGA). Since the state of the lattice gas is determined by Boolean variables, 0 (absence) or 1 (presence), in LGA, it is well suited for implementation in quantum annealing and simulated annealing computers. The quantum annealing-based algorithm proposed in this study is constructed so that conservation of mass and momentum is satisfied at the particle collision process. Verification tests performed with various quantum annealing and simulated annealing computers confirm that the proposed algorithm well replicates a conventional LGA collision model.
No takes yet. Share an insight, caveat, or question.
Kuya et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: