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...
محفوظ في:
المؤلفون الرئيسيون: | , , , |
---|---|
التنسيق: | مقال |
منشور في: |
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. |
---|