Quick Navigation
Topics
Entanglement Theory Quantum Correlations
Quantum Machine Learning
Calculation of entanglement in graph states up to five-qubit based on generalized concurrence
arXiv
Authors: Ahmad Akhound, Saeed Haddadi, Mohammad Ali Chaman Motlagh
Year
2016
Paper ID
43060
Status
Preprint
Abstract Read
~2 min
Abstract Words
78
Citations
N/A
Abstract
We propose a new classification for the entanglement in graph states based on generalized con- currence. The numerical results indicate that the eight different three-qubit graph states in three categories, 64 four-qubit graph states in five categories and 1024 five-qubit graph states are in ten classes. We also compare this classification with equivalence classes of these graph states under local complementation (LC) operator, and the obtained result suggests that classification by generalized concurrence is not in contradiction with the LC-rule.
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2016 reference point for readers tracking recent quantum research.
- We propose a new classification for the entanglement in graph states based on generalized con- currence.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.