Optimal Scaling Quantum Linear-Systems Solver via Discrete Adiabatic Theorem

@article{Costa2022OptimalSQ,
  title={Optimal Scaling Quantum Linear-Systems Solver via Discrete Adiabatic Theorem},
  author={Pedro C. S. Costa and Dong An and Yuval R. Sanders and Yuan Su and Ryan Babbush and Dominic W. Berry},
  journal={PRX Quantum},
  year={2022}
}
Pedro C. S. Costa, Dong An, 3 Yuval R. Sanders, 4 Yuan Su, Ryan Babbush, and Dominic W. Berry Department of Physics and Astronomy, Macquarie University, Sydney, NSW 2109, AU Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD 20742, USA Google Quantum AI, Venice, CA 90291, USA Centre for Quantum Software and Information, University of Technology Sydney, Sydney, NSW 2007, AU (Dated: November 17, 2021) 

Figures and Tables from this paper

A near-term quantum algorithm for solving linear systems of equations based on the Woodbury identity

A quantum algorithm for solving linear systems of equations that is based on the Woodbury identity, which analytically describes the inverse of a matrix that is a low-rank modification of another (easily-invertible) matrix that can produce accurate results on current hardware.

A Survey of Quantum Computing for Finance

A comprehensive summary of the state of the art of quantum computing for financial applications, with particular emphasis on stochastic modeling, optimization, and machine learning, describing how these solutions, adapted to work on a quantum computer, can potentially help to solve financial problems more efficiently and accurately.

A theory of quantum differential equation solvers: limitations and fast-forwarding

It is shown that ODEs in the absence of both types of “non-quantumness” are equivalent to quantum dynamics, and the conclusion is reached that quantum algorithms for quantum dynamics work best.

Quantum algorithm for dense and full-rank kernels using hierarchical matrices

This work proposes a quantum algorithm for efficiently performing matrix operations on hierarchical matrices by implementing a quantum block-encoding of the hierarchical matrix structure and shows how this runtime is near-optimal and exponentially improves over prior quantum linear systems algorithms for dense and full-rank kernel matrices.

Time-marching based quantum solvers for time-dependent linear differential equations

It is proved that the linear dependence on the amplification ratio attains the query complexity lower bound and thus cannot be improved in general and provides a path of designing quantum differential equation solvers that is alternative to those based on quantum linear systems algorithms (QLSA).

Quantum algorithms for uncertainty quantification: application to partial differential equations

New quantum algorithms for PDEs with uncertain coefficients that are more eficient in M and L in various important regimes, compared to their classical counterparts are proposed.

Quantum algorithm for dense kernel matrices using hierarchical splitting

A quantum algorithm for efficiently performing matrix operations on hierarchical matrices by implementing a quantum block-encoding of the hierarchical matrix structure is proposed and can solve quantum linear systems of dimension N in time O(κ polylog( ε )), where κ and ε are the condition number and error bound of the matrix operation.

Improved quantum algorithms for linear and nonlinear differential equations

  • H. Krovi
  • Computer Science, Mathematics
    ArXiv
  • 2022
The present quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices and can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non- diagonalizableMatrices), whereas [2] and [3] additionally require normality.

Efficient quantum algorithm for nonlinear reaction-diffusion equations and energy estimation

This work improves upon the Carleman linearization approach introduced in [1] to obtain a faster convergence rate under the condition R D < 1, where R D measures the ratio of nonlinearity to dissipation using the (cid:96) ∞ norm.

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

We construct quantum algorithms to compute the solution and/or physical observables of nonlinear ordinary differential equations (ODEs) and nonlinear Hamilton-Jacobi equations (HJE) via linear

References

SHOWING 1-10 OF 17 REFERENCES

Quantum Linear System Solver Based on Time-optimal Adiabatic Quantum Computing and Quantum Approximate Optimization Algorithm

  • Dong AnLin Lin
  • Computer Science
    ACM Transactions on Quantum Computing
  • 2022
We demonstrate that with an optimally tuned scheduling function, adiabatic quantum computing (AQC) can readily solve a quantum linear system problem (QLSP) with O(κ poly(log (κ ε))) runtime, where κ

Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

A quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials that achieves the near optimal O~(dκlog⁡(1/ϵ) query complexity for ad-sparse matrix, whereκis the condition number, andϵis the desired precision.

High-order quantum algorithm for solving linear differential equations

This work extends quantum simulation algorithms to general inhomogeneous sparse linear differential equations, which describe many classical physical systems, and examines the use of high-order methods to improve the efficiency.

Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision

This work presents a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients that produces a quantum state that is proportional to the solution at a desired final time using a Taylor series.

Toward the first quantum simulation with quantum speedup

It is argued that simulating the time evolution of spin systems is a classically hard problem of practical interest that is among the easiest to address with early quantum devices, and develops optimized implementations and performs detailed resource analyses for several leading quantum algorithms for this problem.

Improved techniques for preparing eigenstates of fermionic Hamiltonians

Modeling low energy eigenstates of fermionic systems can provide insight into chemical reactions and material properties and is one of the most anticipated applications of quantum computing. We

Quantum algorithm for linear systems of equations.

This work exhibits a quantum algorithm for estimating x(-->)(dagger) Mx(-->) whose runtime is a polynomial of log(N) and kappa, and proves that any classical algorithm for this problem generically requires exponentially more time than this quantum algorithm.

Discrete time adiabatic theorems for quantum mechanical systems

The theory of adiabatic asymptotics is adapted to systems with discrete time evolution. The corresponding theorems about the approximation of physical time evolution by the adiabatic time evolution

Bounds for the adiabatic approximation with applications to quantum computation

The gap dependence is analyzed explicitly and the result is applied to interpolating Hamiltonians of interest in quantum computing by straightforward proofs of estimates used in the adiabatic approximation.

Product Decomposition of Periodic Functions in Quantum Signal Processing

It is proved that the algorithm to approximate complex-valued periodic functions under the random-access memory model of computation with accuracy with accuracy is run in time.