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

Quantum Science and Technology

Resource-efficient quantum principal component analysis

Youle Wang, Yu H. Luo

Published May 2, 2024• 13 citations
Publisher

Abstract

Abstract Principal component analysis (PCA) is an important dimensionality reduction method in machine learning and data analysis. Recently, the quantum version of PCA has been established to diagonalize quantum states. Although these quantum algorithms promise quantum advantages, they require substantial resources beyond the reach of state-of-the-art quantum technologies. This work aims to reduce resource requirements and improve the efficiency of quantum PCA. Assuming that the quantum state is accessed through a purified quantum query model and a sampling model, we propose quantum algorithms that use minimal resource requirements for ancillary qubits to reveal properties of eigenvectors and eigenvalues of a state. In particular, we show that estimating eigenvalue λ with error ε and success probability larger than λ ( 1 − η ) requests a query complexity O ~ ( ϵ − 1 ) and a sample complexity O ~ ( ϵ − 2 η − 1 ) , respectively. To our knowledge, our result is the first quantum speedup that achieves asymptotic linear scaling in 1 / ϵ for quantum PCA. As applications, we discuss estimating the minimum relative entropy of entanglement of bipartite pure-states and performing quantum state discrimination tasks. We show that quantum speedups are maintained when the pure state has a low Schmidt number and states of discrimination have a low rank. This study opens up a new quantum PCA method for high-dimensional quantum data analysis and discusses its application in quantum information processing tasks.

DOI
10.1088/2058-9565/ad466c

Related papers

Resonant quantum principal component analysis

Zhaokai Li, Zihua Chai, Yuhang Guo +6 more

Principal component analysis (PCA) has been widely adopted to reduce the dimension of data while preserving the information. The quantum version of PCA (qPCA) can be used to analyze an unknown low-rank density matrix by rapidly revealing the principal components of it, i.e., the eigenvectors of the density matrix with the largest eigenvalues. However, because of the substantial resource requirement, its experimental implementation remains challenging. Here, we develop a resonant analysis algorithm with minimal resource for ancillary qubits, in which only one frequency-scanning probe qubit is required to extract the principal components. In the experiment, we demonstrate the distillation of the first principal component of a 4 × 4 density matrix, with an efficiency of 86.0% and a fidelity of 0.90. This work shows the speedup ability of quantum algorithm in dimension reduction of data and thus could be used as part of quantum artificial intelligence algorithms in the future.

arXiv:2104.02476•Science Advances•Aug 18, 2021•54 citations

Near-optimal quantum kernel principal component analysis

Youle Wang

Abstract Kernel principal component analysis (kernel PCA) is a nonlinear dimensionality reduction technique that employs kernel functions to map data into a high-dimensional feature space, thereby extending the applicability of linear PCA to nonlinear data and facilitating the extraction of informative principal components. However, kernel PCA necessitates the manipulation of large-scale matrices, leading to high computational complexity and posing challenges for efficient implementation in big data environments. Quantum computing has recently been integrated with kernel methods in machine learning, enabling effective analysis of input data within intractable feature spaces. Although existing quantum kernel PCA proposals promise exponential speedups, they impose stringent requirements on quantum hardware that are challenging to fulfill. In this work, we propose a quantum algorithm for kernel PCA by establishing a connection between quantum kernel methods and block encoding, thereby diagonalizing the centralized kernel matrix on a quantum computer. The query complexity is logarithmic with respect to the size of the data vector, D , and linear with respect to the size of the dataset. An exponential speedup could be achieved when the dataset consists of a few high-dimensional vectors, wherein the dataset size is polynomial in log ⁡ ( D ) , with D being significantly large. In contrast to existing work, our algorithm enhances the efficiency of quantum kernel PCA and reduces the requirements for quantum hardware. Furthermore, we have also demonstrated that the algorithm based on block encoding matches the lower bound of query complexity, indicating that our algorithm is nearly optimal. Our research has laid down new pathways for developing quantum machine learning algorithms aimed at addressing tangible real-world problems and demonstrating quantum advantages within machine learning.

Quantum Science and Technology•Nov 12, 2024•8 citations

Integrating Quantum Learning and Principal Component Analysis

N. Kousika, M. S. C. Sujitha, R. Rajshree +1 more

The incorporation of principal component analysis (PCA) through quantum knowledge is a pioneering improvement in the area of machine learning and quantum tools. Conventional PCA reduces data dimensionality and manages computation complexity by using eigenvector adjustment. By applying the thoughts of the superposition of information and the catch-up procedure, quantum computing makes it possible to encode and control data, finally ensuing in greater speedups in dedicated erudition responsibilities. This chapter investigates the association that exists among PCA and quantum algorithms. It mainly focuses on quantum PCA variants that translate standard eigenvectors into the quantum province. Quantum systems such as the qPCA may successfully pull out most important works from facts that have been programmed into quantum circumstances. In contrast to regular approaches, the new policy can provide considerable execution time and scalability enhancements. The shift from eigenvectors to qubits unlocks a new archetype in examining information, which includes quicker pattern discovery, enhanced feature mining, and superior capability to contract with bigger data sets. In spite of the reality that there are still many challenges to be solved, such as honest data training models, error rectification, and appropriate quantum tools, preface outcome shows that quantum enhanced dimensionality diminution has the potential to be a key constituent of subsequently cohort applications by utilizing machine learning concepts.

Wiley eBooks•Aug 21, 2026•0 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

Quantum principal component analysis without eigenvector recovery

Yewei Yuan, Michele Minervini, Mark M. Wilde +1 more

Principal component analysis (PCA) is traditionally implemented through a covariance or kernel matrix, leading-eigenvector extraction, and hard rank-$k$ projection. These steps can be computationally costly in high-dimensional and quantum-data settings, sensitive to small eigengaps, and unnecessary when downstream tasks only require principal-subspace scores. Such score-based objectives are important in applications such as anomaly detection, spectral-energy profiling, and other postselection tasks. To address these needs, we introduce a measurement-based soft PCA framework replacing the hard top-$k$ projector with an entropy-regularized Fermi--Dirac filter. This filter is the unique optimizer of an entropy-regularized variational formulation of PCA and converges to the classical PCA projector in the zero-temperature limit. This filter has a direct interpretation as a quantum measurement, which naturally suggests a quantum approach. For centered covariance operators represented by quantum feature states, a single fixed circuit, together with threshold calibration, accesses all optimal filters for different rank budgets or retained-variance levels without rank-dependent circuit updates or eigenvector recovery. For new inputs, the same calibrated quantum circuit yields soft principal subspace scores, spectral energy profiles, and postselected filtered states. The required centering of both training and test data is performed coherently inside the quantum protocol, which is particularly important for quantum data where no classical feature vectors or centered Gram matrix are directly available. By reframing PCA as a calibrated measurement task, this framework bypasses the need for iterative eigenvector extraction and achieves a dimension-independent sample complexity $O(η^{-2})$ for normalized fractional-rank or retained variance scoring at additive accuracy $η$.

quant-pharXiv:2605.27942•May 28, 2026•2 citations
Abstract Principal component analysis (PCA) is an important dimensionality reduction method in machine learning and data analysis. Recently, the quantum version of PCA has been established to diagonalize quantum states. Although these quantum algorithms promise quantum advantages, they require substantial resources beyond the reach of state-of-the-art quantum technologies. This work aims to reduce resource requirements and improve the efficiency of quantum PCA. Assuming that the quantum state is accessed through a purified quantum query model and a sampling model, we propose quantum algorithms that use minimal resource requirements for ancillary qubits to reveal properties of eigenvectors and eigenvalues of a state. In particular, we show that estimating eigenvalue λ with error ε and success probability larger than λ ( 1 − η ) requests a query complexity O ~ ( ϵ − 1 ) and a sample complexity O ~ ( ϵ − 2 η − 1 ) , respectively. To our knowledge, our result is the first quantum speedup that achieves asymptotic linear scaling in 1 / ϵ for quantum PCA. As applications, we discuss estimating the minimum relative entropy of entanglement of bipartite pure-states and performing quantum state discrimination tasks. We show that quantum speedups are maintained when the pure state has a low Schmidt number and states of discrimination have a low rank. This study opens up a new quantum PCA method for high-dimensional quantum data analysis and discusses its application in quantum information processing tasks.
Principal component analysis (PCA) has been widely adopted to reduce the dimension of data while preserving the information. The quantum version of PCA (qPCA) can be used to analyze an unknown low-rank density matrix by rapidly revealing the principal components of it, i.e., the eigenvectors of the density matrix with the largest eigenvalues. However, because of the substantial resource requirement, its experimental implementation remains challenging. Here, we develop a resonant analysis algorithm with minimal resource for ancillary qubits, in which only one frequency-scanning probe qubit is required to extract the principal components. In the experiment, we demonstrate the distillation of the first principal component of a 4 × 4 density matrix, with an efficiency of 86.0% and a fidelity of 0.90. This work shows the speedup ability of quantum algorithm in dimension reduction of data and thus could be used as part of quantum artificial intelligence algorithms in the future.
Abstract Kernel principal component analysis (kernel PCA) is a nonlinear dimensionality reduction technique that employs kernel functions to map data into a high-dimensional feature space, thereby extending the applicability of linear PCA to nonlinear data and facilitating the extraction of informative principal components. However, kernel PCA necessitates the manipulation of large-scale matrices, leading to high computational complexity and posing challenges for efficient implementation in big data environments. Quantum computing has recently been integrated with kernel methods in machine learning, enabling effective analysis of input data within intractable feature spaces. Although existing quantum kernel PCA proposals promise exponential speedups, they impose stringent requirements on quantum hardware that are challenging to fulfill. In this work, we propose a quantum algorithm for kernel PCA by establishing a connection between quantum kernel methods and block encoding, thereby diagonalizing the centralized kernel matrix on a quantum computer. The query complexity is logarithmic with respect to the size of the data vector, D , and linear with respect to the size of the dataset. An exponential speedup could be achieved when the dataset consists of a few high-dimensional vectors, wherein the dataset size is polynomial in log ⁡ ( D ) , with D being significantly large. In contrast to existing work, our algorithm enhances the efficiency of quantum kernel PCA and reduces the requirements for quantum hardware. Furthermore, we have also demonstrated that the algorithm based on block encoding matches the lower bound of query complexity, indicating that our algorithm is nearly optimal. Our research has laid down new pathways for developing quantum machine learning algorithms aimed at addressing tangible real-world problems and demonstrating quantum advantages within machine learning.
The incorporation of principal component analysis (PCA) through quantum knowledge is a pioneering improvement in the area of machine learning and quantum tools. Conventional PCA reduces data dimensionality and manages computation complexity by using eigenvector adjustment. By applying the thoughts of the superposition of information and the catch-up procedure, quantum computing makes it possible to encode and control data, finally ensuing in greater speedups in dedicated erudition responsibilities. This chapter investigates the association that exists among PCA and quantum algorithms. It mainly focuses on quantum PCA variants that translate standard eigenvectors into the quantum province. Quantum systems such as the qPCA may successfully pull out most important works from facts that have been programmed into quantum circumstances. In contrast to regular approaches, the new policy can provide considerable execution time and scalability enhancements. The shift from eigenvectors to qubits unlocks a new archetype in examining information, which includes quicker pattern discovery, enhanced feature mining, and superior capability to contract with bigger data sets. In spite of the reality that there are still many challenges to be solved, such as honest data training models, error rectification, and appropriate quantum tools, preface outcome shows that quantum enhanced dimensionality diminution has the potential to be a key constituent of subsequently cohort applications by utilizing machine learning concepts.
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.
Principal component analysis (PCA) is traditionally implemented through a covariance or kernel matrix, leading-eigenvector extraction, and hard rank-kkk projection. These steps can be computationally costly in high-dimensional and quantum-data settings, sensitive to small eigengaps, and unnecessary when downstream tasks only require principal-subspace scores. Such score-based objectives are important in applications such as anomaly detection, spectral-energy profiling, and other postselection tasks. To address these needs, we introduce a measurement-based soft PCA framework replacing the hard top-kkk projector with an entropy-regularized Fermi--Dirac filter. This filter is the unique optimizer of an entropy-regularized variational formulation of PCA and converges to the classical PCA projector in the zero-temperature limit. This filter has a direct interpretation as a quantum measurement, which naturally suggests a quantum approach. For centered covariance operators represented by quantum feature states, a single fixed circuit, together with threshold calibration, accesses all optimal filters for different rank budgets or retained-variance levels without rank-dependent circuit updates or eigenvector recovery. For new inputs, the same calibrated quantum circuit yields soft principal subspace scores, spectral energy profiles, and postselected filtered states. The required centering of both training and test data is performed coherently inside the quantum protocol, which is particularly important for quantum data where no classical feature vectors or centered Gram matrix are directly available. By reframing PCA as a calibrated measurement task, this framework bypasses the need for iterative eigenvector extraction and achieves a dimension-independent sample complexity O(η−2)O(η^{-2})O(η−2) for normalized fractional-rank or retained variance scoring at additive accuracy ηηη.