Nonlocal Games with Noisy Maximally Entangled States are Decidable
From MaRDI portal
Publication:5096445
DOI10.1137/20M134592XMaRDI QIDQ5096445
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
Quantum computation (81P68) Games involving topology, set theory, or logic (91A44) Quantum coherence, entanglement, quantum correlations (81P40) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- About the Connes embedding conjecture
- Calculus on normed vector spaces
- Impossibility of local state transformation via hypercontractivity
- Non-deterministic exponential time has two-prover interactive protocols
- Quantum Arthur-Merlin games
- The higher-order derivatives of spectral functions
- Noise stability of functions with low influences: invariance and optimality
- Inequalities in Fourier analysis
- Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
- Inequalities for trace norms of \(2\times 2\) block matrices.
- Maximally stable Gaussian partitions with discrete applications
- Gaussian bounds for noise correlation of functions
- Hypercontractivity for semigroups of unital qubit channels
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Quantum Proofs
- Some applications of hypercontractive inequalities in quantum information theory
- TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
- Hypercontractivity of quasi-free quantum semigroups
- Quantum Information Complexity
- On Non-Interactive Simulation of Joint Distributions
- Compressibility of Positive Semidefinite Factorizations and Quantum Models
- Randomly Supported Independence and Resistance
- Limitations on Quantum Dimensionality Reduction
- Entangled Games Are Hard to Approximate
- Proof verification and the hardness of approximation problems
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- On Sequences of Pairs of Dependent Random Variables
- On measures of dependence
- Extensions of Lipschitz mappings into a Hilbert space
- Quantum reverse hypercontractivity
- On the power of unique 2-prover 1-round games
- Lipschitz Continuity of Functions of Operators in the Schatten Classes
- Probabilistic checking of proofs
- The common information of two dependent random variables
- IP = PSPACE
- IP = SPACE
- The knowledge complexity of interactive proof-systems
- A Parallel Repetition Theorem
- Non interactive simulation of correlated distributions is decidable
- The Theory of Quantum Information
- THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
- Compression of quantum multi-prover interactive proofs
- Dimension Reduction for Polynomials over Gaussian Space and Applications
- Two-Message Quantum Interactive Proofs Are in PSPACE
- Quantum proof systems for iterated exponential time, and beyond
- Tsirelson’s problem and an embedding theorem for groups arising from non-local games
- Connes' embedding problem and Tsirelson's problem
- Hypercontractivity of simple random variables
- Classical verification of quantum proofs
- Proposed Experiment to Test Local Hidden-Variable Theories
- Unique Games with Entangled Provers Are Easy
- An invariance principle for polytopes
- A new quantum data processing inequality
- Some optimal inapproximability results
