Papers
Topics
Authors
Recent
Search
2000 character limit reached

Scalable Bell inequalities for qubit graph states and robust self-testing

Published 26 Dec 2018 in quant-ph | (1812.10428v1)

Abstract: Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a very simple and intuitive construction of Bell inequalities that are maximally violated by the multiqubit graph states and can be used for their robust self-testing. The main advantage of our inequalities over previous constructions for these states lies in the fact that the number of correlations they contain scales only linearly with the number of observers, which presents a significant reduction of the experimental effort needed to violate them. We also discuss possible generalizations of our approach by showing that it is applicable to entangled states whose stabilizers are not simply tensor products of Pauli matrices.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.