Bell inequalities for graph states.

@article{Ghne2005BellIF,
  title={Bell inequalities for graph states.},
  author={Otfried G{\"u}hne and G{\'e}za T{\'o}th and Philipp Hyllus and Hans J. Briegel},
  journal={Physical review letters},
  year={2005},
  volume={95 12},
  pages={
          120405
        }
}
We investigate the nonlocal properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state there is an inequality maximally violated only by that state. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties… 

Figures, Tables, and Topics from this paper

Two-setting Bell inequalities for graph states
We present Bell inequalities for graph states with a high violation of local realism. In particular, we show that there is a basic Bell inequality for every nontrivial graph state which is violated
A Note of Bell Inequalities for Graph States
In this paper, we construct a general Bell inequality for the graph state. Firstly, we show that the Bell inequality is maximally violated by graph state corresponding to some given graph. In
Multipartite entanglement in four-qubit graph states
Abstract We consider a compendium of the non-trivial four-qubit graphs, derive their corresponding quantum states and classify them into equivalent classes. We use Meyer-Wallach measure and its
Fully multi-qubit entangled states
TLDR
It is proved that in connected graph states of N qubits there is no genuine k-qubit entanglement, 2 ≤ k ≤ N - 1, among every k qubits, which naturally lead to the definition of fully multi-qu bit entangled states.
Scalable Bell Inequalities for Qubit Graph States and Robust Self-Testing.
TLDR
A general construction of Bell inequalities that are maximally violated by the multiqubit graph states and can be used for their robust self-testing, and numerical results indicate that the self- testing statements for graph states derived from the inequalities tolerate noise levels that are met by present experimental data.
Nonlocality and Entanglement for Symmetric States
In this paper, building on some recent progress combined with numerical techniques, we shed some new light on how the nonlocality of symmetric states is related to their entanglement properties and
Quantum circuits for maximally entangled states
We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to
Entanglement and nonclassical properties of hypergraph states
Hypergraph states are multiqubit states that form a subset of the locally maximally entangleable states and a generalization of the well-established notion of graph states. Mathematically, they can
Entanglement criteria for Dicke states
Dicke states are a family of multi-qubit quantum states with interesting entanglement properties and they have been observed in many experiments. We construct entanglement witnesses for detecting
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
PRL 95
  • PRL 95
  • 2005
Phys
  • Rev. Lett. 94, 060501 (2005); Phys. Rev. A 72, 022340
  • 2005
Phys
  • Rev. Lett. 95, 010501
  • 2005
Phys. Rev. Lett
  • Phys. Rev. Lett
  • 2005
Phys. Rev. Lett. Phys. Rev. A
  • Phys. Rev. Lett. Phys. Rev. A
  • 2005
Phys
  • Rev. Lett. 86, 5188 (2001); M. Nielsen, ibid. 93, 040503
  • 2004
Phys. Rev. A
  • Phys. Rev. A
  • 2004
Phys
  • Rev. A 68, 042307
  • 2003
Phys
  • Rev. A 69, 062311 (2004); W. Dür et al., Phys. Rev. Lett. 91, 107903
  • 2003
Phys. Rev. A
  • Phys. Rev. A
  • 2003
...
1
2
3
...