Toward end-to-end quantum simulation of rapidly distorted turbulence

• URL: http://arxiv.org/abs/2511.18802v1
• Date: Mon, 24 Nov 2025 06:12:54 GMT
• Title: Toward end-to-end quantum simulation of rapidly distorted turbulence
• Authors: Zhaoyuan Meng, Leyu Chen, Jin-Peng Liu, Guowei He,
• Abstract summary: We propose an end-to-end quantum algorithm to simulate rapidly distorted turbulence via linear combination of Hamiltonian (LCHS)<n>Our work establishes a foundation for addressing more complex turbulent phenomena on future fault-tolerant quantum computers.
• Score: 4.6376402255720635
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose an end-to-end quantum algorithm to simulate rapidly distorted turbulence via linear combination of Hamiltonian (LCHS). The algorithm comprises three primary stages: the efficient preparation of an initial turbulent state with a prescribed energy spectrum, its subsequent time evolution via LCHS, and the direct measurement of key turbulence statistics. Our analysis indicates that the algorithm can offer a practical quantum speedup over the classical simulation methods for a sufficiently large computational grid. We evaluate the quantum resource requirements for simulating a minimal instance of non-trivial turbulence with classical validation. The numerical results show excellent agreement with ground-truth solutions, capturing both the qualitative evolution of turbulent fields and the quantitative behavior of statistics, including the Reynolds stresses and the fluctuating velocity spectrum. Despite its linearity, rapidly distorted turbulence captures essential turbulence mechanisms and may inform the development of quantum algorithms for the Navier-Stokes equations. Our work establishes a foundation for addressing more complex turbulent phenomena on future fault-tolerant quantum computers.

Related papers

• Resource-efficient quantum simulation of transport phenomena via Hamiltonian embedding [6.521480719947598]
  Transport phenomena play a key role in a variety of application domains, and efficient simulation of these dynamics remains an outstanding challenge.<n>We develop a comprehensive framework for simulating classes of transport equations, offering both rigorous theoretical guarantees and a systematic, hardware-efficient implementation.<n>We then apply our framework to solve linear and nonlinear transport PDEs, including the first experimental demonstration of a 2D advection equation on a trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2026-02-03T04:44:10Z)
• Simulating non-trivial incompressible flows with a quantum lattice Boltzmann algorithm [0.4397520291340695]
  We extend the recent quantum algorithm for the incompressible LBM to account for realistic fluid dynamics setups by incorporating walls, inlets, outlets, and external forcing.<n>Our results provide a pathway to accurate quantum simulation of nonlinear fluid dynamics, and a framework for extending quantum LBM to more challenging flow configurations.
  arXiv  Detail & Related papers  (2025-12-05T15:10:50Z)
• Quantum machine learning for efficient reduced order modelling of turbulent flows [7.466937279190739]
  Accurately predicting turbulent flows remains a central challenge in fluid dynamics due to their high dimensionality and intrinsic nonlinearity.<n>Recent developments in quantum algorithms and machine learning offer new opportunities for overcoming the computational barriers inherent in turbulence modeling.<n>Here we present a new hybrid quantum-classical framework that enables faster-than-real-time turbulence prediction.
  arXiv  Detail & Related papers  (2025-11-23T17:42:46Z)
• Simulating sparse SYK model with a randomized algorithm on a trapped-ion quantum computer [0.4593579891394288]
  The Sachdev-Ye-Kitaev (SYK) model describes a strongly correlated quantum system that shows a strong signature of quantum chaos.<n>Quantum simulations of the SYK model on noisy quantum processors are severely limited by the complexity of its Hamiltonian.<n>We simulate the real-time dynamics of a sparsified version of the SYK model with 24 Majorana fermions on a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2025-07-10T08:26:08Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Simulations for Strong-Field QED [0.0]
  We perform quantum simulations of strong-field QED (SFQED) in $3+1$ dimensions. The interactions relevant for Breit-Wheeler pair-production are transformed into a quantum circuit. Quantum simulations of a "null double slit" experiment are found to agree well with classical simulations.
  arXiv  Detail & Related papers  (2023-11-30T03:05:26Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Hybrid quantum gap estimation algorithm using a filtered time series [0.0]
  We prove that classical post-processing, i.e., long-time filtering of an offline time series, exponentially improves the circuit depth needed for quantum time evolution. We apply the filtering method to the construction of a hybrid quantum-classical algorithm to estimate energy gap. Our findings set the stage for unbiased quantum simulation to offer memory advantage in the near term.
  arXiv  Detail & Related papers  (2022-12-28T18:59:59Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• 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)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

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.