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:1705.01523 · Physical Review A

Separability-entanglement classifier via machine learning

Sirui Lu, Shilin Huang, Keren Li, Jun Li, Jianxin Chen, Dawei Lu, Zhengfeng Ji, Yi Shen, Duan-Lu Zhou, Bei Zeng

Published Jul 13, 2018• 117 citations
arXivHTMLPDF

Abstract

The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing. Despite the many methods---such as the positive partial transpose criterion and the $k$-symmetric extendibility criterion---to tackle this problem, none of them enables a general, practical solution due to the problem's NP-hard complexity. Explicitly, separable states form a high-dimensional convex set of vastly complicated structures. In this work, we build a different separability-entanglement classifier underpinned by machine learning techniques. We use standard tools from machine learning to learn the entanglement feature of arbitrary given quantum states. We perform substantial numerical tests on two-qubit and two-qutrit systems, and the results indicate that our method can outperform the existing methods in generic cases in terms of both speed and accuracy. This opens up avenues to explore quantum entanglement via the machine learning approach.

DOI
10.1103/physreva.98.012315

Related papers

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

Improved algorithm for quantum separability and entanglement detection

Lawrence M. Ioannou, B. C. Travaglione, Donny Cheung +1 more

Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard, suggesting that an efficient, general solution does not exist. There is a highly inefficient ``basic algorithm'' for solving the quantum separability problem which follows from the definition of a separable state. By exploiting specific properties of the set of separable states, we introduce a classical algorithm that solves the problem significantly faster than the ``basic algorithm,'' allowing a feasible separability test where none previously existed, e.g., in $3\ifmmode\times\else\texttimes\fi{}3$-dimensional systems. Our algorithm also provides a unique tool in the experimental detection of entanglement.

arXiv:quant-ph/0403041•Physical Review A•Dec 15, 2004•32 citations

Towards efficient and generic entanglement detection by machine learning

Jue Xu, Qi Zhao

Detection of entanglement is an indispensable step to practical quantum computation and communication. Compared with the conventional entanglement witness method based on fidelity, we propose a flexible, machine learning assisted entanglement detection protocol that is robust to different types of noises and sample efficient. In this protocol, an entanglement classifier for a generic entangled state is obtained by training a classical machine learning model with a synthetic dataset. The dataset contains classical features of two types of states and their labels (either entangled or separable). The classical features of a state, which are expectation values of a set of k-local Pauli observables, are estimated sample-efficiently by the classical shadow method. In the numerical simulation, our classifier can detect the entanglement of 4-qubit GHZ states with coherent noise and W states mixed with large white noise, with high accuracy.

arXiv:2211.05592•Nov 10, 2022•0 citations

Free versus bound entanglement, a NP-hard problem tackled by machine learning

Beatrix C. Hiesmayr

Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in contrast to detecting bound entanglement, i.e. a curious form of entanglement that can also not be distilled into maximally (free) entangled states. Only a few bound entangled states have been found, typically by constructing dedicated entanglement witnesses, so naturally the question arises how large is the volume of those states. We define a large family of magically symmetric states of bipartite qutrits for which we find [Formula: see text] to be free entangled, [Formula: see text] to be certainly separable and as much as [Formula: see text] to be bound entangled, which shows that this kind of entanglement is not rare. Via various machine learning algorithms we can confirm that the remaining [Formula: see text] of states are more likely to belonging to the set of separable states than bound entangled states. Most important we find via dimension reduction algorithms that there is a strong two-dimensional (linear) sub-structure in the set of bound entangled states. This revealed structure opens a novel path to find and characterize bound entanglement towards solving the long-standing problem of what the existence of bound entanglement is implying.

arXiv:2106.03977•Scientific Reports•Oct 5, 2021•35 citations

Detecting quantum entanglement with unsupervised learning

Yiwei Chen, Yu Pan, Guofeng Zhang +1 more

Abstract Quantum properties, such as entanglement and coherence, are indispensable resources in various quantum information processing tasks. However, there still lacks an efficient and scalable way to detecting these useful features especially for high-dimensional and multipartite quantum systems. In this work, we exploit the convexity of samples without the desired quantum features and design an unsupervised machine learning method to detect the presence of such features as anomalies. Particularly, in the context of entanglement detection, we propose a complex-valued neural network composed of pseudo-siamese network and generative adversarial net, and then train it with only separable states to construct non-linear witnesses for entanglement. It is shown via numerical examples, ranging from two-qubit to ten-qubit systems, that our network is able to achieve high detection accuracy which is above 97.5% on average. Moreover, it is capable of revealing rich structures of entanglement, such as partial entanglement among subsystems. Our results are readily applicable to the detection of other quantum resources such as Bell nonlocality and steerability, and thus our work could provide a powerful tool to extract quantum features hidden in multipartite quantum data.

arXiv:2103.04804•Quantum Science and Technology•Oct 19, 2021•61 citations

Entanglement verification with deep semisupervised machine learning

Lifeng Zhang, Zhihua Chen, Shao-Ming Fei

Quantum entanglement lies at the heart of quantum information-processing tasks. Although many criteria have been proposed, efficient and scalable methods to detect the entanglement of generally given quantum states are still not available yet, particularly for high-dimensional and multipartite quantum systems. Based on FixMatch and Pseudo-Label methods, we propose a deep semisupervised learning model with a small portion of labeled data and a large portion of unlabeled data. The data-augmentation strategies are applied in this model by using the convexity of separable states and performing local unitary operations on the training data. We verify that our model has good generalization ability and gives rise to better accuracies than traditional supervised learning models with detailed examples.

arXiv:2308.15391•Physical Review A•Aug 28, 2023•17 citations
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing. Despite the many methods---such as the positive partial transpose criterion and the kkk-symmetric extendibility criterion---to tackle this problem, none of them enables a general, practical solution due to the problem's NP-hard complexity. Explicitly, separable states form a high-dimensional convex set of vastly complicated structures. In this work, we build a different separability-entanglement classifier underpinned by machine learning techniques. We use standard tools from machine learning to learn the entanglement feature of arbitrary given quantum states. We perform substantial numerical tests on two-qubit and two-qutrit systems, and the results indicate that our method can outperform the existing methods in generic cases in terms of both speed and accuracy. This opens up avenues to explore quantum entanglement via the machine learning approach.
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.
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard, suggesting that an efficient, general solution does not exist. There is a highly inefficient ``basic algorithm'' for solving the quantum separability problem which follows from the definition of a separable state. By exploiting specific properties of the set of separable states, we introduce a classical algorithm that solves the problem significantly faster than the ``basic algorithm,'' allowing a feasible separability test where none previously existed, e.g., in $3\ifmmode\times\else\texttimes\fi{}3$-dimensional systems. Our algorithm also provides a unique tool in the experimental detection of entanglement.
Detection of entanglement is an indispensable step to practical quantum computation and communication. Compared with the conventional entanglement witness method based on fidelity, we propose a flexible, machine learning assisted entanglement detection protocol that is robust to different types of noises and sample efficient. In this protocol, an entanglement classifier for a generic entangled state is obtained by training a classical machine learning model with a synthetic dataset. The dataset contains classical features of two types of states and their labels (either entangled or separable). The classical features of a state, which are expectation values of a set of k-local Pauli observables, are estimated sample-efficiently by the classical shadow method. In the numerical simulation, our classifier can detect the entanglement of 4-qubit GHZ states with coherent noise and W states mixed with large white noise, with high accuracy.
Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki criterion), in contrast to detecting bound entanglement, i.e. a curious form of entanglement that can also not be distilled into maximally (free) entangled states. Only a few bound entangled states have been found, typically by constructing dedicated entanglement witnesses, so naturally the question arises how large is the volume of those states. We define a large family of magically symmetric states of bipartite qutrits for which we find [Formula: see text] to be free entangled, [Formula: see text] to be certainly separable and as much as [Formula: see text] to be bound entangled, which shows that this kind of entanglement is not rare. Via various machine learning algorithms we can confirm that the remaining [Formula: see text] of states are more likely to belonging to the set of separable states than bound entangled states. Most important we find via dimension reduction algorithms that there is a strong two-dimensional (linear) sub-structure in the set of bound entangled states. This revealed structure opens a novel path to find and characterize bound entanglement towards solving the long-standing problem of what the existence of bound entanglement is implying.
Abstract Quantum properties, such as entanglement and coherence, are indispensable resources in various quantum information processing tasks. However, there still lacks an efficient and scalable way to detecting these useful features especially for high-dimensional and multipartite quantum systems. In this work, we exploit the convexity of samples without the desired quantum features and design an unsupervised machine learning method to detect the presence of such features as anomalies. Particularly, in the context of entanglement detection, we propose a complex-valued neural network composed of pseudo-siamese network and generative adversarial net, and then train it with only separable states to construct non-linear witnesses for entanglement. It is shown via numerical examples, ranging from two-qubit to ten-qubit systems, that our network is able to achieve high detection accuracy which is above 97.5% on average. Moreover, it is capable of revealing rich structures of entanglement, such as partial entanglement among subsystems. Our results are readily applicable to the detection of other quantum resources such as Bell nonlocality and steerability, and thus our work could provide a powerful tool to extract quantum features hidden in multipartite quantum data.
Quantum entanglement lies at the heart of quantum information-processing tasks. Although many criteria have been proposed, efficient and scalable methods to detect the entanglement of generally given quantum states are still not available yet, particularly for high-dimensional and multipartite quantum systems. Based on FixMatch and Pseudo-Label methods, we propose a deep semisupervised learning model with a small portion of labeled data and a large portion of unlabeled data. The data-augmentation strategies are applied in this model by using the convexity of separable states and performing local unitary operations on the training data. We verify that our model has good generalization ability and gives rise to better accuracies than traditional supervised learning models with detailed examples.