Principal component analysis (PCA) is a widely used statistical tool for extracting low-dimensional structures underlying multivariate data. However, its application to high-dimensional data is limited due to its large computational time. While the conventional PCA algorithm requires polynomial time, using a quantum-inspired algorithm as a subroutine, we have implemented an algorithm that approximates it with computational time proportional to the logarithm of the input dimensionality. The computational efficiency and performance of the implemented algorithm, quantum-inspired PCA, are experimentally evaluated on synthetic and real datasets.
Principal component analysis (PCA) is a widely used statistical tool for extracting low-dimensional structures underlying multivariate data. However, its application to high-dimensional data is limited due to its large computational time. While the conventional PCA algorithm requires polynomial time, using a quantum-inspired algorithm as a subroutine, we have implemented an algorithm that approximates it with computational time proportional to the logarithm of the input dimensionality. The computational efficiency and performance of the implemented algorithm, quantum-inspired PCA, are experimentally evaluated on synthetic and real datasets.
Principal component analysis (PCA) is a widely used statistical tool for extracting low-dimensional structures underlying multivariate data. However, its application to high-dimensional data is limited due to its large computational time. While the conventional PCA algorithm requires polynomial time, using a quantum-inspired algorithm as a subroutine, we have implemented an algorithm that approximates it with computational time proportional to the logarithm of the input dimensionality. The computational efficiency and performance of the implemented algorithm, quantum-inspired PCA, are experimentally evaluated on synthetic and real datasets.
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.
Machine learning algorithms specialized for neural data have allowed the extraction of information encoded in the brain. As an example, in previous studies, the images human subjects see were reconstructed from their brain activity measured via functional magnetic resonance imaging (fMRI) [1]. However, the application of those machine learning algorithms to high-resolution fMRI data, which may become mainstream in the near future, is limited due to their high computational cost. To solve this problem, scalable machine learning algorithms are being designed by utilizing computational techniques developed in the field of quantum computation [2,3]. In this report, taking one of the popular statistical methods, principal component analysis (PCA), as an example, we show that machine algorithms can be approximated with the use of such quantum-inspired techniques. The computational time and approximation performance of quantum-inspired PCA are demonstrated. The main results of this report have been presented in a previous paper by the author [3]. References 1G. Shen, T. Horikawa, K. Majima, Y. Kamitani, PLOS Computational Biology, Volume 15, e1006633 (2019). 2E. Tang, Physical Review Letters, Volume 127, 060503 (2021). 3N. Koide-Majima, K. Majima, Neural Networks, Volume 135, 55–67 (2021).
This essential resource bridges the gap between classical data limitations and the future of computing, giving you the scalable, quantum-accelerated PCA strategies needed to conquer today’s massive, high-dimensional datasets. With the rapid growth of big data in fields such as genomics, internet traffic analysis, and social network data, traditional principal component analysis methods have reached their limits in terms of scalability and computational efficiency. This volume delves into cutting-edge advancements in principal component analysis (PCA), particularly focusing on its applications in handling high-dimensional and large-scale datasets. It also provides practical insights into how PCA can be applied to fields such as machine learning, bioinformatics, and finance. Through real-world case studies, hands-on examples, and guidance on implementing PCA using modern software tools and libraries, the book presents essential principles in quantum information theory and quantum algorithms, establishing the groundwork necessary to comprehend how quantum computing may expedite and improve PCA procedures. This work examines quantum algorithms for matrix decomposition, analyzes the computational benefits of quantum PCA compared to classical approaches, and showcases real applications in quantum machine learning, encryption, and quantum chemistry. Ultimately, this book will serve as a valuable resource for researchers, students, and professionals looking to the future of high-dimensional data analysis and how to apply efficient, scalable methods to PCA in their work.
Canonical correlation analysis (CCA) serves to identify statistical dependencies between pairs of multivariate data. However, its application to high-dimensional data is limited due to considerable computational complexity. As an alternative to the conventional CCA approach that requires polynomial computational time, we propose an algorithm that approximates CCA using quantum-inspired computations with computational time proportional to the logarithm of the input dimensionality. The computational efficiency and performance of the proposed quantum-inspired CCA (qiCCA) algorithm are experimentally evaluated on synthetic and real datasets. Furthermore, the fast computation provided by qiCCA allows directly applying CCA even after nonlinearly mapping raw input data into high-dimensional spaces. The conducted experiments demonstrate that, as a result of mapping raw input data into the high-dimensional spaces with the use of second-order monomials, qiCCA extracts more correlations compared with the linear CCA and achieves comparable performance with state-of-the-art nonlinear variants of CCA on several datasets. These results confirm the appropriateness of the proposed qiCCA and the high potential of quantum-inspired computations in analyzing high-dimensional data.
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.