Entanglement is a central concept in quantum information and a key resource for many quantum protocols. In this work we propose and analyze a class of entanglement witnesses that detect the presence of entanglement in subsystems of experimental multiqubit stabilizer states. The witnesses we propose can be decomposed into sums of Pauli operators and can be efficiently evaluated by either two measurement settings only or at most a number of measurements that only depends on the size of the subsystem of interest. We provide two constructive methods to design the local witness operators, the first one based on the local unitary equivalence between graph and stabilizer states, and the second one based on sufficient and necessary conditions that the respective set of constituent Pauli operators needs to fulfill. We theoretically establish the noise tolerance of the proposed witnesses and benchmark their practical performance by analyzing the local entanglement structure of an experimental seven-qubit quantum error correction code.
Entanglement is a central concept in quantum information and a key resource for many quantum protocols. In this work we propose and analyze a class of entanglement witnesses that detect the presence of entanglement in subsystems of experimental multiqubit stabilizer states. The witnesses we propose can be decomposed into sums of Pauli operators and can be efficiently evaluated by either two measurement settings only or at most a number of measurements that only depends on the size of the subsystem of interest. We provide two constructive methods to design the local witness operators, the first one based on the local unitary equivalence between graph and stabilizer states, and the second one based on sufficient and necessary conditions that the respective set of constituent Pauli operators needs to fulfill. We theoretically establish the noise tolerance of the proposed witnesses and benchmark their practical performance by analyzing the local entanglement structure of an experimental seven-qubit quantum error correction code.
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.
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.
Entanglement is an essential resource in quantum information science [1] and its presence in any quantum system can be experimentally detected through entanglement witness operators [2]. In particular, measuring a negative expectation value of a witness with high statistical confidence provides a necessary and sufficient condition to confirm the generation of a genuine multipartite [3] and/or d-level entangled state [4]. In recent years, the experimental generation of complex quantum states has intensified the need for witnesses that are capable of detecting such systems and are experimentally optimal at the same time. This means that the witness should require the least measurement effort (in terms of number and complexity of the measurement settings), include only projections on single qudits, while at the same time possessing a high noise tolerance (Fig. 1a). However, "experimentally-friendly" witnesses capable of accomplishing these tasks have not been derived yet.
Entanglement witnesses are essential for certifying entanglement, yet constructing ones that are both noise-robust and economical in measurement settings remains challenging - particularly beyond qubits and for non-stabilizer ("magic") states. We present a machine-learning method that, given a target state and a user-specified number of measurement settings, generates an entanglement witness optimized for noise tolerance in the neighborhood of that state, requiring only local measurements. The approach is fully general, applying to multipartite qubit and qudit systems alike, including non-stabilizer states. For N qudits of dimension d, we train on the fully-separable eigenstates of each qudit's SU(d) generators to find a prototype witness, then tune the witness's bias term via gradient descent to maximize noise tolerance. Adversarial training further strengthens the witnesses, delivering greater noise tolerance with even fewer settings; critically, under this scheme the required training-set size becomes independent of system size. We package the entire pipeline as an automated script that, in every case we tested, produces witnesses surpassing all existing methods in noise tolerance and/or number of measurement settings. We demonstrate the method on Bell, GHZ, W, and hypergraph states, along with a range of qudit states, spanning 2-6 qubits, bipartite qudits up to d=10, and tripartite qutrits. Our witnesses achieve perfect accuracy across both physical experimental test states and large numerical sets of separable mixed states-including 30 million test states for a 3-qubit W-state witness and 10 million for a 4-qubit hypergraph-state witness-and we experimentally confirm the noise tolerance of Bell- and hypergraph state witnesses on both photonic and superconducting platforms, respectively.
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.