Quantum-inspired algorithms in practice

@article{Arrazola2019QuantuminspiredAI,
  title={Quantum-inspired algorithms in practice},
  author={Juan Miguel Arrazola and Alain Delgado and Bhaskar Roy Bardhan and Seth Lloyd},
  journal={Quantum},
  year={2019},
  volume={4},
  pages={307}
}
We study the practical performance of quantum-inspired algorithms for recommendation systems and linear systems of equations. These algorithms were shown to have an exponential asymptotic speedup compared to previously known classical methods for problems involving low-rank matrices, but with complexity bounds that exhibit a hefty polynomial overhead compared to quantum algorithms. This raised the question of whether these methods were actually useful in practice. We conduct a theoretical… 

Quantum-Inspired Classical Algorithms for Singular Value Transformation

This paper develops quantum-inspired algorithms for a large class of matrix transformations that are defined via the singular value decomposition of the matrix and obtains classical algorithms with complexity polynomially related to the complexity of the best quantum algorithms for singular value transformation recently developed.

Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing Quantum machine learning

This work develops classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions, and gives compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups.

Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension

The pseudoinverse of a low-rank matrix is implemented allowing us to sample from the solution to the problem Ax = b using fast sampling techniques, indicating that more low- rank quantum algorithms can be “dequantised” into classical length-square sampling algorithms.

Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming

A proof-of-principle sublinear-time algorithm for solving SDPs with low-rank constraints; specifically, given an SDP with $m$ constraint matrices, each of dimension n and rank r, this algorithm can compute any entry and efficient descriptions of the spectral decomposition of the solution matrix.

Quantum-inspired algorithm applied to extreme learning

The quantum-inspired singular value decomposition technique is applied to extreme learning which is a machine learning framework that performs linear regression using random feature vectors generated through a random neural network and it is observed that the algorithm works order-of-magnitude faster than the exact SVD when the authors use high-dimensional feature vectors.

Quantum-Inspired Classical Algorithm for Slow Feature Analysis

This work proposed an algorithm for slow feature analysis, a machine learning algorithm that extracts the slow-varying features, with a run time O(polylog(n)poly(d)).

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 quantum interior-point predictor–corrector algorithm for linear programming

We introduce a new quantum optimization algorithm for dense linear programming problems, which can be seen as the quantization of the interior point predictor–corrector algorithm [] using a quantum

Quantum algorithms for SVD-based data representation and analysis

This paper formalizes quantum procedures that speed-up the solution of eigenproblems for data representations in machine learning through new quantum algorithms, sublinear in the input matrix’s size, for principal component analysis, correspondence analysis, and latent semantic analysis.

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/ε.
...

References

SHOWING 1-10 OF 38 REFERENCES

A quantum-inspired classical algorithm for recommendation systems

  • Ewin Tang
  • Computer Science
    Electron. Colloquium Comput. Complex.
  • 2018
A classical analogue to Kerenidis and Prakash’s quantum recommendation system is given, previously believed to be one of the strongest candidates for provably exponential speedups in quantum machine learning, which produces recommendations exponentially faster than previous classical systems, which run in time linear in m and n.

Quantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches

This paper presents a sublinear classical algorithm for solving low-rank SDPs which is asymptotically as good as existing quantum algorithms and applies it to a quantum state learning task as an application.

Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming

A proof-of-principle sublinear-time algorithm for solving SDPs with low-rank constraints; specifically, given an SDP with $m$ constraint matrices, each of dimension n and rank r, this algorithm can compute any entry and efficient descriptions of the spectral decomposition of the solution matrix.

Quantum-inspired sublinear classical algorithms for solving low-rank linear systems

Two classical sublinear-time algorithms for solving low-rank linear systems of equations with query and time complexity are presented, inspired by the HHL quantum algorithm for solving linear systems and the recent breakthrough by Tang of dequantizing the quantum algorithms for recommendation systems.

An Empirical Evaluation of Sketching for Numerical Linear Algebra

This work investigates least squares regression, iteratively reweighted least squares, logistic regression, robust regression with Huber and Bisquare loss functions, leverage score computation, Frobenius norm low rank approximation, and entrywise $\ell_1$-low rank approximation.

Quantum Recommendation Systems

This work presents the first algorithm for recommendation systems that runs in time polylogarithmic in the dimensions of the matrix and provides an example of a quantum machine learning algorithm for a real world application.

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

This work surveys and extends recent research which demonstrates that randomization offers a powerful tool for performing low-rank matrix approximation, and presents a modular framework for constructing randomized algorithms that compute partial matrix decompositions.

Quantum computational finance: quantum algorithm for portfolio optimization

A quantum algorithm for portfolio optimization is presented, given quantum access to the historical record of returns, that determines the optimal risk-return tradeoff curve and allows one to sample from the optimal portfolio.

Defining and detecting quantum speedup

Here, it is shown how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup, and the subtle nature of the quantum speed up question is illustrated.

Quantum-inspired evolutionary algorithm for a class of combinatorial optimization

The results show that QEA performs well, even with a small population, without premature convergence as compared to the conventional genetic algorithm, and a Q-gate is introduced as a variation operator to drive the individuals toward better solutions.