Hybrid quantum algorithms for flow problems
- URL: http://arxiv.org/abs/2307.00391v2
- Date: Tue, 21 Nov 2023 05:14:19 GMT
- Title: Hybrid quantum algorithms for flow problems
- Authors: Sachin S. Bharadwaj and Katepalli R. Sreenivasan
- Abstract summary: We debut here a high performance quantum simulator which we term QFlowS (Quantum Flow Simulator)
We first choose to simulate two well known flows using QFlowS and demonstrate a previously unseen, full gate-level implementation of a hybrid and high precision Quantum Linear Systems Algorithms (QLSA)
This work suggests a path towards quantum simulation of fluid flows, and highlights the special considerations needed at the gate level implementation of QC.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: For quantum computing (QC) to emerge as a practically indispensable
computational tool, there is a need for quantum protocols with an end-to-end
practical applications -- in this instance, fluid dynamics. We debut here a
high performance quantum simulator which we term QFlowS (Quantum Flow
Simulator), designed for fluid flow simulations using QC. Solving nonlinear
flows by QC generally proceeds by solving an equivalent infinite dimensional
linear system as a result of linear embedding. Thus, we first choose to
simulate two well known flows using QFlowS and demonstrate a previously unseen,
full gate-level implementation of a hybrid and high precision Quantum Linear
Systems Algorithms (QLSA) for simulating such flows at low Reynolds numbers.
The utility of this simulator is demonstrated by extracting error estimates and
power law scaling that relates $T_{0}$ (a parameter crucial to Hamiltonian
simulations) to the condition number $\kappa$ of the simulation matrix, and
allows the prediction of an optimal scaling parameter for accurate eigenvalue
estimation. Further, we include two speedup preserving algorithms for (a) the
functional form or sparse quantum state preparation, and (b) \textit{in-situ}
quantum post-processing tool for computing nonlinear functions of the velocity
field. We choose the viscous dissipation rate as an example, for which the
end-to-end complexity is shown to be $\mathcal{O}(\textrm{polylog}
(N/\epsilon)\kappa/\epsilon_{QPP})$, where $N$ is the size of the linear system
of equations, $\epsilon$ is the the solution error and $\epsilon_{QPP}$ is the
error in post processing. This work suggests a path towards quantum simulation
of fluid flows, and highlights the special considerations needed at the gate
level implementation of QC.
Related papers
- Compact quantum algorithms that can potentially maintain quantum advantage for solving time-dependent differential equations [0.0]
We present algorithms for solving time-dependent PDEs governing fluid flow problems.
We build on an idea based on linear combination of unitaries to simulate non-unitary, non-Hermitian quantum systems.
These algorithms lead to low-depth quantum circuits that protect quantum advantage.
arXiv Detail & Related papers (2024-05-16T02:14:58Z) - Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers.
The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
arXiv Detail & Related papers (2024-03-25T14:06:18Z) - A two-circuit approach to reducing quantum resources for the quantum lattice Boltzmann method [41.66129197681683]
Current quantum algorithms for solving CFD problems use a single quantum circuit and, in some cases, lattice-based methods.
We introduce the a novel multiple circuits algorithm that makes use of a quantum lattice Boltzmann method (QLBM)
The problem is cast as a stream function--vorticity formulation of the 2D Navier-Stokes equations and verified and tested on a 2D lid-driven cavity flow.
arXiv Detail & Related papers (2024-01-20T15:32:01Z) - Two quantum algorithms for solving the one-dimensional
advection-diffusion equation [0.0]
Two quantum algorithms are presented for the numerical solution of a linear one-dimensional advection-diffusion equation with periodic boundary conditions.
Their accuracy and performance with increasing qubit number are compared point-by-point with each other.
arXiv Detail & Related papers (2023-12-30T21:23:15Z) - Efficient Mean-Field Simulation of Quantum Circuits Inspired by Density
Functional Theory [1.3561290928375374]
Exact simulations of quantum circuits (QCs) are currently limited to $sim$50 qubits.
Here we show simulations of QCs with a method inspired by density functional theory (DFT)
Our calculations can predict marginal single-qubit probabilities with over 90% accuracy in several classes of QCs with universal gate sets.
arXiv Detail & Related papers (2022-10-29T02:12:15Z) - Accelerating the training of single-layer binary neural networks using
the HHL quantum algorithm [58.720142291102135]
We show that useful information can be extracted from the quantum-mechanical implementation of Harrow-Hassidim-Lloyd (HHL)
This paper shows, however, that useful information can be extracted from the quantum-mechanical implementation of HHL, and used to reduce the complexity of finding the solution on the classical side.
arXiv Detail & Related papers (2022-10-23T11:58:05Z) - Quantum Simulation of Open Quantum Systems Using Density-Matrix
Purification [0.0]
We present a general framework for OQSs where the system's $d times d$ density matrix is recast as a $d2$ wavefunction.
We demonstrate this method on a two-level system in a zero temperature amplitude damping channel and a two-site quantum Ising model.
arXiv Detail & Related papers (2022-07-14T17:59:19Z) - Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary
Optimization [44.96576908957141]
We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
arXiv Detail & Related papers (2022-03-23T18:00:03Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Efficient phase-factor evaluation in quantum signal processing [1.3614427997190908]
Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrixs on quantum computers.
There is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits.
We present here an optimization based method that can accurately compute the phase factors using standard double precision arithmetic operations.
arXiv Detail & Related papers (2020-02-26T17:23:55Z) - Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings.
In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$.
We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
arXiv Detail & Related papers (2020-02-25T19:18:36Z)
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.