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:0708.3119

Detection of fidelity and multiparticle entanglement for arbitrary graph states

Yashuai Han, Duan, L. -M.

Published Aug 23, 2007• 0 citations
arXivHTMLPDF

Abstract

withdrawn by the authors because of an error.
DOI
10.48550/arxiv.0708.3119

Related papers

Entanglement in multipartite quantum systems in the context of graph states

Junyi WU

•Apr 22, 2015•0 citations

Multiparticle entanglement purification for two-colorable graph states

Hans Aschauer, Wolfgang Dür, Hans J. Briegel

We investigate multiparticle entanglement purification schemes which allow one to purify all two colorable graph states, a class of states which includes, e.g., cluster states, Greenberger-Horne-Zeilinger states, and code words of various error correction codes. The schemes include both recurrence protocols and hashing protocols. We analyze these schemes under realistic conditions and observe for a generic error model that the threshold value for imperfect local operations depends on the structure of the corresponding interaction graph, but is otherwise independent of the number of parties. The qualitative behavior can be understood from an analytically solvable model which deals only with a restricted class of errors. We compare direct multiparticle entanglement purification protocols with schemes based on bipartite entanglement purification and show that the direct multiparticle entanglement purification is more efficient and the achievable fidelity of the purified states is larger. We also show that the purification protocol allows one to produce private entanglement, an important aspect when using the produced entangled states for secure applications. Finally we discuss an experimental realization of a multiparty purification protocol in optical lattices which is issued to improve the fidelity of cluster states created in such systems.

arXiv:quant-ph/0405045•Physical Review A•Jan 14, 2005•137 citations

Multiparticle entanglement in graph-diagonal states: Necessary and sufficient conditions for four qubits

Otfried Gühne, Bastian Jungnitsch, Tobias Moroder +1 more

The characterization of genuine multiparticle entanglement is important for entanglement theory as well as experimental studies related to quantum-information theory. Here, we completely characterize genuine multiparticle entanglement for four-qubit states diagonal in the cluster-state basis. In addition, we give a complete characterization of multiparticle entanglement for all five-qubit graph states mixed with white noise, for states diagonal in the basis corresponding to the five-qubit $\mathsf{Y}$-shaped graph, and for a family of graph states with an arbitrary number of qubits.

arXiv:1107.4863•Physical Review A•Nov 18, 2011•27 citations

Detection of genuine entanglement for multipartite quantum states

Hui Zhao, Yu-Qiu Liu, Naihuan Jing +1 more

arXiv:2302.08655•Quantum Information Processing•Sep 17, 2022•5 citations

Detection of Genuine Multipartite Entanglement in Multipartite Systems

Jing Yun Zhao, Hui Zhao, Naihuan Jing +1 more

arXiv:1909.13630•International Journal of Theoretical Physics•Jun 26, 2019•9 citations

Multiparticle covariance matrices and the impossibility of detecting graph-state entanglement with two-particle correlations

Oleg Gittsovich, Philipp Hyllus, Otfried Gühne

We present a criterion for multiparticle entanglement based on covariance matrices. On the one hand, the criterion allows detection of bound entangled states which are not detected by other criteria; on the other hand, some strongly entangled pure states such as the Greenberger-Horne-Zeilinger (GHZ) states are not detected. We show, however, that this is a general phenomenon: No separability criterion based on two-particle correlations can recognize the entanglement in the family of graph states to which the GHZ states belong.

arXiv:1006.1594•Physical Review A•Sep 9, 2010•52 citations
We investigate multiparticle entanglement purification schemes which allow one to purify all two colorable graph states, a class of states which includes, e.g., cluster states, Greenberger-Horne-Zeilinger states, and code words of various error correction codes. The schemes include both recurrence protocols and hashing protocols. We analyze these schemes under realistic conditions and observe for a generic error model that the threshold value for imperfect local operations depends on the structure of the corresponding interaction graph, but is otherwise independent of the number of parties. The qualitative behavior can be understood from an analytically solvable model which deals only with a restricted class of errors. We compare direct multiparticle entanglement purification protocols with schemes based on bipartite entanglement purification and show that the direct multiparticle entanglement purification is more efficient and the achievable fidelity of the purified states is larger. We also show that the purification protocol allows one to produce private entanglement, an important aspect when using the produced entangled states for secure applications. Finally we discuss an experimental realization of a multiparty purification protocol in optical lattices which is issued to improve the fidelity of cluster states created in such systems.
The characterization of genuine multiparticle entanglement is important for entanglement theory as well as experimental studies related to quantum-information theory. Here, we completely characterize genuine multiparticle entanglement for four-qubit states diagonal in the cluster-state basis. In addition, we give a complete characterization of multiparticle entanglement for all five-qubit graph states mixed with white noise, for states diagonal in the basis corresponding to the five-qubit Y\mathsf{Y}Y-shaped graph, and for a family of graph states with an arbitrary number of qubits.
We present a criterion for multiparticle entanglement based on covariance matrices. On the one hand, the criterion allows detection of bound entangled states which are not detected by other criteria; on the other hand, some strongly entangled pure states such as the Greenberger-Horne-Zeilinger (GHZ) states are not detected. We show, however, that this is a general phenomenon: No separability criterion based on two-particle correlations can recognize the entanglement in the family of graph states to which the GHZ states belong.