Bell inequalities, classical cryptography and fractals
| dc.creator | Shchukin, E. | |
| dc.date | 2007-03-28 | |
| dc.date | 2007-04-04 | |
| dc.date.accessioned | 2026-07-07T07:55:17Z | |
| dc.date.available | 2026-07-07T07:55:17Z | |
| dc.description | The relation between the boolean functions and Bell inequalities for qubits is analyzed. The connection between the maximal quantum violation of a Bell inequality and the nonlinearity of the corresponding boolean function is discussed. A visualization scheme of boolean functions is proposed. An attempt to classify Bell inequalities for qubits is made, a weaker result (classification with respect to Jevons group) is obtained. The fractal structure of the classification is shown. All constructs are illustrated by Mathematica code. | |
| dc.description | 26 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0703259 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0703259 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/126916 | |
| dc.subject | Quantum Physics | |
| dc.title | Bell inequalities, classical cryptography and fractals | |
| dc.type | text |