Bell inequalities, classical cryptography and fractals
量子物理
2007-05-23 v2
摘要
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.
引用
@article{arxiv.quant-ph/0703259,
title = {Bell inequalities, classical cryptography and fractals},
author = {E. Shchukin},
journal= {arXiv preprint arXiv:quant-ph/0703259},
year = {2007}
}
备注
26 pages, 7 figures