Computing the maximum violation of a Bell inequality is an NP-problem (Q332067)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the maximum violation of a Bell inequality is an NP-problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.7652840614318848
0 references
0.7580795288085938
0 references
0.7528333067893982
0 references
0.7470285296440125
0 references
0.7453916072845459
0 references
