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 Symposium on Computer, Consumer and Control

Dimensionality Reduction Using Quantum Computation and Data Transformation

Su‐Ling Lee, Chien‐Cheng Tseng

Published Jun 27, 2025• 0 citations
Publisher

Abstract

In this article, we present a dimensionality reduction method based on data transformation and quantum computation. The proposed approach is implemented using a cascade quantum circuit comprising three key stages: quantum state preparation (QSP), quantum data transformation (QDT), and quantum measurement. The main steps of the method are as follows: First, the QSP circuit is designed using elementary quantum gates to encode the given data into a quantum register, enabling efficient data transformation. Next, the QDT circuit processes the encoded data, compressing it into a more compact representation with fewer significant features. This study explores two types of data transformations: dataindependent transforms (DIT), commonly used in digital signal compression, such as the discrete cosine transform (DCT), discrete Walsh transform (DWT), and discrete Haar transform (DHT); and data-dependent transforms (DDT), which leverage statistical properties of the data, such as the Karhunen-Loeve transform (KLT) which is also known as principal component analysis (PCA). Finally, quantum measurement is performed to extract the transformed data, where small-valued coefficients are discarded to achieve dimensionality reduction. To validate the effectiveness of the proposed method, experiments are conducted using real-world Fisher's iris flower data set.

DOI
10.1109/is3c65361.2025.11130993

Related papers

Image compression using quantum wavelet transforms

Sri Harshavardhan Reddy Devarapalli, Harshdeep Jadhav, Jayasri Dontabhaktuni

Quantum computing has emerged as a revolutionary paradigm in numerous fields owing to its basis in quantum mechanical concepts such as quantum entanglement and parallelism. This has potential in various applications including computer vision, particularly, image processing and compression. Applications that depend on largescale image data for storing, processing, and transmission have to rely on compression methods for real-time processing. While the classical methods based on discrete cosine transformations (DCT used in JPEG) and discrete wavelet transformations (DWT) perform image compression efficiently, they suffer from trade-off between loss-less compression and compression ratios. In the current work, we would like to explore the usefulness of implementing quantum wavelet transforms for image compression for better PSNR values and execution times. We compare the application of quantum Haar wavelet transform (QHWT) with different quantum encoding methods such as NASS and FRQI and find that NASS-encoded images on application of QHWT gives better PSNR values and shorter runtime with visibly closer details to the original images, showcasing potential for efficient and faster image compression methods.

Quantum Computing, Communication, and Simulation•Jan 24, 2025•6 citations

Quantum PCA in Genomics Dimensionality Reduction in Biological Data

S. Ranjana Devi, R. C. Suganthee, E. Grace Mary Kanaga +2 more

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.

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

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

Advanced quantum image representation and compression using a DCT-EFRQI approach

Md Ershadul Haque, Manoranjan Paul, Anwaar Ulhaq +1 more

In recent years, quantum image computing draws a lot of attention due to storing and processing image data faster compared to classical computers. A number of approaches have been proposed to represent the quantum image inside a quantum computer. Representing and compressing medium and big-size images inside the quantum computer is still challenging. To address this issue, we have proposed a block-wise DCT-EFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) approach to represent and compress the gray-scale image efficiently to save computational time and reduce the quantum bits (qubits) for the state preparation. In this work, we have demonstrated the capability of block-wise DCT and DWT transformation inside the quantum domain to investigate their relative performances. The Quirk simulation tool is used to design the corresponding quantum image circuit. In the proposed DCT-EFRQI approach, a total of 17 qubits are used to represent the coefficients, the connection between coefficients and state (i.e., auxiliary), and their position for representing and compressing grayscale images inside a quantum computer. Among those, 8 qubits are used to map the coefficient values and the rest are used to generate the corresponding coefficient XY-coordinate position including one auxiliary qubit. Theoretical analysis and experimental results show that the proposed DCT-EFRQI scheme provides better representation and compression compared to DCT-GQIR, DWT-GQIR, and DWT-EFRQI in terms of rate-distortion performance.

Scientific Reports•Mar 13, 2023•37 citations

Quantum Dimension Reduction for Pattern Recognition in High-Resolution Spatio-Spectral Data

Naveed Mahmud, Bennett Haase-Divine, Andrew MacGillivray +1 more

The promises of advanced quantum computing technology have driven research in the simulation of quantum computers on classical hardware, where the feasibility of quantum algorithms for real-world problems can be investigated. In domains such as High Energy Physics (HEP) and Remote Sensing Hyperspectral Imagery, classical computing systems are held back by enormous readouts of high-resolution data. Due to the multi-dimensionality of the readout data, processing and performing pattern recognition operations for this enormous data are both computationally intensive and time-consuming. In this article, we propose a methodology that utilizes Quantum Haar Transform (QHT) and a modified Grover's search algorithm for time-efficient dimension reduction and dynamic pattern recognition in data sets that are characterized by high spatial resolution and high dimensionality. QHT is performed on the data to reduce its dimensionality at preserved spatial locality, while the modified Grover's search algorithm is used to search for dynamically changing multiple patterns in the reduced data set. By performing search operations on the reduced data set, processing overheads are minimized. Moreover, quantum techniques produce results in less time than classical dimension reduction and search methods. The feasibility of the proposed methodology is verified by emulating the quantum algorithms on classical hardware based on field programmable gate arrays (FPGAs). We present designs of the quantum circuits for multi-dimensional QHT and multi-pattern Grover's search. We also present two emulation techniques and the corresponding hardware architectures for this methodology. A high performance reconfigurable computer (HPRC) was used for the experimental evaluation, and high-resolution images were used as the input data set. Analysis of the methods and implications of the experimental results are discussed.

IEEE Transactions on Computers•Oct 30, 2020•17 citations
In this article, we present a dimensionality reduction method based on data transformation and quantum computation. The proposed approach is implemented using a cascade quantum circuit comprising three key stages: quantum state preparation (QSP), quantum data transformation (QDT), and quantum measurement. The main steps of the method are as follows: First, the QSP circuit is designed using elementary quantum gates to encode the given data into a quantum register, enabling efficient data transformation. Next, the QDT circuit processes the encoded data, compressing it into a more compact representation with fewer significant features. This study explores two types of data transformations: dataindependent transforms (DIT), commonly used in digital signal compression, such as the discrete cosine transform (DCT), discrete Walsh transform (DWT), and discrete Haar transform (DHT); and data-dependent transforms (DDT), which leverage statistical properties of the data, such as the Karhunen-Loeve transform (KLT) which is also known as principal component analysis (PCA). Finally, quantum measurement is performed to extract the transformed data, where small-valued coefficients are discarded to achieve dimensionality reduction. To validate the effectiveness of the proposed method, experiments are conducted using real-world Fisher's iris flower data set.
Quantum computing has emerged as a revolutionary paradigm in numerous fields owing to its basis in quantum mechanical concepts such as quantum entanglement and parallelism. This has potential in various applications including computer vision, particularly, image processing and compression. Applications that depend on largescale image data for storing, processing, and transmission have to rely on compression methods for real-time processing. While the classical methods based on discrete cosine transformations (DCT used in JPEG) and discrete wavelet transformations (DWT) perform image compression efficiently, they suffer from trade-off between loss-less compression and compression ratios. In the current work, we would like to explore the usefulness of implementing quantum wavelet transforms for image compression for better PSNR values and execution times. We compare the application of quantum Haar wavelet transform (QHWT) with different quantum encoding methods such as NASS and FRQI and find that NASS-encoded images on application of QHWT gives better PSNR values and shorter runtime with visibly closer details to the original images, showcasing potential for efficient and faster image compression methods.
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.
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.
In recent years, quantum image computing draws a lot of attention due to storing and processing image data faster compared to classical computers. A number of approaches have been proposed to represent the quantum image inside a quantum computer. Representing and compressing medium and big-size images inside the quantum computer is still challenging. To address this issue, we have proposed a block-wise DCT-EFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) approach to represent and compress the gray-scale image efficiently to save computational time and reduce the quantum bits (qubits) for the state preparation. In this work, we have demonstrated the capability of block-wise DCT and DWT transformation inside the quantum domain to investigate their relative performances. The Quirk simulation tool is used to design the corresponding quantum image circuit. In the proposed DCT-EFRQI approach, a total of 17 qubits are used to represent the coefficients, the connection between coefficients and state (i.e., auxiliary), and their position for representing and compressing grayscale images inside a quantum computer. Among those, 8 qubits are used to map the coefficient values and the rest are used to generate the corresponding coefficient XY-coordinate position including one auxiliary qubit. Theoretical analysis and experimental results show that the proposed DCT-EFRQI scheme provides better representation and compression compared to DCT-GQIR, DWT-GQIR, and DWT-EFRQI in terms of rate-distortion performance.
The promises of advanced quantum computing technology have driven research in the simulation of quantum computers on classical hardware, where the feasibility of quantum algorithms for real-world problems can be investigated. In domains such as High Energy Physics (HEP) and Remote Sensing Hyperspectral Imagery, classical computing systems are held back by enormous readouts of high-resolution data. Due to the multi-dimensionality of the readout data, processing and performing pattern recognition operations for this enormous data are both computationally intensive and time-consuming. In this article, we propose a methodology that utilizes Quantum Haar Transform (QHT) and a modified Grover's search algorithm for time-efficient dimension reduction and dynamic pattern recognition in data sets that are characterized by high spatial resolution and high dimensionality. QHT is performed on the data to reduce its dimensionality at preserved spatial locality, while the modified Grover's search algorithm is used to search for dynamically changing multiple patterns in the reduced data set. By performing search operations on the reduced data set, processing overheads are minimized. Moreover, quantum techniques produce results in less time than classical dimension reduction and search methods. The feasibility of the proposed methodology is verified by emulating the quantum algorithms on classical hardware based on field programmable gate arrays (FPGAs). We present designs of the quantum circuits for multi-dimensional QHT and multi-pattern Grover's search. We also present two emulation techniques and the corresponding hardware architectures for this methodology. A high performance reconfigurable computer (HPRC) was used for the experimental evaluation, and high-resolution images were used as the input data set. Analysis of the methods and implications of the experimental results are discussed.