论文标题
通过无限的顺序观察者在量子网络中共享非局部性
Sharing nonlocality in quantum network by unbounded sequential observers
论文作者
论文摘要
最近,研究各种形式的量子相关性,即非局部性,准备背景性,连贯性和纠缠的顺序共享,人们引起了人们的兴趣。在这项工作中,我们探讨了量子网络中非局部性的顺序共享。我们首先考虑两输入双端口场景的最简单情况,该场景具有两个独立的来源和三个方,包括两个边缘政党和一个中央聚会。我们证明,在同时考虑两个边界的共享时,每个边缘派对最多有两个顺序观察者可以共享非局部性。但是,在不对称的情况下,考虑到一个边缘方的共享,我们表明,最多有六个顺序观察者可以在网络中共享非局部性。我们将调查扩展到Star-Network配置中的两输入$ n $局部场景,该配置具有任意$ n $的边缘派对和一个中央聚会。在不对称的情况下,我们证明了网络非局部性可以通过一个边缘派对中无限数量的连续观察者共享,以适当的$ n $值。此外,我们将研究概括为“星际网络配置”中的任意$ m $输入$ n $ local-local方案。我们表明,即使对于任意的$ m $输入方案,非销售量也可以由无限数量的顺序观察者共享。但是,增加输入$ m $,必须采用比两输入案例的边缘派对数量$ n $的数量,以证明共享无限数量的顺序观察者的共享。
Of late, there has been an upsurge of interest in studying the sequential sharing of various forms of quantum correlations, viz., nonlocality, preparation contextuality, coherence, and entanglement. In this work, we explore the sequential sharing of nonlocality in a quantum network. We first consider the simplest case of the two-input bilocality scenario that features two independent sources and three parties, including two edge parties and a central party. We demonstrate that in the symmetric case when the sharing is considered for both the edge parties, the nonlocality can be shared by at most two sequential observers per edge party. However, in the asymmetric case, when the sharing across one edge party is considered, we show that at most, six sequential observers can share the nonlocality in the network. We extend our investigation to the two-input $n$-local scenario in the star-network configuration that features an arbitrary $n$ number of edge parties and one central party. In the asymmetric case, we demonstrate that the network nonlocality can be shared by an unbounded number of sequential observers across one edge party for a suitably large value of $n$. Further, we generalize our study for an arbitrary $m$ input $n$-local scenario in the star-network configuration. We show that even for an arbitrary $m$ input scenario, the nonlocality can be shared by an unbounded number of sequential observers. However, increasing the input $m$, one has to employ more number of edge parties $n$ than that of the two-input case to demonstrate the sharing of an unbounded number of sequential observers.