Principal Component Analysis (PCA) is commonly used for dimensionality reduction, feature extraction, data denoising, and visualization. The L1-PCA is known to confer robustness or a resistance to outliers in the data. In this paper, a new method for L1-PCA is explored using quantum annealing hardware. To showcase performance increases as compared to other PCA types, results for a fault detection scenario are presented and the speedup of L1-PCA using quantum annealing is demonstrated. Additionally, L1-PCA has better fault detection rates than L2-PCA when in the presence of outliers.
Principal Component Analysis (PCA) is commonly used for dimensionality reduction, feature extraction, data denoising, and visualization. The L1-PCA is known to confer robustness or a resistance to outliers in the data. In this paper, a new method for L1-PCA is explored using quantum annealing hardware. To showcase performance increases as compared to other PCA types, results for a fault detection scenario are presented and the speedup of L1-PCA using quantum annealing is demonstrated. Additionally, L1-PCA has better fault detection rates than L2-PCA when in the presence of outliers.
Principal component analysis is commonly used for dimensionality reduction, feature extraction, denoising, and visualization. The most commonly used principal component analysis method is based upon optimization of the L2-norm, however, the L2-norm is known to exaggerate the contribution of errors and outliers. When optimizing over the L1-norm, the components generated are known to exhibit robustness or resistance to outliers in the data. The L1-norm components can be solved for with a binary optimization problem. Previously, L1-BF has been used to solve the binary optimization for multiple components simultaneously. In this paper we propose QAPCA, a new method for finding principal components using quantum annealing hardware which will optimize over the robust L1-norm. The conditions required for convergence of the annealing problem are discussed. The potential speedup when using quantum annealing is demonstrated through complexity analysis and experimental results. To showcase performance against classical principal component analysis techniques experiments upon synthetic Gaussian data, a fault detection scenario and breast cancer diagnostic data are studied. We find that the reconstruction error when using QAPCA is comparable to that when using L1-BF.
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 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.
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 advent of high-throughput categorizing technologies in genomics has resulted in the phase of high-dimensional biological datasets that present important analytical challenges. Traditional dimensionality reduction techniques such as Principal Component Analysis (PCA) have facilitated data simplification and pattern recognition; however, their limitations in scalability and handling non-linear relationships are well recognized. In this chapter, the authors present an algorithm, Quantum Principal Component Analysis (QPCA), which is a quantum-enhanced algorithm addressing the computational limitation of the classical PCA with the goal of reducing computational costs. The quantum volume of computation is reduced by utilizing the laws of quantum mechanics; quantum superposition and quantum entanglements allow QPCA to process larger-scale genomic data more effectively and with a greater level of accuracy. The chapter brings out the theoretical basis of QPCA, the benefit of the technique compared to traditional PCA, and emphasizes the areas of operation that this technique can be applied such as gene types, feature capturing, biomarker-related disease, and identification. This paper has highlighted the potential of quantum computing to transform bio-data computing solutions, especially precision medicine, by incorporating comparative analysis and experiments.
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.