Quantum Nonlocality in Any Forked Tree-Shaped Network

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 (tn−1)-local correlations and all local correlations, where tn 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.


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 treeshaped 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 kj − l k(j−1) parties in the layer k + 1 (2 ≤ k ≤ n − 1, j ≥ 1), where l k0 = 0 and l kj − 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 kj − 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 treeshaped 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.

Nonlocality in Any Forked Tree-Shaped Network Scenario
In this section, we consider the nonlocality of a general tree-shaped network; see Figure 1.
The general any forked tree-shaped network consists of t n parties (A 11 , A 21 Denote by x i and a i the input and output of each party A i (i = 11, 21, • • • , np n ), respectively.This general tree-shaped network has n "layers" (n ≥ 2), where each layer k has p k parties (nodes) with in the layer k shares one source with another party in the layer k − 1 and with l kj − l k(j−1) parties in the layer k + 1, where l kj − l k(j−1) is an arbitrary positive integer, except that Thus, this general treeshaped 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 We say that the correlations in the tree-shaped network of Figure 1 are local if the joint probability distribution satisfies (1) and moreover, if P(λ 1 , • • • , λ t n −1 ) in Equation ( 1) can be decomposed into 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.

(t 3 − 1)-Local Network Scenario
If n = 3 in Figure 1, then it reduces to the network of Figure 2.
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 and are called (t 3 − 1)-local if they have a decomposition form of Equation (3) with the additional restriction 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.In what follows, we consider the case that each party A i (i = 11, 21, • • • , 3p 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. where guaranteeing the non-(t 3 − 1)-local nature of the correlations generated by the network of Figure 2. Besides, each of the above 2 2t 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: Here, λ m are hidden variables of shared sources S m with P m (λ , and τ 3j are sources of local randomness for party A 3j with P j (τ 3j = 0) = r and P j (τ As for the nonlocality correlations in the network of Figure 2, we give a set of Belltype inequalities.
Theorem 2. Every local correlation in the tree-shaped network of Figure 2 satisfies the following inequalities: where By Theorem 2, the violation of at least one of the 2 2t 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 For simplicity, we write Once each party receives particles from its all-connecting sources, it performs suitable measurement.The resulting joint probability distribution has the form 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 ρ are also written in the Schmidt basis with the corresponding positive coefficients.
For party A 11 , take the measurement Here, σ k z = σ z and σ k x = σ x for all k are Pauli matrices.Let the settings of all parties A 3q (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 3q by A 3q 0 = (sin α q , 0, cos α q ) • σ, A 3q 1 = (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 For any x 31 , x 32 , • • • , x 3p 3 ∈ {0, 1}, we can follow similar calculations as above for . Therefore, Write It follows that the extremal points of f must satisfy the conditions Therefore, the value of f at these extremal Comparing this value with the values of f at all boundary points, it is easily seen that the maximum of Thus, other possible nonzero terms for However, by similar discussions to the above, one can obtain that these three values are less than 1.
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: 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 ) 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

Denote by τ
≥ 0 the three non-negative eigenvalues of For the other mixed states ρ , 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 Suppose that party A 11 performs measurements 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 , respectively [19].Similarly, we use R A 11 A 2i for aligning the ith subsystem of A 11 , connected to the first subsystem of A 2i , i = 2, • • • , p 2 .Note that the Z and X axes used by the parties A 11 and A 2i (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 2p 2 before performing the measurements.Likewise, we may assume the party A For party A 3q (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 2jq A 3q (1 ≤ j q ≤ p 2 ).That is, A 3q 0 = c q • σ and A 3q 1 = c q • σ, where c q = (sin β q , 0, cos β q ), c q = (sin β q , 0, cos β q ), β q , β q ∈ [0, 2π].Now, we have and and so A calculation gives the maximum 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 τ 2 , which implies that Equation ( 8) can be reduced to Equation (7).
From Equation ( 8), S max (t 3 −1)−local > 1 implies that these states violate the (t 3 − 1)-locality inequalities (5).Since all these eigenvalues τ where the expressions S max XY = τ XY 1 + τ XY 2 represent the maximal CHSH value for the corresponding state ρ XY 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: 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 max 9−local 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 1j and A 2j and any measurements for parties A 3j .In this quantum strategy, the maximal violation S max (t 3 −1)−local is obtained, which gives a sufficient condition that S max (t 3 −1)−local > 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.

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 Let the input of party A 11 be {A 11 0 = ⊗ ) p 3 V, and so, 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 ) for the Werner state to violate the CHSH inequality.

(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, • • • , np 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: and the corresponding local correlations satisfy the following inequalities: where for k ∈ {0, 1}, and A i x i denotes the observable for binary inputs x i of party A i , i = 11, 21, 22, • • • , np n .
Note that the subscript t n−1 in Ineqs.( 9) and ( 10) represents the total number of parties 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.
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 τ and party A nq have measurement

Networks Multi-Local Inequalities Relations
any forked tree-shaped

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 "twoforked" 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].
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.
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 .
Here, we use similar symbols as those in the proof of Theorem 1.Note that | A 11 i 1 (j 1 ) 3) and a similar discussion to that in the proof of Theorem 1, we have Consequently, Proof of Equation (8).Note that 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 Hence, the corresponding function value of these extreme points is By comparing this function value with those of all endpoints, it follows that the maximum of f = S Proof of Theorem 3. Assume that Equation (1) holds.Write By Equation (1), for any i     x n1 λ t n−1 Therefore, Using Lemma A1, we obtain

Theorem 1 .
Any (t 3 − 1)-local correlation in the tree-shaped network of Figure2must satisfy the following inequalities: 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 ρ 11 A 21 corresponding to the two largest eigenvalues τ A 11 A 21 1 and τ A 11 A 21 2 produce pure entangled states |ψ i ψ i |, |ψ i = b i0 |00 + b i1 |11 , written in the Schmidt basis, with positive coefficients b i0 and b
11 x 11 denotes the observable for binary inputs x 11 of party A 11 , and A 21 x 21 , • • • , A

Table 1 .
Comparison of multi-local inequalities between any forked tree-shaped network and other networks.