Time complexity analysis of quantum difference methods for the multiscale transport equations

• URL: http://arxiv.org/abs/2211.06593v1
• Date: Sat, 12 Nov 2022 07:13:49 GMT
• Title: Time complexity analysis of quantum difference methods for the multiscale transport equations
• Authors: He Xiaoyang, Jin Shi, Yu Yue
• Abstract summary: We find that the complexities for the even-odd parity based Asymptotic-Preserving scheme do not depend on $varepsilon$. This indicates that it is still of great importance to use AP schemes for multiscale problems in quantum computing.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We investigate time complexities of finite difference methods for solving the multiscale transport equation with quantum algorithms. We find that the time complexities of both the classical treatment and quantum treatment for a standard explicit scheme scale as $\mathcal{O}(1/\varepsilon)$, where $\varepsilon$ is the small scaling parameter, while the complexities for the even-odd parity based Asymptotic-Preserving (AP) scheme do not depend on $\varepsilon$. This indicates that it is still of great importance to use AP (and probably other efficient multiscale) schemes for multiscale problems in quantum computing when solving multiscale transport or kinetic equations.

Related papers

• Halving the Cost of Quantum Algorithms with Randomization [0.138120109831448]
  Quantum signal processing (QSP) provides a systematic framework for implementing a transformation of a linear operator. Recent works have developed randomized compiling, a technique that promotes a unitary gate to a quantum channel. Our algorithm implements a probabilistic mixture of randomizeds, strategically chosen so that the average evolution converges to that of a target function, with an error quadratically smaller than that of an equivalent individual.
  arXiv  Detail & Related papers  (2024-09-05T17:56:51Z)
• Quantum Circuits for the heat equation with physical boundary conditions via Schrodingerisation [33.76659022113328]
  This paper explores the explicit design of quantum circuits for quantum simulation of partial differential equations (PDEs) with physical boundary conditions. We present two methods for handling the inhomogeneous terms arising from time-dependent physical boundary conditions. We then apply the quantum simulation technique from [CJL23] to transform the resulting non-autonomous system to an autonomous system in one higher dimension.
  arXiv  Detail & Related papers  (2024-07-22T03:52:14Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer. Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model. We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• Taming Quantum Time Complexity [45.867051459785976]
  We show how to achieve both exactness and thriftiness in the setting of time complexity. We employ a novel approach to the design of quantum algorithms based on what we call transducers.
  arXiv  Detail & Related papers  (2023-11-27T14:45:19Z)
• Dense outputs from quantum simulations [5.295277584890625]
  The quantum dense output problem is the process of evaluating time-accumulated observables from time-dependent quantum dynamics. This problem arises frequently in applications such as quantum control and spectroscopic computation. We present a range of algorithms designed to operate on both early and fully fault-tolerant quantum platforms.
  arXiv  Detail & Related papers  (2023-07-26T18:16:51Z)
• Fast quantum algorithm for differential equations [0.5895819801677125]
  We present a quantum algorithm with numerical complexity that is polylogarithmic in $N$ but is independent of $kappa$ for a large class of PDEs. Our algorithm generates a quantum state that enables extracting features of the solution.
  arXiv  Detail & Related papers  (2023-06-20T18:01:07Z)
• Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems [2.707154152696381]
  We propose efficient quantum algorithms for solving nonlinear differential equations (SDE) via the associated Fokker-Planck equation (FPE) We discretize the FPE in space and time using two well-known numerical schemes, namely Chang-Cooper and implicit finite difference. We then compute the solution of the resulting system of linear equations using the quantum linear systems.
  arXiv  Detail & Related papers  (2023-03-04T17:40:23Z)
• Correspondence between open bosonic systems and stochastic differential equations [77.34726150561087]
  We show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment. A particular system with the form of a discrete nonlinear Schr"odinger equation is analyzed in more detail.
  arXiv  Detail & Related papers  (2023-02-03T19:17:37Z)
• Time-marching based quantum solvers for time-dependent linear differential equations [3.1952399274829775]
  The time-marching strategy is a natural strategy for solving time-dependent differential equations on classical computers. We show that a time-marching based quantum solver can suffer from exponentially vanishing success probability with respect to the number of time steps. This provides a path of designing quantum differential equation solvers that is alternative to those based on quantum linear systems algorithms.
  arXiv  Detail & Related papers  (2022-08-14T23:49:19Z)
• Oracle separations of hybrid quantum-classical circuits [68.96380145211093]
  Two models of quantum computation: CQ_d and QC_d. CQ_d captures the scenario of a d-depth quantum computer many times; QC_d is more analogous to measurement-based quantum computation. We show that, despite the similarities between CQ_d and QC_d, the two models are intrinsically, i.e. CQ_d $nsubseteq$ QC_d and QC_d $nsubseteq$ CQ_d relative to an oracle.
  arXiv  Detail & Related papers  (2022-01-06T03:10:53Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)

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.