Quantum Circuit Model for Lattice Boltzmann Fluid Flow Simulations
- URL: http://arxiv.org/abs/2405.08669v1
- Date: Tue, 14 May 2024 14:51:15 GMT
- Title: Quantum Circuit Model for Lattice Boltzmann Fluid Flow Simulations
- Authors: Dinesh Kumar E, Steven H. Frankel,
- Abstract summary: We propose a quantum computational algorithm for the Lattice Boltzmann Method (LBM) to solve fluid flow equations in the low Reynolds number ($Re$) regime.
The proposed algorithm has been tested through typical benchmark problems like advection-diffusion of a Gaussian hill, Poiseuille flow, Couette flow, and the lid-driven cavity problem.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In the present contribution, we propose a quantum computational algorithm for the Lattice Boltzmann Method (LBM) to solve fluid flow equations in the low Reynolds number ($Re$) regime. Firstly, we express the LBM collision and streaming operators in matrix form. Since quantum logic gates are typically expressed as unitary matrices, we first decompose LBM operations as a product of unitaries. The particle distribution functions (PDFs) of LBM are encoded as probability amplitudes of the quantum state. We have observed that the amplitudes in the state vector (SV) can be affected: (i) by the choice of encoding the PDFs during the quantum state preparation or (ii) when collision is followed by streaming, as in classical LBM implementation. In the first case, we show that the ancilla qubit must be in superposition with the compute qubits during the quantum state preparation. The superposition allows the SV to utilize the increased Hilbert space offered by the ancilla qubit rather than placing the ancilla in a separate register, which restricts the space of possible outcomes. Next, we show that the second issue can be resolved by having an intermediate Hadamard gate before the streaming operation. The proposed algorithm has been tested through typical benchmark problems like advection-diffusion of a Gaussian hill, Poiseuille flow, Couette flow, and the lid-driven cavity problem. The results are validated with the respective analytic or reference solutions. Translating the unitaries into quantum gates (circuit synthesis) presents a primary challenge, as a unitary matrix can be decomposed in multiple ways. We report on the CNOT and U gate counts obtained for the test cases with the range of qubits from 9 to 12. Although the gate count closely agrees with the theoretical limit, the number of two qubit gates is in the $O(10^7)$ prompts special attention to circuit synthesis.
Related papers
- Quantum simulation of dissipation for Maxwell equations in dispersive media [0.0]
dissipation appears in the Schr"odinger representation of classical Maxwell equations as a sparse diagonal operator occupying an $r$-dimensional subspace.
The unitary operators can be implemented through qubit lattice algorithm (QLA) on $n$ qubits.
The non-unitary-dissipative part poses a challenge on how it should be implemented on a quantum computer.
arXiv Detail & Related papers (2023-07-31T18:22:40Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - Randomized semi-quantum matrix processing [0.0]
We present a hybrid quantum-classical framework for Monte-Carlo simulation of generic matrix functions.
Our framework provides a pathway towards early fault-tolerant quantum linear algebra applications.
arXiv Detail & Related papers (2023-07-21T18:00:28Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Impact of decoherence on the fidelity of quantum gates leaving the
computational subspace [0.0]
We show the average gate fidelity of a general multiqubit operation in terms of the dissipative rates and the corresponding Lindblad jump operators.
These results are useful for understanding the error budgets of quantum gates while scaling up quantum computers.
arXiv Detail & Related papers (2023-02-27T15:31:52Z) - Experimental realization of deterministic and selective photon addition
in a bosonic mode assisted by an ancillary qubit [50.591267188664666]
Bosonic quantum error correcting codes are primarily designed to protect against single-photon loss.
Error correction requires a recovery operation that maps the error states -- which have opposite parity -- back onto the code states.
Here, we realize a collection of photon-number-selective, simultaneous photon addition operations on a bosonic mode.
arXiv Detail & Related papers (2022-12-22T23:32:21Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Quantum State Preparation and Non-Unitary Evolution with Diagonal
Operators [0.0]
We present a dilation based algorithm to simulate non-unitary operations on unitary quantum devices.
We use this algorithm to prepare random sub-normalized two-level states on a quantum device with high fidelity.
We also present the accurate non-unitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude damping channel computed on a quantum device.
arXiv Detail & Related papers (2022-05-05T17:56:41Z) - Random quantum circuits anti-concentrate in log depth [118.18170052022323]
We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated.
Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform.
In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
arXiv Detail & Related papers (2020-11-24T18:44:57Z) - Quantum Search for Scaled Hash Function Preimages [1.3299507495084417]
We present the implementation of Grover's algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions.
We show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover's algorithm can only provide some marginal practical advantage in terms of error mitigation.
arXiv Detail & Related papers (2020-09-01T18:00:02Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.