Next Article in Journal
Coherence and Anticoherence Induced by Thermal Fields
Next Article in Special Issue
A Distributed Architecture for Secure Delegated Quantum Computation
Previous Article in Journal
Future Perspectives of Finite-Time Thermodynamics
Previous Article in Special Issue
Quantum Incoherence Based Simultaneously on k Bases
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Quantum Nonlocality in Any Forked Tree-Shaped Network

1
School of Mathematical Science, Shanxi University, Taiyuan 030006, China
2
School of Mathematics and Information Technology, Yuncheng University, Yuncheng 044000, China
3
College of Mathematics, Taiyuan University of Technology, Taiyuan 030024, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Entropy 2022, 24(5), 691; https://doi.org/10.3390/e24050691
Submission received: 7 April 2022 / Revised: 10 May 2022 / Accepted: 11 May 2022 / Published: 13 May 2022
(This article belongs to the Special Issue Quantum Information and Computation)

Abstract

:
In the last decade, much attention has been focused on examining the nonlocality of various quantum networks, which are fundamental for long-distance quantum communications. In this paper, we consider the nonlocality of any forked tree-shaped network, where each node, respectively, shares arbitrary number of bipartite sources with other nodes in the next “layer”. The Bell-type inequalities for such quantum networks are obtained, which are, respectively, satisfied by all ( t n 1 ) -local correlations and all local correlations, where t n denotes the total number of nodes in the network. The maximal quantum violations of these inequalities and the robustness to noise in these networks are also discussed. Our network can be seen as a generalization of some known quantum networks.

1. Introduction

Quantum correlation is one of the main characteristics that distinguishes quantum mechanics from classical mechanics. In the last few decades, quantum nonlocality has been studied extensively both in theory [1,2,3] and experiment [4,5,6]. It is found that quantum nonlocality is a powerful resource in quantum information science, such as secure cryptography [7,8], quantum key distribution [9], randomness certification [10], and distributed computing [11]. Bell inequalities are often used to detect quantum nonlocality [12,13,14]. Violations of Bell inequalities imply the existence of nonlocal correlations.
Different from the usual Bell nonlocality, where entanglement is distributed from one common source, the multi-locality in quantum networks features several independent sources. By performing joint measurements, this leads to stronger correlations throughout the whole network [15], which is fundamental for long-distance quantum communications. Nonlocality of correlations generated in such networks was first observed in a bilocal network [16,17,18]. Later, the authors in [18] obtained the bilocal inequalities for bilocal networks, and the scholars in [19] explicitly examined quantum violations of the bilocal inequalities for pure states and mixed states, respectively. Since then, the nonlocality of various quantum networks were explored, including chain-shaped networks [20], star-shaped networks [21,22,23], triangle networks [24], and other networks in [25,26,27,28,29,30,31,32]. Furthermore, stronger forms of network nonlocality were examined in [33,34,35].
The tree-tensor networks are also important quantum networks. They have wide applications, such as in quantum simulations [36,37,38,39], entanglement transitions [40], and quantum-assisted machine learning [41]. Recently, nonlocal correlations of a special class of tree-tensor networks, so-called “two-forked” tree-shaped networks were studied in [42]. In this network, there are ( 2 n 1 ) parties (nodes) distributed in n “layers” ( n 2 ), where each layer k ( 1 k n ) has 2 k 1 parties, and each party in the layer k shares a source with another party in the layer k 1 and with other two parties in the layer k + 1 . Thus, this network is a ( 2 n 1 ) -partite system with ( 2 n 2 ) independent sources.
The purpose of the present paper is to consider the nonlocality of any forked tree-shaped network. In this tree-shaped network, t n parties are arranged in an n “layer” scenario ( n 2 ) , and the ( k , j ) party in the layer k, respectively, shares a source with another party in the layer k 1 and with other l k j l k ( j 1 ) parties in the layer k + 1 ( 2 k n 1 , j 1 ), where l k 0 = 0 and l k j l k ( j 1 ) is an arbitrary positive integer. Denote the total number of parties in layer k by p k ( k = 1 , 2 , , n ) , satisfying p 1 = 1 . Write t n = p 1 + + p n . Thus, the whole network is a t n -partite system with ( t n 1 ) independent sources. In particular, if l k j l k ( j 1 ) = 2 for all ( k , j ) , this tree-shaped network reduces to the network in [42].
The rest of this paper is organized as follows. In Section 2, we discuss any forked tree-shaped network with t n parties and ( t n 1 ) independent sources. We explicitly examine the nonlocality of the network for the case of n = 3 and generalize the results to arbitrary n 3 . Moreover, the ( t n 1 ) -local inequalities of the networks and quantum violations of the corresponding inequalities for pure states and mixed states are obtained. Besides, we also compare this network with some known quantum network scenarios. Some conclusions are presented in Section 3. The detailed proofs of the main results are provided in Appendix A.

2. Nonlocality in Any Forked Tree-Shaped Network Scenario

In this section, we consider the nonlocality of a general tree-shaped network; see Figure 1.
This general tree-shaped network has n “layers” ( n 2 ), where each layer k has p k parties (nodes) with p 1 = 1 , say Alice k 1 (A k 1 ), ⋯, Alice k p k (A k p k ), 1 k n ; each party A k j in the layer k shares one source with another party in the layer k 1 and with l k j l k ( j 1 ) parties in the layer k + 1 , where l k j l k ( j 1 ) is an arbitrary positive integer, except that l 11 = p 2 > 1 , 1 j p k , 2 k n 1 , and l k 0 = 0 . It is clear that l k p k = p k + 1 , k = 1 , 2 , , n 1 . Write t n = p 1 + p 2 + + p n . Thus, this general tree-shaped quantum network concerns a t n -partite system with t n 1 independent sources. In addition, the t n 1 independent sources S 1 , , S t n 1 are characterized by independent hidden variables λ 1 , , λ t n 1 , respectively. Denote by x i and a i the input and output of party A i ( i = 11 , 21 , , n p n ), respectively.
We say that the correlations in the tree-shaped network of Figure 1 are local if the joint probability distribution satisfies
P ( a 11 , a 21 , , a ( n 1 ) p n 1 , a n 1 , , a n p n | x 11 , x 21 , , x ( n 1 ) p n 1 , x n 1 , , x n p n ) = P ( λ 1 , , λ t n 1 ) [ P ( a 11 | x 11 , λ 1 , , λ p 2 ) P ( a 21 | x 21 , λ 1 , λ p 2 + 1 , , λ p 2 + l 21 ) P ( a ( n 1 ) p n 1 | x ( n 1 ) p n 1 , λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 ) · P ( a n 1 | x n 1 , λ t n 1 ) P ( a n p n | x n p n , λ t n 1 ) ] d λ 1 d λ t n 1 ;
and moreover, if P ( λ 1 , , λ t n 1 ) in Equation (1) can be decomposed into
P ( λ 1 , , λ t n 1 ) = P 1 ( λ 1 ) P t n 1 ( λ t n 1 ) with P i ( λ i ) d λ i = 1 , i = 1 , 2 , , t n 1 ,
then we say that the correlations in the tree-shaped network of Figure 1 are ( t n 1 ) -local. Under the source independence restriction Equation (2), correlations that cannot be decomposed into Equation (1) are said to be non- ( t n 1 ) -local.

2.1. ( t 3 1 ) -Local Network Scenario

If n = 3 in Figure 1, then it reduces to the network of Figure 2.
The network of Figure 2 is a t 3 -partite system with t 3 1 independent sources, where party A 11 shares p 2 sources with parties A 21 , A 22 , ⋯, A 2 p 2 ; party A 2 j shares l 2 j l 2 ( j 1 ) + 1 sources with parties A 11 , A 3 ( l 2 ( j 1 ) + 1 ) , ⋯, A 3 l 2 j , where j = 1 , 2 , , p 2 and l 20 = 0 . Let l 2 p 2 = p 3 , and then, t 3 = 1 + p 2 + p 3 .
To illustrate Figure 2, we give a concrete example. Let p 2 = 2 , p 3 = l 22 = 7 , and l 21 = 3 . Then, we obtain the network of Figure 3, which is a 10-partite system with nine independent sources.
For the case n = 3 , the correlations obtained in the network of Figure 2 are called local if the probability distribution can be decomposed as
P ( a 11 , a 21 , , a 2 p 2 , a 31 , , a 3 p 3 | x 11 , x 21 , , x 2 p 2 , x 31 , , x 3 p 3 ) = d λ 1 d λ t 3 1 P ( λ 1 , , λ t 3 1 ) [ P ( a 11 | x 11 , λ 1 , , λ p 2 ) · P ( a 21 | x 21 , λ 1 , λ p 2 + 1 , , λ p 2 + l 21 ) P ( a 2 p 2 | x 2 p 2 , λ p 2 , λ p 2 + l 2 ( p 2 1 ) + 1 , , λ t 3 1 ) · P ( a 31 | x 31 , λ p 2 + 1 ) P ( a 3 p 3 | x 3 p 3 , λ t 3 1 ) ] ,
and are called ( t 3 1 ) -local if they have a decomposition form of Equation (3) with the additional restriction
P ( λ 1 , λ 2 , , λ t 3 1 ) = P 1 ( λ 1 ) P 2 ( λ 2 ) P t 3 1 ( λ t 3 1 ) .
Here, the output of every party depends on the corresponding input and all connected sources. Correlations that do not meet Equations (3) and (4) are said to be non- ( t 3 1 ) -local.

2.1.1. ( t 3 1 ) -Locality Inequality

In what follows, we consider the case that each party A i ( i = 11 , 21 , , 3 p 3 ) has binary input x i ( { 0 , 1 } ) with binary output a i ( { 0 , 1 } ) , respectively. We develop inequalities that are fulfilled by all probability distributions satisfying Equations (3) and (4), but which may be violated by measuring quantum states distributed in the tree-shaped network of Figure 2.
Theorem 1.
Any ( t 3 1 ) -local correlation in the tree-shaped network of Figure 2 must satisfy the following inequalities:
| I i 1 , , i t 2 , 0 | 1 p 3 + | I j 1 , , j t 2 , 1 | 1 p 3 1 , i 1 , , i t 2 , j 1 , , j t 2 { 0 , 1 } ,
where
I i 1 ( j 1 ) , , i t 2 ( j t 2 ) , k = 1 2 p 3 x 31 , , x 3 p 3 ( 1 ) k l A i 1 ( j 1 ) 11 A i 2 ( j 2 ) 21 A i t 2 ( j t 2 ) 2 p 2 A x 31 31 A x 3 p 3 3 p 3 ,
A x 11 11 A x 21 21 A x 2 p 2 2 p 2 A x 31 31 A x 3 p 3 3 p 3 = a 11 , a 21 , , a 2 p 2 , a 31 , , a 3 p 3 ( 1 ) m P ( a 11 , a 21 , , a 2 p 2 , a 31 , , a 3 p 3 | x 11 , x 21 , , x 2 p 2 , x 31 , , x 3 p 3 ) ,
k { 0 , 1 } , l = x 31 + + x 3 p 3 , m = a 11 + a 21 + + a 2 p 2 + a 31 + + a 3 p 3 , A x 11 11 denotes the observable for binary inputs x 11 of party A 11 , and A x 21 21 , ⋯, A x 2 p 2 2 p 2 , A x 31 31 , ⋯, A x 3 p 3 3 p 3 are similarly defined.
Note that the subscript t 2 in Ineqs. (5) indicates the total number of parties A 11 , A 21 , ⋯, A 2 p 2 . By Theorem 1, we see that violation of Ineqs. (5) for at least one possible ( i 1 , , i t 2 , j 1 , , j t 2 ) guaranteeing the non- ( t 3 1 ) -local nature of the correlations generated by the network of Figure 2. Besides, each of the above 2 2 t 2 inequalities is tight.
To see this, we give an explicit ( t 3 1 ) -local decomposition, which is able to saturate the bound. Consider the following strategy:
P ( a 11 | x 11 , λ 1 , , λ p 2 ) = 1 , if a 11 = λ 1 λ p 2 , 0 , else ,
P ( a 21 | x 21 , λ 1 , λ p 2 + 1 , , λ p 2 + l 21 ) = 1 , if a 21 = ( λ 1 λ p 2 + 1 λ p 2 + l 21 1 ) λ p 2 + l 21 , 0 , else ,
P ( a 2 p 2 | x 2 p 2 , λ p 2 , λ p 2 + l 2 ( p 2 1 ) + 1 , , λ t 3 1 ) = 1 , if a 2 p 2 = ( λ p 2 λ p 2 + l 2 ( p 2 1 ) + 1 λ t 3 2 ) λ t 3 1 , 0 , else ,
P ( a 3 j | x 3 j , λ p 2 + j , τ 3 j ) = 1 , if a 3 j = λ p 2 + j τ 3 j x 3 j , 0 , else , j = 1 , 2 , , p 3 .
Here, λ m are hidden variables of shared sources S m with P m ( λ m = 0 ) = 1 ( m = 1 , 2 , , t 3 1 ) , and τ 3 j are sources of local randomness for party A 3 j with P j ( τ 3 j = 0 ) = r and P j ( τ 3 j = 1 ) = 1 r , r [ 0 , 1 ] ( j = 1 , 2 , , p 3 ). A simple calculation gives I i 1 , , i t 2 , 0 = r p 3 and I j 1 , , j t 2 , 1 = ( 1 r ) p 3 for any i 1 , , i t 2 , j 1 , , j t 2 { 0 , 1 } . Hence, | I i 1 , , i t 2 , 0 | 1 p 3 + | I j 1 , , j t 2 , 1 | 1 p 3 = 1 , reaching the bound for all i 1 , , i t 2 , j 1 , , j t 2 { 0 , 1 } .
As for the nonlocality correlations in the network of Figure 2, we give a set of Bell-type inequalities.
Theorem 2.
Every local correlation in the tree-shaped network of Figure 2 satisfies the following inequalities:
| I i 1 , , i t 2 , 0 | + | I j 1 , , j t 2 , 1 | 1 , i 1 , , i t 2 , j 1 , , j t 2 { 0 , 1 } ,
where I i 1 , , i t 2 , 0 and I j 1 , , j t 2 , 1 are defined as in Theorem 1.
By Theorem 2, the violation of at least one of the 2 2 t 2 Ineqs.(6) guarantees that the corresponding correlations generated by the network are nonlocal. Apparently, the set of ( t 3 1 ) -local correlations is a subset of the set of local correlations in the network of Figure 2.
For the proofs of Theorems 1 and 2, see Appendix A.

2.1.2. Quantum Violations of ( t 3 1 ) -Local Inequalities

Now, we consider the network of Figure 2 involving ( t 3 1 ) independent quantum sources, each generating a bipartite quantum state. Then, the overall quantum state of this network has the form
ρ = ρ A 1 11 A 1 21 ρ A p 2 11 A 1 2 p 2 ρ A 2 21 A 31 ρ A l 21 + 1 21 A 3 l 21 ρ A l 2 p 2 l 2 ( p 2 1 ) + 1 2 p 2 A 3 p 3
with state space H = H A 11 H A 21 H A 2 p 2 H A 31 H A 3 p 3 , where H A 11 = H A 1 11 H A p 2 11 and H A 2 i = H A 1 2 i H A l 2 i l 2 ( i 1 ) + 1 2 i , i = 1 , , p 2 . For simplicity, we write
ρ = ρ A 11 A 21 ρ A 11 A 2 p 2 ρ A 21 A 31 ρ A 21 A 3 l 21 ρ A 2 p 2 A 3 p 3 .
Once each party receives particles from its all-connecting sources, it performs suitable measurement. The resulting joint probability distribution has the form
P ( a 11 , a 21 , , a 2 p 2 , a 31 , , a 3 p 3 | x 11 , x 21 , , x 2 p 2 , x 31 , , x 3 p 3 ) = tr [ ( M a 11 | x 11 M a 21 | x 21 M a 3 p 3 | x 3 p 3 ) ( ρ A 11 A 21 ρ A 11 A 22 ρ A 2 p 2 A 3 p 3 ) ] ,
where M a 11 | x 11 denotes the specific measurement operator of party A 11 corresponding to the measurement choice x 11 with the outcome a 11 , and other measurement operators have similar meanings.
In what follows, we examine quantum violations of the ( t 3 1 ) -local inequalities (5) from pure states and mixed states, respectively.
Non-( t 3 -1)-local correlations from pure states: Firstly, let all ( t 3 1 ) sources produce any pure entangled states. Then, ρ A 11 A 21 can be written in the Schmidt basis as ρ A 11 A 21 = | ψ A 11 A 21 ψ A 11 A 21 | with | ψ A 11 A 21 = b 10 | 00 + b 11 | 11 and b 10 , b 11 > 0 , the normalized two-qubit pure state shared by the parties A 11 and A 21 . Likewise, write ρ A 11 A 2 i = | ψ A 11 A 2 i ψ A 11 A 2 i | , i { 2 , , p 2 } , ρ A 2 j A 3 k j = | ψ A 2 j A 3 k j ψ A 2 j A 3 k j | , j { 1 , 2 , , p 2 } , k j { l 2 ( j 1 ) + 1 , , l 2 j } , where | ψ A 11 A 2 i = b i 0 | 00 + b i 1 | 11 and | ψ A 2 j A 3 k j = c k j 0 | 00 + c k j 1 | 11 are also written in the Schmidt basis with the corresponding positive coefficients.
For party A 11 , take the measurement A 0 11 = k = 1 p 2 σ z k and A 1 11 = k = 1 p 2 σ x k ; for parties A 2 i ( i = 1 , , p 2 ), the corresponding measurement choices are A 0 2 i = k = 1 l 2 i l 2 ( i 1 ) + 1 σ z k and A 1 2 i = k = 1 l 2 i l 2 ( i 1 ) + 1 σ x k . Here, σ z k = σ z and σ x k = σ x for all k are Pauli matrices. Let the settings of all parties A 3 q ( q = 1 , , p 3 ) correspond to any projective measurements in the Z-X plane of the Bloch sphere. Thus, each measurement can be characterized by an angle. Write the observables of A 3 q by A 0 3 q = ( sin α q , 0 , cos α q ) · σ , A 1 3 q = ( sin α q , 0 , cos α q ) · σ , where σ = ( σ x , σ y , σ z ) is the vector of Pauli matrices and α q , α q [ 0 , 2 π ] for all q { 1 , , p 3 } . Note that, if the above Schmidt bases differ from the computational basis, then it would be sufficient to add local unitary rotations to recover the case we discuss here. Then, we have
A 0 11 A 0 21 A 0 2 p 2 A 0 31 A 0 3 p 3 = tr { [ k = 1 p 2 ( σ z k σ z k ) ( σ z A 0 31 ) ( σ z A 0 3 p 3 ) ] · ( ρ A 11 A 21 ρ A 11 A 2 p 2 ρ A 21 A 31 ρ A 2 p 2 A 3 p 3 ) } = i = 1 p 2 tr [ ( σ z σ z ) ρ A 11 A 2 i ] tr [ ( σ z A 0 31 ) ρ A 21 A 31 ] tr [ ( σ z A 0 3 p 3 ) ρ A 2 p 2 A 3 p 3 ] = cos α 1 cos α 2 cos α p 3 .
For any x 31 , x 32 , , x 3 p 3 { 0 , 1 } , we can follow similar calculations as above for A 0 11 A 0 21 A 0 2 p 2 A x 31 31 A x 3 p 3 3 p 3 and A 1 11 A 1 21 A 1 2 p 2 A x 31 31 A x 3 p 3 3 p 3 . Therefore,
I 0 , , 0 , 0 = 1 2 p 3 x 31 , , x 3 p 3 A 0 11 A 0 21 A 0 2 p 2 A x 31 31 A x 3 p 3 3 p 3 = 1 2 p 3 A 0 11 A 0 21 A 0 2 p 2 ( A 0 31 + A 1 31 ) ( A 0 3 p 3 + A 1 3 p 3 ) = 1 2 p 3 ( cos α 1 + cos α 1 ) ( cos α p 3 + cos α p 3 )
and
I 1 , , 1 , 1 = 1 2 p 3 x 31 , , x 3 p 3 ( 1 ) x 31 + + x 3 p 3 A 1 11 A 1 21 A 1 2 p 2 A x 31 31 A x 3 p 3 3 p 3 = 1 2 p 3 A 1 11 A 1 21 A 1 2 p 2 ( A 0 31 A 1 31 ) ( A 0 3 p 3 A 1 3 p 3 ) = 1 2 p 3 Δ ( sin α 1 sin α 1 ) ( sin α p 3 sin α p 3 ) ,
where Δ = b ( 1 ) b ( p 2 ) c ( 1 ) c ( p 3 ) > 0 , b ( i ) = 2 b i 0 b i 1 , i { 1 , , p 2 } , c ( q ) = 2 c q 0 c q 1 , q { 1 , , p 3 } . Consequently,
S ( t 3 1 ) local = | I 0 , , 0 , 0 | 1 p 3 + | I 1 , , 1 , 1 | 1 p 3 = 1 2 | ( cos α 1 + cos α 1 ) ( cos α p 3 + cos α p 3 ) | 1 p 3 + 1 2 | Δ ( sin α 1 sin α 1 ) ( sin α p 3 sin α p 3 ) | 1 p 3 .
Write S ( t 3 1 ) local = f ( α 1 , α 1 , , α p 3 , α p 3 ) . To derive the maximum of differentiable function f ( α 1 , α 1 , , α p 3 , α p 3 ) , we calculate all the partial derivatives f α i = 0 , f α i = 0 for i = 1 , 2 , , p 3 . It follows that the extremal points of f must satisfy the conditions α i = α i and | tan α i | = Δ 1 / p 3 ( i = 1 , 2 , , p 3 ). These force | cos α i | = | cos α i | = 1 1 + Δ 2 / p 3 and | sin α i | = | sin α i | = Δ 1 / p 3 1 + Δ 2 / p 3 , i = 1 , 2 , , p 3 . Therefore, the value of f at these extremal points is | cos α 1 | + Δ 1 / p 3 | sin α 1 | = 1 + Δ 2 / p 3 . Comparing this value with the values of f at all boundary points, it is easily seen that the maximum of S ( t 3 1 ) local is
S ( t 3 1 ) local max = 1 + Δ 2 / p 3 > 1 .
Notice that tr [ ( σ z σ x ) ρ i ] = tr [ ( σ x σ z ) ρ i ] = 0 hold for all i = A 11 A 21 , , A 2 p 2 A 3 p 3 . Thus, other possible nonzero terms for | I i 1 , , i t 2 , 0 | 1 p 3 + | I j 1 , , j t 2 , 1 | 1 p 3 are | I 0 , , 0 , 0 | 1 p 3 + | I 0 , , 0 , 1 | 1 p 3 , | I 1 , , 1 , 0 | 1 p 3 + | I 1 , , 1 , 1 | 1 p 3 , and | I 1 , , 1 , 0 | 1 p 3 + | I 0 , , 0 , 1 | 1 p 3 . However, by similar discussions to the above, one can obtain that these three values are less than 1.
Hence, if all ( t 3 1 ) sources in the network of Figure 2 emit pure entangled states, they necessarily violate the ( t 3 1 ) -local inequalities (5) and, thus, generate non- ( t 3 1 ) -local correlations.
Non-( t 3 -1)-local correlations from mixed states: Now, we consider the case that all the sources in the network of Figure 2 produce any mixed states.
Assume that the state ρ A 11 A 21 shared by the parties A 11 and A 21 is a mixed state. Then, it has the following form:
ρ A 11 A 21 = 1 4 ( I I + r A 11 · σ I + I r A 21 · σ + i , j t i j A 11 A 21 σ i σ j ) ,
where σ = ( σ x , σ y , σ z ) , r A 11 ( r A 21 ) represents the Bloch vector of the reduced state of subsystem A 11 (A 21 ), and T A 11 A 21 = ( t i j A 11 A 21 ) with i , j { x , y , z } is the correlation matrix. By the polar decomposition, the correlation matrix T A 11 A 21 can be written as T A 11 A 21 = U A 11 A 21 R A 11 A 21 , where U A 11 A 21 is a unitary matrix and R A 11 A 21 = ( T A 11 A 21 ) T A 11 A 21 0 . Denote by τ 1 A 11 A 21 τ 2 A 11 A 21 τ 3 A 11 A 21 0 the three non-negative eigenvalues of R A 11 A 21 .
For the other mixed states ρ A 11 A 22 , , ρ A 11 A 2 p 2 , ρ A 21 A 31 , , ρ A 2 p 2 A 3 p 3 , shared by the corresponding parties, they also have similar expressions to that of ρ A 11 A 21 , and the corresponding matrices and the eigenvalues are, respectively, represented as
R A 11 A 2 i = ( T A 11 A 2 i ) T A 11 A 2 i , τ 1 A 11 A 2 i τ 2 A 11 A 2 i τ 3 A 11 A 2 i 0 ,
R A 2 j A 3 k j = ( T A 2 j A 3 k j ) T A 2 j A 3 k j , τ 1 A 2 j A 3 k j τ 2 A 2 j A 3 k j τ 3 A 2 j A 3 k j 0 ,
where i { 1 , 2 , , p 2 } , k j { l 2 ( j 1 ) + 1 , , l 2 j } , and j { 1 , 2 , , p 2 } .
Suppose that party A 11 performs measurements A 0 11 = k = 1 p 2 σ z k , A 1 11 = k = 1 p 2 σ x k . We consider the Z and X Bloch directions (on the first subsystem of party A 11 , connected to the first subsystem of party A 21 ) given by the eigenvectors of the matrix R A 11 A 21 corresponding to the two largest eigenvalues τ 1 A 11 A 21 and τ 2 A 11 A 21 , respectively [19]. Similarly, we use R A 11 A 2 i for aligning the ith subsystem of A 11 , connected to the first subsystem of A 2 i , i = 2 , , p 2 . Note that the Z and X axes used by the parties A 11 and A 2 i ( i = 1 , , p 2 ) may be different from each other. In this case, party A 11 can perform different unitary transformations to the p 2 qubits she/he shares with A 21 , ⋯, A 2 p 2 before performing the measurements. Likewise, we may assume the party A 2 i ( i = 1 , , p 2 ) has measurement choices A 0 2 i = k = 1 l 2 i l 2 ( i 1 ) + 1 σ z k and A 1 2 i = k = 1 l 2 i l 2 ( i 1 ) + 1 σ x k . For party A 3 q ( q = 1 , , p 3 ), he/she performs projective measurements on the Z and X Bloch directions, which are composed of the two eigenvectors with largest eigenvalues of the connected matrix R A 2 j q A 3 q ( 1 j q p 2 ). That is, A 0 3 q = c q · σ and A 1 3 q = c q · σ , where c q = ( sin β q , 0 , cos β q ) , c q = ( sin β q , 0 , cos β q ) , β q , β q [ 0 , 2 π ] .
Now, we have
I 0 , , 0 , 0 = 1 2 p 3 x 31 , , x 3 p 3 A 0 11 A 0 21 A 0 2 p 2 A x 31 31 A x 3 p 3 3 p 3 = 1 2 p 3 A 0 11 A 0 21 A 0 2 p 2 ( A 0 31 + A 1 31 ) ( A 0 3 p 3 + A 1 3 p 3 ) = 1 2 p 3 ( k = 1 p 2 σ z k ) ( k = 1 l 21 + 1 σ z k ) ( k = 1 l 2 p 2 l 2 ( p 2 1 ) + 1 σ z k ) [ ( c 1 + c 1 ) · σ ] [ ( c p 3 + c p 3 ) · σ ] = 1 2 p 3 tr { [ ( k = 1 p 2 ( σ z k σ z k ) ) ( σ z ( c 1 + c 1 ) · σ ) ( σ z ( c p 3 + c p 3 ) · σ ) ] · ( ρ A 11 A 21 ρ A 11 A 2 p 2 ρ A 21 A 31 ρ A 2 p 2 A 3 p 3 ) } = 1 2 p 3 tr [ ( σ z σ z ) ρ A 11 A 21 ] tr [ ( σ z σ z ) ρ A 11 A 2 p 2 ] tr [ ( σ z ( c 1 + c 1 ) · σ ) ρ A 21 A 31 ] tr [ ( σ z ( c p 3 + c p 3 ) · σ ) ρ A 2 p 2 A 3 p 3 ] = 1 2 p 3 τ 1 A 11 A 21 τ 1 A 11 A 2 p 2 τ 1 A 21 A 31 τ 1 A 2 p 2 A 3 p 3 j = 1 p 3 ( cos β j + cos β j )
and
I 1 , , 1 , 1 = 1 2 p 3 x 31 , , x 3 p 3 ( 1 ) x 31 + + x 3 p 3 A 1 11 A 1 21 A 1 2 p 2 A x 31 31 A x 3 p 3 3 p 3 = 1 2 p 3 A 1 11 A 1 21 A 1 2 p 2 ( A 0 31 A 1 31 ) ( A 0 3 p 3 A 1 3 p 3 ) = 1 2 p 3 τ 2 A 11 A 21 τ 2 A 11 A 2 p 2 τ 2 A 21 A 31 τ 2 A 2 p 2 A 3 p 3 j = 1 p 3 ( sin β j sin β j ) ,
and so
S ( t 3 1 ) local = | I 0 , , 0 , 0 | 1 p 3 + | I 1 , , 1 , 1 | 1 p 3 = 1 2 ( τ 1 A 11 A 21 τ 1 A 11 A 2 p 2 τ 1 A 21 A 31 τ 1 A 2 p 2 A 3 p 3 ) 1 2 p 3 | j = 1 p 3 ( cos β j + cos β j ) | 1 p 3 + 1 2 ( τ 2 A 11 A 21 τ 2 A 11 A 2 p 2 τ 2 A 21 A 31 τ 2 A 2 p 2 A 3 p 3 ) 1 2 p 3 | j = 1 p 3 ( sin β j sin β j | 1 p 3 .
A calculation gives the maximum
S ( t 3 1 ) local max = i = 1 2 ( τ i A 11 A 21 τ i A 11 A 2 p 2 τ i A 21 A 31 τ i A 2 p 2 A 3 p 3 ) 1 p 3 .
The detailed proof for Equation (8) is in Appendix A.
It is easily verified that the above Equation (8) reduces to Equation (7) for the case of pure states discussed in the above. In fact, for pure states, we have τ 1 A 11 A 21 = = τ 1 A 11 A 2 p 2 = τ 1 A 21 A 31 = = τ 1 A 2 p 2 A 3 p 3 = 1 and τ 2 A 11 A 21 = ( b ( 1 ) ) 2 , ⋯, τ 2 A 11 A 2 p 2 = ( b ( p 2 ) ) 2 , τ 2 A 21 A 31 = ( c ( 1 ) ) 2 , ⋯, τ 2 A 2 p 2 A 3 p 3 = ( c ( p 3 ) ) 2 , which implies that Equation (8) can be reduced to Equation (7).
From Equation (8), S ( t 3 1 ) local max > 1 implies that these states violate the ( t 3 1 ) -locality inequalities (5). Since all these eigenvalues τ i A 11 A 21 , , τ i A 2 p 2 A 3 p 3 ( i = 1 , 2 ) belong to [ 0 , 1 ] ([23] Lemma 3), by [21] Lemma 1, Equation (8) implies
S ( t 3 1 ) local max i = 1 2 ( τ i A 11 A 21 τ i A 11 A 2 p 2 τ i A 21 A 31 τ i A 2 p 2 A 3 p 3 ) 1 p 2 + p 3 ( τ 1 A 11 A 21 + τ 2 A 11 A 21 τ 1 A 11 A 2 p 2 + τ 2 A 11 A 2 p 2 τ 1 A 21 A 31 + τ 2 A 21 A 31 τ 1 A 2 p 2 A 3 p 3 + τ 2 A 2 p 2 A 3 p 3 ) 1 p 2 + p 3 ( S A 11 A 21 max S A 11 A 2 p 2 max S A 21 A 31 max S A 2 p 2 A 3 p 3 max ) 1 p 2 + p 3 ,
where the expressions S X Y max = τ 1 X Y + τ 2 X Y represent the maximal CHSH value for the corresponding state ρ X Y by the Horodecki criterion in [43]. From the above inequality, we know that once the states altogether violate the ( t 3 1 ) -locality inequalities, at least one of these states necessarily violates the CHSH inequality. However, for each state violating the CHSH inequality, this does not imply that it necessarily violates the ( t 3 1 ) -locality inequalities. We illustrate this case by the specific network of Figure 3. For example, let nine sources in Figure 3 all produce the following state:
ρ = 3 4 | ψ ψ | + 1 20 ( | ψ + ψ + | + I ) = 0.05 0 0 0 0 0.45 0.35 0 0 0.35 0.45 0 0 0 0 0.05 ,
where | ψ ± = ( | 01 ± | 10 ) / 2 . It is easily obtained that τ 1 = 0.64 and τ 2 = 0.49 . For this single state, the maximal CHSH value is S max 1.06 > 1 . However, through distributing nine copies of this state in the network of Figure 3, the maximal value of the corresponding nine-local inequality is S 9 local max 0.98 < 1 .
Remark 1.
To achieve the maximal quantum violation of the ( t 3 1 ) -local correlation inequalities (5), all possible quantum measurements should be considered. However, this is almost impossible because the calculation is very difficult and complicated. Therefore, for the network of Figure 2, we take separable measurements for parties A 1 j and A 2 j and any measurements for parties A 3 j . In this quantum strategy, the maximal violation S ( t 3 1 ) local max is obtained, which gives a sufficient condition that S ( t 3 1 ) local max > 1 ensures that the state ρ violates the inequality (5) and, thus, is non- ( t 3 1 ) -local. Of course, there are other strategies of the measurement choices that are computable, and some of them may be better than our strategy, though we have not discovered them yet. This is an interesting problem that is worth being explored later.

2.1.3. Resistance to White Noise

Now, suppose that each source S i ( i = 1 , , t 3 1 ) in Figure 2 produces Bell state | ϕ + = ( | 00 + | 11 ) / 2 with white noise of probability 1 v i . Then, the state it actually produces is the Werner state of the form
ρ i ( v i ) = v i | ϕ + ϕ + | + ( 1 v i ) I 4 .
Let the input of party A 11 be { A 0 11 = k = 1 p 2 σ z k , A 1 11 = k = 1 p 2 σ x k } . For party A 2 j ( j = 1 , , p 2 ), the measurement choices are { A 0 2 j = k = 1 l 2 j l 2 ( j 1 ) + 1 σ z k , A 1 2 j = k = 1 l 2 j l 2 ( j 1 ) + 1 σ x k } . Suppose the inputs of each party A 3 q ( q = 1 , 2 , , p 3 ) are measurements { A 0 3 q = ( σ z + σ x ) / 2 , A 1 3 q = ( σ z σ x ) / 2 } . Denoting by V = i = 1 t 3 1 v i as the overall visibility, we obtain I 0 , , 0 , 0 = ( 1 2 ) p 3 V , I 1 , , 1 , 1 = ( 1 2 ) p 3 V , and so,
| I 0 , , 0 , 0 | 1 p 3 + | I 1 , , 1 , 1 | 1 p 3 = 2 V 1 / p 3 .
That is to say, V > ( 1 2 ) p 3 implies non- ( t 3 1 ) -local correlations. Assuming that all the ( t 3 1 ) sources emit states with the same noise parameter v i = v , we thus see that a single source necessarily satisfies v > ( 1 2 ) p 3 t 3 1 , which is a little greater than v > 1 2 for the Werner state to violate the CHSH inequality.

2.2. ( t n 1 ) -Local Network Scenario

In this subsection, we consider the nonlocality of the general tree-shaped network of Figure 1. With similar arguments, if each party A i ( i = 11 , 21 , , n p n ) has binary input x i ( { 0 , 1 } ) with binary output a i ( { 0 , 1 } ) , then we obtain the following results for any n 2 .
Theorem 3.
All ( t n 1 ) -local correlations generated by the tree-shaped network of Figure 1 necessarily satisfy the following inequalities:
| I i 1 , , i t n 1 , 0 | 1 p n + | I j 1 , , j t n 1 , 1 | 1 p n 1 , i 1 , , i t n 1 , j 1 , , j t n 1 { 0 , 1 } ;
and the corresponding local correlations satisfy the following inequalities:
| I i 1 , , i t n 1 , 0 | + | I j 1 , , j t n 1 , 1 | 1 , i 1 , , i t n 1 , j 1 , , j t n 1 { 0 , 1 } .
where for k { 0 , 1 } ,
I i 1 ( j 1 ) , , i t n 1 ( j t n 1 ) , k = 1 2 p n x n 1 , , x n p n ( 1 ) k · ( x n 1 + + x n p n ) A i 1 ( j 1 ) 11 A i t n 1 ( j t n 1 ) ( n 1 ) p n 1 A x n 1 n 1 A x n p n n p n ,
A x 11 11 A x ( n 1 ) p n 1 ( n 1 ) p n 1 A x n 1 n 1 A x n p n n p n = a 11 , , a n p n ( 1 ) m P ( a 11 , , a ( n 1 ) p n 1 , a n 1 , , a n p n | x 11 , , x ( n 1 ) p n 1 , x n 1 , , x n p n ) ,
m = a 11 + + a n p n , and A x i i denotes the observable for binary inputs x i of party A i , i = 11 , 21 , 22 , , n p n .
Note that the subscript t n 1 in Ineqs. (9) and (10) represents the total number of parties A 11 , A 21 , ⋯, A 2 p 2 , ⋯, A ( n 1 ) 1 , ⋯, A ( n 1 ) p n 1 . In particular, if n = 3 , then Inequalities (9) and (10) reduce to Inequalities (5) and (6), respectively. By Theorem 3, violating Inequalities (9) for at least one possible ( i 1 , , i t n 1 , j 1 , , j t n 1 ) implies the non- ( t n 1 ) -local nature of the general tree-shaped networks in Figure 1. The proof of Theorem 3 is provided in Appendix A.
Next, assume that all sources in Figure 1 produce pure entangled states | ψ i ψ i | , | ψ i = b i 0 | 00 + b i 1 | 11 , written in the Schmidt basis, with positive coefficients b i 0 and b i 1 , i = 1 , 2 , , t n 1 . Let the measurements of A 11 be { A 0 11 = k = 1 p 2 σ z k , A 1 11 = k = 1 p 2 σ x k } . For parties A i j with i = 2 , 3 , , n 1 and j = 1 , 2 , , p i , they have the same measurement choices { A 0 i j = k = 1 l i j l i ( j 1 ) + 1 σ z k , A 1 i j = k = 1 l i j l i ( j 1 ) + 1 σ x k } . Here, σ z k = σ z and σ x k = σ z for any k. For the parties A n q ( q = 1 , 2 , , p n ), they perform projective measurements denoted by { A 0 n q = ( sin α q , 0 , cos α q ) · σ , A 1 n q = ( sin α q , 0 , cos α q ) · σ } , where α q , α q [ 0 , 2 π ] . With similar arguments to that of Equation (7), one obtains I 0 , , 0 , 0 = 1 2 p n ( cos α 1 + cos α 1 ) ( cos α p n + cos α p n ) and I 1 , , 1 , 1 = 1 2 p n Δ ( sin α 1 sin α 1 ) ( sin α p n sin α p n ) , where
Δ = b ( 1 ) b ( 2 ) b ( t n 1 ) > 0 ,
b ( i ) = 2 b i 0 b i 1 , i = 1 , 2 , , t n 1 . Therefore, the maximum of S ( t n 1 ) local = | I 0 , , 0 , 0 | 1 p n + | I 1 , , 1 , 1 | 1 p n is
S ( t n 1 ) local max = 1 + Δ 2 / p n > 1 .
That is to say, all pure entangled states distributed in the network of Figure 1 indicate the non- ( t n 1 ) -local correlations.
Finally, we consider that all sources in Figure 1 produce any mixed states ρ i , i = 1 , 2 , , t n 1 . Let T i be the correlation matrix of ρ i and τ 1 ( i ) , τ 2 ( i ) the two larger non-negative eigenvalues of ( T i ) T i , i = 1 , 2 , , t n 1 . Let party A 11 perform measurements { A 0 11 = k = 1 p 2 σ z k , A 1 11 = k = 1 p 2 σ x k } ; party A i j perform measurements { A 0 i j = k = 1 l i j l i ( j 1 ) + 1 σ z k , A 1 i j = k = 1 l i j l i ( j 1 ) + 1 σ x k } ( i = 2 , 3 , , n 1 , j = 1 , 2 , , p i ); and party A n q have measurement choices { A 0 n q = ( sin β q , 0 , cos β q ) · σ , A 1 n q = ( sin β q , 0 , cos β q ) · σ } with β q , β q [ 0 , 2 π ] ( q = 1 , 2 , , p n ). By calculations, we obtain
I 0 , , 0 , 0 = 1 2 p n τ 1 ( 1 ) τ 1 ( 2 ) τ 1 ( 3 ) τ 1 ( t n 1 ) i = 1 p n ( cos β i + cos β i )
and
I 1 , , 1 , 1 = 1 2 p n τ 2 ( 1 ) τ 2 ( 2 ) τ 2 ( 3 ) τ 2 ( t n 1 ) i = 1 p n ( sin β i sin β i ) .
Following the analogous proof process of Equation (8), we have that the maximal value of S ( t n 1 ) local = | I 0 , , 0 , 0 | 1 p n + | I 1 , , 1 , 1 | 1 p n is
S ( t n 1 ) local max = ( τ 1 ( 1 ) τ 1 ( 2 ) τ 1 ( 3 ) τ 1 ( t n 1 ) ) 1 / ( p n ) + ( τ 2 ( 1 ) τ 2 ( 2 ) τ 2 ( 3 ) τ 2 ( t n 1 ) ) 1 / ( p n ) .
When n = 3 , Equations (11) and (12) reduce to Equations (7) and (8). By Equation (12), S ( t n 1 ) local max > 1 implies the non- ( t n 1 ) -local correlations.
Besides, if all sources in Figure 1, respectively, distribute Werner states with visibilities v 1 , v 2 , , v t n 1 , then we take the inputs of A 11 { A 0 11 = k = 1 p 2 σ z k , A 1 11 = k = 1 p 2 σ x k } ; the inputs of A i j   { A 0 i j = k = 1 l i j l i ( j 1 ) + 1 σ z k , A 1 i j = k = 1 l i j l i ( j 1 ) + 1 σ x k } ( i = 2 , 3 , , n 1 , j = 1 , 2 , , p i ); and the inputs of A n q   { A 0 n q = ( σ z + σ x ) / 2 , A 1 n q = ( σ z σ x ) / 2 } . Let the overall visibility be V = i = 1 t n 1 v i . A calculation gives I 0 , , 0 , 0 = ( 1 2 ) p n V and I 1 , , 1 , 1 = ( 1 2 ) p n V , and so,
| I 0 , , 0 , 0 | 1 p n + | I 1 , , 1 , 1 | 1 p n = 2 V 1 / p n .
Hence, if V > ( 1 2 ) p n , then the inequalities (9) will be violated, demonstrating non- ( t n 1 ) -local correlations in Figure 1.

2.3. Comparing Any Forked Tree-Shaped Network with Other Networks

In this subsection, we discuss the relationships of multi-local inequalities between any forked tree-shaped network of Figure 1 and a bilocal network, chain-shaped network, star-shaped network, and two-forked tree-shaped network.
In fact, when n = 2 and p 2 = 2, the network of Figure 1 reduces to a bilocal network and the ( t n -1)-local Ineq. (5) reduces to the bilocal Ineq. (20) in [18]. When p 2 = = p n = 2 , the network of Figure 1 reduces to the chain-shaped network and Ineq. (5) reduces to the (2n−2)-local Ineq. (16) in [20]. When n = 2, the network of Figure 1 reduces to a star-shaped network and Ineq. (5) reduces to the p 2 -local Ineq. (7) in [21]. Moreover, if l k j l k ( j 1 ) = 2 holds for any ( k , j ), then the network of Figure 1 reduces to a two-forked tree-shaped network and Ineq. (5) reduces to the ( 2 n 2 )-local Ineq. (16) in [42]. See Table 1. Therefore, from this point of view, any forked tree-shaped network can be seen as a generalization of these networks.

3. Discussions

In this work, we discussed the nonlocality of a kind of important quantum network: any forked tree-shaped network, in which each node, respectively, shares an arbitrary number of bipartite sources with other nodes in the next “layer”. This network contains ( t n 1 ) independent bipartite sources and t n noninteracting parties ( n 2 ). The “two-forked” tree-shaped networks discussed in [42] are special tree-shaped networks. In addition, if n = 2 , the networks are in fact the p 2 -local star networks introduced in [21]. If p 2 = = p n = 2 , the networks are reduced to the chain networks introduced in [20]. We gave a detailed discussion for the case of n = 3 , i.e., a tree-shaped network scenario with t 3 particles and ( t 3 1 ) independent sources. Concretely, we gave the inequalities satisfied by all ( t 3 1 ) -local correlations, proved that all pure entangled states violate these ( t 3 1 ) -local inequalities, obtained a necessary condition for mixed states to violate these inequalities, and explored the relation between the ( t 3 1 ) -locality correlation and locality correlation in this quantum network. Finally, we generalized these results to the general t n -partite tree-shaped networks. Note that the tree-shaped networks examined here just involve bipartite quantum states. The nonlocality of tree-shaped networks with multipartite states deserves further research.

Author Contributions

Conceptualization, L.Y. and X.Q.; methodology, X.Q. and J.H.; formal analysis, L.Y.; writing—original draft preparation, L.Y.; writing—review and editing, X.Q. and J.H.; visualization, L.Y.; supervision, X.Q.; project administration, X.Q. and J.H. All authors have read and agreed to the published version of the manuscript.

Funding

This work is partially supported by the National Natural Science Foundation of China (12171290, 12071336) and Fund Program for the Scientific Activities of Selected Returned Overseas Professionals in Shanxi Province (20200011).

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

To prove Theorem 1, the following lemma is needed.
Lemma A1
([21] Lemma 1). Assume that x i k are non-negative real numbers, i = 1 , 2 , , n , and k = 1 , 2 , , m . Then,
k = 1 m ( i = 1 n x i k ) 1 / n i = 1 n ( k = 1 m x i k ) 1 / n .
Proof of Theorem 1. 
By the assumption, all joint probability distributions have a ( t 3 1 ) -local decomposition form satisfying Equations (3) and (4). Firstly, take i 1 = = i t 2 = j 1 = = j t 2 = 0 . Then,
I 0 , , 0 , 0 = 1 2 p 3 x 31 , , x 3 p 3 A 0 11 A 0 21 A 0 2 p 2 A x 31 31 A x 3 p 3 3 p 3
and
I 0 , , 0 , 1 = 1 2 p 3 x 31 , , x 3 p 3 ( 1 ) x 31 + + x 3 p 3 A 0 11 A 0 21 A 0 2 p 2 A x 31 31 A x 3 p 3 3 p 3 .
Write
A x 11 11 λ 1 , , λ p 2 = a 11 ( 1 ) a 11 P ( a 11 | x 11 , λ 1 , , λ p 2 ) ,
A x 21 21 λ 1 , λ p 2 + 1 , , λ p 2 + l 21 = a 21 ( 1 ) a 21 P ( a 21 | x 21 , λ 1 , λ p 2 + 1 , , λ p 2 + l 21 ) ,
A x 2 p 2 2 p 2 λ p 2 , λ p 2 + l 2 ( p 2 1 ) + 1 , , λ t 3 1 = a 2 p 2 ( 1 ) a 2 p 2 P ( a 2 p 2 | x 2 p 2 , λ p 2 , λ p 2 + l 2 ( p 2 1 ) + 1 , , λ t 3 1 ) ,
A x 3 j 3 j λ p 2 + j = a 3 j ( 1 ) a 3 j P ( a 3 j | x 3 j , λ p 2 + j ) , j = 1 , , p 3 .
By Equations (3) and (4) and the facts that | A 0 11 λ 1 , , λ p 2 | 1 , | A 0 21 λ 1 , λ p 2 + 1 , , λ p 2 + l 21 | 1 , ⋯, | A 0 2 p 2 λ p 2 , λ p 2 + l 2 ( p 2 1 ) + 1 , , λ t 3 1 | 1 , we have
| I 0 , , 0 , 0 | = 1 2 p 3 | P 1 ( λ 1 ) P t 3 1 ( λ t 3 1 ) A 0 11 λ 1 , , λ p 2 A 0 21 λ 1 , λ p 2 + 1 , , λ p 2 + l 21 · A 0 2 p 2 λ p 2 , λ p 2 + l 2 ( p 2 1 ) + 1 , , λ t 3 1 j = 1 p 3 ( A 0 3 j λ p 2 + j + A 1 3 j λ p 2 + j ) d λ 1 d λ t 3 1 | 1 2 p 3 P 1 ( λ 1 ) P t 3 1 ( λ t 3 1 ) | A 0 11 λ 1 , , λ p 2 | | A 0 21 λ 1 , λ p 2 + 1 , , λ p 2 + l 21 | · | A 0 2 p 2 λ p 2 , λ p 2 + l 2 ( p 2 1 ) + 1 , , λ t 3 1 | j = 1 p 3 | A 0 3 j λ p 2 + j + A 1 3 j λ p 2 + j | d λ 1 d λ t 3 1 1 2 p 3 P 1 ( λ 1 ) P t 3 1 ( λ t 3 1 ) j = 1 p 3 | A 0 3 j λ p 2 + j + A 1 3 j λ p 2 + j | d λ 1 d λ t 3 1 = j = 1 p 3 P p 2 + j ( λ p 2 + j ) | A 0 3 j λ p 2 + j + A 1 3 j λ p 2 + j | d λ p 2 + j 2 .
Similarly, one has
| I 0 , , 0 , 1 | j = 1 p 3 P p 2 + j ( λ p 2 + j ) | A 0 3 j λ p 2 + j A 1 3 j λ p 2 + j | d λ p 2 + j 2 .
By Lemma A1, we can obtain
| I 0 , , 0 , 0 | 1 p 3 + | I 0 , , 0 , 1 | 1 p 3 j = 1 p 3 [ P p 2 + j ( λ p 2 + j ) ( | A 0 3 j λ p 2 + j + A 1 3 j λ p 2 + j | 2 + | A 0 3 j λ p 2 + j A 1 3 j λ p 2 + j | 2 ) d λ p 2 + j ] 1 p 3 = j = 1 p 3 [ P p 2 + j ( λ p 2 + j ) max { | A 0 3 j λ p 2 + j | , | A 1 3 j λ p 2 + j | } d λ p 2 + j ] 1 p 3 1 .
With similar discussions, Inequality (5) also holds for any other values of i 1 , ⋯, i t 2 , j 1 , ⋯, j t 2 ( { 0 , 1 } ) . □
Proof of Theorem 2. 
For any i 1 , , i t 2 , j 1 , , j t 2 { 0 , 1 } , we can obtain
I i 1 , , i t 2 , 0 = 1 2 p 3 A i 1 11 A i 2 21 A i t 2 2 p 2 ( A 0 31 + A 1 31 ) ( A 0 3 p 3 + A 1 3 p 3 )
and
I j 1 , , j t 2 , 1 = 1 2 p 3 A j 1 11 A j 2 21 A j t 2 2 p 2 ( A 0 31 A 1 31 ) ( A 0 3 p 3 A 1 3 p 3 ) .
Here, we use similar symbols as those in the proof of Theorem 1. Note that | A i 1 ( j 1 ) 11 λ 1 , , λ p 2 | 1 , | A i 2 ( j 2 ) 21 λ 1 , λ p 2 + 1 , , λ p 2 + l 21 | 1 , ⋯, | A i t 2 ( j t 2 ) 2 p 2 λ p 2 , λ p 2 + l 2 ( p 2 1 ) + 1 , , λ t 3 1 | 1 . By Equation (3) and a similar discussion to that in the proof of Theorem 1, we have
| I i 1 , , i t 2 , 0 | 1 2 p 3 P ( λ 1 , , λ t 3 1 ) j = 1 p 3 | A 0 3 j λ p 2 + j + A 1 3 j λ p 2 + j | d λ 1 d λ t 3 1
and
| I j 1 , , j t 2 , 1 | 1 2 p 3 P ( λ 1 , , λ t 3 1 ) j = 1 p 3 | A 0 3 j λ p 2 + j A 1 3 j λ p 2 + j | d λ 1 d λ t 3 1 .
Consequently,
| I i 1 , , i t 2 , 0 | + | I j 1 , , j t 2 , 1 | 1 2 p 3 P ( λ 1 , , λ t 3 1 ) j = 1 p 3 ( | A 0 3 j λ p 2 + j + A 1 3 j λ p 2 + j | + | A 0 3 j λ p 2 + j A 1 3 j λ p 2 + j | ) · d λ 1 d λ t 3 1 = P ( λ 1 , , λ t 3 1 ) j = 1 p 3 max { | A 0 3 j λ p 2 + j | , | A 1 3 j λ p 2 + j | } d λ 1 d λ t 3 1 1 .
Proof of Equation (8). 
Note that
S ( t 3 1 ) local = | I 0 , , 0 , 0 | 1 p 3 + | I 1 , , 1 , 1 | 1 p 3 = 1 2 ( τ 1 A 11 A 21 τ 1 A 11 A 2 p 2 τ 1 A 21 A 31 τ 1 A 2 p 2 A 3 p 3 ) 1 2 p 3 | j = 1 p 3 ( cos β j + cos β j ) | 1 p 3 + 1 2 ( τ 2 A 11 A 21 τ 2 A 11 A 2 p 2 τ 2 A 21 A 31 τ 2 A 2 p 2 A 3 p 3 ) 1 2 p 3 | j = 1 p 3 ( sin β j sin β j | 1 p 3 .
For convenience, write f ( β 1 , β 1 , , β p 3 , β p 3 ) = S ( t 3 1 ) local . To maximize the function f, calculating all the partial derivatives β j f = β j f = 0 for j , j { 1 , 2 , , p 3 } , one obtains that the extreme points of f must satisfy
β j = β j and | tan β j | = ( τ 2 A 11 A 21 τ 2 A 11 A 2 p 2 τ 2 A 21 A 31 τ 2 A 2 p 2 A 3 p 3 ) 1 2 p 3 ( τ 1 A 11 A 21 τ 1 A 11 A 2 p 2 τ 1 A 21 A 31 τ 1 A 2 p 2 A 3 p 3 ) 1 2 p 3 , j = 1 , , p 3 .
These imply
| cos β j | = ( τ 1 A 11 A 21 τ 1 A 11 A 2 p 2 τ 1 A 21 A 31 τ 1 A 2 p 2 A 3 p 3 ) 1 p 3 i = 1 2 ( τ i A 11 A 21 τ i A 11 A 2 p 2 τ i A 21 A 31 τ i A 2 p 2 A 3 p 3 ) 1 p 3
and
| sin β j | = ( τ 2 A 11 A 21 τ 2 A 11 A 2 p 2 τ 2 A 21 A 31 τ 2 A 2 p 2 A 3 p 3 ) 1 p 3 i = 1 2 ( τ i A 11 A 21 τ i A 11 A 2 p 2 τ i A 21 A 31 τ i A 2 p 2 A 3 p 3 ) 1 p 3 , j = 1 , , p 3 .
Hence, the corresponding function value of these extreme points is
i = 1 2 ( τ i A 11 A 21 τ i A 11 A 2 p 2 τ i A 21 A 31 τ i A 2 p 2 A 3 p 3 ) 1 p 3 .
By comparing this function value with those of all endpoints, it follows that the maximum of f = S ( t 3 1 ) local is
S ( t 3 1 ) local max = i = 1 2 ( τ i A 11 A 21 τ i A 11 A 2 p 2 τ i A 21 A 31 τ i A 2 p 2 A 3 p 3 ) 1 p 3 .
Proof of Theorem 3. 
Assume that Equation (1) holds. Write
A x 11 11 λ 1 , , λ p 2 = a 11 ( 1 ) a 11 P ( a 11 | x 11 , λ 1 , , λ p 2 ) ,
A x ( n 1 ) p n 1 ( n 1 ) p n 1 λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 = a ( n 1 ) p n 1 ( 1 ) a ( n 1 ) p n 1 P ( a ( n 1 ) p n 1 | x ( n 1 ) p n 1 , λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 ) ,
A x n k n k λ t n 1 1 + k = a n k ( 1 ) a n k P ( a n k | x n k , λ t n 1 1 + k ) , k = 1 , , p n .
By Equation (1), for any i 1 , , i t n 1 , j 1 , , j t n 1 { 0 , 1 } , we have
| I i 1 , , i t n 1 , 0 | = | 1 2 p n x n 1 , , x n p n A i 1 11 A i t n 1 ( n 1 ) p n 1 A x n 1 n 1 A x n p n n p n | = | 1 2 p n x n 1 , , x n p n a 11 , , a n p n ( 1 ) a 11 + + a n p n P ( λ 1 , , λ t n 1 ) [ P ( a 11 | i 1 , λ 1 , , λ p 2 ) · P ( a ( n 1 ) p n 1 | i t n 1 , λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 ) P ( a n 1 | x n 1 , λ t n 1 ) · P ( a n p n | x n p n , λ t n 1 ) ] d λ 1 d λ t n 1 | = | 1 2 p n x n 1 , , x n p n P ( λ 1 , , λ t n 1 ) A i 1 11 λ 1 , , λ p 2 · A i t n 1 ( n 1 ) p n 1 λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 A x n 1 n 1 λ t n 1 A x n p n n p n λ t n 1 d λ 1 d λ t n 1 | = | 1 2 p n P ( λ 1 , , λ t n 1 ) A i 1 11 λ 1 , , λ p 2 · A i t n 1 ( n 1 ) p n 1 λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 ( A 0 n 1 λ t n 1 + A 1 n 1 λ t n 1 ) · ( A 0 n p n λ t n 1 + A 1 n p n λ t n 1 ) d λ 1 d λ t n 1 | 1 2 p n P ( λ 1 , , λ t n 1 ) | A i 1 11 λ 1 , , λ p 2 | · | A i t n 1 ( n 1 ) p n 1 λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 | | A 0 n 1 λ t n 1 + A 1 n 1 λ t n 1 | · | A 0 n p n λ t n 1 + A 1 n p n λ t n 1 | d λ 1 d λ t n 1 1 2 p n P ( λ 1 , , λ t n 1 ) | A 0 n 1 λ t n 1 + A 1 n 1 λ t n 1 | | A 0 n p n λ t n 1 + A 1 n p n λ t n 1 | · d λ 1 d λ t n 1 = 1 2 p n P ( λ 1 , , λ t n 1 ) k = 1 p n | A 0 n k λ t n 1 1 + k + A 1 n k λ t n 1 1 + k | d λ 1 d λ t n 1
and
| I j 1 , , j t n 1 , 1 | = | 1 2 p n x n 1 , , x n p n ( 1 ) x n 1 + + x n p n A j 1 11 A j t n 1 ( n 1 ) p n 1 A x n 1 n 1 A x n p n n p n | = | 1 2 p n x n 1 , , x n p n ( 1 ) x n 1 + + x n p n a 11 , , a n p n ( 1 ) a 11 + + a n p n P ( λ 1 , , λ t n 1 ) · [ P ( a 11 | j 1 , λ 1 , , λ p 2 ) P ( a ( n 1 ) p n 1 | j t n 1 , λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 ) · P ( a n 1 | x n 1 , λ t n 1 ) P ( a n p n | x n p n , λ t n 1 ) ] d λ 1 d λ t n 1 | = | 1 2 p n x n 1 , , x n p n ( 1 ) x n 1 + + x n p n P ( λ 1 , , λ t n 1 ) A j 1 11 λ 1 , , λ p 2 · A j t n 1 ( n 1 ) p n 1 λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 A x n 1 n 1 λ t n 1 A x n p n n p n λ t n 1 d λ 1 d λ t n 1 | = | 1 2 p n P ( λ 1 , , λ t n 1 ) A j 1 11 λ 1 , , λ p 2 · A j t n 1 ( n 1 ) p n 1 λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 ( A 0 n 1 λ t n 1 A 1 n 1 λ t n 1 ) · ( A 0 n p n λ t n 1 A 1 n p n λ t n 1 ) d λ 1 d λ t n 1 | 1 2 p n P ( λ 1 , , λ t n 1 ) | A j 1 11 λ 1 , , λ p 2 | · | A j t n 1 ( n 1 ) p n 1 λ t n 1 1 , λ t n 1 + l ( n 1 ) ( p n 1 1 ) , , λ t n 1 | · | A 0 n 1 λ t n 1 A 1 n 1 λ t n 1 | | A 0 n p n λ t n 1 A 1 n p n λ t n 1 | d λ 1 d λ t n 1 1 2 p n P ( λ 1 , , λ t n 1 ) | A 0 n 1 λ t n 1 A 1 n 1 λ t n 1 | | A 0 n p n λ t n 1 A 1 n p n λ t n 1 | · d λ 1 d λ t n 1 = 1 2 p n P ( λ 1 , , λ t n 1 ) k = 1 p n | A 0 n k λ t n 1 1 + k A 1 n k λ t n 1 1 + k | d λ 1 d λ t n 1 .
Therefore,
| I i 1 , , i t n 1 , 0 | + | I j 1 , , j t n 1 , 1 | 1 2 p n P ( λ 1 , , λ t n 1 ) k = 1 p n ( | A 0 n k λ t n 1 1 + k + A 1 n k λ t n 1 1 + k | + | A 0 n k λ t n 1 1 + k A 1 n k λ t n 1 1 + k | ) d λ 1 d λ t n 1 = P ( λ 1 , , λ t n 1 ) k = 1 p n max { | A 0 n k λ t n 1 1 + k | , | A 1 n k λ t n 1 1 + k | } d λ 1 d λ t n 1 1 ,
as desired.
Moreover, if Equation (2) also holds, we have
| I i 1 , , i t n 1 , 0 | 1 2 p n P 1 ( λ 1 ) P t n 1 ( λ t n 1 ) k = 1 p n | A 0 n k λ t n 1 1 + k + A 1 n k λ t n 1 1 + k | d λ 1 d λ t n 1 = k = 1 p n P t n 1 1 + k ( λ t n 1 1 + k ) | A 0 n k λ t n 1 1 + k + A 1 n k λ t n 1 1 + k | 2 d λ t n 1 1 + k
and
| I j 1 , , j t n 1 , 1 | 1 2 p n P 1 ( λ 1 ) P t n 1 ( λ t n 1 ) k = 1 p n | A 0 n k λ t n 1 1 + k A 1 n k λ t n 1 1 + k | d λ 1 d λ t n 1 = k = 1 p n P t n 1 1 + k ( λ t n 1 1 + k ) | A 0 n k λ t n 1 1 + k A 1 n k λ t n 1 1 + k | 2 d λ t n 1 1 + k .
Using Lemma A1, we obtain
| I i 1 , , i t n 1 , 0 | 1 p n + | I j 1 , , j t n 1 , 1 | 1 p n k = 1 p n [ P t n 1 1 + k ( λ t n 1 1 + k ) ( | A 0 n k λ t n 1 1 + k + A 1 n k λ t n 1 1 + k | 2 + | A 0 n k λ t n 1 1 + k A 1 n k λ t n 1 1 + k | 2 ) d λ t n 1 1 + k ] 1 p n = k = 1 p n [ P t n 1 1 + k ( λ t n 1 1 + k ) max { | A 0 n k λ t n 1 1 + k | , | A 1 n k λ t n 1 1 + k | } d λ t n 1 1 + k ] 1 p n 1 ,
that is, Inequality (9) holds. □

References

  1. Einstein, A.; Podolsky, B.; Rosen, N. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 1935, 47, 777. [Google Scholar] [CrossRef] [Green Version]
  2. Bell, J.S. On the Einstein-Podolsky-Rosen paradox. Physics 1964, 1, 195. [Google Scholar] [CrossRef] [Green Version]
  3. Brunner, N.; Cavalcanti, D.; Pironio, S.; Scarani, V.; Wehner, S. Bell nonlocality. Rev. Mod. Phys. 2014, 86, 419. [Google Scholar] [CrossRef] [Green Version]
  4. Brendel, J.; Mohler, E.; Martienssen, W. Experimental test of Bell’s inequality for energy and time. Europhys. Lett. 1992, 20, 575. [Google Scholar] [CrossRef]
  5. Gröblacher, S.; Paterek, T.; Kaltenbaek, R.; Brukner, Č.; Żukowski, M.; Aspelmeyer, M.; Zeilinger, A. An experimental test of non-local realism. Nature 2007, 446, 871. [Google Scholar] [CrossRef] [Green Version]
  6. Giustina, M.; Versteegh, M.A.M.; Wengerowsky, S.; Handsteiner, J.; Hochrainer, A.; Phelan, K.; Steinlechner, F.; Kofler, J.; Larsson, J.A.; Abellán, C.; et al. Significant-Loophole-Free test of Bell’s theorem with entangled photons. Phys. Rev. Lett. 2015, 115, 250401. [Google Scholar] [CrossRef]
  7. Ekert, A.K. Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 1991, 67, 661. [Google Scholar] [CrossRef] [Green Version]
  8. Acín, A.; Brunner, N.; Gisin, N.; Massar, S.; Pironio, S.; Scarani, V. Device-independent security of quantum cryptography against collective attacks. Phys. Rev. Lett. 2007, 98, 230501. [Google Scholar] [CrossRef] [Green Version]
  9. Acín, A.; Gisin, N.; Masanes, L. From Bell’s theorem to secure quantum key distribution. Phys. Rev. Lett. 2006, 97, 120405. [Google Scholar] [CrossRef] [Green Version]
  10. Pironio, S.; Acín, A.; Massar, S.; Boyer de la Giroday, A.; Matsukevich, D.N.; Maunz, P.; Olmschenk, S.; Hayes, D.; Luo, L.; Manning, T.A.; et al. Random numbers certified by Bell’s theorem. Nature 2010, 464, 1021. [Google Scholar] [CrossRef] [Green Version]
  11. Buhrman, H.; Cleve, R.; Massar, S.; de Wolf, R. Nonlocality and communication complexity. Rev. Mod. Phys. 2010, 82, 665. [Google Scholar] [CrossRef] [Green Version]
  12. Clauser, J.F.; Horne, M.A.; Shimony, A.; Holt, R.A. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett. 1969, 23, 880. [Google Scholar] [CrossRef] [Green Version]
  13. Collins, D.; Gisin, N.; Linden, N.; Massar, S.; Popescu, S. Bell inequalities for arbitrarily high-dimensional systems. Phys. Rev. Lett. 2002, 88, 040404. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  14. Cruzeiro, E.Z.; Gisin, N. Complete list of tight Bell inequalities for two parties with four binary settings. Phys. Rev. A 2019, 99, 022104. [Google Scholar] [CrossRef] [Green Version]
  15. Tavakoli, A.; Pozas-Kerstjens, A.; Luo, M.-X.; Renou, M.-O. Bell nonlocality in networks. Rep. Prog. Phys. 2021, in press. [Google Scholar] [CrossRef]
  16. Żukowski, M.; Zeilinger, A.; Horne, M.A.; Ekert, A.K. “Event-Ready-Detectors” Bell experiment via entanglement swapping. Phys. Rev. Lett. 1993, 71, 4287. [Google Scholar] [CrossRef]
  17. Branciard, C.; Gisin, N.; Pironio, S. Characterizing the nonlocal correlations created via entanglement swapping. Phys. Rev. Lett. 2010, 104, 170401. [Google Scholar] [CrossRef]
  18. Branciard, C.; Rosset, D.; Gisin, N.; Pironio, S. Bilocal versus nonbilocal correlations in entanglement-swapping experiments. Phys. Rev. A 2012, 85, 032119. [Google Scholar] [CrossRef] [Green Version]
  19. Gisin, N.; Mei, Q.; Tavakoli, A.; Renou, M.O.; Brunner, N. All entangled pure quantum states violate the bilocality inequality. Phys. Rev. A 2017, 96, 020304. [Google Scholar] [CrossRef] [Green Version]
  20. Mukherjee, K.; Paul, B.; Sarkar, D. Correlations in n-local scenario. Quantum Inf. Process. 2015, 14, 2025. [Google Scholar] [CrossRef] [Green Version]
  21. Tavakoli, A.; Skrzypczyk, P.; Cavalcanti, D.; Acín, A. Nonlocal correlations in the star-network configuration. Phys. Rev. A 2014, 90, 062109. [Google Scholar] [CrossRef] [Green Version]
  22. Tavakoli, A.; Renou, M.O.; Gisin, N.; Brunner, N. Correlations in star networks: From Bell inequalities to network inequalities. New J. Phys. 2017, 19, 073003. [Google Scholar] [CrossRef] [Green Version]
  23. Andreoli, F.; Carvacho, G.; Santodonato, L.; Chaves, R.; Sciarrino, F. Maximal qubit violation of n-locality inequalities in a star-shaped quantum network. New J. Phys. 2017, 19, 113020. [Google Scholar] [CrossRef]
  24. Renou, M.-O.; B<i>a</i>¨umer, E.; Boreiri, S.; Brunner, N.; Gisin, N.; Beigi, S. Genuine quantum nonlocality in the triangle network. Phys. Rev. Lett. 2019, 123, 140401. [Google Scholar] [CrossRef] [Green Version]
  25. Luo, M.-X. Computationally efficient nonlinear Bell inequalities for quantum networks. Phys. Rev. Lett. 2018, 120, 140402. [Google Scholar] [CrossRef] [Green Version]
  26. Frey, M. A Bell inequality for a class of multilocal ring networks. Quantum Inf. Process 2017, 16, 266. [Google Scholar] [CrossRef]
  27. Fritz, T. Beyond Bell’s theorem: Correlation scenarios. New J. Phys. 2012, 14, 103001. [Google Scholar] [CrossRef]
  28. Tavakoli, A. Quantum correlations in connected multipartite Bell experiments. J. Phys. A Math. Theor. 2016, 49, 145304. [Google Scholar] [CrossRef] [Green Version]
  29. Chaves, R. Polynomial Bell inequalities. Phys. Rev. Lett. 2016, 116, 010402. [Google Scholar] [CrossRef]
  30. Luo, M.-X. Nonlocality of all quantum networks. Phys. Rev. A 2018, 98, 042317. [Google Scholar] [CrossRef] [Green Version]
  31. Mukherjee, K.; Paul, B.; Sarkar, D. Nontrilocality: Exploiting nonlocality from three-particle systems. Phys. Rev. A 2017, 96, 022103. [Google Scholar] [CrossRef] [Green Version]
  32. Mukherjee, K.; Paul, B.; Roy, A. Characterizing quantum correlations in a fixed-input n-local network scenario. Phys. Rev. A 2020, 101, 032328. [Google Scholar] [CrossRef] [Green Version]
  33. Bancal, J.-D.; Gisin, N. Nonlocal boxes for networks. Phys. Rev. A 2021, 104, 052212. [Google Scholar] [CrossRef]
  34. Šupić, I.; Bancal, J.-D.; Cai, Y.; Brunner, N. Genuine network quantum nonlocality and self-testing. Phys. Rev. A 2022, 105, 022206. [Google Scholar]
  35. Pozas-Kerstjens, A.; Gisin, N.; Tavakoli, A. Full network nonlocality. Phys. Rev. Lett. 2022, 128, 010403. [Google Scholar] [CrossRef] [PubMed]
  36. Shi, Y.-Y.; Duan, L.-M.; Vidal, G. Classical simulation of quantum many-body systems with a tree tensor network. Phys. Rev. A 2006, 74, 022320. [Google Scholar] [CrossRef] [Green Version]
  37. Tagliacozzo, L.; Evenbly, G.; Vidal, G. Simulation of two-dimensional quantum systems using a tree tensor network that exploits the entropic area law. Phys. Rev. B 2009, 80, 235127. [Google Scholar] [CrossRef] [Green Version]
  38. Murg, V.; Verstraete, F.; Legeza, Ö.; Noack, R.M. Simulating strongly correlated quantum systems with tree tensor networks. Phys. Rev. B 2010, 82, 205105. [Google Scholar] [CrossRef] [Green Version]
  39. Dumitrescu, E. Tree tensor network approach to simulating Shor’s algorithm. Phys. Rev. A 2017, 96, 062322. [Google Scholar] [CrossRef] [Green Version]
  40. Lopez-Piqueres, J.; Ware, B.; Vasseur, R. Mean-field entanglement transitions in random tree tensor networks. Phys. Rev. B 2020, 102, 064202. [Google Scholar] [CrossRef]
  41. Wall, M.L.; D’Aguanno, G. Tree-tensor-network classifiers for machine learning: From quantum inspired to quantum assisted. Phys. Rev. A 2021, 104, 042408. [Google Scholar] [CrossRef]
  42. Yang, L.-H.; Qi, X.-F.; Hou, J.-C. Nonlocal correlations in the tree-tensor-network configuration. Phys. Rev. A 2021, 104, 042405. [Google Scholar] [CrossRef]
  43. Horodecki, R.; Horodecki, P.; Horodecki, M. Violating Bell inequality by mixed spin-12 states: Necessary and sufficient condition. Phys. Lett. A 1995, 200, 340. [Google Scholar] [CrossRef]
Figure 1. The general any forked tree-shaped network consists of t n parties (A 11 , A 21 , ⋯, A 2 p 2 , A 31 , ⋯, A 3 p 3 ,⋯, A n 1 , ⋯, A n p n ), and t n 1 independent sources S 1 , , S t n 1 . Denote by x i and a i the input and output of each party A i (i = 11, 21, ⋯, n p n ), respectively.
Figure 1. The general any forked tree-shaped network consists of t n parties (A 11 , A 21 , ⋯, A 2 p 2 , A 31 , ⋯, A 3 p 3 ,⋯, A n 1 , ⋯, A n p n ), and t n 1 independent sources S 1 , , S t n 1 . Denote by x i and a i the input and output of each party A i (i = 11, 21, ⋯, n p n ), respectively.
Entropy 24 00691 g001
Figure 2. For the case of n = 3 , the any forked tree-shaped network consists of t 3 parties (A 11 , A 21 , ⋯, A 2 p 2 , A 31 , ⋯, A 3 p 3 ) and ( t 3 1 ) independent sources S 1 , , S t 3 1 . Let x 11 , x 21 , , x 2 p 2 , x 31 , , x 3 p 3 and a 11 , a 21 , , a 2 p 2 , a 31 , , a 3 p 3 be the corresponding input and output of each party, respectively.
Figure 2. For the case of n = 3 , the any forked tree-shaped network consists of t 3 parties (A 11 , A 21 , ⋯, A 2 p 2 , A 31 , ⋯, A 3 p 3 ) and ( t 3 1 ) independent sources S 1 , , S t 3 1 . Let x 11 , x 21 , , x 2 p 2 , x 31 , , x 3 p 3 and a 11 , a 21 , , a 2 p 2 , a 31 , , a 3 p 3 be the corresponding input and output of each party, respectively.
Entropy 24 00691 g002
Figure 3. A tree-shaped network involves 10 parties, A 11 , A 21 , A 22 , A 31 , ⋯, A 37 , and 9 sources, S 1 , ⋯, S 9 . Denote by x 11 , x 21 , x 22 , x 31 , ⋯, x 37 and a 11 , a 21 , a 22 , a 31 , ⋯, a 37 the input and output of each party, respectively. Here, l 11 = 2 , l 21 = 3 , l 22 = 7 and p 2 = 2 , p 3 = 7 , t 1 = 1 , t 2 = 3 , t 3 = 10 .
Figure 3. A tree-shaped network involves 10 parties, A 11 , A 21 , A 22 , A 31 , ⋯, A 37 , and 9 sources, S 1 , ⋯, S 9 . Denote by x 11 , x 21 , x 22 , x 31 , ⋯, x 37 and a 11 , a 21 , a 22 , a 31 , ⋯, a 37 the input and output of each party, respectively. Here, l 11 = 2 , l 21 = 3 , l 22 = 7 and p 2 = 2 , p 3 = 7 , t 1 = 1 , t 2 = 3 , t 3 = 10 .
Entropy 24 00691 g003
Table 1. Comparison of multi-local inequalities between any forked tree-shaped network and other networks.
Table 1. Comparison of multi-local inequalities between any forked tree-shaped network and other networks.
NetworksMulti-Local InequalitiesRelations
any forked tree-shaped | I i 1 , , i t n 1 , 0 | 1 p n + | I j 1 , , j t n 1 , 1 | 1 p n 1
bilocal | I i 1 , 0 | 1 2 + | I j 1 , 1 | 1 2 1 n = 2, p 2 = 2
chain-shaped | I i 1 , , i 2 n 3 , 0 | 1 2 + | I j 1 , , j 2 n 3 , 1 | 1 2 1 p 2 = = p n = 2
star-shaped | I i 1 , 0 | 1 p 2 + | I j 1 , 1 | 1 p 2 1 n = 2
two-forked tree-shaped | I i 1 , , i 2 n 1 1 , 0 | 1 2 n 1 + | I j 1 , , j 2 n 1 1 , 1 | 1 2 n 1 1 l k j l k ( j 1 ) = 2
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Yang, L.; Qi, X.; Hou, J. Quantum Nonlocality in Any Forked Tree-Shaped Network. Entropy 2022, 24, 691. https://doi.org/10.3390/e24050691

AMA Style

Yang L, Qi X, Hou J. Quantum Nonlocality in Any Forked Tree-Shaped Network. Entropy. 2022; 24(5):691. https://doi.org/10.3390/e24050691

Chicago/Turabian Style

Yang, Lihua, Xiaofei Qi, and Jinchuan Hou. 2022. "Quantum Nonlocality in Any Forked Tree-Shaped Network" Entropy 24, no. 5: 691. https://doi.org/10.3390/e24050691

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop