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

SLOCC下多体纠缠的归纳分类

Inductive classification of multipartite entanglement under SLOCC

L. Lamata, J. Leon, D. Salgado, E. Solano

摘要:

我们提出了一个归纳的程序来分类随机局域操作和经典通信(SLOCC)下的N-部纠缠提供这样的分类是已知的N-1量子比特。该方法是基于分析的系数矩阵的状态在任意的产品基础。我们详细说明了这种方法与著名的双和三方系统,获得作为副产品的一个系统的标准,建立一个给定的纯态的纠缠类,而无需资源的任何纠缠措施。一般情况下证明归纳,使我们能够找到一个上限的N-partite纠缠类的数量方面的纠缠类的数量为N-1量子比特。

英文摘要:

We propose an inductive procedure to classify N-partite entanglement under stochastic local operations and classical communication (SLOCC) provided such a classification is known for N-1 qubits. The method is based upon the analysis of the coefficient matrix of the state in an arbitrary product basis. We illustrate this approach in detail with the well-known bi- and tripartite systems, obtaining as a by-product a systematic criterion to establish the entanglement class of a given pure state without resourcing to any entanglement measure. The general case is proved by induction, allowing us to find an upper bound for the number of N-partite entanglement classes in terms of the number of entanglement classes for N-1 qubits.

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

↑