Error-Tolerating Bell Inequalities via Graph States
| dc.creator | Chen, Qing | |
| dc.creator | Yu, Sixia | |
| dc.creator | Oh, C. H. | |
| dc.date | 2009-03-19 | |
| dc.date.accessioned | 2026-07-07T12:54:15Z | |
| dc.date.available | 2026-07-07T12:54:15Z | |
| dc.description | 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. | |
| dc.description | 4 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/0903.3318 | |
| dc.identifier | http://arxiv.org/abs/0903.3318 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/223866 | |
| dc.subject | Quantum Physics | |
| dc.title | Error-Tolerating Bell Inequalities via Graph States | |
| dc.type | text |