Pages that link to "Item:Q2816299"
From MaRDI portal
The following pages link to Three-Player Entangled XOR Games are NP-Hard to Approximate (Q2816299):
Displaying 9 items.
- Geometry of information structures, strategic measures and associated stochastic control topologies (Q2169821) (← links)
- A parallel repetition theorem for entangled projection games (Q2351389) (← links)
- Rank-one quantum games (Q2353189) (← links)
- Quantum de Finetti theorems under local measurements with applications (Q2358805) (← links)
- Erratum: Three-Player Entangled XOR Games are NP-hard to Approximate (Q3387765) (← links)
- Interactive Proofs with Approximately Commuting Provers (Q3448798) (← links)
- (Q4638072) (← links)
- (Q5090382) (← links)
- A formalization of the CHSH inequality and Tsirelson's upper-bound in Isabelle/HOL (Q6190081) (← links)
