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.
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.
Abstract Detecting genuine multipartite entanglement (GME) is a state-characterization task that benchmarks coherence and experimental control in quantum systems. Existing GME tests often require joint measurements on many qubits, posing challenges for systems like time-bin encoded qubits and microwave photons from superconducting circuits, where qubit connectivity is limited or measurement noise grows with the number of jointly measured qubits. Here we introduce versatile GME and k -inseparability criteria applicable to any state, which only require measuring O ( n 2 ) out of 2 n (at most) m -body stabilizers of n -qubit target graph states, with m upper-bounded by twice the graph’s maximum degree. For cluster or ring-graph states, only constant-weight stabilizers are needed. Using semidefinite programming (and sometimes graph-local complementations), we can reduce the number or weight of required stabilizers. Analytical and numerical results show that our criteria are noise-robust and may infer state infidelity from certified k -inseparability in microwave photonic graph states generated under realistic conditions.
Characterizing large noisy multiparty quantum states using genuine multipartite entanglement is a challenging task. In this paper, we calculate lower bounds of genuine multipartite entanglement localized over a chosen multiparty subsystem of multiqubit stabilizer states in the noiseless and noisy scenarios. In the absence of noise, adopting a graph-based technique, we perform the calculation for arbitrary graph states as representatives of the stabilizer states and show that the graph operations required for the calculation have a polynomial scaling with the system size. As demonstrations, we compute the localized genuine multipartite entanglement over subsystems of large graphs having linear, ladder, and square structures. We also extend the calculation for graph states subjected to single-qubit Markovian or non-Markovian Pauli noise on all qubits and demonstrate, for a specific lower bound of the localizable genuine multipartite entanglement corresponding to a specific Pauli measurement setup, the existence of a critical noise strength beyond which all of the postmeasured states are biseparable. The calculation is also useful for arbitrary large stabilizer states under noise due to the local unitary connection between stabilizer states and graph states. We demonstrate this by considering a toric code defined on a square lattice and computing a lower bound of localizable genuine multipartite entanglement over a nontrivial loop of the code. Similar to the graph states, we show the existence of the critical noise strength in this case also and discuss its interesting features.
Ensuring the correct functioning of quantum error correction (QEC) circuits is crucial to achieve fault tolerance in realistic quantum processors subjected to noise. The first checkpoint for a fully operational QEC circuit is to create genuine multipartite entanglement across all subsystems of physical qubits. We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) that is efficient in the number of subsystems and, importantly, robust against experimental noise and imperfections. Specifically, we prove that the detection of entanglement in a linear number of bipartitions by a number of measurements that also scales linearly, suffices to certify GME. Moreover, our method goes beyond the standard procedure of separating the state from the convex hull of biseparable states, yielding an improved finesse and robustness compared to previous techniques. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version. In particular, we subject the circuits to combinations of three types of noise, namely, uniform depolarizing noise, two-qubit gate depolarizing noise, and bit-flip measurement noise. We numerically compare our method with the standard, yet generally inefficient, fidelity test and to a pair of efficient witnesses, verifying the increased robustness of our method. Last but not least, we provide the full translation of our analysis to a trapped-ion native gate set that makes it suitable for experimental applications.
Detecting genuine multipartite entanglement (GME) is a state-characterization task that benchmarks coherence and experimental control in quantum systems. Existing GME tests often require joint measurements on many qubits, posing challenges for systems like time-bin encoded qubits and microwave photons from superconducting circuits, where qubit connectivity is limited or measurement noise grows with the number of jointly measured qubits. Here we introduce versatile GME and k-inseparability criteria applicable to any state, which only require measuring O(n2) out of 2n (at most) m-body stabilizers of n-qubit target graph states, with m upper-bounded by twice the graph’s maximum degree. For cluster or ring-graph states, only constant-weight stabilizers are needed. Using semidefinite programming (and sometimes graph-local complementations), we can reduce the number or weight of required stabilizers. Analytical and numerical results show that our criteria are noise-robust and may infer state infidelity from certified k-inseparability in microwave photonic graph states generated under realistic conditions.
Quantum hypergraph states extend the well-studied class of graph states by taking into account multi-qubit interactions through hyperedges. They provide a powerful framework to represent a family of quantum states with genuine multipartite entanglement. In this review, we provide a compact overview of the formal structure, entanglement characteristics, and operational relevance of hypergraph states in quantum information theory. We begin by introducing their mathematical foundations and generalizations of the stabilizer formalism. A central focus is placed on their entanglement properties, including the classification under local unitary (LU) and stochastic local operations with classical communication (SLOCC), the quantification of multipartite entanglement, and detection techniques via entanglement witnesses. We also explore other nonclassical features of hypergraph states, such as contextuality and genuine multipartite nonlocality, derived from stabilizer-based Bell-type inequalities. Additional attention is given to the role of hypergraph states in error correction, and as a computational resource in measurement-based quantum computation (MBQC), and to their non-stabilizer character - quantified via resource-theoretic measures of quantum magic. Finally we review their generalization to higher dimensions, i.e. to qudits and continuous variables.
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.