arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0909.1603quant-ph
收藏

图状态的纠缠高达8个量子比特

Entanglement of graph states up to 8 qubits

Xiao-yu Chen

摘要:

在迭代计算中计算了八个量子比特的图态纠缠。纠缠度量可以是纠缠的相对熵、对数鲁棒性或几何度量。将146个局部不等价图分为两类:具有相同的LOCC纠缠上界和二部纠缠下界的图和具有不相等纠缠下界的图。晚五月显示非整数纠缠。纠缠的迭代计算精度小于$10^{-14}$。

英文摘要:

The entanglement of graph states up to eight qubits is calculated in the regime of iteration calculation. The entanglement measures could be the relative entropy of entanglement, the logarithmic robustness or the geometric measure. All 146 local inequivalent graphs are classified as two categories: graphs with identical upper LOCC entanglement bound and lower bipartite entanglement bound, graphs with unequal bounds. The late may displays non-integer entanglement. The precision of iteration calculation of the entanglement is less than $10^{-14}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑