صورة الغلاف

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...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: Batle, J., Raymond Ooi, C.H., Abdalla, S., Bagdasaryan, A.
التنسيق: مقال
منشور في: Springer Verlag (Germany) 2016
الموضوعات:
Q Science (General)
QC Physics
الوصول للمادة أونلاين:http://eprints.um.edu.my/18484/
http://dx.doi.org/10.1007/s11128-016-1275-2
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
id my.um.eprints.18484
record_format eprints
spelling my.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 http://dx.doi.org/10.1007/s11128-016-1275-2 doi:10.1007/s11128-016-1275-2
institution Universiti Malaya
building UM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaya
content_source UM Research Repository
url_provider http://eprints.um.edu.my/
topic Q Science (General)
QC Physics
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
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.
format Article
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.
title 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_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_sort computing the maximum violation of a bell inequality is an np-problem
publisher Springer Verlag (Germany)
publishDate 2016
url http://eprints.um.edu.my/18484/
http://dx.doi.org/10.1007/s11128-016-1275-2
_version_ 1643690718112251904
score 13.251813

مواد مشابهة