Quantum free games
From MaRDI portal
Publication:6499326
DOI10.1145/3564246.3585208WikidataQ130909510 ScholiaQ130909510MaRDI QIDQ6499326FDOQ6499326
Authors: Anand Natarajan, Tina Zhang 
Publication date: 8 May 2024
Cites Work
- Title not available (Why is that?)
- Proof verification and the hardness of approximation problems
- Probabilistic checking of proofs
- Derandomizing Arthur-Merlin games using hitting sets
- Quantum de finetti theorems under local measurements with applications
- Non-deterministic exponential time has two-prover interactive protocols
- The power of unentanglement
- A quantum characterization of NP
- Testing product states, quantum Merlin-Arthur games and tensor optimization
- Improved soundness for QMA with multiple provers
- A quasipolynomial-time algorithm for the quantum separability problem
- A parallel repetition theorem for entangled projection games
- Compression of quantum multi-prover interactive proofs
- Can you compute the operator norm?
- Infinite randomness expansion with a constant number of devices
- Most rigid representation and Cayley index of finitely generated groups
- Title not available (Why is that?)
- Entanglement in Interactive Proof Systems with Binary Answers
- Hardness amplification for entangled games via anchoring
This page was built for publication: Quantum free games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499326)
