A Quantum Inspired Approach to Exploit Turbulence Structures

• URL: http://arxiv.org/abs/2106.05782v3
• Date: Mon, 4 Jul 2022 14:52:56 GMT
• Title: A Quantum Inspired Approach to Exploit Turbulence Structures
• Authors: Nikita Gourianov, Michael Lubasch, Sergey Dolgov, Quincy Y. van den Berg, Hessam Babaee, Peyman Givi, Martin Kiffner, Dieter Jaksch
• Abstract summary: We introduce a new paradigm for analyzing the structure of turbulent flows by quantifying correlations between different length scales. We present results for interscale correlations of two paradigmatic flow examples, and use these insights to design a structure-resolving algorithm for simulating turbulent flows.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Understanding turbulence is the key to our comprehension of many natural and technological flow processes. At the heart of this phenomenon lies its intricate multi-scale nature, describing the coupling between different-sized eddies in space and time. Here we introduce a new paradigm for analyzing the structure of turbulent flows by quantifying correlations between different length scales using methods inspired from quantum many-body physics. We present results for interscale correlations of two paradigmatic flow examples, and use these insights along with tensor network theory to design a structure-resolving algorithm for simulating turbulent flows. With this algorithm, we find that the incompressible Navier-Stokes equations can be accurately solved within a computational space reduced by over an order of magnitude compared to direct numerical simulation. Our quantum-inspired approach provides a pathway towards conducting computational fluid dynamics on quantum computers.

Related papers

• 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)
• Quantum-Inspired Fluid Simulation of 2D Turbulence with GPU Acceleration [0.894484621897981]
  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.
  arXiv  Detail & Related papers  (2024-06-25T10:31:20Z)
• Deep Stochastic Mechanics [17.598067133568062]
  This paper introduces a novel deep-learning-based approach for numerical simulation of a time-evolving Schr"odinger equation. Our method allows us to adapt to the latent low-dimensional structure of the wave function by sampling from the Markovian diffusion.
  arXiv  Detail & Related papers  (2023-05-31T09:28:03Z)
• 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)
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations [55.41644538483948]
  We study strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. We find that the gate complexity using second order Trotter- Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing.
  arXiv  Detail & Related papers  (2022-07-07T09:39:40Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• 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)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)
• An Ode to an ODE [78.97367880223254]
  We present a new paradigm for Neural ODE algorithms, called ODEtoODE, where time-dependent parameters of the main flow evolve according to a matrix flow on the group O(d) This nested system of two flows provides stability and effectiveness of training and provably solves the gradient vanishing-explosion problem.
  arXiv  Detail & Related papers  (2020-06-19T22:05:19Z)
• Simple heuristics for efficient parallel tensor contraction and quantum circuit simulation [1.4416132811087747]
  We propose a parallel algorithm for the contraction of tensor networks using probabilistic models. We apply the resulting algorithm to the simulation of random quantum circuits.
  arXiv  Detail & Related papers  (2020-04-22T23:00:42Z)

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.