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:1204.2722 · Physical Review A

Package of facts and theorems for efficiently generating entanglement criteria for many qubits

Marcin Wieśniak, Koji Maruyama

Published Jun 19, 2012• 6 citations
arXivHTMLPDF

Abstract

We present a package of mathematical theorems that allows us to construct multipartite-entanglement criteria. Importantly, establishing bounds for certain classes of entanglement does not take an optimization over continuous sets of states. These bonds are found from the properties of commutativity graphs of operators used in the criterion. We present two examples of criteria constructed according to our method. One of them detects genuine five-qubit entanglement without ever referring to correlations between all five qubits.

DOI
10.1103/physreva.85.062315

Related papers

Efficient entanglement criteria for discrete, continuous, and hybrid variables

Manuel Gessner, Luca Pezzè, Augusto Smerzi

We develop a method to construct entanglement criteria for arbitrary multipartite systems of discrete or continuous variables and hybrid combinations of both. While any set of local operators generates a sufficient condition for entanglement of arbitrary quantum states, a suitable set leads to a necessary and sufficient criterion for pure states. The criteria are readily implementable with existing technology and reveal entanglement that remains undetected by the respective state-of-the-art methods for discrete and continuous variables.

arXiv:1608.02421•Physical Review A•Aug 1, 2016•75 citations

Separability criteria for genuine multiparticle entanglement

Otfried Gühne, Michael Seevinck

We present a method to derive separability criteria for different classes of multiparticle entanglement, especially genuine multiparticle entanglement. The resulting criteria are necessary and sufficient for certain families of states. This, for example, completely solves the problem of classifying N -qubit Greenberger–Horne–Zeilinger states mixed with white noise according to their separability and entanglement properties. Further, the criteria are superior to all known entanglement criteria for many other families; also they allow the detection of bound entanglement. We next demonstrate that they are easily implementable in experiments and discuss applications to the decoherence of multiparticle entangled states.

arXiv:0905.1349•New Journal of Physics•May 5, 2010•317 citations

Scalable multipartite entanglement criteria for continuous variables

Xiaoyu Chen

Multipartite entanglement detection is crucial for the develop of quantum information science and quantum computation, communication, simulation and metrology tasks. In contrast to experiments, where several handreds of qubits have been entangled to build a quantum computer or a quantum simulator, theoretically only for lower dimensional quantum system such as two qubit system or two-mode Gaussian state and some special quantum states, efficient criteria have been developed to detect the entanglement. An efficient and practical entanglement detection method is anticipated to appear for current scalable quantum system. Based on the matched entanglement witness scheme and integrated uncertainty relations, we propose a quite general entanglement detection method for all kinds of multipartite entanglement of multimode continuous variable systems. With the covariance matrix of any randomly generated multimode continuous variable quantum state, our criterion can detect entanglement, genuine entanglement and other kinds of inseparabilities almost imidiately.

arXiv:2411.03083•Nov 5, 2024•0 citations

Separability criteria and lower bounds of entanglement via realignment

Yuhang Xie, Yanjun Chu, Shao-Ming Fei

The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.

quant-pharXiv:2610.15664•Oct 13, 2026•0 citations

Experimentally feasible set of criteria detecting genuine multipartite entanglement in n -qubit Dicke states and in higher-dimensional systems

Marcus Huber, Paul Erker, Hans Schimpf +2 more

We construct a set of criteria detecting genuine multipartite entanglement in arbitrary dimensional multipartite systems. These criteria are optimally suited for detecting multipartite entanglement in $n$-qubit Dicke states with $m$ excitations, as shown in exemplary cases. Furthermore, they can be employed to detect multipartite entanglement in different states related to quantum cloning, decoherence-free communication, and quantum secret sharing. In a detailed analysis, we show that the criteria are also more robust to noise than any other criterion known so far, especially with increasing system size. Furthermore, it is shown that the number of required local observables scales only polynomially with size, thus making the criteria experimentally feasible.

arXiv:1011.4579•Physical Review A•Apr 18, 2011•56 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•81 citations
We present a package of mathematical theorems that allows us to construct multipartite-entanglement criteria. Importantly, establishing bounds for certain classes of entanglement does not take an optimization over continuous sets of states. These bonds are found from the properties of commutativity graphs of operators used in the criterion. We present two examples of criteria constructed according to our method. One of them detects genuine five-qubit entanglement without ever referring to correlations between all five qubits.
We develop a method to construct entanglement criteria for arbitrary multipartite systems of discrete or continuous variables and hybrid combinations of both. While any set of local operators generates a sufficient condition for entanglement of arbitrary quantum states, a suitable set leads to a necessary and sufficient criterion for pure states. The criteria are readily implementable with existing technology and reveal entanglement that remains undetected by the respective state-of-the-art methods for discrete and continuous variables.
We present a method to derive separability criteria for different classes of multiparticle entanglement, especially genuine multiparticle entanglement. The resulting criteria are necessary and sufficient for certain families of states. This, for example, completely solves the problem of classifying N -qubit Greenberger–Horne–Zeilinger states mixed with white noise according to their separability and entanglement properties. Further, the criteria are superior to all known entanglement criteria for many other families; also they allow the detection of bound entanglement. We next demonstrate that they are easily implementable in experiments and discuss applications to the decoherence of multiparticle entangled states.
Multipartite entanglement detection is crucial for the develop of quantum information science and quantum computation, communication, simulation and metrology tasks. In contrast to experiments, where several handreds of qubits have been entangled to build a quantum computer or a quantum simulator, theoretically only for lower dimensional quantum system such as two qubit system or two-mode Gaussian state and some special quantum states, efficient criteria have been developed to detect the entanglement. An efficient and practical entanglement detection method is anticipated to appear for current scalable quantum system. Based on the matched entanglement witness scheme and integrated uncertainty relations, we propose a quite general entanglement detection method for all kinds of multipartite entanglement of multimode continuous variable systems. With the covariance matrix of any randomly generated multimode continuous variable quantum state, our criterion can detect entanglement, genuine entanglement and other kinds of inseparabilities almost imidiately.
The detection and quantification of quantum entanglement are central problems in quantum information science. Based on the realignment of density matrices and the vectorization of reduced density matrices, we construct a family of enhanced separability criteria for bipartite and multipartite quantum systems. Our criteria recover the previously proposed realignment-based criteria as special cases and detect more entanglement than the earlier ones. Moreover, we derive tighter lower bounds for the concurrence and the convex-roof extended negativity, criteria for detecting the genuine tripartite entanglement, and lower bounds on genuine-multipartite-entanglement concurrence. The advantages of our results are demonstrated with detailed examples.
We construct a set of criteria detecting genuine multipartite entanglement in arbitrary dimensional multipartite systems. These criteria are optimally suited for detecting multipartite entanglement in nnn-qubit Dicke states with mmm excitations, as shown in exemplary cases. Furthermore, they can be employed to detect multipartite entanglement in different states related to quantum cloning, decoherence-free communication, and quantum secret sharing. In a detailed analysis, we show that the criteria are also more robust to noise than any other criterion known so far, especially with increasing system size. Furthermore, it is shown that the number of required local observables scales only polynomially with size, thus making the criteria experimentally feasible.
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.