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

Physica A Statistical Mechanics and its Applications

Variational quantum entanglement classification discrimination

Shaoxuan Wang, Yingtong Shen, Xinjian Liu, Haoying Zhang, Yukun Wang

Published Jan 18, 2024• 2 citations
Publisher

Abstract

With the rapid development of quantum technology, understanding the properties of entanglement states has become an urgent task.Various classifications of entanglement states have been proposed to cater to distinct quantum applications, highlighting the significance of entanglement classification. This paper presents a variational quantum classifier for entanglement classification discrimination which can effectively reduce the measurement resources, specifically for four-qubit entanglement equivalence classifications under SLOCC (Stochastic Local Operations and Classical Communication). Through training one-to-one and one-to-many models, our proposed method achieves excellent performance in the entanglement classification. We further investigate the impact of parameterized quantum circuit layers and various measurement settings on the classifier’s performance. Considering the inherent noise present in near-term quantum computers, we also analyze how noise affects the model’s performance. Moreover, we explore the classifier’s capabilities in the context of multi-qubit entanglement systems. Numerical simulations demonstrate that high-precision entanglement classification tasks can be accomplished with shallow circuit depths, and the model exhibits resilience to noise. Additionally, the results reveal the versatility and potential application of our proposed model in larger-scale quantum systems by effectively handling entanglement classification tasks involving an increased number of qubits.

DOI
10.1016/j.physa.2024.129530

Related papers

Quantum-machine-learning channel discrimination

Andrey Kardashin, A. V. Vlasova, Anastasiia A. Pervishko +2 more

In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels, which is done by sending an input state through a channel and measuring the output state. This work studies applications of variational quantum circuits and machine-learning techniques for discriminating such channels. In particular, we explore (i) the practical implementation of embedding this task into the framework of variational quantum computing, (ii) training a quantum classifier based on variational quantum circuits, and (iii) applying the quantum kernel estimation technique. For testing these three channel discrimination approaches, we considered a pair of entanglement-breaking channels and the depolarizing channel with two different depolarization factors. For the approach (i), we address solving the quantum channel discrimination problem using widely discussed parallel and sequential strategies. We show the advantage of the latter in terms of better convergence with less quantum resources. Quantum channel discrimination with a variational quantum classifier (ii) allows one to operate even with random and mixed input states and simple variational circuits. The kernel-based classification approach (iii) is also found effective as it allows one to discriminate depolarizing channels associated not with just fixed values of the depolarization factor, but with ranges of it. Additionally, we discovered that a simple modification of one of the commonly used kernels significantly increases the efficiency of this approach. Finally, our numerical findings reveal that the performance of variational methods of channel discrimination depends on the trace of the product of the output states. These findings demonstrate that quantum machine learning can be used to discriminate channels, such as those representing physical noise processes.

arXiv:2206.09933•Physical Review A•Sep 7, 2022•16 citations

Polynomial invariants for discrimination and classification of four-qubit entanglement

Oliver Viehmann, Christopher Eltschka, Jens Siewert

The number of entanglement classes in stochastic local operations and classical communication (SLOCC) classifications increases with the number of qubits and is already infinite for four qubits. Criteria for explicitly discriminating and classifying pure states of four and more qubits are highly desirable and therefore at the focus of intense theoretical research. We develop a general criterion for the discrimination of pure $N\text{\ensuremath{-}}$partite entangled states in terms of polynomial $\mathrm{SL}(d,\mathrm{C}){}^{\ensuremath{\bigotimes}N}$ invariants. By means of this criterion, existing SLOCC classifications of four-qubit entanglement are reproduced. Based on this we propose a polynomial classification scheme in which entanglement types are identified through ``tangle patterns.'' This scheme provides a practicable way to classify states of arbitrary multipartite systems. Moreover, the use of polynomials induces a corresponding quantification of the different types of entanglement.

arXiv:1101.5558•Physical Review A•May 31, 2011•66 citations

Neural network-based multipartite entanglement classification with prior guidance from quantum uncertainty relations

Qiyi Li, Xiao Zheng, Guofeng Zhang

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.

quant-pharXiv:2609.22768•Frontiers of Physics•Sep 22, 2026•0 citations

An Optimal Evaluation of Entanglement Depth in Variational Quantum Classifiers for Efficient Deployment of Machine Learning Applications

Aryan Sahni, Krishnesh Mathur, Yashvi Diya Singh +1 more

Variational Quantum Classifiers (VQCs) are a common class of hybrid quantum-classical models developed for nearterm quantum machine learning applications. Despite growing focus, it is still unclear how circuit design choices, particularly entanglement depth, affect learning performance and optimisation stability when compared to reliable classical baselines [1]. In this research, we provide a controlled empirical analysis of entanglement depth in VQCs for medical image classification utilizing pre-extracted deep feature representations. Under a predetermined experimental design, we assessed VQCs with no entanglement, single-layer entanglement, and two-layer interleaved entanglement with different training set sizes. Our findings demonstrate that in low-data regimes, increasing entanglement could negatively impact accuracy due to optimization instability [2] and may not always enhance performance. Since classical machine learning baselines consistently match or surpass quantum models, there is no performance advantage of variational quantum classifiers was observed under the evaluated experimental conditions and preprocessing constraints. These results emphasize the significance of thorough, comparative benchmarking for real-world use and draw attention to the expressivity optimization trade-offs inherent in variational quantum learning.

International Conference on Electronic Systems and Intelligent Computing (ICESIC)•Mar 13, 2026•0 citations

Automatic Optimization of Variational Quantum Algorithm-Based Classifiers

Ruihong Jia, Guang Yang, Min Nie +2 more

With the advent of the era of big data, how to efficiently process data has become an urgent problem. Although classical machine learning algorithms are very mature in processing data, they require a large amount of data to complete the training process. Quantum machine learning uses the superposition, entanglement, parallelism and other characteristics of quantum computing to improve the performance of classical machine learning algorithms. At the same time, circuit optimization of the quantum classifier can reduce the computational complexity. This paper proposes an automatic optimization model of the classifier based on the variational quantum algorithm, which reduces the complexity of the parameter update process through the deep optimization of the core circuit. This model greatly speeds up the training process and has lower complexity than other quantum classifiers. In addition, a unique regularization method is used to avoid overfitting. The simulation results show that the classification of some typical data sets can achieve better classification results, and the training parameters and training speed are significantly better than other quantum classifiers. Finally, the robustness of the classifier is further verified in the presence of noise.

•Sep 23, 2022•2 citations

Entanglement classification from a topological perspective

Dmitry Melnikov

Classification of entanglement is an important problem in quantum resource theory. In this paper we discuss an embedding of this problem in the context of topological quantum field theories (TQFTs). This approach allows classifying entanglement patterns in terms of topological equivalence classes. In the bipartite case a classification equivalent to the one by stochastic local operations and classical communication (SLOCC) is constructed by restricting to a simple class of connectivity diagrams. Such diagrams characterize quantum states of TQFT up to braiding and tangling of the ``connectome.'' In the multipartite case the same restricted topological classification only captures a part of the SLOCC classes, in particular, it does not see the $W$ entanglement of three qubits. Nonlocal braiding of connections may solve the problem, but no finite classification is attempted in this case. Despite incompleteness, the connectome classification has a straightforward generalization to any number and dimension of parties and has a very intuitive interpretation, which might be useful for understanding specific properties of entanglement and for design of new quantum resources.

arXiv:2208.13901•Physical review. D/Physical review. D.•Jun 12, 2023•12 citations
With the rapid development of quantum technology, understanding the properties of entanglement states has become an urgent task.Various classifications of entanglement states have been proposed to cater to distinct quantum applications, highlighting the significance of entanglement classification. This paper presents a variational quantum classifier for entanglement classification discrimination which can effectively reduce the measurement resources, specifically for four-qubit entanglement equivalence classifications under SLOCC (Stochastic Local Operations and Classical Communication). Through training one-to-one and one-to-many models, our proposed method achieves excellent performance in the entanglement classification. We further investigate the impact of parameterized quantum circuit layers and various measurement settings on the classifier’s performance. Considering the inherent noise present in near-term quantum computers, we also analyze how noise affects the model’s performance. Moreover, we explore the classifier’s capabilities in the context of multi-qubit entanglement systems. Numerical simulations demonstrate that high-precision entanglement classification tasks can be accomplished with shallow circuit depths, and the model exhibits resilience to noise. Additionally, the results reveal the versatility and potential application of our proposed model in larger-scale quantum systems by effectively handling entanglement classification tasks involving an increased number of qubits.
In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels, which is done by sending an input state through a channel and measuring the output state. This work studies applications of variational quantum circuits and machine-learning techniques for discriminating such channels. In particular, we explore (i) the practical implementation of embedding this task into the framework of variational quantum computing, (ii) training a quantum classifier based on variational quantum circuits, and (iii) applying the quantum kernel estimation technique. For testing these three channel discrimination approaches, we considered a pair of entanglement-breaking channels and the depolarizing channel with two different depolarization factors. For the approach (i), we address solving the quantum channel discrimination problem using widely discussed parallel and sequential strategies. We show the advantage of the latter in terms of better convergence with less quantum resources. Quantum channel discrimination with a variational quantum classifier (ii) allows one to operate even with random and mixed input states and simple variational circuits. The kernel-based classification approach (iii) is also found effective as it allows one to discriminate depolarizing channels associated not with just fixed values of the depolarization factor, but with ranges of it. Additionally, we discovered that a simple modification of one of the commonly used kernels significantly increases the efficiency of this approach. Finally, our numerical findings reveal that the performance of variational methods of channel discrimination depends on the trace of the product of the output states. These findings demonstrate that quantum machine learning can be used to discriminate channels, such as those representing physical noise processes.
The number of entanglement classes in stochastic local operations and classical communication (SLOCC) classifications increases with the number of qubits and is already infinite for four qubits. Criteria for explicitly discriminating and classifying pure states of four and more qubits are highly desirable and therefore at the focus of intense theoretical research. We develop a general criterion for the discrimination of pure $N\text{\ensuremath{-}}$partite entangled states in terms of polynomial $\mathrm{SL}(d,\mathrm{C}){}^{\ensuremath{\bigotimes}N}$ invariants. By means of this criterion, existing SLOCC classifications of four-qubit entanglement are reproduced. Based on this we propose a polynomial classification scheme in which entanglement types are identified through ``tangle patterns.'' This scheme provides a practicable way to classify states of arbitrary multipartite systems. Moreover, the use of polynomials induces a corresponding quantification of the different types of entanglement.
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.
Variational Quantum Classifiers (VQCs) are a common class of hybrid quantum-classical models developed for nearterm quantum machine learning applications. Despite growing focus, it is still unclear how circuit design choices, particularly entanglement depth, affect learning performance and optimisation stability when compared to reliable classical baselines [1]. In this research, we provide a controlled empirical analysis of entanglement depth in VQCs for medical image classification utilizing pre-extracted deep feature representations. Under a predetermined experimental design, we assessed VQCs with no entanglement, single-layer entanglement, and two-layer interleaved entanglement with different training set sizes. Our findings demonstrate that in low-data regimes, increasing entanglement could negatively impact accuracy due to optimization instability [2] and may not always enhance performance. Since classical machine learning baselines consistently match or surpass quantum models, there is no performance advantage of variational quantum classifiers was observed under the evaluated experimental conditions and preprocessing constraints. These results emphasize the significance of thorough, comparative benchmarking for real-world use and draw attention to the expressivity optimization trade-offs inherent in variational quantum learning.
With the advent of the era of big data, how to efficiently process data has become an urgent problem. Although classical machine learning algorithms are very mature in processing data, they require a large amount of data to complete the training process. Quantum machine learning uses the superposition, entanglement, parallelism and other characteristics of quantum computing to improve the performance of classical machine learning algorithms. At the same time, circuit optimization of the quantum classifier can reduce the computational complexity. This paper proposes an automatic optimization model of the classifier based on the variational quantum algorithm, which reduces the complexity of the parameter update process through the deep optimization of the core circuit. This model greatly speeds up the training process and has lower complexity than other quantum classifiers. In addition, a unique regularization method is used to avoid overfitting. The simulation results show that the classification of some typical data sets can achieve better classification results, and the training parameters and training speed are significantly better than other quantum classifiers. Finally, the robustness of the classifier is further verified in the presence of noise.
Classification of entanglement is an important problem in quantum resource theory. In this paper we discuss an embedding of this problem in the context of topological quantum field theories (TQFTs). This approach allows classifying entanglement patterns in terms of topological equivalence classes. In the bipartite case a classification equivalent to the one by stochastic local operations and classical communication (SLOCC) is constructed by restricting to a simple class of connectivity diagrams. Such diagrams characterize quantum states of TQFT up to braiding and tangling of the ``connectome.'' In the multipartite case the same restricted topological classification only captures a part of the SLOCC classes, in particular, it does not see the WWW entanglement of three qubits. Nonlocal braiding of connections may solve the problem, but no finite classification is attempted in this case. Despite incompleteness, the connectome classification has a straightforward generalization to any number and dimension of parties and has a very intuitive interpretation, which might be useful for understanding specific properties of entanglement and for design of new quantum resources.