We present a general theory for the construction of witnesses that detect genuine multipartite entanglement in graph states. First, we present explicit witnesses for all graph states of up to six qubits which are better than all criteria so far. Therefore, lower fidelities are required in experiments that aim at the preparation of graph states. Building on these results, we develop analytical methods to construct two different types of entanglement witnesses for general graph states. For many classes of states, these operators exhibit white noise tolerances that converge to 1 when increasing the number of particles. We illustrate our approach for states such as the linear and the 2D cluster state. Finally, we study an entanglement monotone motivated by our approach for graph states.
We present a general theory for the construction of witnesses that detect genuine multipartite entanglement in graph states. First, we present explicit witnesses for all graph states of up to six qubits which are better than all criteria so far. Therefore, lower fidelities are required in experiments that aim at the preparation of graph states. Building on these results, we develop analytical methods to construct two different types of entanglement witnesses for general graph states. For many classes of states, these operators exhibit white noise tolerances that converge to 1 when increasing the number of particles. We illustrate our approach for states such as the linear and the 2D cluster state. Finally, we study an entanglement monotone motivated by our approach for graph states.
Abstract We study the entanglement properties of quantum hypergraph states of n qubits, focusing on multipartite entanglement . We compute multipartite entanglement for hypergraph states with a single hyperedge of maximum cardinality, for hypergraph states endowed with all possible hyperedges of cardinality equal to n − 1 and for those hypergraph states with all possible hyperedges of cardinality greater than or equal to n − 1 . We then find a lower bound to the multipartite entanglement of a generic quantum hypergraph state. We finally apply the multipartite entanglement results to the construction of entanglement witness operators , able to detect genuine multipartite entanglement in the neighbourhood of a given hypergraph state. We first build entanglement witnesses of the projective type, then propose a class of witnesses based on the stabilizer formalism, hence called stabilizer witnesses , able to reduce the experimental effort from an exponential to a linear growth in the number of local measurement settings with the number of qubits.
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 Genuine multipartite entanglement (GME) is arguably the most valuable form of entanglement in the multipartite case with application for instance in quantum metrology. In order to detect that form of entanglement in multipartite quantum states, one typically uses entanglement witnesses. The aim of this paper is to generalize the results of Tóth and Gühne (2005 Phys. Rev. A 72 022340) in order to provide a construction of witnesses of GME tailored to entangled subspaces originating from the multi-qudit stabilizer formalism—a framework well known for its role in quantum error correction, which also provides a very convenient description of a broad class of entangled multipartite states (both pure and mixed). Our construction includes graph states of arbitrary local dimension. We then show that in certain situations, the obtained witnesses detecting GME in quantum systems of higher local dimension are superior in terms of noise robustness to those derived for multiqubit states.
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.
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 entanglement, as an indispensable resource in quantum communication and quantum computation, is widely used in the field of quantum information. However, people's understanding on entanglement is quite limited both theoretically and experimentally. How to determine whether a given quantum state is entangled is still an important task. The entanglement witness is a kind of special self-adjoint operator, it can be used to determine whether a quantum state is an entangled state. This provides a new direction for the determination of entangled states. Entanglement witness has its own unique characteristics in various kinds of entanglement criterion. It is the most effective tool for detecting multipartite entanglement, and the most useful method to detect entanglement in experiments. In the background of quantum theory, we use theory of operators to make a thorough and systematic study of the construction of entanglement witness in this paper. First, from the definition of an entanglement witness, a general method is given to construct an entanglement witness. It is proved that when the maximal expectation CA of an observable A in the separable pure states is strictly less than its biggest eigenvalue max(A), the operator WC=CI-A is an entanglement witness provided that CA C max(A). Although the entanglement witness WCA can detect more entangled states than WC, but it is difficult to calculate the exact value of CA, and the estimate of the upper bound of CA is easier. Therefore, it is more convenient to construct entanglement witness WC than WCA. In quantum computation, a graph state is a special kind of multi-qubit state that can be represented by a graph. Each qubit is represented by a vertex of the graph, and there is an edge between every interacting pair of qubits. Graph states play a crucial role in many applications of quantum information theory, such as quantum error correcting codes, measurement-based quantum computation, and quantum simulation. Consequently, a significant effort is devoted to the creation and investigation of graph states. In the last part of this paper, as applications of our method, a series of methods for constructing an entanglement witness is obtained in the stabilizer formalism. It is also proved that how entanglement witnesses can be derived for a given graph state, provided some stabilizing operators of the graph state are known. Especially, when A is made up of some stabilizing operators of a graph state, entanglement witness WCA becomes one in literature.