Discrimination of Non-Local Correlations
In view of the importance of quantum non-locality in cryptography, quantum computation, and communication complexity, it is crucial to decide whether a given correlation exhibits non-locality or not. As proved by Pitowski, this problem is NP-complete, and is thus computationally intractable unless N...
Main Authors: | Alberto Montina, Stefan Wolf |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-01-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/2/104 |
Similar Items
-
Bell Inequalities with One Bit of Communication
by: Emmanuel Zambrini Cruzeiro, et al.
Published: (2019-02-01) -
A Limit on Quantum Nonlocality from an Information Processing Principle
by: Proulx, Marc-Olivier
Published: (2018) -
Quantum Nonlocality and Quantum Correlations in the Stern–Gerlach Experiment
by: Alma Elena Piceno Martínez, et al.
Published: (2018-04-01) -
Cutting Convex Polytopes by Hyperplanes
by: Takayuki Hibi, et al.
Published: (2019-04-01) -
Regular Polygonal Complexes of Higher Ranks in E³
by: Egon Schulte
Published: (2013-12-01)