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:2508.13734 · Reports on Progress in Physics

Entanglement witnesses for stabilizer states and subspaces beyond qubits

Jakub Szczepaniak, Owidiusz Makuta, Remigiusz Augusiak

Published Nov 1, 2025• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1361-6633/ae1b67

Related papers

Detecting genuine multipartite entanglement in multi-qubit devices with restricted measurements

Nicky Kai Hong Li, Xi Dai, Manuel H. Muñoz-Arias +3 more

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.

arXiv:2504.21076•Nature Communications•Feb 17, 2026•8 citations

Localizing genuine multipartite entanglement in noisy stabilizer states

K J Harikrishnan, Amit Kumar Pal

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.

arXiv:2211.01064•Physical Review A•Sep 5, 2023•5 citations

Efficient and Robust Certification of Genuine Multipartite Entanglement in Noisy Quantum Error Correction Circuits

Andrea Rodriguez-Blanco, Alejandro Bermudez, Markus Müller +1 more

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 (GME) across all subsystems of physical qubits.We introduce a conditional witnessing technique to certify 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.

arXiv:2010.02941•PRX Quantum•Apr 8, 2021•21 citations

Entanglement witnesses for graph states: General theory and examples

Bastian Jungnitsch, Tobias Moroder, Otfried Gühne

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.

arXiv:1106.1114•Physical Review A•Sep 8, 2011•87 citations

Multipartite entanglement detection for hypergraph states

Maddalena Ghio, Daniele Malpetti, Matteo A. C. Rossi +2 more

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.

arXiv:1703.00429•Journal of Physics A Mathematical and Theoretical•Nov 10, 2017•32 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
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 (GME) across all subsystems of physical qubits.We introduce a conditional witnessing technique to certify 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.
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.
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.