Pages that link to "Item:Q3093626"

The following pages link to Entangled Games Are Hard to Approximate (Q3093626):

Displaying 20 items.

• Classical, quantum and nonsignalling resources in bipartite games (Q387029) (← links)
• On symmetric nonlocal games (Q391085) (← links)
• Unbounded violations of bipartite Bell inequalities via operator space theory (Q608918) (← links)
• Shannon-like games are difficult (Q686516) (← links)
• Large violation of Bell inequalities with low entanglement (Q717112) (← links)
• Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
• Quantum games: a review of the history, current state, and interpretation (Q1994770) (← links)
• Parallelization of entanglement-resistant multi-prover interactive proofs (Q2015158) (← links)
• Geometry of information structures, strategic measures and associated stochastic control topologies (Q2169821) (← links)
• Rank-one quantum games (Q2353189) (← links)
• Quantum de Finetti theorems under local measurements with applications (Q2358805) (← links)
• Three-Player Entangled XOR Games are NP-Hard to Approximate (Q2816299) (← links)
• Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967) (← links)
• Heralded channel Holevo superadditivity bounds from entanglement monogamy (Q4575959) (← links)
• Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
• Nonlocal Games with Noisy Maximally Entangled States are Decidable (Q5096445) (← links)
• Dimension Reduction for Polynomials over Gaussian Space and Applications (Q5121916) (← links)
• Tsirelson’s problem and an embedding theorem for groups arising from non-local games (Q5216992) (← links)
• Semi-definite programming and quantum information (Q6561827) (← links)
• Quantum interactive proofs using quantum energy teleportation (Q6566210) (← links)