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:2406.19738

Batch Entanglement Detection in Parameterized Qubit States using Classical Bandit Algorithms

Bharati, K., Vikesh Siddhu, Krishna Jagannathan

Published Jun 28, 2024• 2 citations
arXivHTMLPDF

Abstract

Entanglement is a key property of quantum states that acts as a resource for a wide range of tasks in quantum computing. Entanglement detection is a key conceptual and practical challenge. Without adaptive or joint measurements, entanglement detection is constrained by no-go theorems (Lu et al. [Phys. Rev. Lett., 116, 230501 (2016)]), necessitating full state tomography. Batch entanglement detection refers to the problem of identifying all entangled states from amongst a set of $K$ unknown states, which finds applications in quantum information processing. We devise a method for performing batch entanglement detection by measuring a single-parameter family of entanglement witnesses, as proposed by Zhu, Teo, and Englert [Phys. Rev. A, 81, 052339, 2010], followed by a thresholding bandit algorithm on the measurement data. The proposed method can perform batch entanglement detection conclusively when the unknown states are drawn from a practically well-motivated class of two-qubit states $\mathcal{F}$, which includes Depolarised Bell states, Bell diagonal states, etc. Our key novelty lies in drawing a connection between batch entanglement detection and a Thresholding Bandit problem in classical Multi-Armed Bandits (MAB). The connection to the MAB problem also enables us to derive theoretical guarantees on the measurement/sample complexity of the proposed technique. We demonstrate the performance of the proposed method through numerical simulations and an experimental implementation. More broadly, this paper highlights the potential for employing classical machine learning techniques for quantum entanglement detection.

DOI
10.48550/arxiv.2406.19738

Related papers

Identifying Highly Distillable Entanglement in Pure States Using Multi-Armed Bandits

R Jayaharish, K. Bharati, Krishna Jagannathan

The quantum internet uses high-quality entanglement distribution to enable long-distance communication. The quality of entanglement is measured by distillable entanglement, which quantifies how many maximally entangled states can be refined from a given ensemble of noisy states. Therefore, identifying highly distillable states is essential for ensuring efficient entanglement distribution. Given$K$ensembles of noisy entangled states, we address the problem of identifying highly distillable states, i.e., states with distillable entanglement exceeding a prespecified threshold. We propose entanglement distillation-based estimation protocols on two copies of bipartite$2 \times 2$and$2 \times 3$pure states. We characterize their distillable entanglement by estimating statedependent parameters from measurement statistics. We identify a structural connection to the Thresholding Bandit problem (TBP) in classical Multi-Armed Bandits (MAB) literature and use these policies to obtain guarantees on the sample complexity for estimating the state-dependent parameters. We also provide numerical results showcasing the performance of the proposed distillation protocol and TBP policies.

IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•0 citations

High-Accuracy Entanglement Detection via a Convolutional Neural Network with Noise Resistance

Qian Sun, Yanyan Song, Zhichuan Liao +1 more

Quantum entanglement detection is one of the fundamental tasks in quantum information science. Conventional methods for quantum state tomography exhibit limitations in scalability as the number of qubits increases, leading to exponential growth in the number of unknown parameters and required measurements. Consequently, the accuracy enhancement achieved by these methods is constrained. In response to this challenge, we developed a tailored convolutional neural network (CNN) model capable of effectively detecting entanglement in two-qubit quantum states, achieving an accuracy exceeding 97.5%. Notably, even in the presence of noise, this model retains its robust performance, displaying resilience against a tolerable level of noise contamination. Furthermore, the inherent generalization power of CNNs allows our model, which was initially trained on a specific spectrum of quantum states, to extend its applicability to wider states, positioning it as an outstanding tool for the further application of machine learning in the field of quantum computing, opening up new pathways for solving entanglement detection problems in quantum information.

Applied Sciences•Oct 16, 2024•3 citations

Quantifying quantum entanglement via a hybrid quantum-classical machine learning framework

Xiaodie Lin, Zhenyu Chen, Zhaohui Wei

Quantifying entanglement for quantum states whose density matrices are unknown is a difficult task, but also becomes more and more necessary because of the fast development of quantum engineering. Machine learning provides practical solutions to this fundamental problem, where one has to train a proper machine learning model to predict entanglement measures of unknown quantum states based on experimentally measurable data, say, moments of density matrices or correlation data produced by local measurements. In this paper, we compare the performance of these two different machine learning approaches systematically. Particularly, we first show that the approach based on moments enjoys a remarkable advantage over that based on correlation data, though the cost of measuring moments is much higher. Next, since correlation data is much easier to obtain experimentally, we try to better its performance by proposing a hybrid quantum-classical machine learning framework for this problem, where the key is to train optimal local measurements, or even optimal tensor products of single-qubit observables, to generate more informative correlation data. Our numerical simulations show that the new hybrid framework brings us comparable performance with the approach based on moments to quantify entanglement, and furthermore, it turns out that the new hybrid framework has a nice noise-resistant capability when handling realistic correlation data.

arXiv:2204.11500•Physical Review A•Jun 9, 2023•26 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•2 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•65 citations

Detecting Entanglement in Unfaithful States

Yongtao Zhan, Hoi‐Kwong Lo

Entanglement witness is an effective method to detect entanglement in unknown states without doing full tomography. One of the most widespread schemes of witnessing entanglement is measuring its fidelity with respect to a pure entangled state. Recently, a large class of states whose entanglement can not be detected with the fidelity witness has been discovered in Phys.Rev.Lett \textbf{124},200502(2020). They are called unfaithful states. In this paper we propose a new way to detect entanglement by calculating the lower bound of entanglement using measurement results. Numerical simulation shows our method can detect entanglement in unfaithful states with a small number of measurements. Moreover, we generalize our scheme to multipartite states and show that it can tolerate higher noise than previous entanglement witness operators with same number of measurement settings.

arXiv:2010.06054•Oct 12, 2020•6 citations
Entanglement is a key property of quantum states that acts as a resource for a wide range of tasks in quantum computing. Entanglement detection is a key conceptual and practical challenge. Without adaptive or joint measurements, entanglement detection is constrained by no-go theorems (Lu et al. [Phys. Rev. Lett., 116, 230501 (2016)]), necessitating full state tomography. Batch entanglement detection refers to the problem of identifying all entangled states from amongst a set of KKK unknown states, which finds applications in quantum information processing. We devise a method for performing batch entanglement detection by measuring a single-parameter family of entanglement witnesses, as proposed by Zhu, Teo, and Englert [Phys. Rev. A, 81, 052339, 2010], followed by a thresholding bandit algorithm on the measurement data. The proposed method can perform batch entanglement detection conclusively when the unknown states are drawn from a practically well-motivated class of two-qubit states F\mathcal{F}F, which includes Depolarised Bell states, Bell diagonal states, etc. Our key novelty lies in drawing a connection between batch entanglement detection and a Thresholding Bandit problem in classical Multi-Armed Bandits (MAB). The connection to the MAB problem also enables us to derive theoretical guarantees on the measurement/sample complexity of the proposed technique. We demonstrate the performance of the proposed method through numerical simulations and an experimental implementation. More broadly, this paper highlights the potential for employing classical machine learning techniques for quantum entanglement detection.
The quantum internet uses high-quality entanglement distribution to enable long-distance communication. The quality of entanglement is measured by distillable entanglement, which quantifies how many maximally entangled states can be refined from a given ensemble of noisy states. Therefore, identifying highly distillable states is essential for ensuring efficient entanglement distribution. GivenKKKensembles of noisy entangled states, we address the problem of identifying highly distillable states, i.e., states with distillable entanglement exceeding a prespecified threshold. We propose entanglement distillation-based estimation protocols on two copies of bipartite2×22 \times 22×2and2×32 \times 32×3pure states. We characterize their distillable entanglement by estimating statedependent parameters from measurement statistics. We identify a structural connection to the Thresholding Bandit problem (TBP) in classical Multi-Armed Bandits (MAB) literature and use these policies to obtain guarantees on the sample complexity for estimating the state-dependent parameters. We also provide numerical results showcasing the performance of the proposed distillation protocol and TBP policies.
Quantum entanglement detection is one of the fundamental tasks in quantum information science. Conventional methods for quantum state tomography exhibit limitations in scalability as the number of qubits increases, leading to exponential growth in the number of unknown parameters and required measurements. Consequently, the accuracy enhancement achieved by these methods is constrained. In response to this challenge, we developed a tailored convolutional neural network (CNN) model capable of effectively detecting entanglement in two-qubit quantum states, achieving an accuracy exceeding 97.5%. Notably, even in the presence of noise, this model retains its robust performance, displaying resilience against a tolerable level of noise contamination. Furthermore, the inherent generalization power of CNNs allows our model, which was initially trained on a specific spectrum of quantum states, to extend its applicability to wider states, positioning it as an outstanding tool for the further application of machine learning in the field of quantum computing, opening up new pathways for solving entanglement detection problems in quantum information.
Quantifying entanglement for quantum states whose density matrices are unknown is a difficult task, but also becomes more and more necessary because of the fast development of quantum engineering. Machine learning provides practical solutions to this fundamental problem, where one has to train a proper machine learning model to predict entanglement measures of unknown quantum states based on experimentally measurable data, say, moments of density matrices or correlation data produced by local measurements. In this paper, we compare the performance of these two different machine learning approaches systematically. Particularly, we first show that the approach based on moments enjoys a remarkable advantage over that based on correlation data, though the cost of measuring moments is much higher. Next, since correlation data is much easier to obtain experimentally, we try to better its performance by proposing a hybrid quantum-classical machine learning framework for this problem, where the key is to train optimal local measurements, or even optimal tensor products of single-qubit observables, to generate more informative correlation data. Our numerical simulations show that the new hybrid framework brings us comparable performance with the approach based on moments to quantify entanglement, and furthermore, it turns out that the new hybrid framework has a nice noise-resistant capability when handling realistic correlation data.
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.
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.
Entanglement witness is an effective method to detect entanglement in unknown states without doing full tomography. One of the most widespread schemes of witnessing entanglement is measuring its fidelity with respect to a pure entangled state. Recently, a large class of states whose entanglement can not be detected with the fidelity witness has been discovered in Phys.Rev.Lett \textbf{124},200502(2020). They are called unfaithful states. In this paper we propose a new way to detect entanglement by calculating the lower bound of entanglement using measurement results. Numerical simulation shows our method can detect entanglement in unfaithful states with a small number of measurements. Moreover, we generalize our scheme to multipartite states and show that it can tolerate higher noise than previous entanglement witness operators with same number of measurement settings.