Quantum implicit representation of vortex filaments in turbulence

• URL: http://arxiv.org/abs/2502.18212v1
• Date: Tue, 25 Feb 2025 13:57:32 GMT
• Title: Quantum implicit representation of vortex filaments in turbulence
• Authors: Chenjia Zhu, Ziteng Wang, Shiying Xiong, Yaomin Zhao, Yue Yang,
• Abstract summary: Entangled vortex filaments are essential to turbulence, serving as coherent structures that govern nonlinear fluid dynamics.<n>This study introduces an quantum implicit representation of vortex filaments in turbulence, employing a level-set method.<n>The proposed quantum framework achieves a near-linear time complexity and a exponential storage reduction while maintaining a balance of accuracy, robustness, and versatility.
• Score: 21.386763100595026
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entangled vortex filaments are essential to turbulence, serving as coherent structures that govern nonlinear fluid dynamics and support the reconstruction of fluid fields to reveal statistical properties. This study introduces an quantum implicit representation of vortex filaments in turbulence, employing a level-set method that models the filaments as the intersection of the real and imaginary zero iso-surfaces of a complex scalar field. Describing the fluid field via the wave function offers distinct advantages in capturing complex structures, topological properties, and fluid dynamics, while opening new avenues for innovative solutions through quantum computing platforms. The representation is reformulated into an eigenvalue problem for Hermitian matrices, enabling the conversion of velocity fields into complex scalar fields that embed the vortex filaments. The resulting optimization is addressed using a variational quantum eigensolver, with Pauli operator truncation and deep learning techniques applied to improve efficiency and reduce noise. The proposed quantum framework achieves a near-linear time complexity and a exponential storage reduction while maintaining a balance of accuracy, robustness, and versatility, presenting a promising tool for turbulence analysis, vortex dynamics research, and machine learning dataset generation.

Related papers

• PolyQROM: Orthogonal-Polynomial-Based Quantum Reduced-Order Model for Flow Field Analysis [5.588958112139646]
  Quantum computing promises exponential acceleration for fluid flow simulations. measurement overhead required to extract flow features from quantum-encoded flow field data undermines this advantage.
  arXiv  Detail & Related papers  (2025-04-30T12:14:08Z)
• Quantum lattice Boltzmann method for simulating nonlinear fluid dynamics [12.270811823319576]
  We introduce a novel ensemble description of lattice gas for simulating nonlinear fluid dynamics on a quantum computer.<n>We propose a quantum lattice Boltzmann method that relies on linear operations with medium dimensionality.
  arXiv  Detail & Related papers  (2025-02-23T13:25:35Z)
• Quantum Recurrent Neural Networks with Encoder-Decoder for Time-Dependent Partial Differential Equations [3.9179566873079046]
  This study explores Recurrent Neural Networks within an encoder-decoder framework, integrating Vari Gatedational Circuit Units and Long Short-Term Memory networks.<n>We evaluate the algorithms on the Hamilton-Jacobiman equation, Burgers' equation, the Gray-Scott reaction-diffusion system, and the three dimensional Michaelis-Menten reaction-diffusion equation.
  arXiv  Detail & Related papers  (2025-02-19T02:09:43Z)
• Grassmann time-evolving matrix product operators: An efficient numerical approach for fermionic path integral simulations [0.0]
  We introduce the concepts of Grassmann tensor, signed matrix product operator, and Grassmann matrix product state to handle the Grassmann path integral. Our method is a robust and promising numerical approach to study strong coupling physics and non-Markovian dynamics. It can also serve as an alternative impurity solver to study strongly-correlated quantum matter with dynamical mean-field theory.
  arXiv  Detail & Related papers  (2024-10-15T12:17:29Z)
• Simulating Non-Markovian Dynamics in Multidimensional Electronic Spectroscopy via Quantum Algorithm [0.0]
  We present a general approach for the simulation of the optical response of multi-chromophore systems in a structured environment. A key step of the procedure is the pseudomode embedding of the system-environment problem resulting in a finite set of quantum states evolving. This formulation is then solved by a collision model integrated into a quantum algorithm designed to simulate linear and nonlinear response functions.
  arXiv  Detail & Related papers  (2024-09-09T12:13:41Z)
• 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)
• A Universal Framework for Quantum Dissipation:Minimally Extended State Space and Exact Time-Local Dynamics [5.221249829454763]
  dynamics of open quantum systems is formulated in a minimally extended state space. Time-local evolution equation is created in a mixed Liouville-Fock space.
  arXiv  Detail & Related papers  (2023-07-31T15:57:10Z)
• 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)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• 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)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations [79.71184760864507]
  This article introduces a new physics-based method for rigid point set alignment called Fast Gravitational Approach (FGA) In FGA, the source and target point sets are interpreted as rigid particle swarms with masses interacting in a globally multiply-linked manner while moving in a simulated gravitational force field. We show that the new method class has characteristics not found in previous alignment methods.
  arXiv  Detail & Related papers  (2020-09-28T15:05:39Z)
• Masked Language Modeling for Proteins via Linearly Scalable Long-Context Transformers [42.93754828584075]
  We present a new Transformer architecture, Performer, based on Fast Attention Via Orthogonal Random features (FAVOR) Our mechanism scales linearly rather than quadratically in the number of tokens in the sequence, is characterized by sub-quadratic space complexity and does not incorporate any sparsity pattern priors. It provides strong theoretical guarantees: unbiased estimation of the attention matrix and uniform convergence.
  arXiv  Detail & Related papers  (2020-06-05T17:09:16Z)

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.