Potential quantum advantage for simulation of fluid dynamics

• URL: http://arxiv.org/abs/2303.16550v3
• Date: Fri, 29 Mar 2024 00:20:12 GMT
• Title: Potential quantum advantage for simulation of fluid dynamics
• Authors: Xiangyu Li, Xiaolong Yin, Nathan Wiebe, Jaehun Chun, Gregory K. Schenter, Margaret S. Cheung, Johannes Mülmenstädt,
• Abstract summary: 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.
• Score: 1.4046104514367475
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Numerical simulation of turbulent fluid dynamics needs to either parameterize turbulence-which introduces large uncertainties-or explicitly resolve the smallest scales-which is prohibitively expensive. Here we provide evidence through analytic bounds and numerical studies that a potential quantum exponential speedup can be achieved to simulate the Navier-Stokes equations governing turbulence using quantum computing. Specifically, we provide a formulation of the lattice Boltzmann equation for which we give evidence that low-order Carleman linearization is much more accurate than previously believed for these systems and that for computationally interesting examples. This is achieved via a combination of reformulating the nonlinearity and accurately linearizing the dynamical equations, effectively trading nonlinearity for additional degrees of freedom that add negligible expense in the quantum solver. Based on this we apply a quantum algorithm for simulating the Carleman-linearized lattice Boltzmann equation and provide evidence that its cost scales logarithmically with system size, compared to polynomial scaling in the best known classical algorithms. This work suggests that an exponential quantum advantage may exist for simulating fluid dynamics, paving the way for simulating nonlinear multiscale transport phenomena in a wide range of disciplines using quantum computing.

Related papers

• Quantum Carleman linearisation efficiency in nonlinear fluid dynamics [0.2624902795082451]
  One promising avenue to enhance Computational fluid dynamics is the use of quantum computing. We propose a connection between the numerical parameter, $R$, that guarantees efficiency in the truncation of the Carleman linearisation. We also introduce the formalism for vector field simulation in different spatial dimensions.
  arXiv  Detail & Related papers  (2024-10-30T14:32:18Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Machine learning of hidden variables in multiscale fluid simulation [77.34726150561087]
  Solving fluid dynamics equations often requires the use of closure relations that account for missing microphysics. In our study, a partial differential equation simulator that is end-to-end differentiable is used to train judiciously placed neural networks. We show that this method enables an equation based approach to reproduce non-linear, large Knudsen number plasma physics.
  arXiv  Detail & Related papers  (2023-06-19T06:02:53Z)
• Quantum computing of fluid dynamics using the hydrodynamic Schr\"odinger equation [7.752417113600681]
  We propose a framework for quantum computing of fluid dynamics based on the hydrodynamic Schr"odinger equation (HSE) We develop a prediction-correction quantum algorithm to solve the HSE. This algorithm is implemented for simple flows on the quantum simulator Qiskit with exponential speedup.
  arXiv  Detail & Related papers  (2023-02-20T03:43:27Z)
• Quantum Computing for Fusion Energy Science Applications [0.0]
  We explore the topic of using quantum computers to simulate both linear and nonlinear dynamics in greater detail. We extend previous results on embedding nonlinear systems within linear systems by explicitly deriving the connection between the Koopman evolution operator and the Perron-Frobenius evolution operator. We discuss the simulation of toy models of wave-particle interactions through the simulation of quantum maps and of wave-wave interactions important in nonlinear plasma dynamics.
  arXiv  Detail & Related papers  (2022-12-09T18:56:46Z)
• Discovering hydrodynamic equations of many-body quantum systems [0.0]
  We develop a new machine-learning framework for automated discovery of effective equations from a limited set of available data. We reproduce previously known hydrodynamic equations, strikingly discover novel equations and provide their derivation. Our approach provides a new interpretable method to study properties of quantum materials and quantum simulators in non-perturbative regimes.
  arXiv  Detail & Related papers  (2021-11-03T17:55:07Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Designing Kerr Interactions for Quantum Information Processing via Counterrotating Terms of Asymmetric Josephson-Junction Loops [68.8204255655161]
  static cavity nonlinearities typically limit the performance of bosonic quantum error-correcting codes. Treating the nonlinearity as a perturbation, we derive effective Hamiltonians using the Schrieffer-Wolff transformation. Results show that a cubic interaction allows to increase the effective rates of both linear and nonlinear operations.
  arXiv  Detail & Related papers  (2021-07-14T15:11:05Z)
• 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)
• Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms [74.17312533172291]
  We describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding) We then explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation)
  arXiv  Detail & Related papers  (2020-12-12T00:01:10Z)

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.