Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (Q5091777): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2966029787 / rank | |||
Normal rank | |||
| Property / title | |||
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (English) | |||
| Property / title: Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (English) / rank | |||
Normal rank | |||
Latest revision as of 09:23, 30 July 2024
scientific article; zbMATH DE number 7564425
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision |
scientific article; zbMATH DE number 7564425 |
Statements
27 July 2022
0 references
quantum complexity theory
0 references
non-local game
0 references
multi-prover interactive proof
0 references
entanglement
0 references
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (English)
0 references
