We design and successfully implement artificial neural networks (ANNs) to detect and classify entanglement for three-qubit systems using limited state features. The overall design principle is a feed forward neural network (FFNN), with the output layer consisting of a single neuron for the detection of genuine multipartite entanglement (GME) and six neurons for the classification problem corresponding to six entanglement classes under stochastic local operations and classical communication (SLOCC). The models are trained and validated on a simulated dataset of randomly generated states. We achieve high accuracy, around 98%, for detecting GME as well as for SLOCC classification. Remarkably, we find that feeding only 7 diagonal elements of the density matrix into the ANN results in an accuracy greater than 94% for both the tasks, showcasing the strength of the method in reducing the required input data while maintaining efficient performance. Reducing the feature set makes it easier to apply ANN models for entanglement classification, particularly in resource-constrained environments, without sacrificing accuracy. The performance of the ANN models was further evaluated by introducing white noise into the data set, and the results indicate that the models are robust and are able to well tolerate noise.
We design and successfully implement artificial neural networks (ANNs) to detect and classify entanglement for three-qubit systems using limited state features. The overall design principle is a feed forward neural network (FFNN), with the output layer consisting of a single neuron for the detection of genuine multipartite entanglement (GME) and six neurons for the classification problem corresponding to six entanglement classes under stochastic local operations and classical communication (SLOCC). The models are trained and validated on a simulated dataset of randomly generated states. We achieve high accuracy, around 98%, for detecting GME as well as for SLOCC classification. Remarkably, we find that feeding only 7 diagonal elements of the density matrix into the ANN results in an accuracy greater than 94% for both the tasks, showcasing the strength of the method in reducing the required input data while maintaining efficient performance. Reducing the feature set makes it easier to apply ANN models for entanglement classification, particularly in resource-constrained environments, without sacrificing accuracy. The performance of the ANN models was further evaluated by introducing white noise into the data set, and the results indicate that the models are robust and are able to well tolerate noise.
Quantum entanglement is a crucial resource in quantum information processing, yet its efficient, scalable and robust classification in multipartite systems remains theoretically challenging. Although supervised machinelearning has been applied to this task, most existing methods still suffer from high measurement costs, computational consumption, and weak noise robustness. In this work, by incorporating multipartite uncertainty relations as prior guidance, we propose a neural network approach to classify distinct Stochastic Local Operations and Classical Communication (SLOCC) multipartite entanglement classes based on states sampled from their local unitary (LU) orbits. Compared with traditional techniques, our method reduces experimental measurement-resource requirements and computational overhead, showing high adaptability to large-scale systems. The classification accuracy of our method reaches 99.5% in 20-qubit systems. The numerical validation is performed on states generated by random LU transformations, which preserve the SLOCC class. Within this setting, the proposed method offers strong effectiveness, scalability, and robustness for multipartite entanglement classification.
In recent years, the detection of genuine multipartite entanglement (GME) via machine learning has received scant attention. Here, we employ convolutional neural networks (CNNs), as well as CNNs enhanced with squeeze and excitation (SE) to detect GME. We randomly generated GME states with 4 to 6 qubits and GHZ-diagonal states ranging from 4 to 20 qubits using the semidefinite programming approach. Subsequently, we assessed their classification accuracy. Our results demonstrate that the integration of the SE module significantly improved training performance. Additionally, we conducted an analysis of false positive and false negative occurrences. Utilizing our training data, we have substantially reduced the likelihood of incorrectly classifying nonentangled states as entangled.
ABSTRACT Quantum entanglement is a fundamental resource in quantum information science. In recent years, many researchers have explored the use of machine learning techniques to detect entanglement. However, most existing models still suffer from limited classification and generalization capability. To address these issues, we construct a randomly generated dataset of three‐qubit quantum states covering fully separable, bi‐separable, and genuine entangled states, and train a complex‐valued convolutional neural network to classify these three classes. Numerical results demonstrate that the proposed model accurately identifies all separability classes and exhibits strong generalization performance not only on the constructed dataset but also on various noisy quantum states, including noisy GHZ, W, GHZ‐W mixed, and hypergraph states, achieving an overall accuracy of 98.6%. In addition, we test the ability of the proposed model to identify certain positive‐partial‐transpose entangled states (PPTES), as well as quantum states that undergo local unitary (LU) operations. All of these results indicate that the proposed model can accurately identify the separability of most three‐qubit quantum states and can also serve as a reliable tool, providing highly probable and accurate predictions when theoretical methods fail.
Abstract Suppose we have an unknown multipartite quantum state, how can we experimentally find out whether it is genuine multipartite entangled or not? Recall that even for a bipartite quantum state whose density matrix is known, it is already NP-Hard to determine whether it is entangled or not. Therefore, it is hard to efficiently solve the above problem generally. However, since genuine multipartite entanglement (GME) is such a fundamental concept that plays a crucial role in many-body physics and quantum information processing tasks, finding realistic approaches to certify GME is undoubtedly necessary. In this work, we show that neural networks can provide a nice solution to this problem, where measurement statistics data produced by measuring involved quantum states with local measurement devices serve as input features of neural networks. By testing our models on many specific multipartite quantum states, we show that they can certify GME very accurately, even including some new results unknown before. We also exhibit a possible way to improve the efficiency of our models by reducing the size of features. Lastly, we show that our models enjoy remarkable robustness against flaws in measurement devices, implying that they are very experiment-friendly.
Quantum state classification and entanglement quantification are of significant importance in the fundamental research of quantum information science and various quantum applications. Traditional methods, such as quantum state tomography, face exponential measurement demands with increasing numbers of qubits, necessitating more efficient approaches. Recent work has shown promise in using artificial neural networks (ANNs) for quantum state analysis. However, existing ANNs may falter when confronted with states affected by dephasing noise, especially with limited data and computational resources. In this study, we employ a machine-learning approach to investigate the disentanglement process in two-qubit systems in the presence of dephasing noise. Our findings highlight the limitations of general state-trained ANNs in classifying states under dephasing noise. Specialized ANN algorithms, tailored for classifying states and quantifying entanglement in such noisy environments, demonstrate excellent performance using only a subset of tomographic features.
Artificial neural networks (ANN) proved to be efficient in solving many problems for big data analytics using machine learning. The complex and non-linear features of the input data can be learned and generalized by ANN. In the big data era, enormous amounts of data arrive from multiple sources. A stage is expected to be reached where even supercomputers are likely inundated with the big data. Training an ANN in such a situation is a challenging task due to the size and dimension of the big data. Also, a large number of parameters are to be used and optimized in the network to learn the patterns and analyze such data. Quantum computing is emerging as a field that provides a solution to this problem as a quantum computer can represent data differently using qubits. Qubits on quantum computers can be used to detect the hidden patterns in data that are difficult for a classical computer to find. Hence, there exists a huge scope for application in the area of artificial neural networks. In this work, we primarily focused on training an artificial neural network using qubits as artificial neurons. The simulation results show that our quantum computing approach for ANN (QC ANN) is efficient when compared to classical ANN. The model with qubits as artificial neurons can learn the features of data using fewer parameters for a binary classification task. We demonstrate our experiment using a quantum simulator and optimization of the quantum parameters used in QC ANN is carried out on a classical computer.