Computing the maximum violation of a Bell inequality is an NP-problem (Q332067)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the maximum violation of a Bell inequality is an NP-problem |
scientific article |
Statements
Computing the maximum violation of a Bell inequality is an NP-problem (English)
0 references
27 October 2016
0 references
Bell inequalities
0 references
NP-problem
0 references
Turing machine
0 references
0 references
0 references
0 references
