群关联方案的底层网络上的最优纠缠提供
Optimal Entanglement Provision over Underlying Networks of Group Association Schemes
摘要：
我们研究了对称网络中最优纠缠的产生。所提出的网络是其中连接由组表（换句话说，组关联方案）组织的网络。我们表明，最佳的纠缠可以提供这样的网络通过调整耦合和初始状态。我们发现最佳的初始态是一个简单的局域激发态。此外，我们还得到了位于同一层的顶点对之间纠缠的解析公式，并计算了它们的最佳耦合。对于这些对位于不同的地层两个上限。这些结果也进行了数值检验。
英文摘要：
We investigate creation of optimal entanglement in symmetric networks. The proposed network is one in which the connections are organized by a group table in other words a group association scheme. We show that optimal entanglement can be provided over such networks by adjusting couplings and initial state. We find that the optimal initial state is a simple local excited state. Moreover we obtain an analytic formula for entanglement achievable between vertex pairs located in the same strata and calculate their relevant optimal couplings. For those pairs located in different strata two upper bounds are presented. These results are also checked numerically.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
