arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1302.0709math-phmath.MPmath.PRquant-ph
收藏

随机图态的面积律

Area law for random graph states

Benoit Collins, Ion Nechita, Karol Zyczkowski

摘要:

研究了任意图下多体量子系统的随机纯态。图的每个顶点表示子系统之间的通用相互作用,由根据Haar测度分布的随机酉矩阵描述,而图的每个边缘表示二分的最大纠缠态。对于图的任何分裂成两部分,我们考虑量子系统的相应分区,并计算平均纠缠熵。首先,在特殊情况下,分区不“交叉”的任何顶点的图,我们证明了面积定律是完全满足的。在一般情况下,我们表明,纠缠的熵服从平均面积定律,这一次的校正项,取决于拓扑图和分区。将所得结果应用于具有指定拓扑结构的量子网络中的量子纠缠分布问题。

英文摘要:

Random pure states of multi-partite quantum systems, associated with arbitrary graphs, are investigated. Each vertex of the graph represents a generic interaction between subsystems, described by a random unitary matrix distributed according to the Haar measure, while each edge of the graph represents a bi-partite, maximally entangled state. For any splitting of the graph into two parts we consider the corresponding partition of the quantum system and compute the average entropy of entanglement. First, in the special case where the partition does not "cross" any vertex of the graph, we show that the area law is satisfied exactly. In the general case, we show that the entropy of entanglement obeys an area law on average, this time with a correction term that depends on the topologies of the graph and of the partition. The results obtained are applied to the problem of distribution of quantum entanglement in a quantum network with prescribed topology.

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

↑