Quantum-Inspired Fluid Simulation of 2D Turbulence with GPU Acceleration

• URL: http://arxiv.org/abs/2406.17823v1
• Date: Tue, 25 Jun 2024 10:31:20 GMT
• Title: Quantum-Inspired Fluid Simulation of 2D Turbulence with GPU Acceleration
• Authors: Leonhard Hölscher, Pooja Rao, Lukas Müller, Johannes Klepsch, Andre Luckow, Tobias Stollenwerk, Frank K. Wilhelm,
• Abstract summary: We study an algorithm for solving the Navier-Stokes equations using velocity as matrix product states. Our adaptation speeds up simulations by up to 12.1 times. We find that the algorithm has a potential advantage over direct numerical simulations in the turbulent regime.
• Score: 0.894484621897981
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Tensor network algorithms can efficiently simulate complex quantum many-body systems by utilizing knowledge of their structure and entanglement. These methodologies have been adapted recently for solving the Navier-Stokes equations, which describe a spectrum of fluid phenomena, from the aerodynamics of vehicles to weather patterns. Within this quantum-inspired paradigm, velocity is encoded as matrix product states (MPS), effectively harnessing the analogy between interscale correlations of fluid dynamics and entanglement in quantum many-body physics. This particular tensor structure is also called quantics tensor train (QTT). By utilizing NVIDIA's cuQuantum library to perform parallel tensor computations on GPUs, our adaptation speeds up simulations by up to 12.1 times. This allows us to study the algorithm in terms of its applicability, scalability, and performance. By simulating two qualitatively different but commonly encountered 2D flow problems at high Reynolds numbers up to $1\times10^7$ using a fourth-order time stepping scheme, we find that the algorithm has a potential advantage over direct numerical simulations in the turbulent regime as the requirements for grid resolution increase drastically. In addition, we derive the scaling $\chi=\mathcal{O}(\text{poly}(1/\epsilon))$ for the maximum bond dimension $\chi$ of MPS representing turbulent flow fields, with an error $\epsilon$, based on the spectral distribution of turbulent kinetic energy. Our findings motivate further exploration of related quantum algorithms and other tensor network methods.

Related papers

• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Quantum Calculation for Two-Stream Instability and Advection Test of Vlasov-Maxwell Equations: Numerical Evaluation of Hamiltonian Simulation [0.0]
  We develop a quantum-classical hybrid Vlasov-Maxwell solver. We perform numerical simulation of a 1D advection test and a 1D1V two-stream instability test. Our quantum algorithm is robust under larger time steps compared with classical algorithms.
  arXiv  Detail & Related papers  (2024-08-21T11:56:55Z)
• Simulating unsteady fluid flows on a superconducting quantum processor [23.24560103938476]
  We report an experiment on the digital simulation of unsteady flows, which consists of quantum encoding, evolution, and detection of flow states. This work demonstrates the potential of quantum computing in simulating more complex flows, such as turbulence, for practical applications.
  arXiv  Detail & Related papers  (2024-04-24T13:45:43Z)
• Geometry-Informed Neural Operator for Large-Scale 3D PDEs [76.06115572844882]
  We propose the geometry-informed neural operator (GINO) to learn the solution operator of large-scale partial differential equations. We successfully trained GINO to predict the pressure on car surfaces using only five hundred data points.
  arXiv  Detail & Related papers  (2023-09-01T16:59:21Z)
• Hybrid quantum algorithms for flow problems [0.0]
  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.
  arXiv  Detail & Related papers  (2023-07-01T17:39:21Z)
• Potential quantum advantage for simulation of fluid dynamics [1.4046104514367475]
  We show that a potential quantum exponential speedup can be achieved to simulate the Navier-Stokes equations governing turbulence using quantum computing. This work suggests that an exponential quantum advantage may exist for simulating nonlinear multiscale transport phenomena.
  arXiv  Detail & Related papers  (2023-03-29T09:14:55Z)
• Tensor network reduced order models for wall-bounded flows [0.0]
  We introduce a widely applicable tensor network-based framework for developing reduced order models. We consider the incompressible Navier-Stokes equations and the lid-driven cavity in two spatial dimensions.
  arXiv  Detail & Related papers  (2023-03-06T10:33:00Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
  We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We numerically demonstrate that the MNIST image dataset satisfies such conditions. We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
  arXiv  Detail & Related papers  (2021-07-19T23:41: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)
• 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.