Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2012.00824

Quantum-Inspired Classical Algorithm for Slow Feature Analysis

Daniel Chen, Yekun Xu, Betis Baheri, Samuel A. Stein, Chuan Bi, Ying Mao, Qiang Quan, Shuai Xu

Published Dec 1, 2020• 2 citations
arXivHTMLPDF

Abstract

Recently, there has been a surge of interest for quantum computation for its ability to exponentially speed up algorithms, including machine learning algorithms. However, Tang suggested that the exponential speed up can also be done on a classical computer. In this paper, we 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)). To achieve this, we assumed necessary preprocessing of the input data as well as the existence of a data structure supporting a particular sampling scheme. The analysis of algorithm borrowed results from matrix perturbation theory, which was crucial for the algorithm's correctness. This work demonstrates the possible application and extent for which quantum-inspired computation can be used.

DOI
10.48550/arxiv.2012.00824

Related papers

Quantum-Inspired Classical Algorithm for Principal Component Regression

Daniel Chen, Yekun Xu, Betis Baheri +4 more

This paper presents a sublinear classical algorithm for principal component regression. The algorithm uses quantum-inspired linear algebra, an idea developed by Tang. Using this technique, her algorithm for recommendation systems achieved runtime only polynomially slower than its quantum counterpart. Her work was quickly adapted to solve many other problems in sublinear time complexity. In this work, we developed an algorithm for principal component regression that runs in time polylogarithmic to the number of data points, an exponential speed up over the state-of-the-art algorithm, under the mild assumption that the input is given in some data structure that supports a norm-based sampling procedure. This exponential speed up allows for potential applications in much larger data sets.

arXiv:2010.08626•Oct 16, 2020•3 citations

Learning with Optimized Random Features: Exponential Speedup by Quantum Machine Learning without Sparsity and Low-Rank Assumptions

Hayata Yamasaki, Sathyawageeswar Subramanian, Sho Sonoda +1 more

Kernel methods augmented with random features give scalable algorithms for learning from big data. But it has been computationally hard to sample random features according to a probability distribution that is optimized for the data, so as to minimize the required number of features for achieving the learning to a desired accuracy. Here, we develop a quantum algorithm for sampling from this optimized distribution over features, in runtime $O(D)$ that is linear in the dimension $D$ of the input data. Our algorithm achieves an exponential speedup in $D$ compared to any known classical algorithm for this sampling task. In contrast to existing quantum machine learning algorithms, our algorithm circumvents sparsity and low-rank assumptions and thus has wide applicability. We also show that the sampled features can be combined with regression by stochastic gradient descent to achieve the learning without canceling out our exponential speedup. Our algorithm based on sampling optimized random features leads to an accelerated framework for machine learning that takes advantage of quantum computers.

arXiv:2004.10756•Apr 22, 2020•9 citations

Smooth input preparation for quantum and quantum-inspired machine learning

Zhikuan Zhao, Jack Fitzsimons, Patrick Rebentrost +2 more

Abstract Machine learning has recently emerged as a fruitful area for finding potential quantum computational advantage. Many of the quantum-enhanced machine learning algorithms critically hinge upon the ability to efficiently produce states proportional to high-dimensional data points stored in a quantum accessible memory. Even given query access to exponentially many entries stored in a database, the construction of which is considered a one-off overhead, it has been argued that the cost of preparing such amplitude-encoded states may offset any exponential quantum advantage. Here we prove using smoothed analysis that if the data analysis algorithm is robust against small entry-wise input perturbation, state preparation can always be achieved with constant queries. This criterion is typically satisfied in realistic machine learning applications, where input data is subjective to moderate noise. Our results are equally applicable to the recent seminal progress in quantum-inspired algorithms, where specially constructed databases suffice for polylogarithmic classical algorithm in low-rank cases. The consequence of our finding is that for the purpose of practical machine learning, polylogarithmic processing time is possible under a general and flexible input model with quantum algorithms or quantum-inspired classical algorithms in the low-rank cases.

Quantum Machine Intelligence•Apr 26, 2021•10 citations

Smooth input preparation for quantum and quantum-inspired machine learning

Zhikuan Zhao, Jack Fitzsimons, Patrick Rebentrost +2 more

Machine learning has recently emerged as a fruitful area for finding potential quantum computational advantage. Many of the quantum enhanced machine learning algorithms critically hinge upon the ability to efficiently produce states proportional to high-dimensional data points stored in a quantum accessible memory. Even given query access to exponentially many entries stored in a database, the construction of which is considered a one-off overhead, it has been argued that the cost of preparing such amplitude-encoded states may offset any exponential quantum advantage. Here we prove using smoothed analysis, that if the data-analysis algorithm is robust against small entry-wise input perturbation, state preparation can always be achieved with constant queries. This criterion is typically satisfied in realistic machine learning applications, where input data is subjective to moderate noise. Our results are equally applicable to the recent seminal progress in quantum-inspired algorithms, where specially constructed databases suffice for polylogarithmic classical algorithm in low-rank cases. The consequence of our finding is that for the purpose of practical machine learning, polylogarithmic processing time is possible under a general and flexible input model with quantum algorithms or quantum-inspired classical algorithms in the low-rank cases.

arXiv:1804.00281•Apr 1, 2018•7 citations

Parametrized Complexity of Quantum Inspired Algorithms

Ebrahim Ardeshir-Larijani

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).

arXiv:2112.11686•Dec 22, 2021•0 citations

Quantum-Based Feature Extraction for Machine Learning

Jincheng Zhang

This paper investigates the potential of leveraging quantum algorithms for feature extraction in machine learning. Traditional feature extraction methods often struggle with high-dimensional data and computational complexity, leading to performance bottlenecks in downstream machine learning tasks. We explore the application of quantum algorithms, specifically Quantum Principal Component Analysis (QPCA) and Quantum Support Vector Machines (QSVM), to extract more efficient and potentially more informative features from datasets. The core claim of this research is that utilizing quantum algorithms can significantly enhance the performance of machine learning models. The mechanism involves applying quantum algorithms to reduce the dimensionality of data while preserving crucial information, which is then fed into classical machine learning models. This work provides a foundational exploration into this emerging field, demonstrating the potential for increased efficiency and accuracy in machine learning applications. ---

•Sep 3, 2026•0 citations
Recently, there has been a surge of interest for quantum computation for its ability to exponentially speed up algorithms, including machine learning algorithms. However, Tang suggested that the exponential speed up can also be done on a classical computer. In this paper, we 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)). To achieve this, we assumed necessary preprocessing of the input data as well as the existence of a data structure supporting a particular sampling scheme. The analysis of algorithm borrowed results from matrix perturbation theory, which was crucial for the algorithm's correctness. This work demonstrates the possible application and extent for which quantum-inspired computation can be used.
This paper presents a sublinear classical algorithm for principal component regression. The algorithm uses quantum-inspired linear algebra, an idea developed by Tang. Using this technique, her algorithm for recommendation systems achieved runtime only polynomially slower than its quantum counterpart. Her work was quickly adapted to solve many other problems in sublinear time complexity. In this work, we developed an algorithm for principal component regression that runs in time polylogarithmic to the number of data points, an exponential speed up over the state-of-the-art algorithm, under the mild assumption that the input is given in some data structure that supports a norm-based sampling procedure. This exponential speed up allows for potential applications in much larger data sets.
Kernel methods augmented with random features give scalable algorithms for learning from big data. But it has been computationally hard to sample random features according to a probability distribution that is optimized for the data, so as to minimize the required number of features for achieving the learning to a desired accuracy. Here, we develop a quantum algorithm for sampling from this optimized distribution over features, in runtime O(D)O(D)O(D) that is linear in the dimension DDD of the input data. Our algorithm achieves an exponential speedup in DDD compared to any known classical algorithm for this sampling task. In contrast to existing quantum machine learning algorithms, our algorithm circumvents sparsity and low-rank assumptions and thus has wide applicability. We also show that the sampled features can be combined with regression by stochastic gradient descent to achieve the learning without canceling out our exponential speedup. Our algorithm based on sampling optimized random features leads to an accelerated framework for machine learning that takes advantage of quantum computers.
Abstract Machine learning has recently emerged as a fruitful area for finding potential quantum computational advantage. Many of the quantum-enhanced machine learning algorithms critically hinge upon the ability to efficiently produce states proportional to high-dimensional data points stored in a quantum accessible memory. Even given query access to exponentially many entries stored in a database, the construction of which is considered a one-off overhead, it has been argued that the cost of preparing such amplitude-encoded states may offset any exponential quantum advantage. Here we prove using smoothed analysis that if the data analysis algorithm is robust against small entry-wise input perturbation, state preparation can always be achieved with constant queries. This criterion is typically satisfied in realistic machine learning applications, where input data is subjective to moderate noise. Our results are equally applicable to the recent seminal progress in quantum-inspired algorithms, where specially constructed databases suffice for polylogarithmic classical algorithm in low-rank cases. The consequence of our finding is that for the purpose of practical machine learning, polylogarithmic processing time is possible under a general and flexible input model with quantum algorithms or quantum-inspired classical algorithms in the low-rank cases.
Machine learning has recently emerged as a fruitful area for finding potential quantum computational advantage. Many of the quantum enhanced machine learning algorithms critically hinge upon the ability to efficiently produce states proportional to high-dimensional data points stored in a quantum accessible memory. Even given query access to exponentially many entries stored in a database, the construction of which is considered a one-off overhead, it has been argued that the cost of preparing such amplitude-encoded states may offset any exponential quantum advantage. Here we prove using smoothed analysis, that if the data-analysis algorithm is robust against small entry-wise input perturbation, state preparation can always be achieved with constant queries. This criterion is typically satisfied in realistic machine learning applications, where input data is subjective to moderate noise. Our results are equally applicable to the recent seminal progress in quantum-inspired algorithms, where specially constructed databases suffice for polylogarithmic classical algorithm in low-rank cases. The consequence of our finding is that for the purpose of practical machine learning, polylogarithmic processing time is possible under a general and flexible input model with quantum algorithms or quantum-inspired classical algorithms in the low-rank cases.
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).
This paper investigates the potential of leveraging quantum algorithms for feature extraction in machine learning. Traditional feature extraction methods often struggle with high-dimensional data and computational complexity, leading to performance bottlenecks in downstream machine learning tasks. We explore the application of quantum algorithms, specifically Quantum Principal Component Analysis (QPCA) and Quantum Support Vector Machines (QSVM), to extract more efficient and potentially more informative features from datasets. The core claim of this research is that utilizing quantum algorithms can significantly enhance the performance of machine learning models. The mechanism involves applying quantum algorithms to reduce the dimensionality of data while preserving crucial information, which is then fed into classical machine learning models. This work provides a foundational exploration into this emerging field, demonstrating the potential for increased efficiency and accuracy in machine learning applications. ---