scientific article; zbMATH DE number 7559121
From MaRDI portal
Publication:5090458
DOI10.4230/LIPICS.STACS.2019.12MaRDI QIDQ5090458FDOQ5090458
Authors: Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, Troy Lee 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1811.11068
Title of this publication is not available (Why is that?)
Recommendations
- Extended nonlocal games from quantum-classical games
- NON-CLASSICAL QUANTUM CORRELATIONS IN QUANTUM GAMES
- Classical, quantum and nonsignalling resources in bipartite games
- SEPARATION BETWEEN CLASSICAL AND QUANTUM WINNING STRATEGIES FOR THE MATCHING GAME
- Graph-theoretical bounds on the entangled value of non-local games
- Extended non-local games and monogamy-of-entanglement games
- Nonlocal Games with Noisy Maximally Entangled States are Decidable
- Limitations of semidefinite programs for separable states and entangled games
- The relationship between quantum and classical correlation in games
- On deciding the existence of perfect entangled strategies for nonlocal games
semidefinite programmingpseudorandomnesscommunication complexityGowers normsnonlocal gamesbounded separations
Cites Work
- Counting graph homomorphisms
- Quantum analogues of the Bell inequalities. The case of two spatially separated domains
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Title not available (Why is that?)
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Exponential separation of quantum and classical communication complexity
- Decision Trees and Influences of Variables Over Product Probability Spaces
- Weak quasi-randomness for uniform hypergraphs
- Conditional Hardness for Approximate Coloring
- On the power of unique 2-prover 1-round games
- Quantum lower bounds by polynomials
- Lower bounds on information complexity via zero-communication protocols and applications
- Lower bounds in communication complexity based on factorization norms
- Unbounded violation of tripartite Bell inequalities
- Explicit lower and upper bounds on the entangled value of multiplayer XOR games
- The Grothendieck Constant is Strictly Smaller than Krivine's Bound
- Title not available (Why is that?)
- Graph norms and Sidorenko's conjecture
- The inverse conjecture for the Gowers norm over finite fields in low characteristic
- Near-optimal algorithms for unique games
- Finite reflection groups and graph norms
- Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement
- Multiplayer parallel repetition for expanding games
Cited In (5)
- SEPARATION BETWEEN CLASSICAL AND QUANTUM WINNING STRATEGIES FOR THE MATCHING GAME
- Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
- On deciding the existence of perfect entangled strategies for nonlocal games
- Nonlocal Quantum XOR Games for Large Number of Players
- Nonlocal Games with Noisy Maximally Entangled States are Decidable
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090458)
