Computationally Efficient Nonlinear Bell Inequalities for General Quantum Networks

Understand

The correlations in quantum networks have attracted strong interest with new types of violations of the locality.

• The standard Bell inequalities cannot characterize the multipartite correlations that are generated by multiple sources.
• The main problem is that no computationally efficient method is available for constructing useful Bell inequalities for general quantum networks.
• In this work, we show a significant improvement by presenting new, explicit Bell-type inequalities for general networks including cyclic networks.