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:2508.17909 · The Journal of Supercomputing

Entanglement detection with quantum-inspired kernels and SVMs

Ana Martínez-Sabiote, Michalis Skotiniotis, Jara J. Bermejo-Vega, Daniel Manzano, Carlos Cano

Published Jan 27, 2026• 4 citations
arXivHTMLPDF

Abstract

Abstract This work presents a machine learning approach based on support vector machines (SVMs) for quantum entanglement detection. Particularly, we focus on bipartite systems of dimensions $$3\times 3$$ 3 × 3 , $$4\times 4$$ 4 × 4 , and $$5\times 5$$ 5 × 5 , where the positive partial transpose criterion (PPT) provides only partial characterization. Using SVMs with quantum-inspired kernels, we develop a classification scheme that distinguishes between separable and entangled states, including PPT-detectable entangled states, and entangled states that evade PPT detection. Our method achieves increasing accuracy with system dimension, reaching $$80\%$$ 80 % , $$90\%$$ 90 % , and nearly $$100\%$$ 100 % for $$3\times 3$$ 3 × 3 , $$4\times 4$$ 4 × 4 , and $$5\times 5$$ 5 × 5 systems, respectively. Our results show that principal component analysis significantly enhances performance for small training sets. The study reveals important practical considerations regarding purity biases in the generation of data for this problem and examines the challenges of implementing these techniques on near-term quantum hardware. Our results demonstrate that machine learning can be an effective alternative to entanglement detection of higher-dimensional systems where conventional entanglement detection methods struggle. Our approach provides improved data generation protocols and can be readily implemented in hybrid classical-quantum architectures, overcoming current limitations.

DOI
10.1007/s11227-026-08229-7

Related papers

Quantum Kernels for SVM Entanglement Detection

Ernesto Acosta, Carlos Cano, Daniel Manzano +1 more

This work presents a quantum machine learning approach for bipartite entanglement detection in 3×3 quantum systems using a support vector machine with quantum kernels. The classifier is trained to distinguish separable from entangled states, which includes both PPT-detectable and PPT-non-detectable instances, based on classical simulations of parameterized quantum feature maps combined with dimensionality reduction via PCA. Our results show that Pauli-based feature map kernels achieve higher classification accuracy than amplitude embedding at the same PCA dimension, reaching up to 78% accuracy for PCA =8, while amplitude embedding requires PCA =32 to attain comparable performance. We also show that increasing the number of Pauli feature map repetitions does not lead to consistent accuracy improvements, despite significantly increasing circuit depth and computational overhead.

IEEE Conference on Artificial Intelligence (CAI)•May 8, 2026•0 citations

Machine Learning Based Detection of Quantum Entanglement in Two-Qubit Systems

Shanidev Ambadas Sontakke

This paper explores the use of machine learning techniques for detecting quantum entanglement in two-qubit systems. A dataset of randomly generated quantum states was constructed and labeled using the Positive Partial Transpose (PPT) criterion. Several supervised learning models, including Random Forest and Multi-Layer Perceptron neural networks, were trained to classify quantum states as entangled or separable. The results show that machine learning models can effectively learn patterns from quantum state data, while also highlighting the impact of dataset imbalance on classification performance. This study demonstrates the potential of machine learning as a complementary tool for quantum entanglement detection and provides insights into the challenges and opportunities of integrating artificial intelligence with quantum physics.

•Jan 24, 2026•0 citations

Quantum-Inspired Kernel Design for Support Vector Machines

Jincheng Zhang

Support Vector Machines (SVMs) are powerful machine learning models widely used for classification and regression tasks. However, their performance can be significantly impacted by the choice of the kernel function, which defines how data points are mapped into a higher-dimensional space. Traditional kernels often struggle to capture complex, non-linear relationships effectively, leading to suboptimal results. This paper proposes a novel approach to kernel design inspired by quantum mechanical principles. Specifically, we leverage concepts of quantum entanglement and superposition to generate kernels that can potentially capture richer and more nuanced data patterns. Our core claim is that employing these quantum-inspired designs can improve SVM performance and scalability. We present a theoretical framework outlining how quantum mechanical effects can be translated into kernel functions. The proposed method is based on constructing kernel functions that implicitly encode correlations between data points, mimicking the inherent interconnectedness observed in quantum systems. We explore specific kernel formulations based on these principles and discuss their potential advantages and challenges. The ultimate goal is to demonstrate that quantum inspiration can unlock new avenues for kernel design, leading to more effective SVM models.

•Sep 5, 2026•0 citations

Quantum-Inspired Kernel Design for Machine Learning

Jincheng Zhang

This paper explores a novel approach to kernel design for machine learning, drawing inspiration from the principles of quantum entanglement. Traditional kernel functions in Support Vector Machines (SVMs) frequently necessitate extensive manual tuning and often fail to achieve optimal performance. We introduce a kernel design algorithm that mimics the correlated behavior observed in entangled quantum systems. The algorithm constructs kernel functions based on the correlated features of data points, effectively simulating entanglement effects to potentially enhance classification accuracy. This work presents a fundamental shift in kernel design, moving away from hand-crafted kernels towards a more adaptive and potentially more powerful approach guided by quantum-inspired concepts. The core contribution lies in the methodology for generating kernels that dynamically capture complex relationships within data, leading to improved classification outcomes. We demonstrate the potential of this approach through a theoretical framework and outline a design strategy that can be readily applied to various machine learning tasks.

•Sep 3, 2026•0 citations

From Theory to Practice: Quantum Kernels in Support Vector Classification for Improved Performance

Nhat-Trinh Le, Nhat Tan Thai, Cao Vu Bui

Quantum computing offers a powerful new paradigm for enhancing classical machine learning, particularly in classification tasks. In this paper, we examine the use of quantum kernels within Support Vector Classification (SVC) and compare their performance to classical SVC. Our experiments focus on the Iris and Wine datasets. For the Wine dataset, we applied Principal Component Analysis (PCA), reducing the feature space from 13 to 4 dimensions to improve computational efficiency. The results demonstrate that Quantum-enhanced SVC (QSVC) outperforms classical SVC, achieving an accuracy improvement from 96.15% with classical SVM to 98.05% with QSVC for the Wine dataset. Similarly, for the Iris dataset, classical SVC achieves near-perfect accuracy at 100%, while QSVC closely follows with 97.25% accuracy. These results highlight the capability of quantum kernels to improve both accuracy and efficiency in classification tasks, providing a promising direction for scalable quantum-classical hybrid systems in machine learning.

RIVF International Conference on Computing and Communication Technologies (RIVF)•Dec 21, 2024•2 citations

Entanglement classification via witness operators generated by support vector machine

Claudio Sanavio, Edoardo Tignone, Elisa Ercolessi

Abstract Although entanglement is a basic resource for reaching quantum advantage in many computation and information protocols, we lack a universal recipe for detecting it, with analytical results obtained for low-dimensional systems and few special cases of higher-dimensional systems. In this work, we use a machine learning algorithm, the support vector machine with polynomial kernel, to classify separable and entangled states. We apply it to two-qubit and three-qubit systems, and we show that, after training, the support vector machine is able to recognize if a random state is entangled with an accuracy up to $$92\%$$ 92 % for the two-qubit system and up to $$98\%$$ 98 % for the three-qubit system. We also describe why and in what regime the support vector machine algorithm is able to implement the evaluation of an entanglement witness operator applied to many copies of the state, and we describe how we can translate this procedure into a quantum circuit.

arXiv:2301.06759•The European Physical Journal Plus•Oct 21, 2023•12 citations
Abstract This work presents a machine learning approach based on support vector machines (SVMs) for quantum entanglement detection. Particularly, we focus on bipartite systems of dimensions 3×33\times 33×3 3 × 3 , 4×44\times 44×4 4 × 4 , and 5×55\times 55×5 5 × 5 , where the positive partial transpose criterion (PPT) provides only partial characterization. Using SVMs with quantum-inspired kernels, we develop a classification scheme that distinguishes between separable and entangled states, including PPT-detectable entangled states, and entangled states that evade PPT detection. Our method achieves increasing accuracy with system dimension, reaching 80%80\%80% 80 % , 90%90\%90% 90 % , and nearly 100%100\%100% 100 % for 3×33\times 33×3 3 × 3 , 4×44\times 44×4 4 × 4 , and 5×55\times 55×5 5 × 5 systems, respectively. Our results show that principal component analysis significantly enhances performance for small training sets. The study reveals important practical considerations regarding purity biases in the generation of data for this problem and examines the challenges of implementing these techniques on near-term quantum hardware. Our results demonstrate that machine learning can be an effective alternative to entanglement detection of higher-dimensional systems where conventional entanglement detection methods struggle. Our approach provides improved data generation protocols and can be readily implemented in hybrid classical-quantum architectures, overcoming current limitations.
This work presents a quantum machine learning approach for bipartite entanglement detection in 3×3 quantum systems using a support vector machine with quantum kernels. The classifier is trained to distinguish separable from entangled states, which includes both PPT-detectable and PPT-non-detectable instances, based on classical simulations of parameterized quantum feature maps combined with dimensionality reduction via PCA. Our results show that Pauli-based feature map kernels achieve higher classification accuracy than amplitude embedding at the same PCA dimension, reaching up to 78% accuracy for PCA =8, while amplitude embedding requires PCA =32 to attain comparable performance. We also show that increasing the number of Pauli feature map repetitions does not lead to consistent accuracy improvements, despite significantly increasing circuit depth and computational overhead.
This paper explores the use of machine learning techniques for detecting quantum entanglement in two-qubit systems. A dataset of randomly generated quantum states was constructed and labeled using the Positive Partial Transpose (PPT) criterion. Several supervised learning models, including Random Forest and Multi-Layer Perceptron neural networks, were trained to classify quantum states as entangled or separable. The results show that machine learning models can effectively learn patterns from quantum state data, while also highlighting the impact of dataset imbalance on classification performance. This study demonstrates the potential of machine learning as a complementary tool for quantum entanglement detection and provides insights into the challenges and opportunities of integrating artificial intelligence with quantum physics.
Support Vector Machines (SVMs) are powerful machine learning models widely used for classification and regression tasks. However, their performance can be significantly impacted by the choice of the kernel function, which defines how data points are mapped into a higher-dimensional space. Traditional kernels often struggle to capture complex, non-linear relationships effectively, leading to suboptimal results. This paper proposes a novel approach to kernel design inspired by quantum mechanical principles. Specifically, we leverage concepts of quantum entanglement and superposition to generate kernels that can potentially capture richer and more nuanced data patterns. Our core claim is that employing these quantum-inspired designs can improve SVM performance and scalability. We present a theoretical framework outlining how quantum mechanical effects can be translated into kernel functions. The proposed method is based on constructing kernel functions that implicitly encode correlations between data points, mimicking the inherent interconnectedness observed in quantum systems. We explore specific kernel formulations based on these principles and discuss their potential advantages and challenges. The ultimate goal is to demonstrate that quantum inspiration can unlock new avenues for kernel design, leading to more effective SVM models.
This paper explores a novel approach to kernel design for machine learning, drawing inspiration from the principles of quantum entanglement. Traditional kernel functions in Support Vector Machines (SVMs) frequently necessitate extensive manual tuning and often fail to achieve optimal performance. We introduce a kernel design algorithm that mimics the correlated behavior observed in entangled quantum systems. The algorithm constructs kernel functions based on the correlated features of data points, effectively simulating entanglement effects to potentially enhance classification accuracy. This work presents a fundamental shift in kernel design, moving away from hand-crafted kernels towards a more adaptive and potentially more powerful approach guided by quantum-inspired concepts. The core contribution lies in the methodology for generating kernels that dynamically capture complex relationships within data, leading to improved classification outcomes. We demonstrate the potential of this approach through a theoretical framework and outline a design strategy that can be readily applied to various machine learning tasks.
Quantum computing offers a powerful new paradigm for enhancing classical machine learning, particularly in classification tasks. In this paper, we examine the use of quantum kernels within Support Vector Classification (SVC) and compare their performance to classical SVC. Our experiments focus on the Iris and Wine datasets. For the Wine dataset, we applied Principal Component Analysis (PCA), reducing the feature space from 13 to 4 dimensions to improve computational efficiency. The results demonstrate that Quantum-enhanced SVC (QSVC) outperforms classical SVC, achieving an accuracy improvement from 96.15% with classical SVM to 98.05% with QSVC for the Wine dataset. Similarly, for the Iris dataset, classical SVC achieves near-perfect accuracy at 100%, while QSVC closely follows with 97.25% accuracy. These results highlight the capability of quantum kernels to improve both accuracy and efficiency in classification tasks, providing a promising direction for scalable quantum-classical hybrid systems in machine learning.
Abstract Although entanglement is a basic resource for reaching quantum advantage in many computation and information protocols, we lack a universal recipe for detecting it, with analytical results obtained for low-dimensional systems and few special cases of higher-dimensional systems. In this work, we use a machine learning algorithm, the support vector machine with polynomial kernel, to classify separable and entangled states. We apply it to two-qubit and three-qubit systems, and we show that, after training, the support vector machine is able to recognize if a random state is entangled with an accuracy up to 92%92\%92% 92 % for the two-qubit system and up to 98%98\%98% 98 % for the three-qubit system. We also describe why and in what regime the support vector machine algorithm is able to implement the evaluation of an entanglement witness operator applied to many copies of the state, and we describe how we can translate this procedure into a quantum circuit.