Document Details Document Type : Article In Journal  Document Title : Computing the maximum violation of a Bell inequality is an NP-problem Computing the maximum violation of a Bell inequality is an NP-problem   Subject : physics  Document Language : English  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  ISSN : 1570-0755  Journal Name : QUANTUM INFORMATION PROCESSING  Volume : 15  Issue Number : 6  Publishing Year : 1437 AH 2016 AD  Article Type : Article  Added Date : Thursday, August 10, 2017  Researchers Researcher Name (Arabic) Researcher Name (English) Researcher Type Dr Grade Email J Batle Batle, J Investigator Doctorate jbv276@uib.es C.H.R Ooi Ooi, C.H.R Researcher Doctorate   S Abdalla Abdalla, S Researcher Doctorate   A Bagdasaryan Bagdasaryan, A Researcher     Files File Name Type Description  42572.pdf pdf   Back To Researches Page