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:1904.05001 · npj Quantum Information

Detecting multipartite entanglement structure with minimal resources

You Zhou, Qi Zhao, Xiao Yuan, Xiongfeng Ma

Published Oct 4, 2019• 52 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/s41534-019-0200-9

Related papers

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

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

Detecting Genuine Multipartite Entanglement with Two Local Measurements

Géza Tóth, Otfried Gühne

We present entanglement witness operators for detecting genuine multipartite entanglement. These witnesses are robust against noise and require only two local measurement settings when used in an experiment, independent of the number of qubits. This allows detection of entanglement for an increasing number of parties without a corresponding increase in effort. The witnesses presented detect states close to Greenberger-Horne-Zeilinger, cluster, and graph states. Connections to Bell inequalities are also discussed.

arXiv:quant-ph/0405165•Physical Review Letters•Feb 17, 2005•349 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

Estimating localizable entanglement from witnesses

David Amaro, Markus Müller, Amit Kumar Pal

Computing localizable entanglement for noisy many-particle quantum states is difficult due to the optimization over all possible sets of local projection measurements. Therefore, it is crucial to develop lower bounds, which can provide useful information about the behaviour of localizable entanglement, and which can be determined by measuring a limited number of operators, or by performing the least number of measurements on the state, preferably without performing a full state tomography. In this paper, we adopt two different yet related approaches to obtain a witness-based, and a measurement-based lower bounds for localizable entanglement. The former is determined by the minimal amount of entanglement that can be present in a subsystem of the multipartite quantum state, which is consistent with the expectation value of an entanglement witness. Determining this bound does not require any information about the state beyond the expectation value of the witness operator, which renders this approach highly practical in experiments. The latter bound of localizable entanglement is computed by restricting the local projection measurements over the qubits outside the subsystem of interest to a suitably chosen basis. We discuss the behaviour of both lower bounds against local physical noise on the qubits, and discuss their dependence on noise strength and system size. We also analytically determine the measurement-based lower bound in the case of graph states under local uncorrelated Pauli noise.

arXiv:1803.02753•New Journal of Physics•May 14, 2018•17 citations
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.
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.
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.
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.
We present entanglement witness operators for detecting genuine multipartite entanglement. These witnesses are robust against noise and require only two local measurement settings when used in an experiment, independent of the number of qubits. This allows detection of entanglement for an increasing number of parties without a corresponding increase in effort. The witnesses presented detect states close to Greenberger-Horne-Zeilinger, cluster, and graph states. Connections to Bell inequalities are also discussed.
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.
Computing localizable entanglement for noisy many-particle quantum states is difficult due to the optimization over all possible sets of local projection measurements. Therefore, it is crucial to develop lower bounds, which can provide useful information about the behaviour of localizable entanglement, and which can be determined by measuring a limited number of operators, or by performing the least number of measurements on the state, preferably without performing a full state tomography. In this paper, we adopt two different yet related approaches to obtain a witness-based, and a measurement-based lower bounds for localizable entanglement. The former is determined by the minimal amount of entanglement that can be present in a subsystem of the multipartite quantum state, which is consistent with the expectation value of an entanglement witness. Determining this bound does not require any information about the state beyond the expectation value of the witness operator, which renders this approach highly practical in experiments. The latter bound of localizable entanglement is computed by restricting the local projection measurements over the qubits outside the subsystem of interest to a suitably chosen basis. We discuss the behaviour of both lower bounds against local physical noise on the qubits, and discuss their dependence on noise strength and system size. We also analytically determine the measurement-based lower bound in the case of graph states under local uncorrelated Pauli noise.