Enabling Large-Scale and High-Precision Fluid Simulations on Near-Term Quantum Computers
- URL: http://arxiv.org/abs/2406.06063v3
- Date: Wed, 19 Jun 2024 09:23:37 GMT
- Title: Enabling Large-Scale and High-Precision Fluid Simulations on Near-Term Quantum Computers
- Authors: Zhao-Yun Chen, Teng-Yang Ma, Chuang-Chao Ye, Liang Xu, Ming-Yang Tan, Xi-Ning Zhuang, Xiao-Fan Xu, Yun-Jie Wang, Tai-Ping Sun, Yong Chen, Lei Du, Liang-Liang Guo, Hai-Feng Zhang, Hao-Ran Tao, Tian-Le Wang, Xiao-Yan Yang, Ze-An Zhao, Peng Wang, Sheng Zhang, Chi Zhang, Ren-Ze Zhao, Zhi-Long Jia, Wei-Cheng Kong, Meng-Han Dou, Jun-Chao Wang, Huan-Yu Liu, Cheng Xue, Peng-Jun-Yi Zhang, Sheng-Hong Huang, Peng Duan, Yu-Chun Wu, Guo-Ping Guo,
- Abstract summary: Quantum computational fluid dynamics (QCFD) offers a promising alternative to classical computational fluid dynamics (CFD)
This paper introduces a comprehensive QCFD method, including an iterative method "Iterative-QLS" that suppresses error in quantum linear solver.
We implement our method on a superconducting quantum computer, demonstrating successful simulations of steady Poiseuille flow and unsteady acoustic wave propagation.
- Score: 17.27937804402152
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Quantum computational fluid dynamics (QCFD) offers a promising alternative to classical computational fluid dynamics (CFD) by leveraging quantum algorithms for higher efficiency. This paper introduces a comprehensive QCFD method, including an iterative method "Iterative-QLS" that suppresses error in quantum linear solver, and a subspace method to scale the solution to a larger size. We implement our method on a superconducting quantum computer, demonstrating successful simulations of steady Poiseuille flow and unsteady acoustic wave propagation. The Poiseuille flow simulation achieved a relative error of less than $0.2\%$, and the unsteady acoustic wave simulation solved a 5043-dimensional matrix. We emphasize the utilization of the quantum-classical hybrid approach in applications of near-term quantum computers. By adapting to quantum hardware constraints and offering scalable solutions for large-scale CFD problems, our method paves the way for practical applications of near-term quantum computers in computational science.
Related papers
- qHEOM: A Quantum Algorithm for Simulating Non-Markovian Quantum Dynamics Using the Hierarchical Equations of Motion [0.0]
We introduce a quantum algorithm designed to simulate non-Markovian dynamics of open quantum systems.
Our approach enables the implementation of arbitrary quantum master equations on noisy intermediate-scale quantum computers.
arXiv Detail & Related papers (2024-11-18T20:41:10Z) - Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC)
This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions.
Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
arXiv Detail & Related papers (2024-11-13T12:03:39Z) - Multi-reference Quantum Davidson Algorithm for Quantum Dynamics [3.3869539907606603]
Quantum Krylov Subspace (QKS) methods have been developed, enhancing the ability to perform accelerated simulations on noisy intermediate-scale quantum computers.
We introduce and evaluate two QKS methods derived from the QDavidson algorithm, a novel approach for determining the ground and excited states of many-body systems.
arXiv Detail & Related papers (2024-06-12T22:30:52Z) - Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum
Computer [0.40964539027092917]
We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer.
Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits.
In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
arXiv Detail & Related papers (2023-12-03T13:56:41Z) - Quantum Embedding Method for the Simulation of Strongly Correlated
Systems on Quantum Computers [0.0]
We introduce the projection-based embedding method for combining the variational quantum eigensolver (VQE) algorithm with density functional theory (DFT)
The developed VQE-in-DFT method is then implemented efficiently on a real quantum device and employed for simulating the triple bond breaking process in butyronitrile.
The developments will benefit many different chemical areas including the computer aided drug design as well as the study of metalloenzymes with a strongly correlated fragment.
arXiv Detail & Related papers (2023-02-06T19:00:03Z) - A self-consistent field approach for the variational quantum
eigensolver: orbital optimization goes adaptive [52.77024349608834]
We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE)
This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
arXiv Detail & Related papers (2022-12-21T23:15:17Z) - 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) - 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) - 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) - Hybrid quantum variational algorithm for simulating open quantum systems
with near-term devices [0.0]
Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources.
We develop an HQC algorithm using an efficient variational optimization approach to simulate open system dynamics.
arXiv Detail & Related papers (2020-08-12T13:49:29Z)
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.