Nonlocal Games with Noisy Maximally Entangled States are Decidable
From MaRDI portal
Publication:5096445
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
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 432503 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 3497786 (Why is no real title available?)
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 7559053 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- scientific article; zbMATH DE number 3019401 (Why is no real title available?)
- A Parallel Repetition Theorem
- A first course in mathematical analysis
- A lower bound on the value of entangled binary games
- A new quantum data processing inequality
- A regularity lemma and low-weight approximators for low-degree polynomial threshold functions
- About the Connes embedding conjecture
- An introduction to entanglement measures
- An invariance principle for polytopes
- Calculus on normed vector spaces
- Classical verification of quantum proofs
- Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
- Compressibility of Positive Semidefinite Factorizations and Quantum Models
- Compression of quantum multi-prover interactive proofs
- Connes' embedding problem and Tsirelson's problem
- Convex optimization algorithms
- Dimension Reduction for Polynomials over Gaussian Space and Applications
- Entangled games are hard to approximate
- Extensions of Lipschitz mappings into a Hilbert space
- Gaussian bounds for noise correlation of functions
- Hypercontractivity for semigroups of unital qubit channels
- Hypercontractivity of quasi-free quantum semigroups
- Hypercontractivity of simple random variables
- IP = PSPACE
- IP = SPACE
- Impossibility of local state transformation via hypercontractivity
- Inequalities for trace norms of \(2\times 2\) block matrices.
- Inequalities in Fourier analysis
- Limitations on quantum dimensionality reduction
- Lipschitz Continuity of Functions of Operators in the Schatten Classes
- Maximally stable Gaussian partitions with discrete applications
- Noise stability of functions with low influences: invariance and optimality
- Non interactive simulation of correlated distributions is decidable
- Non-deterministic exponential time has two-prover interactive protocols
- Notes on super-operator norms induced by Schatten norms
- On Non-Interactive Simulation of Joint Distributions
- On Sequences of Pairs of Dependent Random Variables
- On measures of dependence
- On the power of unique 2-prover 1-round games
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Proposed experiment to test local hidden-variable theories
- Quantum Arthur-Merlin games
- Quantum information complexity
- Quantum proof systems for iterated exponential time, and beyond
- Quantum proofs
- Quantum reverse hypercontractivity
- Randomly Supported Independence and Resistance
- Some applications of hypercontractive inequalities in quantum information theory
- Some optimal inapproximability results
- The common information of two dependent random variables
- The higher-order derivatives of spectral functions
- The knowledge complexity of interactive proof-systems
- The set of quantum correlations is not closed
- The theory of quantum information
- Towards a general theory of quantum games
- Tsirelson's problem and Kirchberg's conjecture
- Tsirelson's problem and an embedding theorem for groups arising from non-local games
- Two-Message Quantum Interactive Proofs Are in PSPACE
- Unique games with entangled provers are easy
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
Cited in
(5)- Maximally Entangled State in Pseudo-Telepathy Games
- scientific article; zbMATH DE number 7559121 (Why is no real title available?)
- Nonlocal Quantum XOR Games for Large Number of Players
- Extended non-local games and monogamy-of-entanglement games
- On deciding the existence of perfect entangled strategies for nonlocal games
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)
