Research Article
Entanglement of 9-qubit graph states
@INPROCEEDINGS{10.4108/chinacom.2010.80, author={Sui Yan and Xiao-yu Chen}, title={Entanglement of 9-qubit graph states}, proceedings={5th International ICST Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2011}, month={1}, keywords={entanglement graph states iterative algorithm closest product state}, doi={10.4108/chinacom.2010.80} }- Sui Yan
Xiao-yu Chen
Year: 2011
Entanglement of 9-qubit graph states
CHINACOM
ICST
DOI: 10.4108/chinacom.2010.80
Abstract
The entanglement of graph states can be calculated by adopting Iterative algorithm. The number of inequivalent classes of 9-qubit graph states is 440. All 440 local inequivalent graphs are classified as two categories: graphs with equal upper LOCC entanglement bound and lower bipartite entanglement bound, graphs with unequal bounds. The later may display non-integer entanglement. After determining the entanglement, the closest product state can also be obtained. As for graph states with different entanglement values, the closest product states have different structural characteristics. The precision of iteration algorithm of the entanglement is less than 10^-14.
Copyright © 2010–2024 ICST
