عنوان مقاله [English]
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.
 R. Horodecki, P. Horodecki, M. Horodecki and K. Horodecki, Quantum entanglement, Reviews of Modern Physics 81 (2009) 865-942.
 M.A. Nielsen and I.L. Chuang, Quantum computation and quantum information, Cambridge University Press, (2000).
 M. Plesch and V. Bužek, Entagled graph: Bipartite entanglement in multiqubit systems, Physical Review A 67 (2003) 012322, pp. 1-6.
 C. Sabín and G. García-Alcaine, A classification of entanglement in three-qubit systems, The European Physical Journal D 48 (2008) 435-442.
 P. Jakubczyk, Y. Kravets, and D. Jakubczyk, Entanglement of one-magnon Schur-Weyl states, The European Physical Journal D 61 (2011) 507-512.
 L. Assadi and M. Jafarpour, Classification of 4-qubit entagled graph states according to bipartite entanglement, multipartite entanglement and non-local properties,International Journal of Theoretical Physics 55 (2016) 4809-4821.
 R. Diestel, Graph theory, Springer, Heidelberg, (2010).
 M. Hein, J. Eisert and H.J. Briegel, Multiparty entanglement in graph states, Physical Review A69 (2004) 062311, pp. 1-20.
 M. Hein, W. Dur, J. Eisert, R. Raussendorf, M. Van den Nest and H.J. Briegel, Entanglement in graph states and its application, Proc. Int. School Phys. Enrico Fermi. Quantum Computers, Algorithms and Chaos. 162 (2006), pp. 1-115.
 S. Hill and W.K. Wootters, Entanglement of a pair of quantum bits, Physical Review Letters 78 (1997) 5022-5025.
 W.K. Wootters, Entanglement of formation of an arbitrary state of two qubits, Physical Review Letters 80 (1998) 2245-2248.
 A.R.R. Carvalho et al., Decoherence and multipartite entanglement, Physical Review Letters 93 (2004) 230501, 1-4.
 X.N. Zhu and Sh.M. Fei, Lower bound of concurrence for qubit systems,Quantum Information Processing 13 (2014) 815-823.
 X.N. Zhu, M. Li and Sh.M. Fei, A lower bound of concurrence for multipartite quantum systems, Quantum Information Processing 17 (2018) 30-39.
 D.A. Meyer and N.R. Wallach, Global entanglement in multiparticle systems, Journal of Mathematical Physics 43 (2002) 4273-4278.
 P.J. Love, et al., A characterization of global entanglement, Quantum Information Processing 6 (2007) 187-195.
 A.J. Scott, Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions,Physical Review A 69 (2004) 052330, 1-10.