Parametrized Complexity of Quantum Inspired Algorithms

Motivated by recent progress in quantum technologies and in particular quantum software, research and industrial communities have been trying to discover new applications of quantum algorithms such as quantum optimization and machine learning. Regardless of which hardware platform these novel algorithms operate on, whether it is adiabatic or gate based, from theoretical point of view, they are performing drastically better than their classical counterparts. Two promising areas of quantum algorithms quantum machine learning and quantum optimization. These are based on performing matrix operations using quantum states and operation, in order to speed up data analysis where quantum computing can efficiently work with high dimensional vectors. Motivated by that, quantum inspired algorithms (e.g. for recommendation systems and principal component analysis) are developed to cope with high dimensionality using probabilistic techniques that are inspire from quantum computing. In this paper we review recent progress in the area of quantum inspired algorithms for low rank matrix approximation. We further explore the possibility of using parametrized complexity for such algorithms to refine practical complexity analysis. Finally, we conjecture that quantum inspired algorithms that use low rank approximation and also sample and query technique for input representations are Fixed Parameter Tractable (FPT).


page 1

page 2

page 3

page 4


Quantum-Inspired Classical Algorithms for Singular Value Transformation

A recent breakthrough by Tang (STOC 2019) showed how to "dequantize" the...

Quantum-inspired algorithms in practice

We study the practical performance of quantum-inspired algorithms for re...

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

We present an algorithmic framework generalizing quantum-inspired polylo...

On exploring practical potentials of quantum auto-encoder with advantages

Quantum auto-encoder (QAE) is a powerful tool to relieve the curse of di...

Quantum Algorithms for Data Representation and Analysis

We narrow the gap between previous literature on quantum linear algebra ...

Efficient Construction of Functional Representations for Quantum Algorithms

Due to the significant progress made in the implementation of quantum ha...

Classical and Quantum Algorithms for Tensor Principal Component Analysis

We present classical and quantum algorithms based on spectral methods fo...

Please sign up or login with your details

Forgot password? Click here to reset