Yan, Sui and Chen, Xiao-yu (2011) Entanglement of 9-qubit graph states. In: 5th International ICST Conference on Communications and Networking in China.
![[thumbnail of 13013.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "13013.pdf")
PDF
13013.pdf
Download (352kB)
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
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 09:14 |
| Last Modified: | 18 Apr 2026 03:10 |
| URI: | http://eprints.eai.eu/id/eprint/4662 |
Actions (login required)
- View Item