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: | , , , |
|---|---|
| Format: | Article |
| Published: |
Springer Verlag (Germany)
2016
|
| Subjects: | |
| Online Access: | http://eprints.um.edu.my/18484/ http://dx.doi.org/10.1007/s11128-016-1275-2 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|