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

Advanced Science

Self‐Adaptive Quantum Kernel Principal Component Analysis for Compact Readout of Chemiresistive Sensor Arrays (Adv. Sci. 15/2025)

Zeheng Wang, Timothy van der Laan, Muhammad Usman

Published Apr 1, 2025• 1 citation
Publisher

Abstract

Quantum Machine Learning In article number 2411573, Zeheng Wang, Timothy van der Laan, and Muhammad Usman introduce a quantum algorithm-driven framework to compress chemiresistive sensor data. By employing a self-adaptive quantum kernel (SAQK), classical data are mapped into a quantum state space, where quantum principal component analysis (qPCA) is used to achieve significant dimensionality reduction. This innovative method not only minimizes information loss but also improves the subsequent AI-driven readout accuracy. The work highlights the synergy of quantum algorithms and AI, paving the way for efficient IoT data handling on noisy intermediate-scale quantum (NISQ) devices.

DOI
10.1002/advs.202570102

Related papers

Adaptive Quantum Kernels for Kernel PCA

Jincheng Zhang

This paper introduces adaptive quantum kernels (AQKs) for kernel principal component analysis (Kernel PCA), addressing the limitations of traditional quantum kernels that necessitate predefined data structures and assumptions. The core concept involves employing a quantum neural network to learn the structure of the kernel function directly from the data. This dynamic approach allows the AQK to adapt to the specific characteristics of a dataset, leading to enhanced classification or dimensionality reduction performance. The key innovation lies in the learned, data-dependent kernel structure, representing a significant departure from static quantum kernels. This paper details the theoretical framework, the proposed AQK architecture, and discusses its potential impact on various applications. The algorithm aims to overcome the rigidity of fixed-structure kernels by introducing a method of self-adaptation. The theoretical foundation is built upon quantum feature maps and kernel methods, exploring the optimization of kernel parameters within a quantum computing environment. This research provides a novel approach to kernel methods, leveraging the power of quantum computation for adaptive dimensionality reduction and classification tasks. The core of the system is the adaptive learning of the kernel parameters via a quantum neural network.

•Sep 1, 2026•0 citations

Quantum Kernel Learning for Small Dataset Modeling in Semiconductor Fabrication: Application to Ohmic Contact (Adv. Sci. 35/2025)

Zeheng Wang, Fangzhou Wang, Liang Li +5 more

Quantum Kernel Learning for Semiconductor Fabrication In article number 2506213, Zeheng Wang, Muhammad Usman, and co-workers present a quantum kernel-aligned regressor for modeling Ohmic contact formation in GaN HEMTs. Leveraging compact experimental datasets, their model outperforms classical baselines, demonstrating quantum machine learning's potential to enhance small-data semiconductor process modeling for future near-term quantum hardware deployment.

Advanced Science•Sep 1, 2025•2 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•6 citations

Adaptive Quantum Kernel Learning

Jincheng Zhang

This paper proposes a novel adaptive quantum kernel learning framework designed to overcome the limitations of classical kernel methods when applied to quantum state analysis. The core challenge lies in effectively mapping the high-dimensional space of quantum states into a manageable, low-dimensional feature space for traditional kernel-based learning algorithms. Existing methods often fail to capture the intricate correlations inherent in quantum states, leading to suboptimal results. Our approach introduces a self-adaptive kernel learning algorithm that dynamically adjusts the kernel function based on the observed quantum state correlations. This adaptation is achieved through a quantum-inspired optimization process utilizing variational quantum circuits. The circuits evolve the kernel parameters, guided by quantum state tomography data, effectively learning a kernel function tailored to the specific quantum system being analyzed. The key innovation is the integration of quantum mechanics directly into the kernel learning process, offering a potentially significant improvement in feature extraction and classification accuracy for quantum data. This work addresses a critical bottleneck in quantum machine learning, paving the way for more powerful and accurate quantum algorithms.

•Sep 2, 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

Quantum Kernel-Based Classification: An Optimized Quantum Support Vector Classifier Approach

Xiaoman Liu

Quantum machine learning has emerged as a promising frontier, leveraging the principles of quantum computing to enhance classical algorithms. This paper proposes an optimized Quantum Support Vector Classifier (QSVC) for the classification of the MNIST dataset (a benchmark in handwritten digit recognition). We employ a Chebyshev Parameterized Quantum Circuit (PQC) with an increased number of qubits and layers, and utilize an existing projected quantum kernel method to effectively capture the complex patterns in the data. To enhance model robustness, data augmentation techniques are applied, and dimensionality reduction is performed using Principal Component Analysis (PCA). The proposed QSVC demonstrates competitive accuracy on both the training and testing datasets, highlighting the potential of quantum kernel methods in practical machine learning applications. A comparative analysis with classical Support Vector Machines (SVM) demonstrates the feasibility of quantum methods for high-dimensional classification tasks. Additionally, we investigate the impact of varying the number of qubits in the quantum circuit, providing in-depth insights into the scalability and performance trade-offs of quantum kernel methods.

IEEE International Conference on Frontiers Technology of Information and Computer (ICFTIC)•Dec 13, 2024•0 citations
Quantum Machine Learning In article number 2411573, Zeheng Wang, Timothy van der Laan, and Muhammad Usman introduce a quantum algorithm-driven framework to compress chemiresistive sensor data. By employing a self-adaptive quantum kernel (SAQK), classical data are mapped into a quantum state space, where quantum principal component analysis (qPCA) is used to achieve significant dimensionality reduction. This innovative method not only minimizes information loss but also improves the subsequent AI-driven readout accuracy. The work highlights the synergy of quantum algorithms and AI, paving the way for efficient IoT data handling on noisy intermediate-scale quantum (NISQ) devices.
This paper introduces adaptive quantum kernels (AQKs) for kernel principal component analysis (Kernel PCA), addressing the limitations of traditional quantum kernels that necessitate predefined data structures and assumptions. The core concept involves employing a quantum neural network to learn the structure of the kernel function directly from the data. This dynamic approach allows the AQK to adapt to the specific characteristics of a dataset, leading to enhanced classification or dimensionality reduction performance. The key innovation lies in the learned, data-dependent kernel structure, representing a significant departure from static quantum kernels. This paper details the theoretical framework, the proposed AQK architecture, and discusses its potential impact on various applications. The algorithm aims to overcome the rigidity of fixed-structure kernels by introducing a method of self-adaptation. The theoretical foundation is built upon quantum feature maps and kernel methods, exploring the optimization of kernel parameters within a quantum computing environment. This research provides a novel approach to kernel methods, leveraging the power of quantum computation for adaptive dimensionality reduction and classification tasks. The core of the system is the adaptive learning of the kernel parameters via a quantum neural network.
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.
This paper proposes a novel adaptive quantum kernel learning framework designed to overcome the limitations of classical kernel methods when applied to quantum state analysis. The core challenge lies in effectively mapping the high-dimensional space of quantum states into a manageable, low-dimensional feature space for traditional kernel-based learning algorithms. Existing methods often fail to capture the intricate correlations inherent in quantum states, leading to suboptimal results. Our approach introduces a self-adaptive kernel learning algorithm that dynamically adjusts the kernel function based on the observed quantum state correlations. This adaptation is achieved through a quantum-inspired optimization process utilizing variational quantum circuits. The circuits evolve the kernel parameters, guided by quantum state tomography data, effectively learning a kernel function tailored to the specific quantum system being analyzed. The key innovation is the integration of quantum mechanics directly into the kernel learning process, offering a potentially significant improvement in feature extraction and classification accuracy for quantum data. This work addresses a critical bottleneck in quantum machine learning, paving the way for more powerful and accurate quantum 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.
Quantum machine learning has emerged as a promising frontier, leveraging the principles of quantum computing to enhance classical algorithms. This paper proposes an optimized Quantum Support Vector Classifier (QSVC) for the classification of the MNIST dataset (a benchmark in handwritten digit recognition). We employ a Chebyshev Parameterized Quantum Circuit (PQC) with an increased number of qubits and layers, and utilize an existing projected quantum kernel method to effectively capture the complex patterns in the data. To enhance model robustness, data augmentation techniques are applied, and dimensionality reduction is performed using Principal Component Analysis (PCA). The proposed QSVC demonstrates competitive accuracy on both the training and testing datasets, highlighting the potential of quantum kernel methods in practical machine learning applications. A comparative analysis with classical Support Vector Machines (SVM) demonstrates the feasibility of quantum methods for high-dimensional classification tasks. Additionally, we investigate the impact of varying the number of qubits in the quantum circuit, providing in-depth insights into the scalability and performance trade-offs of quantum kernel methods.