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

An Exact Quantum Principal Component Analysis Algorithm Based on Quantum Singular Value Threshold

Chen He, Jiazhen Li, Weiqi Liu

Published Oct 2, 2020• 2 citations
OpenAlex

Abstract

Quantum principal component analysis (qPCA) is the quantum version of principal component analysis (PCA). In this paper, based on the quantum singular value threshold (qSVT), we propose an exact quantum principal component analysis algorithm, which screens the data components through the threshold, rather than output all components of data. Compared with other improved qPCA algorithms, our proposed algorithm does not require to adjust the parameters to obtain estimated results. Instead, it yields exact results directly, and the quantum circuit designed is simpler because almost half of the quantum gates are reduced. We implemented our qPCA algorithm on the IBM quantum computing platform: IBM Quantum Experience, and the experimental results verified correctness of our algorithm.

Related papers

A Low-Complexity Quantum Principal Component Analysis Algorithm

Chen He, Jiazhen Li, Weiqi Liu +2 more

In this article, we propose a low-complexity quantum principal component analysis (qPCA) algorithm. Similar to the state-of-the-art qPCA, it achieves dimension reduction by extracting principal components of the data matrix, rather than all components of the data matrix, to quantum registers, so that the samples of measurement required can be reduced considerably. Both our qPCA and Lin’s qPCA are based on quantum singular-value thresholding (QSVT). The key of Lin’s qPCA is to combine QSVT, and modified QSVT is to obtain the superposition of the principal components. The key of our algorithm, however, is to modify QSVT by replacing the rotation-controlled operation of QSVT with the controlled-notoperation to obtain the superposition of the principal components. As a result, this small trick makes the circuit much simpler. Particularly, the proposed qPCA requires three phase estimations, while the state-of-the-art qPCA requires five phase estimations. Since the runtime of qPCA mainly comes from phase estimations, the proposed qPCA achieves a runtime of roughly 3/5 of that of the state of the art. We simulate the proposed qPCA on the IBM quantum computing platform, and the simulation result verifies that the proposed qPCA yields the expected quantum state.

arXiv:2010.00831•IEEE Transactions on Quantum Engineering•Jan 1, 2022•30 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

Challenges in Scaling Quantum Principal Component Analysis (QPCA)

R. Kowsalya, A. Jayanthiladevi, John T Mesia Dhas +1 more

Principal component analysis (PCA) is a significant dimensionality reduction technique for information. Unlike classical PCA, which is demanding in computational resources due to the increase in size and complexity of data, Quantum PCA (QPCA) theoretically can not only achieve the same outcome in an exponentially faster time by optimizing linear algebra in a new and efficient way through the use of quantum physics. Despite QPCA possessing theoretical advantages, the application of QPCA for real-world problems is limited due to quantum hardware capabilities, sensitivity of the algorithm to noise, and efficiency of the approach. New quantum circuit designs, better encoding methods of data and strategies to reduce noise, and other errors mentioned previously, Chapter 3 introduces the idea of combining quantum and classical approaches (Hybrid Quantum Classical PCA) to ameliorate these factors; we will refer to this as a “hybrid approach.” We evaluate HQCPCA with respect to QPCA's best performing algorithms with respect to fidelity, accuracy, run time, QPCA's circuit depth, and noise performance. HQCPCA is an efficient and reliable option for general quantum data processing, as these results indicate reduced circuit depth of 24.5%, a 15.8% increase in execution time, and a 2.9% increase in accuracy as compared to the best-performing algorithms mentioned above.

Wiley eBooks•Aug 21, 2026•0 citations

Open Research Directions in Quantum Principal Component Analysis (QPCA)

Aneesh Pradeep, A. Jayanthiladevi, B. N. Shobha +2 more

Quantum Principal Component Analysis (QPCA) is rapidly becoming an integral part of quantum machine learning (QML) because it will give an important acceleration over traditional PCA for assessing widespread quantum information. In terms of how QPCA works, it will leverage quantum parallelism to extract the primary eigenvectors and eigenvalues from the quantum states. After isolating the dominant eigenvalues and eigenvectors, techniques for data compression, dimensionality reduction, and pattern recognition can become operational in a quantum computing (QC) platform. However, we will still have to face what quantum noise represents robustly; the coherence time limits of the qubits and the concerns associated with collecting and preparing quantum states before the approach of the process described above can be a reality. This chapter has examined the field of QPCA as it stands today, discussed limitations in existing methods and algorithms for QPCA, and identified possible future avenues of research that include error-resilient quantum circuits, hybrid quantum/classical PCA models, and scaling to near-term quantum devices. It has also examined how QPCA may contribute to quantum-enhanced data science and the future of more general quantum technologies. To value researchers and push the boundaries of both the theoretical and practical horizons of QPCA forward, we have carefully conducted a review of the current state, remaining challenges, and possible future directions of QPCA.

Wiley eBooks•Aug 21, 2026•0 citations

Hardware-efficient quantum principal component analysis for medical image recognition

Zidong Lin, Hongfeng Liu, Kai Tang +10 more

Principal component analysis (PCA) is a widely used tool in machine learning algorithms, but it can be computationally expensive. In 2014, Lloyd, Mohseni & Rebentrost proposed a quantum PCA (qPCA) algorithm [Nat. Phys. 10, 631 (2014)] that has not yet been experimentally demonstrated due to challenges in preparing multiple quantum state copies and implementing quantum phase estimations. In this study, we presented a hardware-efficient approach for qPCA, utilizing an iterative approach that effectively resets the relevant qubits in a nuclear magnetic resonance (NMR) quantum processor. Additionally, we introduced a quantum scattering circuit that efficiently determines the eigenvalues and eigenvectors (principal components). As an important application of PCA, we focused on classifying thoracic CT images from COVID-19 patients and achieved high accuracy in image classification using the qPCA circuit implemented on the NMR system. Our experiment highlights the potential of near-term quantum devices to accelerate qPCA, opening up new avenues for practical applications of quantum machine learning algorithms.

Frontiers of Physics•Apr 8, 2024•13 citations

Advancement of Quantum Methods in Principal Component Analysis

Barkha Soni, Nilay Khare

Quantum principal component analysis (QPCA) is analogous to the classical method with additive speedup. This is based on the unsupervised dimensionality reduction mechanism that transforms exponentially high dimensional data points into low dimensional space by retaining significant features with the largest variance. To our knowledge, quantum computations are highly exponential and supports implicit parallelism. Therefore, quantum method for finding principal components are proved to achieve exponential speedup over existing classical solution. An advantage of quantum superposition is utilized for the Eigen decomposition of density matrix which is identical to covariance, however, a way through which its computation happen, is truly an interesting factor. This paper presents basic methodological framework to design QPCA algorithm. Our framework includes the methods for quantum data encoding, quantum memory processing, and the requisite quantum circuit implementations to realize QPCA algorithms. In addition, we categorized existing QPCA methods in view of recent advances. We then proposed the possible advancements that can benefit to design quantum based efficient algorithms for principal component analysis. At the last, suggested concepts are compared with existing methods based on complexities and other factors to justify our proposal as significant in perspective to future directions.

International Conference on Computing, Communication and Networking Technologies (ICCCNT)•Jul 6, 2021•3 citations
Quantum principal component analysis (qPCA) is the quantum version of principal component analysis (PCA). In this paper, based on the quantum singular value threshold (qSVT), we propose an exact quantum principal component analysis algorithm, which screens the data components through the threshold, rather than output all components of data. Compared with other improved qPCA algorithms, our proposed algorithm does not require to adjust the parameters to obtain estimated results. Instead, it yields exact results directly, and the quantum circuit designed is simpler because almost half of the quantum gates are reduced. We implemented our qPCA algorithm on the IBM quantum computing platform: IBM Quantum Experience, and the experimental results verified correctness of our algorithm.
In this article, we propose a low-complexity quantum principal component analysis (qPCA) algorithm. Similar to the state-of-the-art qPCA, it achieves dimension reduction by extracting principal components of the data matrix, rather than all components of the data matrix, to quantum registers, so that the samples of measurement required can be reduced considerably. Both our qPCA and Lin’s qPCA are based on quantum singular-value thresholding (QSVT). The key of Lin’s qPCA is to combine QSVT, and modified QSVT is to obtain the superposition of the principal components. The key of our algorithm, however, is to modify QSVT by replacing the rotation-controlled operation of QSVT with the controlled-notoperation to obtain the superposition of the principal components. As a result, this small trick makes the circuit much simpler. Particularly, the proposed qPCA requires three phase estimations, while the state-of-the-art qPCA requires five phase estimations. Since the runtime of qPCA mainly comes from phase estimations, the proposed qPCA achieves a runtime of roughly 3/5 of that of the state of the art. We simulate the proposed qPCA on the IBM quantum computing platform, and the simulation result verifies that the proposed qPCA yields the expected quantum state.
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.
Principal component analysis (PCA) is a significant dimensionality reduction technique for information. Unlike classical PCA, which is demanding in computational resources due to the increase in size and complexity of data, Quantum PCA (QPCA) theoretically can not only achieve the same outcome in an exponentially faster time by optimizing linear algebra in a new and efficient way through the use of quantum physics. Despite QPCA possessing theoretical advantages, the application of QPCA for real-world problems is limited due to quantum hardware capabilities, sensitivity of the algorithm to noise, and efficiency of the approach. New quantum circuit designs, better encoding methods of data and strategies to reduce noise, and other errors mentioned previously, Chapter 3 introduces the idea of combining quantum and classical approaches (Hybrid Quantum Classical PCA) to ameliorate these factors; we will refer to this as a “hybrid approach.” We evaluate HQCPCA with respect to QPCA's best performing algorithms with respect to fidelity, accuracy, run time, QPCA's circuit depth, and noise performance. HQCPCA is an efficient and reliable option for general quantum data processing, as these results indicate reduced circuit depth of 24.5%, a 15.8% increase in execution time, and a 2.9% increase in accuracy as compared to the best-performing algorithms mentioned above.
Quantum Principal Component Analysis (QPCA) is rapidly becoming an integral part of quantum machine learning (QML) because it will give an important acceleration over traditional PCA for assessing widespread quantum information. In terms of how QPCA works, it will leverage quantum parallelism to extract the primary eigenvectors and eigenvalues from the quantum states. After isolating the dominant eigenvalues and eigenvectors, techniques for data compression, dimensionality reduction, and pattern recognition can become operational in a quantum computing (QC) platform. However, we will still have to face what quantum noise represents robustly; the coherence time limits of the qubits and the concerns associated with collecting and preparing quantum states before the approach of the process described above can be a reality. This chapter has examined the field of QPCA as it stands today, discussed limitations in existing methods and algorithms for QPCA, and identified possible future avenues of research that include error-resilient quantum circuits, hybrid quantum/classical PCA models, and scaling to near-term quantum devices. It has also examined how QPCA may contribute to quantum-enhanced data science and the future of more general quantum technologies. To value researchers and push the boundaries of both the theoretical and practical horizons of QPCA forward, we have carefully conducted a review of the current state, remaining challenges, and possible future directions of QPCA.
Principal component analysis (PCA) is a widely used tool in machine learning algorithms, but it can be computationally expensive. In 2014, Lloyd, Mohseni & Rebentrost proposed a quantum PCA (qPCA) algorithm [Nat. Phys. 10, 631 (2014)] that has not yet been experimentally demonstrated due to challenges in preparing multiple quantum state copies and implementing quantum phase estimations. In this study, we presented a hardware-efficient approach for qPCA, utilizing an iterative approach that effectively resets the relevant qubits in a nuclear magnetic resonance (NMR) quantum processor. Additionally, we introduced a quantum scattering circuit that efficiently determines the eigenvalues and eigenvectors (principal components). As an important application of PCA, we focused on classifying thoracic CT images from COVID-19 patients and achieved high accuracy in image classification using the qPCA circuit implemented on the NMR system. Our experiment highlights the potential of near-term quantum devices to accelerate qPCA, opening up new avenues for practical applications of quantum machine learning algorithms.
Quantum principal component analysis (QPCA) is analogous to the classical method with additive speedup. This is based on the unsupervised dimensionality reduction mechanism that transforms exponentially high dimensional data points into low dimensional space by retaining significant features with the largest variance. To our knowledge, quantum computations are highly exponential and supports implicit parallelism. Therefore, quantum method for finding principal components are proved to achieve exponential speedup over existing classical solution. An advantage of quantum superposition is utilized for the Eigen decomposition of density matrix which is identical to covariance, however, a way through which its computation happen, is truly an interesting factor. This paper presents basic methodological framework to design QPCA algorithm. Our framework includes the methods for quantum data encoding, quantum memory processing, and the requisite quantum circuit implementations to realize QPCA algorithms. In addition, we categorized existing QPCA methods in view of recent advances. We then proposed the possible advancements that can benefit to design quantum based efficient algorithms for principal component analysis. At the last, suggested concepts are compared with existing methods based on complexities and other factors to justify our proposal as significant in perspective to future directions.