Quantum free games

DOI10.1145/3564246.3585208WikidataQ130909510 ScholiaQ130909510MaRDI QIDQ6499326

Tina Zhang, Anand Natarajan

Publication date: 8 May 2024

zbMATH Keywords

entanglementinteractive proofsQMA(2)nonlocal gamesself-testingMIP*

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quantum characterization of NP
• Non-deterministic exponential time has two-prover interactive protocols
• Derandomizing Arthur-Merlin games using hitting sets
• Most rigid representation and Cayley index of finitely generated groups
• A parallel repetition theorem for entangled projection games
• Can you compute the operator norm?
• Proof verification and the hardness of approximation problems
• Probabilistic checking of proofs
• Compression of quantum multi-prover interactive proofs
• Hardness amplification for entangled games via anchoring
• Infinite randomness expansion with a constant number of devices
• Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
• A quasipolynomial-time algorithm for the quantum separability problem
• Entanglement in Interactive Proof Systems with Binary Answers
• Quantum de finetti theorems under local measurements with applications

This page was built for publication: Quantum free games