scientific article; zbMATH DE number 7250160
From MaRDI portal
Publication:5121908
DOI10.4230/LIPIcs.CCC.2018.20zbMath1441.68079arXiv1710.03062MaRDI QIDQ5121908
Thomas Vidick, Anand Natarajan
Publication date: 22 September 2020
Full work available at URL: https://arxiv.org/abs/1710.03062
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
2-person games (91A05) Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ Geometry of information structures, strategic measures and associated stochastic control topologies ⋮ Unnamed Item ⋮ Erratum: Three-Player Entangled XOR Games are NP-hard to Approximate
Cites Work
- Unnamed Item
- Non-deterministic exponential time has two-prover interactive protocols
- Self-testing/correcting with applications to numerical problems
- A parallel repetition theorem for entangled projection games
- A Multiprover Interactive Proof System for the Local Hamiltonian Problem
- Proof verification and the hardness of approximation problems
- Delegating Computation
- Monogamy of non-local quantum correlations
- Probabilistic checking of proofs
- Algebraic methods for interactive proof systems
- IP = PSPACE
- Interactive proofs and the hardness of approximating cliques
- A quantum linearity test for robustly verifying entanglement
- How to delegate computations
- Classical verification of quantum proofs
- Some optimal inapproximability results
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
This page was built for publication:
