Title :
Entanglement of 10-qubit graph states
Author :
Chen, Guo-wei ; Chen, Xiao-yu
Author_Institution :
Coll. of Inf. & Electron. Eng., Zhejiang Gongshang Univ., Hangzhou, China
Abstract :
The number of inequivalent classes of 10-qubit graph states is 3132. All 3132 local inequivalent graphs are classified as two categories: graphs with equal bound, graphs with unequal bounds. We will use different methods to calculate the entanglement of graph states of ten qubits for the different categories. For graph states with different entanglement bounds, the closest product states are given, and they have different structural characters.
Keywords :
graph theory; quantum entanglement; 10-qubit graph states; entanglement; local inequivalent graphs; Algorithm design and analysis; Computers; Equations; Iterative algorithm; Iterative methods; Mathematical model; Quantum computing; closest product state; entanglement; graph states; iterative algorithm;
Conference_Titel :
Natural Computation (ICNC), 2010 Sixth International Conference on
Conference_Location :
Yantai, Shandong
Print_ISBN :
978-1-4244-5958-2
DOI :
10.1109/ICNC.2010.5583975
