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.07274

Improved criteria of detecting multipartite entanglement structure

Kai Wu, Zhihua Chen, Zhen‐Peng Xu, Zhihao Ma, Shao-Ming Fei

Published Jun 11, 2024• 1 citation
arXivHTMLPDF

Abstract

Multipartite entanglement is one of the crucial resources in quantum information processing tasks such as quantum metrology, quantum computing and quantum communications. It is essential to verify not only the multipartite entanglement, but also the entanglement structure in both fundamental theories and the applications of quantum information technologies. However, it is proved to be challenging to detect the entanglement structures, including entanglement depth, entanglement intactness and entanglement stretchability, especially for general states and large-scale quantum systems. By using the partitions of the tensor product space we propose a systematic method to construct powerful entanglement witnesses which identify better the multipartite entanglement structures. Besides, an efficient algorithm using semi-definite programming and a gradient descent algorithm are designed to detect entanglement structure from the inner polytope of the convex set containing all the states with the same entanglement structure. We demonstrate by detailed examples that our criteria perform better than other known ones. Our results may be applied to many quantum information processing tasks.

DOI
10.48550/arxiv.2406.07274

Related papers

Hybrid of Gradient Descent and Semidefinite Programming for Certifying Multipartite Entanglement Structure

Kai Wu, Zhihua Chen, Zhen‐Peng Xu +2 more

Abstract Multipartite entanglement is a crucial resource for a wide range of quantum information processing tasks, including quantum metrology, quantum computing, and quantum communication. The verification of multipartite entanglement, along with an understanding of its intrinsic structure, is of fundamental importance, both for the foundations of quantum mechanics and for the practical applications of quantum information technologies. Nonetheless, detecting entanglement structures remains a significant challenge, particularly for general states and large‐scale quantum systems. To address this issue, an efficient algorithm that combines semidefinite programming with a gradient descent method is developed. This algorithm is designed to explore the entanglement structure by examining the inner polytope of the convex set that encompasses all states sharing the same entanglement properties. Through detailed examples, it is demonstrated that the superior performance of this approach compared to many of the best‐known methods available today. This method not only improves entanglement detection but also provides deeper insights into the complex structures of many‐body quantum systems, which is essential for advancing quantum technologies.

arXiv:2412.16480•Advanced Quantum Technologies•Dec 13, 2024•2 citations

Efficient detection of multipartite entanglement structure

You Zhou, Qi Zhao, Xiao Yuan +1 more

Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum state as a basis for further information processing tasks. In reality, evaluation of a multipartite state is in general a very challenging task owing to the exponential increase of the Hilbert space with respect to the number of system components. In this work, we propose a systematic method using very few local measurements to detect multipartite entanglement structures based on the graph state --- one of the most important classes of quantum states for quantum information processing. Thanks to the close connection between the Schmidt coefficient and quantum entropy in graph states, we develop a family of efficient witness operators to detect the entanglement between subsystems under any partitions and hence the entanglement intactness. We show that the number of local measurements equals to the chromatic number of the underlying graph, which is a constant number, independent of the number of qubits. In reality, the optimization problem involved in the witnesses can be challenging with large system size. For several widely-used graph states, such as 1-D and 2-D cluster states and the Greenberger-Horne-Zeilinger state, by taking advantage of the area law of entanglement entropy, we derive analytical solutions for the witnesses, which only employ two local measurements. Our method offers a standard tool for entanglement structure detection to benchmark multipartite quantum systems.

•Apr 10, 2019•1 citation

Characterizing entanglement in quantum information

Federico M. Spedalieri

Entanglement is a key resource in the emerging field of Quantum Information. The strong correlations between systems described by an entangled state allow us to perform certain tasks more efficiently than it would be possible by using only classical resources. This is why the characterization of entanglement is one of the most important problems in Quantum Information. In this thesis, we analyze several aspects of entanglement. First, we introduce a new family of criteria to determine if a bipartite mixed state is entangled or not. This family consists of a sequence of tests that can be implemented efficiently, and has the property that all entangled states can be detected by some test in the sequence. Each test in the family can be stated as a semidefinite program, which is a class of convex optimization problems. The duality structure of these programs allows us to explicitly construct an entanglement witness that proves entanglement of a state, whenever the state fails one of the tests in the sequence. The entanglement witnesses constructed in this manner have well-defined algebraic properties that can be used to give a characterization of the interior of the set of all possible entanglement witnesses, as well as the set of strictly positive bihermitian forms and the set of strictly positive maps. We also study deterministic transformations of three-qubit pure state when only local operations and classical communication (LOCC) are allowed. We derive strong constraints that the operations and states involved must satisfy, and we apply these results to characterize the set of real states that can be obtained from the GHZ state by LOCC.

•May 22, 2003•0 citations

Detecting multipartite entanglement structure with minimal resources

You Zhou, Qi Zhao, Xiao Yuan +1 more

Abstract Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum state as a basis for further information processing tasks. In reality, evaluation of a multipartite state is in general a very challenging task owing to the exponential increase of the Hilbert space with respect to the number of system components. In this work, we propose a systematic method using very few local measurements to detect multipartite entanglement structures based on the graph state—one of the most important classes of quantum states for quantum information processing. Thanks to the close connection between the Schmidt coefficient and quantum entropy in graph states, we develop a family of efficient witness operators to detect the entanglement between subsystems under any partitions and hence the entanglement intactness. We show that the number of local measurements equals to the chromatic number of the underlying graph, which is a constant number, independent of the number of qubits. In reality, the optimization problem involved in the witnesses can be challenging with large system size. For several widely used graph states, such as 1-D and 2-D cluster states and the Greenberger–Horne–Zeilinger state, by taking advantage of the area law of entanglement entropy, we derive analytical solutions for the witnesses, which only employ two local measurements. Our method offers a standard tool for entanglement-structure detection to benchmark multipartite quantum systems.

arXiv:1904.05001•npj Quantum Information•Oct 4, 2019•61 citations

Scalable multipartite entanglement criteria for continuous variables

Xiaoyu Chen

Multipartite entanglement detection is crucial for the develop of quantum information science and quantum computation, communication, simulation and metrology tasks. In contrast to experiments, where several handreds of qubits have been entangled to build a quantum computer or a quantum simulator, theoretically only for lower dimensional quantum system such as two qubit system or two-mode Gaussian state and some special quantum states, efficient criteria have been developed to detect the entanglement. An efficient and practical entanglement detection method is anticipated to appear for current scalable quantum system. Based on the matched entanglement witness scheme and integrated uncertainty relations, we propose a quite general entanglement detection method for all kinds of multipartite entanglement of multimode continuous variable systems. With the covariance matrix of any randomly generated multimode continuous variable quantum state, our criterion can detect entanglement, genuine entanglement and other kinds of inseparabilities almost imidiately.

arXiv:2411.03083•Nov 5, 2024•1 citation

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•20 citations
Multipartite entanglement is one of the crucial resources in quantum information processing tasks such as quantum metrology, quantum computing and quantum communications. It is essential to verify not only the multipartite entanglement, but also the entanglement structure in both fundamental theories and the applications of quantum information technologies. However, it is proved to be challenging to detect the entanglement structures, including entanglement depth, entanglement intactness and entanglement stretchability, especially for general states and large-scale quantum systems. By using the partitions of the tensor product space we propose a systematic method to construct powerful entanglement witnesses which identify better the multipartite entanglement structures. Besides, an efficient algorithm using semi-definite programming and a gradient descent algorithm are designed to detect entanglement structure from the inner polytope of the convex set containing all the states with the same entanglement structure. We demonstrate by detailed examples that our criteria perform better than other known ones. Our results may be applied to many quantum information processing tasks.
Abstract Multipartite entanglement is a crucial resource for a wide range of quantum information processing tasks, including quantum metrology, quantum computing, and quantum communication. The verification of multipartite entanglement, along with an understanding of its intrinsic structure, is of fundamental importance, both for the foundations of quantum mechanics and for the practical applications of quantum information technologies. Nonetheless, detecting entanglement structures remains a significant challenge, particularly for general states and large‐scale quantum systems. To address this issue, an efficient algorithm that combines semidefinite programming with a gradient descent method is developed. This algorithm is designed to explore the entanglement structure by examining the inner polytope of the convex set that encompasses all states sharing the same entanglement properties. Through detailed examples, it is demonstrated that the superior performance of this approach compared to many of the best‐known methods available today. This method not only improves entanglement detection but also provides deeper insights into the complex structures of many‐body quantum systems, which is essential for advancing quantum technologies.
Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum state as a basis for further information processing tasks. In reality, evaluation of a multipartite state is in general a very challenging task owing to the exponential increase of the Hilbert space with respect to the number of system components. In this work, we propose a systematic method using very few local measurements to detect multipartite entanglement structures based on the graph state --- one of the most important classes of quantum states for quantum information processing. Thanks to the close connection between the Schmidt coefficient and quantum entropy in graph states, we develop a family of efficient witness operators to detect the entanglement between subsystems under any partitions and hence the entanglement intactness. We show that the number of local measurements equals to the chromatic number of the underlying graph, which is a constant number, independent of the number of qubits. In reality, the optimization problem involved in the witnesses can be challenging with large system size. For several widely-used graph states, such as 1-D and 2-D cluster states and the Greenberger-Horne-Zeilinger state, by taking advantage of the area law of entanglement entropy, we derive analytical solutions for the witnesses, which only employ two local measurements. Our method offers a standard tool for entanglement structure detection to benchmark multipartite quantum systems.
Entanglement is a key resource in the emerging field of Quantum Information. The strong correlations between systems described by an entangled state allow us to perform certain tasks more efficiently than it would be possible by using only classical resources. This is why the characterization of entanglement is one of the most important problems in Quantum Information. In this thesis, we analyze several aspects of entanglement. First, we introduce a new family of criteria to determine if a bipartite mixed state is entangled or not. This family consists of a sequence of tests that can be implemented efficiently, and has the property that all entangled states can be detected by some test in the sequence. Each test in the family can be stated as a semidefinite program, which is a class of convex optimization problems. The duality structure of these programs allows us to explicitly construct an entanglement witness that proves entanglement of a state, whenever the state fails one of the tests in the sequence. The entanglement witnesses constructed in this manner have well-defined algebraic properties that can be used to give a characterization of the interior of the set of all possible entanglement witnesses, as well as the set of strictly positive bihermitian forms and the set of strictly positive maps. We also study deterministic transformations of three-qubit pure state when only local operations and classical communication (LOCC) are allowed. We derive strong constraints that the operations and states involved must satisfy, and we apply these results to characterize the set of real states that can be obtained from the GHZ state by LOCC.
Abstract Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum state as a basis for further information processing tasks. In reality, evaluation of a multipartite state is in general a very challenging task owing to the exponential increase of the Hilbert space with respect to the number of system components. In this work, we propose a systematic method using very few local measurements to detect multipartite entanglement structures based on the graph state—one of the most important classes of quantum states for quantum information processing. Thanks to the close connection between the Schmidt coefficient and quantum entropy in graph states, we develop a family of efficient witness operators to detect the entanglement between subsystems under any partitions and hence the entanglement intactness. We show that the number of local measurements equals to the chromatic number of the underlying graph, which is a constant number, independent of the number of qubits. In reality, the optimization problem involved in the witnesses can be challenging with large system size. For several widely used graph states, such as 1-D and 2-D cluster states and the Greenberger–Horne–Zeilinger state, by taking advantage of the area law of entanglement entropy, we derive analytical solutions for the witnesses, which only employ two local measurements. Our method offers a standard tool for entanglement-structure detection to benchmark multipartite quantum systems.
Multipartite entanglement detection is crucial for the develop of quantum information science and quantum computation, communication, simulation and metrology tasks. In contrast to experiments, where several handreds of qubits have been entangled to build a quantum computer or a quantum simulator, theoretically only for lower dimensional quantum system such as two qubit system or two-mode Gaussian state and some special quantum states, efficient criteria have been developed to detect the entanglement. An efficient and practical entanglement detection method is anticipated to appear for current scalable quantum system. Based on the matched entanglement witness scheme and integrated uncertainty relations, we propose a quite general entanglement detection method for all kinds of multipartite entanglement of multimode continuous variable systems. With the covariance matrix of any randomly generated multimode continuous variable quantum state, our criterion can detect entanglement, genuine entanglement and other kinds of inseparabilities almost imidiately.
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.