Nonlocal Games with Noisy Maximally Entangled States are Decidable
From MaRDI portal
Publication:5096445
DOI10.1137/20M134592XMaRDI QIDQ5096445FDOQ5096445
Authors: Minglong Qin, Penghui Yao 
Publication date: 17 August 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.09140
Recommendations
- On deciding the existence of perfect entangled strategies for nonlocal games
- Noisy non-transitive quantum games
- Extended non-local games and monogamy-of-entanglement games
- Extended nonlocal games from quantum-classical games
- scientific article; zbMATH DE number 7559121
- Note on maximally entangled Eisert-Lewenstein-Wilkens quantum games
- Maximally Entangled State in Pseudo-Telepathy Games
- Graph-theoretical bounds on the entangled value of non-local games
- Einstein meets Turing: the computability of nonlocal games
- Nonlocal Quantum XOR Games for Large Number of Players
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Games involving topology, set theory, or logic (91A44)
Cites Work
- On measures of dependence
- Extensions of Lipschitz mappings into a Hilbert space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A lower bound on the value of entangled binary games
- Title not available (Why is that?)
- Proposed experiment to test local hidden-variable theories
- Inequalities in Fourier analysis
- Some applications of hypercontractive inequalities in quantum information theory
- Limitations on quantum dimensionality reduction
- Proof verification and the hardness of approximation problems
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Towards a general theory of quantum games
- Probabilistic checking of proofs
- The theory of quantum information
- Some optimal inapproximability results
- Quantum Arthur-Merlin games
- An introduction to entanglement measures
- The knowledge complexity of interactive proof-systems
- Inequalities for trace norms of \(2\times 2\) block matrices.
- Gaussian bounds for noise correlation of functions
- On the power of unique 2-prover 1-round games
- Non-deterministic exponential time has two-prover interactive protocols
- The higher-order derivatives of spectral functions
- Noise stability of functions with low influences: invariance and optimality
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Notes on super-operator norms induced by Schatten norms
- The common information of two dependent random variables
- Maximally stable Gaussian partitions with discrete applications
- A Parallel Repetition Theorem
- Compressibility of Positive Semidefinite Factorizations and Quantum Models
- Hypercontractivity of quasi-free quantum semigroups
- Quantum proofs
- Tsirelson's problem and Kirchberg's conjecture
- About the Connes embedding conjecture
- IP = PSPACE
- Two-Message Quantum Interactive Proofs Are in PSPACE
- Connes' embedding problem and Tsirelson's problem
- Unique games with entangled provers are easy
- Lipschitz Continuity of Functions of Operators in the Schatten Classes
- Entangled games are hard to approximate
- An invariance principle for polytopes
- Calculus on normed vector spaces
- Title not available (Why is that?)
- Hypercontractivity for semigroups of unital qubit channels
- On Sequences of Pairs of Dependent Random Variables
- Impossibility of local state transformation via hypercontractivity
- A new quantum data processing inequality
- Hypercontractivity of simple random variables
- A regularity lemma and low-weight approximators for low-degree polynomial threshold functions
- Title not available (Why is that?)
- IP = SPACE
- Convex optimization algorithms
- Classical verification of quantum proofs
- Quantum information complexity
- Quantum proof systems for iterated exponential time, and beyond
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
- Title not available (Why is that?)
- The set of quantum correlations is not closed
- Compression of quantum multi-prover interactive proofs
- On Non-Interactive Simulation of Joint Distributions
- Non interactive simulation of correlated distributions is decidable
- Dimension Reduction for Polynomials over Gaussian Space and Applications
- Quantum reverse hypercontractivity
- Randomly Supported Independence and Resistance
- A first course in mathematical analysis
Cited In (5)
This page was built for publication: Nonlocal Games with Noisy Maximally Entangled States are Decidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096445)
