Computing the maximum violation of a Bell inequality is an NP-problem
Document Type
Article
Publication Date
1-1-2016
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.
Keywords
Bell inequalities, NP-problem, Turing machine
Divisions
PHYSICS
Funders
Ministry of Education Malaysia: High Impact Research MoE Grant UM.C/625/1/HIR/MoE/CHAN/04
Publication Title
Quantum Information Processing
Volume
15
Issue
6
Publisher
Springer Verlag (Germany)
COinS