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:2301.06759 · The European Physical Journal Plus

Entanglement classification via witness operators generated by support vector machine

Claudio Sanavio, Edoardo Tignone, Elisa Ercolessi

Published Oct 21, 2023• 15 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1140/epjp/s13360-023-04546-5

Related papers

Optimal entanglement witness of multipartite systems using support vector machine approach

Mohmoud Mahdian, Zahra Beygom Mousavi

Abstract An entanglement witness (EW) is a Hermitian operator that can distinguish an entangled state from all separable states. We developed and implemented a numerical method based on machine learning to create multipartite EW. Using a Support Vector Machine (SVM) algorithm, we construct EW's based on local orthogonal observables in the form of a hyperplane that separates the separable region from the entangled state for two, three, and four qubits Bell-diagonal mixed states which can be generalized to a multipartite mixed state. One of the important features of this method is that the EW s are optimal and are completely tangent to the separable region. Also, we generate non-decomposable EW's that can detect positive partial transpose entangled states (PPTES).

arXiv:2504.18163•Jul 30, 2024•4 citations

Classification of four-qubit entangled states via machine learning

Stephen Vintskevich, Ning Bao, ANDREI NOMEROTSKI +2 more

We apply the support vector machine (SVM) algorithm to derive a set of entanglement witnesses (EW) to identify entanglement patterns in families of four-qubit states. The effectiveness of SVM for practical EW implementations stems from the coarse-grained description of families of equivalent entangled quantum states. The equivalence criteria in our work is based on the stochastic local operations and classical communication classification and the description of the four-qubit entangled Werner states. We numerically verify that the SVM approach provides an effective tool to address the entanglement witness problem when the coarse-grained description of a given family state is available. We also discuss and demonstrate the efficiency of nonlinear kernel SVM methods as applied to four-qubit entangled state classification.

arXiv:2205.11512•Physical Review A•Mar 23, 2023•23 citations

Entanglement detection with quantum-inspired kernels and SVMs

Ana Martínez-Sabiote, Michalis Skotiniotis, Jara J. Bermejo-Vega +2 more

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.

arXiv:2508.17909•The Journal of Supercomputing•Jan 27, 2026•5 citations

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

Optimal Classification of Three-Qubit Entanglement with Cascaded Support Vector Machine

Fatemeh Sadat Lajevardi, Azam Mani, Ali Fahim

We introduce a systematic framework for three-qubit entanglement classification using a cascaded architecture of Support Vector Machine (SVM) classifiers. Leveraging the well defined three-qubit structure with the four nested entanglement classes (S, B, W, and GHZ), we construct three distinct witness models ($\mathcal{M}_{B}$, $\mathcal{M}_{W}$, and $\mathcal{M}_{GHZ}$) that sequentially discriminate between these classes. The proposed Cascaded model achieves an overall classification accuracy of $95\%$ on a comprehensive dataset of mixed states. The framework's robustness and generalization capabilities are confirmed through rigorous testing against out-of-distribution (OOD) entangled states and various quantum noise channels, where the model maintains high performance. A key contribution of this research is an optimization protocol based on systematic feature importance analysis. This approach yields a tunable framework that significantly reduces the number of required features, while maintaining reliable model accuracy.

quant-pharXiv:2602.15545•Feb 18, 2026•1 citation

Detecting genuine multipartite entanglement via machine learning

Yi-Jun Luo, Jin‐Ming Liu, Chengjie Zhang

In recent years, supervised and semisupervised machine learning methods such as neural networks, support vector machines (SVMs), and semisupervised support vector machines (S4VMs) have been widely used in quantum entanglement and quantum steering verification problems. However, few studies have focused on detecting genuine multipartite entanglement based on machine learning. Here, we investigate supervised and semisupervised machine learning for detecting genuine multipartite entanglement of three-qubit states. We randomly generate three-qubit density matrices and train an SVM for the detection of genuine multipartite entangled states. Moreover, we improve the S4VM training method, which optimizes the grouping of prediction samples and then performs iterative predictions. Through numerical simulation, it is confirmed that this method can significantly improve the prediction accuracy.

arXiv:2311.17548•Physical Review A•Nov 21, 2023•23 citations
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.
Abstract An entanglement witness (EW) is a Hermitian operator that can distinguish an entangled state from all separable states. We developed and implemented a numerical method based on machine learning to create multipartite EW. Using a Support Vector Machine (SVM) algorithm, we construct EW's based on local orthogonal observables in the form of a hyperplane that separates the separable region from the entangled state for two, three, and four qubits Bell-diagonal mixed states which can be generalized to a multipartite mixed state. One of the important features of this method is that the EW s are optimal and are completely tangent to the separable region. Also, we generate non-decomposable EW's that can detect positive partial transpose entangled states (PPTES).
We apply the support vector machine (SVM) algorithm to derive a set of entanglement witnesses (EW) to identify entanglement patterns in families of four-qubit states. The effectiveness of SVM for practical EW implementations stems from the coarse-grained description of families of equivalent entangled quantum states. The equivalence criteria in our work is based on the stochastic local operations and classical communication classification and the description of the four-qubit entangled Werner states. We numerically verify that the SVM approach provides an effective tool to address the entanglement witness problem when the coarse-grained description of a given family state is available. We also discuss and demonstrate the efficiency of nonlinear kernel SVM methods as applied to four-qubit entangled state classification.
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.
We introduce a systematic framework for three-qubit entanglement classification using a cascaded architecture of Support Vector Machine (SVM) classifiers. Leveraging the well defined three-qubit structure with the four nested entanglement classes (S, B, W, and GHZ), we construct three distinct witness models (MB\mathcal{M}_{B}MB​, MW\mathcal{M}_{W}MW​, and MGHZ\mathcal{M}_{GHZ}MGHZ​) that sequentially discriminate between these classes. The proposed Cascaded model achieves an overall classification accuracy of 95%95\%95% on a comprehensive dataset of mixed states. The framework's robustness and generalization capabilities are confirmed through rigorous testing against out-of-distribution (OOD) entangled states and various quantum noise channels, where the model maintains high performance. A key contribution of this research is an optimization protocol based on systematic feature importance analysis. This approach yields a tunable framework that significantly reduces the number of required features, while maintaining reliable model accuracy.
In recent years, supervised and semisupervised machine learning methods such as neural networks, support vector machines (SVMs), and semisupervised support vector machines (S4VMs) have been widely used in quantum entanglement and quantum steering verification problems. However, few studies have focused on detecting genuine multipartite entanglement based on machine learning. Here, we investigate supervised and semisupervised machine learning for detecting genuine multipartite entanglement of three-qubit states. We randomly generate three-qubit density matrices and train an SVM for the detection of genuine multipartite entangled states. Moreover, we improve the S4VM training method, which optimizes the grouping of prediction samples and then performs iterative predictions. Through numerical simulation, it is confirmed that this method can significantly improve the prediction accuracy.