A trace costs one quantifier: the exact complexity of perfect play in nonlocal games
quant-ph, math.LO, math.OA
Submitted: 2026-11-07
Updated: 2026-11-07
Code: https://github.com/Apsiape/perfect-play-arithmetical-hierarchy
Terminology
Sources
- Entanglement-assisted zero-error capacity is upper bounded by the Lovasz theta function
- On the undecidability of quantum channel capacities
- A non-robust quantum correlation self-test
- On torsion in finitely presented groups
- Perfect Commuting-Operator Strategies for Linear System Games
- Characterization of Binary Constraint System Games
- The I 3322 Bell inequality requires infinite dimensions
- Unconditional separation of finite and infinite-dimensional quantum correlations
- Improving zero-error classical communication with entanglement
- Curious properties of free hypergraph C*-algebras
- The membership problem for constant-sized quantum correlations is undecidable
- An Explicit Counterexample to Tsirelson's Problem via a Linear System Game
- Classification of hyperfinite factors up to completely bounded isomorphism of their preduals
- Universality of graph homomorphism games and the quantum coloring problem
- MIP*=RE
- A synchronous game for binary constraint systems
- Certified exact identification of the I3322 quantum value
- MIPco=coRE
- Perfect strategies for non-signalling games
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements