Pages that link to "Item:Q5091777"
From MaRDI portal
The following pages link to Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision (Q5091777):
Displaying 4 items.
- Correspondence between quantization schemes for two-player nonzero-sum games and CNOT complexity (Q1654117) (← links)
- (Q5226195) (← links)
- 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time (Q6040865) (← links)
- Locally universal C*-algebras with computable presentations (Q6633934) (← links)