Quantum computing of reacting flows via Hamiltonian simulation

• URL: http://arxiv.org/abs/2312.07893v3
• Date: Sun, 28 Jul 2024 13:00:20 GMT
• Title: Quantum computing of reacting flows via Hamiltonian simulation
• Authors: Zhen Lu, Yue Yang,
• Abstract summary: We develop the quantum spectral and finite difference methods for simulating reacting flows in periodic and general conditions. The present quantum computing algorithms offer a one-shot'' solution for a given time without temporal discretization.
• Score: 13.377719901871027
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We report the quantum computing of reacting flows by simulating the Hamiltonian dynamics. The scalar transport equation for reacting flows is transformed into a Hamiltonian system, mapping the dissipative and non-Hermitian problem in physical space to a Hermitian one in a higher-dimensional space. Using this approach, we develop the quantum spectral and finite difference methods for simulating reacting flows in periodic and general conditions, respectively. The present quantum computing algorithms offer a ``one-shot'' solution for a given time without temporal discretization, avoiding iterative quantum state preparation and measurement. We compare computational complexities of the quantum and classical algorithms. The quantum spectral method exhibits exponential acceleration relative to its classical counterpart, and the quantum finite difference method can achieve exponential speedup in high-dimensional problems. The quantum algorithms are validated on quantum computing simulators with the Qiskit package. The validation cases cover one- and two-dimensional reacting flows with a linear source term and periodic or inlet-outlet boundary conditions. The results obtained from the quantum spectral and finite difference methods agree with analytical and classical simulation results. They accurately capture the convection, diffusion, and reaction processes. This demonstrates the potential of quantum computing as an efficient tool for the simulation of reactive flows in combustion.

Related papers

• Non-adiabatic quantum dynamics with fermionic subspace-expansion algorithms on quantum computers [0.0]
  We introduce a novel computational framework for excited-states molecular quantum dynamics simulations. We calculate the required excited-state transition properties with different flavors of the quantum subspace expansion and quantum equation-of-motion algorithms. We show that only methods that can capture both weak and strong electron correlation effects can properly describe the non-adiabatic effects that tune the reactive event.
  arXiv  Detail & Related papers  (2024-02-23T15:09:19Z)
• A quantum computing concept for 1-D elastic wave simulation with exponential speedup [0.0]
  We present a quantum computing concept for 1-D elastic wave propagation in heterogeneous media. The method rests on a finite-difference approximation, followed by a sparsity-preserving transformation of the discrete elastic wave equation to a Schr"odinger equation. An implementation on an error-free quantum simulator verifies our approach and forms the basis of numerical experiments.
  arXiv  Detail & Related papers  (2023-12-22T14:58:01Z)
• Digital quantum simulator for the time-dependent Dirac equation using discrete-time quantum walks [0.7036032466145112]
  We introduce a quantum algorithm for simulating the time-dependent Dirac equation in 3+1 dimensions using discrete-time quantum walks. Our findings indicate that relativistic dynamics is achievable with quantum computers.
  arXiv  Detail & Related papers  (2023-05-31T05:36:57Z)
• 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)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Commutation simulator for open quantum dynamics [0.0]
  We propose an innovative method to investigate directly the properties of a time-dependent density operator $hatrho(t)$. We can directly compute the expectation value of the commutation relation and thus of the rate of change of $hatrho(t)$. A simple but important example is demonstrated in the single-qubit case and we discuss extension of the method for practical quantum simulation with many qubits.
  arXiv  Detail & Related papers  (2022-06-01T16:03:43Z)
• 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)
• Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers [0.0]
  We show how to tackle the problem using a suitably quantum computer. We propose a hybrid quantum-classical sampling scheme to escape local minima.
  arXiv  Detail & Related papers  (2021-08-25T18:04:52Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)
• 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)

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.