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

International Informatics and Software Engineering Conference (IISEC)

Quantum phase estimation based algorithms for machine learning

Oumayma Ouedrhiri, Oumayma Banouar, Salah El Hadaj, Said Raghay

Published Dec 16, 2021• 4 citations
Publisher

Abstract

Quantum computing is certainly one of the greatest advances in the computer science field. Thanks to the parallelism and entanglement properties, it has proved to offer several advantages compared to the classical algorithms especially in the great reduction of the processing time. Quantum phase estimation (QPE) is one of the most important algorithms for quantum computing. It is known as the eigenvalue finding module for unitary operators. The Fourier transform is the key to this procedure. It has been researched and used to solve many problems such as the order finding problem, and the factoring problem. It was also applied for quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. In this paper, we study three important quantum algorithms for machine learning that use the QPE algorithm as a subroutine: the quantum principal components analysis (PCA) for data visualization, the Harrow-Hassidim-Lloyd (HHL) algorithm for solving linear systems, and the quantum singular value thresholding (SVT) for matrix completion in recommender systems. We also discuss the advantages and limits of such algorithms compared to their classical versions. Then we discuss potential ways of amelioration of such algorithms, and end with a proposed approach for further improvement.

DOI
10.1109/iisec54230.2021.9672406

Related papers

Quantum Algorithms Relevant to Machine Learning

Hamid D. Ismail

This chapter introduces the principal quantum algorithms that form the computational foundation of quantum machine learning (QML). It presents the Quantum Fourier Transform and quantum phase estimation as the core spectral tools for extracting eigenvalue and phase information and then examines Grover’s algorithm, amplitude amplification, and amplitude estimation as search- and probability-based primitives relevant to optimization, expectation estimation, and probabilistic inference. This chapter also develops phase kickback as a unifying mechanism for transferring information into measurable relative phases, highlighting its role in phase oracles, eigenvalue estimation, and phase-based data encoding. This chapter further discusses the Harrow–Hassidim–Lloyd (HHL) algorithm for quantum linear systems and places it in the broader setting of modern quantum linear algebra, including block encoding, quantum singular value transformation, and improved Hamiltonian-simulation techniques. These methods are connected to machine learning tasks such as regression, kernel methods, dimensionality reduction, and graph-based learning. Throughout, the discussion emphasizes that these algorithms function as reusable primitives within hybrid quantum-classical pipelines rather than as standalone learning systems and that their practical value depends critically on assumptions about state preparation, matrix access, conditioning, and measurement overhead.

CRC Press eBooks•Nov 4, 2026•0 citations

Classification problem solving using quantum machine learning mechanisms

Alina O. Savchuk, Nonna N. Shapovalova

Due to the similarity of the computational and probabilistic nature of quantum computing and machine learning, the idea arose to optimize the learning process using quantum methods. There are both fundamentally new algorithms, such as HHL, and quantum-improved ones: QPCA, QSVM. In this article, we will look at the QSVM algorithm step by step, starting from the basics described in section 2 and gradually delving into the composition of the algorithm. Thus, after the basics, we will consider the quantum phase estimation, which is part of the HHL algorithm, and then the QSVM algorithm, the component of which is the HHL. We also will consider the QPCA algorithm, which can be applied before the QSVM algorithm to reduce the dimension of the data sample. In this way, we explore the fundamental difference between classical algorithms and their quantum counterparts. We also implement the QSVM method in practice and compare the obtained practical results with theory. As a result, we obtained high quality of accuracy (100 %) compared to the classical SVM (83 %) on a data sample of dimension 72. However, we found out that the learning time on a quantum device is far from ideal (it can reach 5 min for a sample of this size). The study aims to theoretically argue or disprove the hypothesis about the efficiency of quantum computing for machine learning algorithms. The object of research is the programming of quantum computers. The research subject is the study of quantum computing mechanisms for the implementation of machine learning problems. The research result is a software module that allows evaluating the efficiency of the classification task on a quantum computer. It also can be used to compare the results obtained from classical and quantum devices. Research methods: theoretical analysis of the foundations of quantum computing: principles of superposition and entanglement, linear algebra, probability theory over complex numbers; building a model of one qubit and multi-qubit system; research of quantum machine learning algorithms’ work principles and their complexity; empirical comparison of quantum machine learning methods with their classical counterparts.

Workshop for Young Scientists in Computer Science & Software Engineering (CS&SE@SW)•Jan 19, 2022•0 citations

Quantum linear systems algorithms: a primer

Danial Dervovic, Mark Herbster, Peter Mountney +3 more

The Harrow-Hassidim-Lloyd (HHL) quantum algorithm for sampling from the solution of a linear system provides an exponential speed-up over its classical counterpart. The problem of solving a system of linear equations has a wide scope of applications, and thus HHL constitutes an important algorithmic primitive. In these notes, we present the HHL algorithm and its improved versions in detail, including explanations of the constituent sub- routines. More specifically, we discuss various quantum subroutines such as quantum phase estimation and amplitude amplification, as well as the important question of loading data into a quantum computer, via quantum RAM. The improvements to the original algorithm exploit variable-time amplitude amplification as well as a method for implementing linear combinations of unitary operations (LCUs) based on a decomposition of the operators using Fourier and Chebyshev series. Finally, we discuss a linear solver based on the quantum singular value estimation (QSVE) subroutine.

arXiv:1802.08227•Feb 22, 2018•140 citations

Quantum Machine Learning

Santanu Pattanayak

In this chapter and the next one, we will explore the exciting areas of quantum machine learning and quantum deep learning. Machine learning and deep learning have seen great success in recent years because of the increase in the computational power at our disposal and because of the high-end research in these fields. Quantum machine learning presents an exciting opportunity to increase the computational efficiency of the existing machine learning algorithms as well as presents a way to tackle some of the more computationally intractable problems. In this chapter, we start with the Harrow-Hassidim-Lloyd algorithm, popularly known as HHL, which acts as the matrix inversion routine in the quantum computing domain. Hence, HHL will be the default choice for algorithms such as linear regression and least square support vector machines. Subsequently, we touch upon quantum linear regression and support vector machines in detail in this chapter. We will then move on to implementing quantum routines such as quantum dot product and quantum Euclidean distances since they are integral to several machine learning algorithms such as the k-means clustering and nearest neighbor methods. In this regard, we will implement the k-means clustering method in detail. Also, we will discuss how Grover’s algorithm can be used to optimize quantum objectives by illustrating its usage in the cluster assignment in the k-means algorithm. Principal component analysis is an important machine learning technique, and we will walk through its quantum implementation in great detail as well.

Apress eBooks•Jan 1, 2021•9 citations

An Improved Implementation Approach for Quantum Phase Estimation on Quantum Computers

Hamed Mohammadbagherpoor, Young-Hyun Oh, Patrick Dreher +3 more

Quantum phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety of quantum applications such as the Shor's factoring algorithm, quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. The QPE algorithm has been combined with Kitaev's algorithm and the inverse quantum Fourier transform (IQFT) which are utilized as a fundamental component of such quantum algorithms. In this paper, we explore the computational challenges of implementing QPE algorithms on noisy intermediate-scale quantum (NISQ) machines using the IBM Q Experience (e.g., the IBMQX4, 5-qubit quantum computing hardware platform). Our experimental results indicate that the accuracy of finding the phase using these QPE algorithms is severely constrained by the NISQ computer's physical characteristics such as coherence time and error rates. To mitigate these physical limitations, we propose implementing a modified solution by reducing the number of controlled rotation gates and phase shift operations, thereby increasing the accuracy of the finding phase in near-term quantum computers.

arXiv:1910.11696•IEEE International Conference on Rebooting Computing (ICRC)•Nov 1, 2019•57 citations

Quantum PCA in Machine Learning (ML)

V. Vanitha, Manoj Kumaran, L. Hari Prasath +1 more

Quantum Principal Component Analysis (QPCA) is a revolutionary quantum computing (QC) and machine learning (ML) approach for high-dimensional dataset dimensionality reduction. QPCA extracts dominant features and eigenvectors from complex data distributions at exponential speeds using quantum mechanics’ superposition, entanglement, and quantum parallelism, unlike classical Principal Component Analysis (PCA), which struggles with scalability and efficiency in the age of big QPCA and computes the eigenvalues and eigenvectors of a density value representing a dataset's covariance structure using quantum methods like quantum-phase estimation. Quantum-enhanced computing lowers computation costs and allows for the analysis of more complex datasets. As part of quantum ML (QML) pipelines, QPCA is one step to inspecting enormous datasets for feature selection, compression, and dimensionality reduction. This chapter discusses the algorithmic stages of QPCA and the theoretical and mathematical aspects of QPCA. Practical IBM Qiskit implementations show near-term quantum device constraints. QPCA is evaluated in genetic data analysis feature extraction, financial system predictive modeling, and computer vision (CV) image recognition. Benchmarking compares QPCA's accuracy, scalability, and performance against classical PCA under different noise models and data attributes. Limitations on experimental validation include quantum decoherence, qubit scarcity, and efficient quantum data encoding. The chapter finishes with a hybrid quantum-classical model, quantum error prevention, and domain-specific quantum algorithm development. QPCA will allow exceptional scientific discovery, industrial innovation, and artificial intelligence (AI) as QC advances.

Wiley eBooks•Aug 21, 2026•0 citations
Quantum computing is certainly one of the greatest advances in the computer science field. Thanks to the parallelism and entanglement properties, it has proved to offer several advantages compared to the classical algorithms especially in the great reduction of the processing time. Quantum phase estimation (QPE) is one of the most important algorithms for quantum computing. It is known as the eigenvalue finding module for unitary operators. The Fourier transform is the key to this procedure. It has been researched and used to solve many problems such as the order finding problem, and the factoring problem. It was also applied for quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. In this paper, we study three important quantum algorithms for machine learning that use the QPE algorithm as a subroutine: the quantum principal components analysis (PCA) for data visualization, the Harrow-Hassidim-Lloyd (HHL) algorithm for solving linear systems, and the quantum singular value thresholding (SVT) for matrix completion in recommender systems. We also discuss the advantages and limits of such algorithms compared to their classical versions. Then we discuss potential ways of amelioration of such algorithms, and end with a proposed approach for further improvement.
This chapter introduces the principal quantum algorithms that form the computational foundation of quantum machine learning (QML). It presents the Quantum Fourier Transform and quantum phase estimation as the core spectral tools for extracting eigenvalue and phase information and then examines Grover’s algorithm, amplitude amplification, and amplitude estimation as search- and probability-based primitives relevant to optimization, expectation estimation, and probabilistic inference. This chapter also develops phase kickback as a unifying mechanism for transferring information into measurable relative phases, highlighting its role in phase oracles, eigenvalue estimation, and phase-based data encoding. This chapter further discusses the Harrow–Hassidim–Lloyd (HHL) algorithm for quantum linear systems and places it in the broader setting of modern quantum linear algebra, including block encoding, quantum singular value transformation, and improved Hamiltonian-simulation techniques. These methods are connected to machine learning tasks such as regression, kernel methods, dimensionality reduction, and graph-based learning. Throughout, the discussion emphasizes that these algorithms function as reusable primitives within hybrid quantum-classical pipelines rather than as standalone learning systems and that their practical value depends critically on assumptions about state preparation, matrix access, conditioning, and measurement overhead.
Due to the similarity of the computational and probabilistic nature of quantum computing and machine learning, the idea arose to optimize the learning process using quantum methods. There are both fundamentally new algorithms, such as HHL, and quantum-improved ones: QPCA, QSVM. In this article, we will look at the QSVM algorithm step by step, starting from the basics described in section 2 and gradually delving into the composition of the algorithm. Thus, after the basics, we will consider the quantum phase estimation, which is part of the HHL algorithm, and then the QSVM algorithm, the component of which is the HHL. We also will consider the QPCA algorithm, which can be applied before the QSVM algorithm to reduce the dimension of the data sample. In this way, we explore the fundamental difference between classical algorithms and their quantum counterparts. We also implement the QSVM method in practice and compare the obtained practical results with theory. As a result, we obtained high quality of accuracy (100 %) compared to the classical SVM (83 %) on a data sample of dimension 72. However, we found out that the learning time on a quantum device is far from ideal (it can reach 5 min for a sample of this size). The study aims to theoretically argue or disprove the hypothesis about the efficiency of quantum computing for machine learning algorithms. The object of research is the programming of quantum computers. The research subject is the study of quantum computing mechanisms for the implementation of machine learning problems. The research result is a software module that allows evaluating the efficiency of the classification task on a quantum computer. It also can be used to compare the results obtained from classical and quantum devices. Research methods: theoretical analysis of the foundations of quantum computing: principles of superposition and entanglement, linear algebra, probability theory over complex numbers; building a model of one qubit and multi-qubit system; research of quantum machine learning algorithms’ work principles and their complexity; empirical comparison of quantum machine learning methods with their classical counterparts.
The Harrow-Hassidim-Lloyd (HHL) quantum algorithm for sampling from the solution of a linear system provides an exponential speed-up over its classical counterpart. The problem of solving a system of linear equations has a wide scope of applications, and thus HHL constitutes an important algorithmic primitive. In these notes, we present the HHL algorithm and its improved versions in detail, including explanations of the constituent sub- routines. More specifically, we discuss various quantum subroutines such as quantum phase estimation and amplitude amplification, as well as the important question of loading data into a quantum computer, via quantum RAM. The improvements to the original algorithm exploit variable-time amplitude amplification as well as a method for implementing linear combinations of unitary operations (LCUs) based on a decomposition of the operators using Fourier and Chebyshev series. Finally, we discuss a linear solver based on the quantum singular value estimation (QSVE) subroutine.
In this chapter and the next one, we will explore the exciting areas of quantum machine learning and quantum deep learning. Machine learning and deep learning have seen great success in recent years because of the increase in the computational power at our disposal and because of the high-end research in these fields. Quantum machine learning presents an exciting opportunity to increase the computational efficiency of the existing machine learning algorithms as well as presents a way to tackle some of the more computationally intractable problems. In this chapter, we start with the Harrow-Hassidim-Lloyd algorithm, popularly known as HHL, which acts as the matrix inversion routine in the quantum computing domain. Hence, HHL will be the default choice for algorithms such as linear regression and least square support vector machines. Subsequently, we touch upon quantum linear regression and support vector machines in detail in this chapter. We will then move on to implementing quantum routines such as quantum dot product and quantum Euclidean distances since they are integral to several machine learning algorithms such as the k-means clustering and nearest neighbor methods. In this regard, we will implement the k-means clustering method in detail. Also, we will discuss how Grover’s algorithm can be used to optimize quantum objectives by illustrating its usage in the cluster assignment in the k-means algorithm. Principal component analysis is an important machine learning technique, and we will walk through its quantum implementation in great detail as well.
Quantum phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety of quantum applications such as the Shor's factoring algorithm, quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. The QPE algorithm has been combined with Kitaev's algorithm and the inverse quantum Fourier transform (IQFT) which are utilized as a fundamental component of such quantum algorithms. In this paper, we explore the computational challenges of implementing QPE algorithms on noisy intermediate-scale quantum (NISQ) machines using the IBM Q Experience (e.g., the IBMQX4, 5-qubit quantum computing hardware platform). Our experimental results indicate that the accuracy of finding the phase using these QPE algorithms is severely constrained by the NISQ computer's physical characteristics such as coherence time and error rates. To mitigate these physical limitations, we propose implementing a modified solution by reducing the number of controlled rotation gates and phase shift operations, thereby increasing the accuracy of the finding phase in near-term quantum computers.
Quantum Principal Component Analysis (QPCA) is a revolutionary quantum computing (QC) and machine learning (ML) approach for high-dimensional dataset dimensionality reduction. QPCA extracts dominant features and eigenvectors from complex data distributions at exponential speeds using quantum mechanics’ superposition, entanglement, and quantum parallelism, unlike classical Principal Component Analysis (PCA), which struggles with scalability and efficiency in the age of big QPCA and computes the eigenvalues and eigenvectors of a density value representing a dataset's covariance structure using quantum methods like quantum-phase estimation. Quantum-enhanced computing lowers computation costs and allows for the analysis of more complex datasets. As part of quantum ML (QML) pipelines, QPCA is one step to inspecting enormous datasets for feature selection, compression, and dimensionality reduction. This chapter discusses the algorithmic stages of QPCA and the theoretical and mathematical aspects of QPCA. Practical IBM Qiskit implementations show near-term quantum device constraints. QPCA is evaluated in genetic data analysis feature extraction, financial system predictive modeling, and computer vision (CV) image recognition. Benchmarking compares QPCA's accuracy, scalability, and performance against classical PCA under different noise models and data attributes. Limitations on experimental validation include quantum decoherence, qubit scarcity, and efficient quantum data encoding. The chapter finishes with a hybrid quantum-classical model, quantum error prevention, and domain-specific quantum algorithm development. QPCA will allow exceptional scientific discovery, industrial innovation, and artificial intelligence (AI) as QC advances.