arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0308072quant-phcs.CC
收藏

Computational Complexity Measures of Multipartite Quantum Entanglement

Tomoyuki Yamakami

英文摘要:

We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon the formal treatment of partial separability, we measure the complexity of an entangled quantum state by determining (i) how hard to approximate it from a fixed classical state and (ii) how hard to distinguish it from all partially separable states. We further consider the Kolmogorovian-style descriptive complexity of approximation and distinction of partial entanglement.

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

↑