Computing the maximum violation of a Bell inequality is an NP-problem

The number of steps required in order to maximize a Bell inequality for arbitrary number of qubits is shown to grow exponentially with the number of parties involved. The proof that the optimization of such correlation measure is an NP-problem based on an operational perspective involving a Turing m...

全面介绍

Saved in:
书目详细资料
Main Authors: Batle, J., Raymond Ooi, C.H., Abdalla, S., Bagdasaryan, A.
格式: Article
出版: Springer Verlag (Germany) 2016
主题:
在线阅读:http://eprints.um.edu.my/18484/
http://dx.doi.org/10.1007/s11128-016-1275-2
标签: 添加标签
没有标签, 成为第一个标记此记录!
实物特征
总结:The number of steps required in order to maximize a Bell inequality for arbitrary number of qubits is shown to grow exponentially with the number of parties involved. The proof that the optimization of such correlation measure is an NP-problem based on an operational perspective involving a Turing machine, which follows a general algorithm. The implications for the computability of the so-called nonlocality for any number of qubits is similar to recent results involving entanglement or similar quantum correlation-based measures.