Error-Tolerating Bell Inequalities via Graph States

Details Error-Tolerating Bell Inequalities via Graph States Error-Tolerating Bell Inequalities via Graph States

2009-03-19

arxiv.org/abs/0903.3318v1

Physics

Quantum Physics

4 pages, 1 figure

Scientific paper

We investigate the Bell inequalities derived from the graph states with violations detectable even with the presence of noises, which generalizes the idea of error-correcting Bell inequalities [Phys. Rev. Lett. 101, 080501 (2008)]. Firstly we construct a family of valid Bell inequalities tolerating arbitrary $t$-qubit errors involving $3(t+1)$ qubits, e.g., 6 qubits suffice to tolerate single qubit errors. Secondly we construct also a single-error-tolerating Bell inequality with a violation that increases exponentially with the number of qubits. Exhaustive computer search for optimal error-tolerating Bell inequalities based on graph states on no more than 10 qubits shows that our constructions are optimal for single- and double-error tolerance.

Affiliated with

Also associated with

No associations

Rating

Error-Tolerating Bell Inequalities via Graph States does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Error-Tolerating Bell Inequalities via Graph States, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Error-Tolerating Bell Inequalities via Graph States will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-648591