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

## Abstract

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.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | Bell inequalities; NP-problem; Turing machine |

Subjects: | Q Science > Q Science (General) Q Science > QC Physics |

Divisions: | Faculty of Science > Dept of Physics |

Depositing User: | Ms. Juhaida Abd Rahim |

Date Deposited: | 07 Dec 2017 04:13 |

Last Modified: | 07 Dec 2017 04:13 |

URI: | http://eprints.um.edu.my/id/eprint/18484 |

### Actions (login required)

View Item |