Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations

DOI10.1016/j.jcp.2023.112149arXiv2209.08478OpenAlexW4366134209MaRDI QIDQ6158103

Publication date: 31 May 2023

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.08478

zbMATH Keywords

semiclassical Schrödinger equation Liouville representation quantum linear systems algorithms Koopman-von Neumann representation linear representation methods

Mathematics Subject Classification ID

Theory of computing (68Qxx) Basic linear algebra (15Axx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)

Related Items (1)

Quantum simulation for partial differential equations with physical boundary or interface conditions

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Some simple estimates for singular values of a matrix
On Wigner measures
Moment closure hierarchies for kinetic theories.
On time-splitting spectral approximations for the Schrödinger equation in the semiclassical regime
Quantum algorithm for linear differential equations with exponentially improved dependence on precision
On the convergence of time splitting methods for quantum dynamics in the semiclassical regime
Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations
Quantum spectral methods for differential equations
A level set method for the computation of multivalued solutions to quasi-linear hyperbolic PDEs and Hamilton-Jacobi equations
Quantum Computation and Quantum Information
Mathematical and computational methods for semiclassical Schrödinger equations
The Order of Accuracy of Quadrature Formulae for Periodic Functions
Rapid solution of problems by quantum computation
Homogenization limits and Wigner transforms
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Finite Volume Methods for Hyperbolic Problems
Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
Quantum algorithm and circuit design solving the Poisson equation
Adaptive Quantum Simulated Annealing for Bayesian Inference and Estimating Partition Functions
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
High-order quantum algorithm for solving linear differential equations
Asymptotic Theory of the Boltzmann Equation
Computing quantum dynamics in the semiclassical regime
Asymptotic-preserving schemes for multiscale physical problems
A polynomial quantum algorithm for approximating the Jones polynomial

This page was built for publication: Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations