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

arXiv:2408.10265 · Transactions on machine learning research

Distributed and Secure Kernel-Based Quantum Machine Learning

Alex David Swaminathan, Mete Akgün

Published Aug 16, 2024• 0 citations
arXivHTMLPDF

Abstract

Quantum computing promises to revolutionize machine learning, offering significant efficiency gains in tasks such as clustering and distance estimation. Additionally, it provides enhanced security through fundamental principles like the measurement postulate and the no-cloning theorem, enabling secure protocols such as quantum teleportation and quantum key distribution. While advancements in secure quantum machine learning are notable, the development of secure and distributed quantum analogues of kernel-based machine learning techniques remains underexplored. In this work, we present a novel approach for securely computing common kernels, including polynomial, radial basis function (RBF), and Laplacian kernels, when data is distributed, using quantum feature maps. Our methodology introduces a robust framework that leverages quantum teleportation to ensure secure and distributed kernel learning. The proposed architecture is validated using IBM's Qiskit Aer Simulator on various public datasets.

DOI
10.5281/zenodo.15482311

Related papers

Large-scale quantum machine learning

Tobias Haug, Chris N. Self, M. S. Kim

Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data. However, conventional methods for measuring quantum kernels are impractical for large datasets as they scale with the square of the dataset size. Here, we measure quantum kernels using randomized measurements to gain a quadratic speedup in computation time and quickly process large datasets. Further, we efficiently encode high-dimensional data into quantum computers with the number of features scaling linearly with the circuit depth. The encoding is characterized by the quantum Fisher information metric and is related to the radial basis function kernel. We demonstrate the advantages of our methods by classifying images with the IBM quantum computer. To achieve further speedups we distribute the quantum computational tasks between different quantum computers. Our approach is exceptionally robust to noise via a complementary error mitigation scheme. Using currently available quantum computers, the MNIST database can be processed within 220 hours instead of 10 years which opens up industrial applications of quantum machine learning.

•Aug 2, 2021•11 citations

Quantum machine learning of large datasets using randomized measurements

Tobias Haug, Chris N. Self, M. S. Kim

Abstract Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data. However, conventional methods for measuring quantum kernels are impractical for large datasets as they scale with the square of the dataset size. Here, we measure quantum kernels using randomized measurements. The quantum computation time scales linearly with dataset size and quadratic for classical post-processing. While our method scales in general exponentially in qubit number, we gain a substantial speed-up when running on intermediate-sized quantum computers. Further, we efficiently encode high-dimensional data into quantum computers with the number of features scaling linearly with the circuit depth. The encoding is characterized by the quantum Fisher information metric and is related to the radial basis function kernel. Our approach is robust to noise via a cost-free error mitigation scheme. We demonstrate the advantages of our methods for noisy quantum computers by classifying images with the IBM quantum computer. To achieve further speedups we distribute the quantum computational tasks between different quantum computers. Our method enables benchmarking of quantum machine learning algorithms with large datasets on currently available quantum computers.

arXiv:2108.01039•Machine Learning Science and Technology•Jan 5, 2023•63 citations

Benchmarking Quantum Kernel Support Vector Machines Against Classical Baselines on Tabular Data: A Rigorous Empirical Study with Hardware Validation

Siavash Kakavand, Christoph Strohmeyer, Michael Schlotter

Quantum kernel methods have been proposed as a promising approach for leveraging near-term quantum computers for supervised learning, yet rigorous benchmarks against strong classical baselines remain scarce. We present a comprehensive empirical study of quantum kernel support vector machines (QSVMs) across nine binary classification datasets, four quantum feature maps, three classical kernels, and multiple noise models, totalling 970 experiments with strict nested cross-validation. Our analysis spans four phases: (i) statistical significance testing, revealing that none of 29 pairwise quantum-classical comparisons reach significance at $α= 0.05$; (ii) learning curve analysis over six training fractions, showing steeper quantum slopes on six of eight datasets that nonetheless fail to close the gap to the best classical baseline; (iii) hardware validation on IBM ibm_fez (Heron r2), demonstrating kernel fidelity $r \geq 0.976$ across six experiments; and (iv) seed sensitivity analysis confirming reproducibility (mean CV 1.4%). A Kruskal-Wallis factorial analysis reveals that dataset choice dominates performance variance ($\varepsilon^2 = 0.73$), while kernel type accounts for only 9%. Spectral analysis offers a mechanistic explanation: current quantum feature maps produce eigenspectra that are either too flat or too concentrated, missing the intermediate profile of the best classical kernel, the radial basis function (RBF). Quantum kernel training (QKT) via kernel-target alignment yields the single competitive result -- balanced accuracy 0.968 on breast cancer -- but with ~2,000x computational overhead. Our findings provide actionable guidelines for quantum kernel research. The complete benchmark suite is publicly available to facilitate reproduction and extension.

quant-pharXiv:2604.18837•Apr 22, 2026•0 citations

Secure Quantum Machine Learning via Quantum Cryptography: Theoretical Framework and Implementation Insights

Lokesh BS

As quantum machine learning (QML) continues to evolve, it promises unparalleled computational advantages in processing complex data. However, the rise of QML also introduces critical concerns regarding data security and privacy, particularly in sensitive domains such as healthcare, finance, and defense. Classical cryptographic methods fall short in addressing threats that arise in quantum communication and computation environments. To bridge this gap, this paper presents a hybrid framework that integrates quantum cryptography—specifically Quantum Key Distribution (QKD)—with QML pipelines, ensuring end-to-end quantum-secure machinelearning operations. We first construct a theoretical model that outlines how QKD can be effectively embedded into a typical QML workflow to mitigate adversarial threats such as eavesdropping, model inversion, and poisoning attacks. We then implement this framework using IBM’s Qiskit and a simulated QKD environment via QuNetSim, applying it to a quantum support vector machine (qSVM) classifier. The integration is evaluated based on accuracy, computational overhead, and communication latency. Our results indicate that quantum-secured QML systems can maintain robust model performance while significantly enhancing data confidentiality. This work lays the groundwork for future developments in secure quantum artificial intelligence infrastructures.

Journal of Information Systems Engineering & Management•May 23, 2025•3 citations

A Versatile Variational Quantum Kernel Framework for Non-Trivial Classification

Jiang Yuhan, Matthew Otten

Quantum kernel methods are a promising branch of quantum machine learning, but their per- formance across data types and encoding choices remains incompletely understood. To address this gap, we developed an algorithmic framework for variational quantum kernels utilizing resource- efficient ansätze for complex classification tasks and introduced a parameter scaling technique to accelerate convergence. We conducted a comprehensive benchmark of this framework on eight chal- lenging, real-world and high-dimensional datasets covering tabular, image, time series, and graph data. Our results show that the proposed quantum kernel demonstrated competitive classification accuracy compared to standard classical kernels in classical simulation, such as the radial basis function (RBF) kernel. This work demonstrates that properly designed quantum kernels can func- tion as versatile, high-performance tools, laying a foundation for quantum-enhanced applications in machine learning. Further research is needed to fully assess the practical performance of quantum methods.

cs.LGCross-listedarXiv:2511.10831•Nov 17, 2025•0 citations

Quantum-Safe Federated Learning: Enhancing Data Privacy and Security

E. Kannan, Carmel Mary Belinda M J, S Ravikumar +3 more

Ensuring data security and privacy is highly pertinent in today’s era marked by the dominance of collaborative machine learning. This study presents a novel framework, named" Quantum-Resilient Privacy-Preserving Federated Learning for Enhanced Data Security," which leverages quantum computing to strengthen federated learning models against adversarial risks and enhance privacy safeguards. Our research investigates the incorporation of quantum key distribution and entanglement protocols into federated learning, therefore establishing a quantum- resilient methodology. The findings demonstrate the model’s ability to effectively resist advanced threats, hence assuring the maintenance of strong data security measures. The utilization of quantum technology in this context serves to strengthen the fundamental principles of cryptography, while simultaneously introducing a novel approach to enhancing privacy. Moreover, the study explores the potential of the framework to accommodate various datasets from different cooperating entities, while also resolving the difficulties presented by the diversity of the data. The framework’s success in accommodating multiple machine learning models and applications is demonstrated by evaluations of scalability and computing efficiency. In essence, the research paper titled" Quantum-Resilient Privacy-Preserving Federated Learning for Enhanced Data Security" represents a significant progression in the field of safeguarding collaborative machine learning. The quantum-resilient paradigm not only increases privacy but also offers a safe foundation for the future of collaborative machine learning. The issue at hand pertains to the growing apprehensions over the safeguarding of data privacy and security within the context of our technologically advanced day.

International Conference on Emerging Research in Computational Science (ICERCS)•Dec 12, 2024•8 citations
Quantum computing promises to revolutionize machine learning, offering significant efficiency gains in tasks such as clustering and distance estimation. Additionally, it provides enhanced security through fundamental principles like the measurement postulate and the no-cloning theorem, enabling secure protocols such as quantum teleportation and quantum key distribution. While advancements in secure quantum machine learning are notable, the development of secure and distributed quantum analogues of kernel-based machine learning techniques remains underexplored. In this work, we present a novel approach for securely computing common kernels, including polynomial, radial basis function (RBF), and Laplacian kernels, when data is distributed, using quantum feature maps. Our methodology introduces a robust framework that leverages quantum teleportation to ensure secure and distributed kernel learning. The proposed architecture is validated using IBM's Qiskit Aer Simulator on various public datasets.
Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data. However, conventional methods for measuring quantum kernels are impractical for large datasets as they scale with the square of the dataset size. Here, we measure quantum kernels using randomized measurements to gain a quadratic speedup in computation time and quickly process large datasets. Further, we efficiently encode high-dimensional data into quantum computers with the number of features scaling linearly with the circuit depth. The encoding is characterized by the quantum Fisher information metric and is related to the radial basis function kernel. We demonstrate the advantages of our methods by classifying images with the IBM quantum computer. To achieve further speedups we distribute the quantum computational tasks between different quantum computers. Our approach is exceptionally robust to noise via a complementary error mitigation scheme. Using currently available quantum computers, the MNIST database can be processed within 220 hours instead of 10 years which opens up industrial applications of quantum machine learning.
Abstract Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data. However, conventional methods for measuring quantum kernels are impractical for large datasets as they scale with the square of the dataset size. Here, we measure quantum kernels using randomized measurements. The quantum computation time scales linearly with dataset size and quadratic for classical post-processing. While our method scales in general exponentially in qubit number, we gain a substantial speed-up when running on intermediate-sized quantum computers. Further, we efficiently encode high-dimensional data into quantum computers with the number of features scaling linearly with the circuit depth. The encoding is characterized by the quantum Fisher information metric and is related to the radial basis function kernel. Our approach is robust to noise via a cost-free error mitigation scheme. We demonstrate the advantages of our methods for noisy quantum computers by classifying images with the IBM quantum computer. To achieve further speedups we distribute the quantum computational tasks between different quantum computers. Our method enables benchmarking of quantum machine learning algorithms with large datasets on currently available quantum computers.
Quantum kernel methods have been proposed as a promising approach for leveraging near-term quantum computers for supervised learning, yet rigorous benchmarks against strong classical baselines remain scarce. We present a comprehensive empirical study of quantum kernel support vector machines (QSVMs) across nine binary classification datasets, four quantum feature maps, three classical kernels, and multiple noise models, totalling 970 experiments with strict nested cross-validation. Our analysis spans four phases: (i) statistical significance testing, revealing that none of 29 pairwise quantum-classical comparisons reach significance at α=0.05α= 0.05α=0.05; (ii) learning curve analysis over six training fractions, showing steeper quantum slopes on six of eight datasets that nonetheless fail to close the gap to the best classical baseline; (iii) hardware validation on IBM ibm_fez (Heron r2), demonstrating kernel fidelity r≥0.976r \geq 0.976r≥0.976 across six experiments; and (iv) seed sensitivity analysis confirming reproducibility (mean CV 1.4%). A Kruskal-Wallis factorial analysis reveals that dataset choice dominates performance variance (ε2=0.73\varepsilon^2 = 0.73ε2=0.73), while kernel type accounts for only 9%. Spectral analysis offers a mechanistic explanation: current quantum feature maps produce eigenspectra that are either too flat or too concentrated, missing the intermediate profile of the best classical kernel, the radial basis function (RBF). Quantum kernel training (QKT) via kernel-target alignment yields the single competitive result -- balanced accuracy 0.968 on breast cancer -- but with ~2,000x computational overhead. Our findings provide actionable guidelines for quantum kernel research. The complete benchmark suite is publicly available to facilitate reproduction and extension.
As quantum machine learning (QML) continues to evolve, it promises unparalleled computational advantages in processing complex data. However, the rise of QML also introduces critical concerns regarding data security and privacy, particularly in sensitive domains such as healthcare, finance, and defense. Classical cryptographic methods fall short in addressing threats that arise in quantum communication and computation environments. To bridge this gap, this paper presents a hybrid framework that integrates quantum cryptography—specifically Quantum Key Distribution (QKD)—with QML pipelines, ensuring end-to-end quantum-secure machinelearning operations. We first construct a theoretical model that outlines how QKD can be effectively embedded into a typical QML workflow to mitigate adversarial threats such as eavesdropping, model inversion, and poisoning attacks. We then implement this framework using IBM’s Qiskit and a simulated QKD environment via QuNetSim, applying it to a quantum support vector machine (qSVM) classifier. The integration is evaluated based on accuracy, computational overhead, and communication latency. Our results indicate that quantum-secured QML systems can maintain robust model performance while significantly enhancing data confidentiality. This work lays the groundwork for future developments in secure quantum artificial intelligence infrastructures.
Quantum kernel methods are a promising branch of quantum machine learning, but their per- formance across data types and encoding choices remains incompletely understood. To address this gap, we developed an algorithmic framework for variational quantum kernels utilizing resource- efficient ansätze for complex classification tasks and introduced a parameter scaling technique to accelerate convergence. We conducted a comprehensive benchmark of this framework on eight chal- lenging, real-world and high-dimensional datasets covering tabular, image, time series, and graph data. Our results show that the proposed quantum kernel demonstrated competitive classification accuracy compared to standard classical kernels in classical simulation, such as the radial basis function (RBF) kernel. This work demonstrates that properly designed quantum kernels can func- tion as versatile, high-performance tools, laying a foundation for quantum-enhanced applications in machine learning. Further research is needed to fully assess the practical performance of quantum methods.
Ensuring data security and privacy is highly pertinent in today’s era marked by the dominance of collaborative machine learning. This study presents a novel framework, named" Quantum-Resilient Privacy-Preserving Federated Learning for Enhanced Data Security," which leverages quantum computing to strengthen federated learning models against adversarial risks and enhance privacy safeguards. Our research investigates the incorporation of quantum key distribution and entanglement protocols into federated learning, therefore establishing a quantum- resilient methodology. The findings demonstrate the model’s ability to effectively resist advanced threats, hence assuring the maintenance of strong data security measures. The utilization of quantum technology in this context serves to strengthen the fundamental principles of cryptography, while simultaneously introducing a novel approach to enhancing privacy. Moreover, the study explores the potential of the framework to accommodate various datasets from different cooperating entities, while also resolving the difficulties presented by the diversity of the data. The framework’s success in accommodating multiple machine learning models and applications is demonstrated by evaluations of scalability and computing efficiency. In essence, the research paper titled" Quantum-Resilient Privacy-Preserving Federated Learning for Enhanced Data Security" represents a significant progression in the field of safeguarding collaborative machine learning. The quantum-resilient paradigm not only increases privacy but also offers a safe foundation for the future of collaborative machine learning. The issue at hand pertains to the growing apprehensions over the safeguarding of data privacy and security within the context of our technologically advanced day.