A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method

Abstract

This work proposes a multi-circuit quantum lattice Boltzmann method (QLBM) algorithm that leverages parallel quantum computing to reduce quantum resource requirements. Computational fluid dynamics (CFD) simulations often entail a large computational burden on classical computers. At present, these simulations can require up to trillions of grid points and millions of time steps. To reduce costs, novel architectures like quantum computers may be intrinsically more efficient for these computations. Current quantum algorithms for solving CFD problems are based on single quantum circuits and, in many cases, use lattice-based methods. Current quantum devices are adorned with sufficient noise to make large and deep circuits untenable. We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations. The method, called QLBM-frugal, aims to create more practical quantum circuits and strategies for differential equation-based problems. The presented method is validated and demonstrated for 2D lid-driven cavity flow. The two-circuit algorithm shows a marked reduction in CNOT gates, which consume the majority of the runtime on quantum devices. Compared to the baseline QLBM technique, a two-circuit strategy shows increasingly large improvements in gate counts as the qubit size, or problem size, increases. For 64 lattice sites, the CNOT count was reduced by 35%, and the gate depth decreased by 16%. This strategy also enables concurrent circuit execution, further halving the seen gate depth.

25 pages, 14 figures, 2 tables

References in corpus (33)

• Quantum Computing
• Quantum algorithm for solving linear systems of equations
• Supervised learning with quantum enhanced feature spaces
• A Quantum Approximate Optimization Algorithm
• Quantum Chemistry in the Age of Quantum Computing
• Hamiltonian Simulation by Qubitization
• Efficient quantum state tomography
• Synthesis of Quantum Logic Circuits
• A rigorous and robust quantum speed-up in supervised machine learning
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Quantum speedup of Monte Carlo methods
• Variational quantum algorithms for nonlinear problems
• Preconditioned quantum linear system algorithm
• Quantum computing for finance
• Efficient quantum algorithm for dissipative nonlinear differential equations
• Quantum computing with Qiskit
• Variational Quantum Linear Solver
• A divide-and-conquer algorithm for quantum state preparation
• Quantum Algorithm for Simulating the Wave Equation
• A Quantum Inspired Approach to Exploit Turbulence Structures
• Variational Quantum Algorithms for Computational Fluid Dynamics
• Statistical Methods for Quantum State Verification and Fidelity Estimation
• Variational Quantum Solutions to the Advection-Diffusion Equation for Applications in Fluid Dynamics
• Hybrid quantum algorithms for flow problems
• Lattice Boltzmann-Carleman quantum algorithm and circuit for fluid flows at moderate Reynolds number
• Box algorithm for the solution of differential equations on a quantum annealer
• Potential quantum advantage for simulation of fluid dynamics
• Incompressible Navier-Stokes solve on noisy quantum hardware via a hybrid quantum-classical scheme
• Efficient parallelization of quantum basis state shift
• Efficient Quantum Lattice Gas Automata
• A Hybrid Quantum-Classical CFD Methodology with Benchmark HHL Solutions
• Dynamic Circuits for the Quantum Lattice-Boltzmann Method
• Unitary Quantum Algorithm for the Lattice-Boltzmann Method