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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Springer Verlag (Germany)
2016
|
| Subjects: |
| _version_ | 1825721121935196160 |
|---|---|
| author | Batle, J. Raymond Ooi, C.H. Abdalla, S. Bagdasaryan, A. |
| author_facet | Batle, J. Raymond Ooi, C.H. Abdalla, S. Bagdasaryan, A. |
| author_sort | Batle, J. |
| collection | UM |
| description | 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. |
| first_indexed | 2024-03-06T05:45:33Z |
| format | Article |
| id | um.eprints-18484 |
| institution | Universiti Malaya |
| last_indexed | 2024-03-06T05:45:33Z |
| publishDate | 2016 |
| publisher | Springer Verlag (Germany) |
| record_format | dspace |
| spelling | um.eprints-184842017-12-07T04:13:27Z http://eprints.um.edu.my/18484/ Computing the maximum violation of a Bell inequality is an NP-problem Batle, J. Raymond Ooi, C.H. Abdalla, S. Bagdasaryan, A. Q Science (General) QC Physics 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. Springer Verlag (Germany) 2016 Article PeerReviewed Batle, J. and Raymond Ooi, C.H. and Abdalla, S. and Bagdasaryan, A. (2016) Computing the maximum violation of a Bell inequality is an NP-problem. Quantum Information Processing, 15 (6). pp. 2649-2659. ISSN 1570-0755, DOI https://doi.org/10.1007/s11128-016-1275-2 <https://doi.org/10.1007/s11128-016-1275-2>. http://dx.doi.org/10.1007/s11128-016-1275-2 doi:10.1007/s11128-016-1275-2 |
| spellingShingle | Q Science (General) QC Physics Batle, J. Raymond Ooi, C.H. Abdalla, S. Bagdasaryan, A. Computing the maximum violation of a Bell inequality is an NP-problem |
| title | Computing the maximum violation of a Bell inequality is an NP-problem |
| title_full | Computing the maximum violation of a Bell inequality is an NP-problem |
| title_fullStr | Computing the maximum violation of a Bell inequality is an NP-problem |
| title_full_unstemmed | Computing the maximum violation of a Bell inequality is an NP-problem |
| title_short | Computing the maximum violation of a Bell inequality is an NP-problem |
| title_sort | computing the maximum violation of a bell inequality is an np problem |
| topic | Q Science (General) QC Physics |
| work_keys_str_mv | AT batlej computingthemaximumviolationofabellinequalityisannpproblem AT raymondooich computingthemaximumviolationofabellinequalityisannpproblem AT abdallas computingthemaximumviolationofabellinequalityisannpproblem AT bagdasaryana computingthemaximumviolationofabellinequalityisannpproblem |