Quantum algorithm for linear systems of equations.

  title={Quantum algorithm for linear systems of equations.},
  author={Aram Wettroth Harrow and Avinatan Hassidim and Seth Lloyd},
  journal={Physical review letters},
  volume={103 15},
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b(-->), find a vector x(-->) such that Ax(-->) = b(-->). We consider the case where one does not need to know the solution x(-->) itself, but rather an approximation of the expectation value of some operator associated with x(-->), e.g., x(-->)(dagger) Mx(-->) for some matrix M. In this case, when A is sparse, N x N and has condition… 

Quantum algorithms for solving linear systems of equations 1

This lecture will focus on another such problem, that of solving linear systems of equations, and demonstrated an algorithm that given |b〉, and oracle access to a sparse A, finds |x〉 using only Õ(log(N) queries.

Quantum Linear System Algorithm for Dense Matrices.

A quantum algorithm is described that achieves a sparsity-independent runtime scaling of O(κ^{2}sqrt[n]polylog(n)/ε) for an n×n dimensional A with bounded spectral norm, which amounts to a polynomial improvement over known quantum linear system algorithms when applied to dense matrices.

Quantum Linear System Algorithm for General Matrices in System Identification

A modified quantum scheme to obtain the quantum state x corresponding to the solution of the linear system of equations in O(κ2rpolylog(mn)/ϵ) time for a general m×n dimensional A, which is superior to existing quantum algorithms, where κ is the condition number, r is the rank of matrix A and ϵ is the precision parameter.

Quantum algorithm for solving matrix equations of the form AX = B

This paper presents a quantum algorithm to solve matrix equations of the form AX = B, and demonstrates that in this algorithm the scale of complexity is O(lognN) .

QUBO Formulations for a System of Linear Equations

This work forms unconstrained binary optimization (QUBO) models for a linear system solving problem using a linear least-square problem with binary representation of the solution and validate those QUBO models on the D-Wave system and discuss the results.

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.

Efficient quantum algorithms for solving quantum linear system problems

We transform the problem of solving linear system of equations A x = b to a problem of finding the right singular vector with singular value zero of an augmented matrix C , and present two quantum

Enhancing the Quantum Linear Systems Algorithm Using Richardson Extrapolation

This work shows how to use Richardson extrapolation to enhance Hamiltonian simulation, resulting in an implementation of Quantum Phase Estimation (QPE) within the algorithm with 1/√ε circuits that can be run in parallel each with circuit complexity 1/ ∼√ ε instead of 1/ε.

Quantum linear systems algorithms: a primer

The Harrow-Hassidim-Lloyd quantum algorithm for sampling from the solution of a linear system provides an exponential speed-up over its classical counterpart, and a linear solver based on the quantum singular value estimation subroutine is discussed.

Proving the BQP-Completeness of the Quantum Linear Systems Problem Using a Clock Construction

In virtually any technical field, the classical problem of solving a linear system of equations has a wide range of applications, and the best classical algorithms for solving linear systems of equations scale with time polynomial in N.



A quantum algorithm to solve nonlinear differential equations

A quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials and its expected resource requirements are polylogarithmic in the number of variables and exponential in the integration time.

Efficient Quantum Algorithms for Simulating Sparse Hamiltonians

We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H.

Limit on the Speed of Quantum Computation in Determining Parity

It is shown that any quantum algorithm capable of determining the parity of f contains at least N/2 applications of the unitary operator which evaluates f and quantum computers cannot outperform classical computers.

Topological Quantum Computation

The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones poly-

On the power of quantum computation

  • Daniel R. Simon
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
This work presents here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class.

Algorithms for quantum computation: discrete logarithms and factoring

  • P. Shor
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.

Approximating fractional time quantum evolution

An algorithm is presented for approximating the arbitrary powers of a black box unitary operation, , where t is a real number and is a black box implementing an unknown unitary. The complexity of

The BQP-hardness of approximating the Jones polynomial

The universality proof of Freedman et al (2002) is extended to ks that grow polynomially with the number of strands and crossings in the link, thus extending the BQP-hardness of Jones polynomial approximations to all values to which the AJL algorithm applies, proving that for all those values, the problems are B QP-complete.

Engineering functional quantum algorithms

This work shows that a function of U can be realized on a quantum computer with at most O(mK+m{sup 2}ln m) elementary gates, and obtains efficient circuits for the fractional Fourier transform.

Adiabatic quantum state generation and statistical zero knowledge

The ASG approach to quantum algorithms provides intriguing links between quantum computation and many different areas: the analysis of spectral gaps and groundstates of Hamiltonians in physics, rapidly mixing Markov chains, statistical zero knowledge, and quantum random walks.