A quantum algorithm for advection-diffusion equation by a probabilistic imaginary-time evolution operator
- URL: http://arxiv.org/abs/2409.18559v1
- Date: Fri, 27 Sep 2024 08:56:21 GMT
- Title: A quantum algorithm for advection-diffusion equation by a probabilistic imaginary-time evolution operator
- Authors: Xinchi Huang, Hirofumi Nishi, Taichi Kosugi, Yoshifumi Kawada, Yu-ichiro Matsushita,
- Abstract summary: We propose a quantum algorithm for solving the linear advection-diffusion equation by employing a new approximate probabilistic imaginary-time evolution (PITE) operator.
We construct the explicit quantum circuit for realizing the imaginary-time evolution of the Hamiltonian coming from the advection-diffusion equation.
Our algorithm gives comparable result to the Harrow-Hassidim-Lloyd (HHL) algorithm with similar gate complexity, while we need much less ancillary qubits.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper, we propose a quantum algorithm for solving the linear advection-diffusion equation by employing a new approximate probabilistic imaginary-time evolution (PITE) operator which improves the existing approximate PITE. First, the effectiveness of the proposed approximate PITE operator is justified by the theoretical evaluation of the error. Next, we construct the explicit quantum circuit for realizing the imaginary-time evolution of the Hamiltonian coming from the advection-diffusion equation, whose gate complexity is logarithmic regarding the size of the discretized Hamiltonian matrix. Numerical simulations using gate-based quantum emulator for 1D/2D examples are also provided to support our algorithm. Finally, we extend our algorithm to the coupled system of advection-diffusion equations, and we also compare our proposed algorithm to some other algorithms in the previous works. We find that our algorithm gives comparable result to the Harrow-Hassidim-Lloyd (HHL) algorithm with similar gate complexity, while we need much less ancillary qubits. Besides, our algorithm outperforms a specific HHL algorithm and a variational quantum algorithm (VQA) based on the finite difference method (FDM).
Related papers
- Explicit near-optimal quantum algorithm for solving the advection-diffusion equation [0.0]
An explicit quantum algorithm is proposed for modeling dissipative initial-value problems.
We propose a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function.
The proposed algorithm can be used for modeling a wide class of nonunitary initial-value problems.
arXiv Detail & Related papers (2025-01-19T19:03:29Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective [39.58317527488534]
We present an algorithm for solving systems of linear equations based on the HHL algorithm with a novel qudits methodology.
We perform a quantum-inspired version on tensor networks, taking advantage of their ability to perform non-unitary operations such as projection.
arXiv Detail & Related papers (2023-09-11T08:18:41Z) - Scalable Algorithms for Power Function Calculations of quantum states in
NISQ Era [7.2223563491914]
This article focuses on the development of scalable and quantum bit-efficient algorithms for computing power functions of random quantum states.
Two algorithms, based on Hadamard testing and Gate Set Tomography, are proposed.
arXiv Detail & Related papers (2023-08-28T16:08:17Z) - Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications.
This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
arXiv Detail & Related papers (2023-01-30T15:46:39Z) - Classical and Quantum Iterative Optimization Algorithms Based on Matrix
Legendre-Bregman Projections [1.5736899098702972]
We consider Legendre-Bregman projections defined on the Hermitian matrix space and design iterative optimization algorithms based on them.
We study both exact and approximate Bregman projection algorithms.
In particular, our approximate iterative algorithm gives rise to the non-commutative versions of the generalized iterative scaling (GIS) algorithm for maximum entropy inference.
arXiv Detail & Related papers (2022-09-28T15:59:08Z) - Alternatives to a nonhomogeneous partial differential equation quantum
algorithm [52.77024349608834]
We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$.
These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
arXiv Detail & Related papers (2022-05-11T14:29:39Z) - Quantum Gaussian process regression [3.4501155479285326]
The proposed quantum algorithm consists of three sub-algorithms.
One is the first quantum subalgorithm to efficiently generate mean predictor.
The other is to product covariance predictor with same method.
arXiv Detail & Related papers (2021-06-12T07:03:27Z) - Provably Faster Algorithms for Bilevel Optimization [54.83583213812667]
Bilevel optimization has been widely applied in many important machine learning applications.
We propose two new algorithms for bilevel optimization.
We show that both algorithms achieve the complexity of $mathcalO(epsilon-1.5)$, which outperforms all existing algorithms by the order of magnitude.
arXiv Detail & Related papers (2021-06-08T21:05:30Z) - Quantum Algorithms for Prediction Based on Ridge Regression [0.7612218105739107]
We propose a quantum algorithm based on ridge regression model, which get the optimal fitting parameters.
The proposed algorithm has a wide range of application and the proposed algorithm can be used as a subroutine of other quantum algorithms.
arXiv Detail & Related papers (2021-04-27T11:03:52Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z)
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.