Bipartite and multipartite entanglement in entangled graphs

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

AKHOND AHMAD; Haddadi saeed; Chaman Motlagh Muhammad Ali

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF RESEARCH ON MANY BODY SYSTEMS Year:2019 | Volume:8 | Issue:19 Page(s): 1-10

Download Full-Text

Persian Verion

View:

622

Download:

Cites:

Information Journal Paper

Title

Bipartite and multipartite entanglement in entangled graphs

Author(s)

AKHOND AHMAD | Haddadi saeed | Chaman Motlagh Muhammad Ali | Issue Writer Certificate

Keywords

EntanglementQ1

Entangled graphQ1

Generalized concurrence measureQ1

Global entanglement measureQ1

Meyer-Wallach measureQ1

Abstract

In this study, we have obtained a parametric relationship for the Entanglement measurement between each pair of qubits for graphs with more than four qubits. We have also calculated the value of Entanglement in five-qubit Entangled graphs. Analysis of our results shows that the total of 1024 five-qubit Entangled graphs based on the maximum Entanglement between each pair of qubits, categorizes into 31 groups and if we consider the number of graph edges and degrees of vertices then these states are classified in 40 classes. Also based on the numerical results obtained from multipartite Entanglement measures such as generalized concurrence, global measurements, and Meyer-Wallach measurements, we show that 1024 graphs of the five-qubit system are in 24, 32 and 23 categories, respectively. As well as we conclude that the maximum amount of Entanglement belongs to the cycle graph and the minimum value belongs to the one-edge graph. While the maximum amount of Entanglement between each pair of qubits is in the one-edge graph and the minimum value is in the complete graph.

Cites

No record.

References

No record.

Cite

APA: Copy

AKHOND, AHMAD, Haddadi, saeed, & Chaman Motlagh, Muhammad Ali. (2019). Bipartite and multipartite entanglement in entangled graphs. JOURNAL OF RESEARCH ON MANY BODY SYSTEMS, 8(19 ), 1-10. SID. https://sid.ir/paper/243821/en

Vancouver: Copy

AKHOND AHMAD, Haddadi saeed, Chaman Motlagh Muhammad Ali. Bipartite and multipartite entanglement in entangled graphs. JOURNAL OF RESEARCH ON MANY BODY SYSTEMS[Internet]. 2019;8(19 ):1-10. Available from: https://sid.ir/paper/243821/en

IEEE: Copy

AHMAD AKHOND, saeed Haddadi, and Muhammad Ali Chaman Motlagh, “Bipartite and multipartite entanglement in entangled graphs,” JOURNAL OF RESEARCH ON MANY BODY SYSTEMS, vol. 8, no. 19 , pp. 1–10, 2019, [Online]. Available: https://sid.ir/paper/243821/en

Related Journal Papers