Quantum networks play an important role in the fields of quantum information and quantum computation. One of the current problems for these networks concerns nonlocality. Characterizing and detecting nonlocality is relevant to the implementation of quantum networks and quantum repeaters, where Bell inequalities can be used to test if configurations are prepared correctly. This report contains an overview of an iterative method to find Bell inequalities for networks. Starting from a given network, this method constructs a new Bell inequality for a network containing one additional source and one additional party. We use this procedure to find new Bell inequalities for specific network structures and analyse how these can be used to detect nonlocality within a network. In the first part the Bell inequalities are considered from a more theoretical point of view. We focus on star-shaped networks and discuss violations predicted by quantum mechanics. We look for quantitative bounds describing a set of states that lead to violation, giving an indication of the required quality of the sources. Finally this method is applied to a setup similar to the one described by Bernien et al. We consider a network consisting of three parties and two sources. The effect of errors during preparation of an entangled pair of photons on the ability to detect nonlocality is evaluated. The same is done for the effect of measurement errors. Using numerical computations we show that violation of the Bell inequality can be improved by choosing different measurement angles.
Quantum networks play an important role in the fields of quantum information and quantum computation. One of the current problems for these networks concerns nonlocality. Characterizing and detecting nonlocality is relevant to the implementation of quantum networks and quantum repeaters, where Bell inequalities can be used to test if configurations are prepared correctly. This report contains an overview of an iterative method to find Bell inequalities for networks. Starting from a given network, this method constructs a new Bell inequality for a network containing one additional source and one additional party. We use this procedure to find new Bell inequalities for specific network structures and analyse how these can be used to detect nonlocality within a network. In the first part the Bell inequalities are considered from a more theoretical point of view. We focus on star-shaped networks and discuss violations predicted by quantum mechanics. We look for quantitative bounds describing a set of states that lead to violation, giving an indication of the required quality of the sources. Finally this method is applied to a setup similar to the one described by Bernien et al. We consider a network consisting of three parties and two sources. The effect of errors during preparation of an entangled pair of photons on the ability to detect nonlocality is evaluated. The same is done for the effect of measurement errors. Using numerical computations we show that violation of the Bell inequality can be improved by choosing different measurement angles.
The problem of characterizing classical and quantum correlations in networks is considered. Contrary to the usual Bell scenario, where distant observers share a physical system emitted by one common source, a network features several independent sources, each distributing a physical system to a subset of observers. In the quantum setting, the observers can perform joint measurements on initially independent systems, which may lead to strong correlations across the whole network. In this work, we introduce a technique to systematically map a Bell inequality to a family of Bell-type inequalities bounding classical correlations on networks in a star-configuration. Also, we show that whenever a given Bell inequality can be violated by some entangled state ρ , then all the corresponding network inequalities can be violated by considering many copies of ρ distributed in the star network. The relevance of these ideas is illustrated by applying our method to a specific multi-setting Bell inequality. We derive the corresponding network inequalities, and study their quantum violations.
In a quantum network, distant observers sharing physical resources emitted by independent sources can establish strong correlations, which defy any classical explanation in terms of local variables. We discuss the characterization of nonlocal correlations in such a situation, when compared to those that can be generated in networks distributing independent local variables. We present an iterative procedure for constructing Bell inequalities tailored for networks: starting from a given network, and a corresponding Bell inequality, our technique provides new Bell inequalities for a more complex network, involving one additional source and one additional observer. We illustrate the relevance of our method on a variety of networks, demonstrating significant quantum violations, which could not have been detected using standard Bell inequalities.
In the field of quantum information theory one investigates the properties of information carriers which are subject to the laws of quantum mechanics. The differences between quantum mechanics and the laws that govern macroscopic information carriers lead to new opportunities and challenges in information processing.
One of these differences is the entanglement of particles, which leads to strong correlations of measurement outcomes. This allows the violation of so-called Bell inequalities in quantum mechanics, which is impossible in ``classical'' theories. I investigated the possible amount of violation for an important class of Bell inequalities. In doing so I found a simple mathematical expression for an upper bound and studied the achievability of that bound. The approach provides a basic understanding of the considered Bell inequalities, which allows to construct new inequalities with interesting properties. In particular one can understand how Bell inequalities allow to bound the dimension of a quantum system. Changing a Bell inequality with invariant quantum value proved useful in optimizing them with respect to the violation.
The distribution of entangled systems across large distances is achieved by sending photons. However, since they are absorbed in long fibers, quantum repeater become necessary for distances larger than approximately 200 km. Several approaches to counter the losses are known. In the long term error correction codes are very promising. Here the information is encoded into many photons, such that some losses can be compensated. I contributed to the analysis of this approach by showing how it naturally generalizes to networks of quantum repeaters. The formalism of graph states is useful in this context. A complete performance analysis of a quantum repeater contains many sources of errors and their propagation inside the circuit. I extended this analysis compared to the literature. At the moment it is not clear which types of quantum repeaters will prevail. My comparison of different theoretical proposals helps towards answering this question.
Full quantum network nonlocality (FQNN) describes a scenario where all sources in a network are nonlocal. Existing criteria of FQNN can only be verified in star networks by violating a single Bell-like inequality. Here we propose a method that certifies FQNN in general quantum networks using only a single Bell-like inequality. We show that the topological obstacle to one-shot detection can be overcome by expanding the original network with a carefully chosen number of auxiliary local sources and parties. The correlations of the enlarged network are then tested with a single inequality; a violation implies that all original sources must be nonlocal. Our approach provides an efficient, experimentally friendly way to verify FQNN in any network topology.
This work provides quantitative tests of the extent of violation of two inequalities applicable to qubits coupled into Bell states, using IBM's publicly accessible quantum computers. Violations of the inequalities are well established. Our purpose is not to test the inequalities, but rather to determine how well quantum mechanical predictions can be reproduced on quantum computers, given their current fault rates. We present results for the spin projections of two entangled qubits, along three axes A, B, and C, with a fixed angle θ between A and B and a range of angles θ' between B and C. For any classical object that can be characterized by three observables with two possible values, inequalities govern relationships among the probabilities of outcomes for the observables, taken pairwise. From set theory, these inequalities must be satisfied by all such classical objects; but quantum systems may violate the inequalities. We have detected clear-cut violations of one inequality in runs on IBM's publicly accessible quantum computers. The Clauser-Horne-Shimony-Holt (CHSH) inequality governs a linear combination S of expectation values of products of spin projections, taken pairwise. Finding S > 2 rules out local, hidden variable theories for entangled quantum systems. We obtained values of S greater than 2 in our runs prior to error mitigation. To reduce the quantitative errors, we used a modification of the error-mitigation procedure in the IBM documentation. We prepared a pair of qubits in the state |00〉, found the probabilities to observe the states |00〉, |01〉, |10〉, and |11〉 in multiple runs, and used that information to construct the first column of an error matrix M. We repeated this procedure for states prepared as |01〉, |10〉, and |11〉 to construct the full matrix M, whose inverse is the filtering matrix. After applying filtering matrices to our averaged outcomes, we have found good quantitative agreement between the quantum computer output and the quantum mechanical predictions for the extent of violation of both inequalities as functions of θ'.
The nonlocality of an entangled qubit pair can be recycled for several Bell experiments. Here, we go beyond standard Bell scenarios and investigate the recycling of nonlocal resources in a quantum network. First, we show that the ability to recycle nonlocality can be independent of the size of the network. Then, we realize a photonic quantum three-branch star network in which three sources of entangled pairs independently connect three outer parties with a central node. After measuring, each outer party respectively relays their system to an independent secondary measuring party. We experimentally demonstrate that the outer parties can perform unsharp measurements that are strong enough to violate a network Bell inequality with the central party, but weak enough to maintain sufficient entanglement in the network to allow the three secondary parties to do the same. Moreover, the violations are strong enough to exclude any model based on standard projective measurements on the Einstein-Podolsky-Rosen pairs emitted in the network. Our experiment brings together the research program of recycling quantum resources with that of Bell nonlocality in networks.