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

Efficient detection of multipartite entanglement structure

You Zhou, Qi Zhao, Xiao Yuan, Xiongfeng Ma

Published Apr 10, 2019• 0 citations
OpenAlex

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.

Related papers

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•52 citations

Scalable Certification of Entanglement in Quantum Networks

Jing-Tao Qiu, D. M. Tong, Xiao-Dong Yu

Quantum networks form the backbone of long-distance quantum information processing. Genuine multipartite entanglement (GME) serves as a key indicator of network performance and overall state quality. However, the widely used methods for certifying GME suffer from a major drawback that they either detect only a limited range of states or are applicable only to systems with a small number of parties. To overcome these limitations, we propose a family of sub-symmetric witnesses (SSWs), which are tractable both theoretically and experimentally. Analytically, we establish a connection between SSWs and the cut space of graph theory, enabling several powerful detection criteria tailored to practical quantum networks. Numerically, we show that the optimal detection can be formulated as a linear program, offering a significant efficiency advantage over the semidefinite programs commonly employed in quantum certification. Experimentally, SSWs can be evaluated via local measurements, with resource requirements independent of the local dimension in general, and even independent of the overall network size in many practical networks.

quant-pharXiv:2601.07427•Jan 13, 2026•0 citations

Multipartite Entanglement Detection with Minimal Effort

Lukas Knips, Christian Schwemmer, Nico Klein +2 more

Certifying entanglement of a multipartite state is generally considered a demanding task. Since an N qubit state is parametrized by 4^{N}-1 real numbers, one might naively expect that the measurement effort of generic entanglement detection also scales exponentially with N. Here, we introduce a general scheme to construct efficient witnesses requiring a constant number of measurements independent of the number of qubits for states like, e.g., Greenberger-Horne-Zeilinger states, cluster states, and Dicke states. For four qubits, we apply this novel method to experimental realizations of the aforementioned states and prove genuine four-partite entanglement with two measurement settings only.

arXiv:1412.5881•Physical Review Letters•Nov 18, 2016•36 citations

Improved criteria of detecting multipartite entanglement structure

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

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.

arXiv:2406.07274•Jun 11, 2024•0 citations

Efficient and robust detection of multipartite Greenberger-Horne-Zeilinger-like states

Qi Zhao, Gerui Wang, Xiao Yuan +1 more

Entanglement is a key resource for quantum information processing. A widely used tool for detecting entanglement is the entanglement witness, where the measurement of the witness operator is guaranteed to be positive for all separable states and can be negative for certain entangled states. In reality, due to exponentially increasing the Hilbert-space dimension with respect to the system size, it is very challenging to construct an efficient entanglement witness for general multipartite entangled states. For $N$-partite Greenberger-Horne-Zeilinger (GHZ)-like states, the most robust witness scheme requires $N+1$ local measurement settings and can tolerate up to $1/2$ white noise. As a comparison, the most efficient witness for GHZ-like states only needs two local measurement settings and can tolerate up to $1/3$ white noise. There is a tradeoff between the realization efficiency, the number of measurement settings, and the detection robustness, the maximally tolerable white noise. In this paper, we study this tradeoff by proposing a family of entanglement witnesses with $k$ ($2\ensuremath{\le}k\ensuremath{\le}N+1$) local measurement settings. Considering symmetric local measurements, we calculate the maximal tolerable noise for any given number of measurement settings. Consequently, we design the optimal witness with a minimal number of settings for any given level of white noise. Our theoretical analysis can be applied to other multipartite entangled states with a strong symmetry. Our witnesses can be easily implemented in experiment and applied in practical multipartite entanglement detection under different noise conditions.

arXiv:1902.07869•Physical Review A•May 28, 2019•11 citations

Efficient measurement-device-independent detection of multipartite entanglement structure

Qi Zhao, Xiao Yuan, Xiongfeng Ma

Witnessing entanglement is crucial in quantum information processing. With properly preparing ancillary states, it has been shown previously that genuine entanglement can be witnessed without trusting measurement devices. In this work we generalize the scenario and show that generic multipartite entanglement structures, including entanglement of subsystems and entanglement depth, can be witnessed via measurement-device-independent means. As the original measurement-device-independent entanglement witness scheme exploits only one out of four Bell measurement outcomes for each party, a direct generalization to multipartite quantum states will inevitably cause inefficiency in entanglement detection after taking account of statistical fluctuations. To resolve this problem, we also present a way to utilize all the measurement outcomes. The scheme is efficient for multipartite entanglement detection and can be realized with state-of-the-art technologies.

arXiv:1607.08002•Physical Review A•Jul 26, 2016•16 citations
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.
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.
Quantum networks form the backbone of long-distance quantum information processing. Genuine multipartite entanglement (GME) serves as a key indicator of network performance and overall state quality. However, the widely used methods for certifying GME suffer from a major drawback that they either detect only a limited range of states or are applicable only to systems with a small number of parties. To overcome these limitations, we propose a family of sub-symmetric witnesses (SSWs), which are tractable both theoretically and experimentally. Analytically, we establish a connection between SSWs and the cut space of graph theory, enabling several powerful detection criteria tailored to practical quantum networks. Numerically, we show that the optimal detection can be formulated as a linear program, offering a significant efficiency advantage over the semidefinite programs commonly employed in quantum certification. Experimentally, SSWs can be evaluated via local measurements, with resource requirements independent of the local dimension in general, and even independent of the overall network size in many practical networks.
Certifying entanglement of a multipartite state is generally considered a demanding task. Since an N qubit state is parametrized by 4^{N}-1 real numbers, one might naively expect that the measurement effort of generic entanglement detection also scales exponentially with N. Here, we introduce a general scheme to construct efficient witnesses requiring a constant number of measurements independent of the number of qubits for states like, e.g., Greenberger-Horne-Zeilinger states, cluster states, and Dicke states. For four qubits, we apply this novel method to experimental realizations of the aforementioned states and prove genuine four-partite entanglement with two measurement settings only.
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.
Entanglement is a key resource for quantum information processing. A widely used tool for detecting entanglement is the entanglement witness, where the measurement of the witness operator is guaranteed to be positive for all separable states and can be negative for certain entangled states. In reality, due to exponentially increasing the Hilbert-space dimension with respect to the system size, it is very challenging to construct an efficient entanglement witness for general multipartite entangled states. For NNN-partite Greenberger-Horne-Zeilinger (GHZ)-like states, the most robust witness scheme requires N+1N+1N+1 local measurement settings and can tolerate up to 1/21/21/2 white noise. As a comparison, the most efficient witness for GHZ-like states only needs two local measurement settings and can tolerate up to 1/31/31/3 white noise. There is a tradeoff between the realization efficiency, the number of measurement settings, and the detection robustness, the maximally tolerable white noise. In this paper, we study this tradeoff by proposing a family of entanglement witnesses with kkk ($2\ensuremath{\le}k\ensuremath{\le}N+1$) local measurement settings. Considering symmetric local measurements, we calculate the maximal tolerable noise for any given number of measurement settings. Consequently, we design the optimal witness with a minimal number of settings for any given level of white noise. Our theoretical analysis can be applied to other multipartite entangled states with a strong symmetry. Our witnesses can be easily implemented in experiment and applied in practical multipartite entanglement detection under different noise conditions.
Witnessing entanglement is crucial in quantum information processing. With properly preparing ancillary states, it has been shown previously that genuine entanglement can be witnessed without trusting measurement devices. In this work we generalize the scenario and show that generic multipartite entanglement structures, including entanglement of subsystems and entanglement depth, can be witnessed via measurement-device-independent means. As the original measurement-device-independent entanglement witness scheme exploits only one out of four Bell measurement outcomes for each party, a direct generalization to multipartite quantum states will inevitably cause inefficiency in entanglement detection after taking account of statistical fluctuations. To resolve this problem, we also present a way to utilize all the measurement outcomes. The scheme is efficient for multipartite entanglement detection and can be realized with state-of-the-art technologies.