Interactive Proofs with Approximately Commuting Provers
From MaRDI portal
Publication:3448798
DOI10.1007/978-3-662-47672-7_29zbMath1441.68088arXiv1510.00102OpenAlexW2218897312WikidataQ59792601 ScholiaQ59792601MaRDI QIDQ3448798
Thomas Vidick, Matthew Coudron
Publication date: 27 October 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.00102
Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Cryptography (94A60) Quantum coherence, entanglement, quantum correlations (81P40)
Related Items (1)
Cites Work
- Unnamed Item
- Non-deterministic exponential time has two-prover interactive protocols
- Classification of injective factors. Cases \(\mathrm{II}_1\), \(\mathrm{II}_\infty\), \(\mathrm{III}_\lambda\), \(\lambda\neq 1\)
- On non-semisplit extensions, tensor products and exactness of group \(C^*\)-algebras
- Quantum multi-prover interactive proof systems with limited prior entanglement.
- Three-Player Entangled XOR Games are NP-Hard to Approximate
- Private randomness expansion with untrusted devices
- Proof verification and the hardness of approximation problems
- Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices
- Almost Commuting Unitary Matrices
- Probabilistic checking of proofs
- Interactive proofs and the hardness of approximating cliques
- More randomness from the same data
- Connes' embedding problem and Tsirelson's problem
- Proposed Experiment to Test Local Hidden-Variable Theories
- Unique Games with Entangled Provers Are Easy
- Tsirelson's problem and asymptotically commuting unitary matrices
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
This page was built for publication: Interactive Proofs with Approximately Commuting Provers