Classical Simulation of Quantum CSP Strategies

2025-03-29

AI Summary

This work addresses the classical simulation of perfect quantum strategies for two-party quantum constraint satisfaction problems (CSPs): Can arbitrary perfect quantum strategies—relying on shared entanglement—be exactly replicated using only finite classical communication? The authors establish that a class of communication-enhanced classical strategies suffices, with communication cost bounded solely by the Hilbert space dimension of the shared quantum system and graph-theoretic parameters of the CSP template (e.g., chromatic number, maximum degree). Methodologically, they introduce a geometric rounding technique based on projection-valued measurements (PVMs) to rigorously convert quantum strategies into classical ones augmented with bounded communication. Their key contributions include: (i) the first boundedness result linking quantum vs. classical chromatic numbers under finite shared quantum information; (ii) a constructive PVM-based rounding framework; and (iii) an explicit upper bound on communication complexity. These results yield a new quantitative criterion for quantum advantage and inform the design of hybrid quantum-classical protocols in the NISQ era.

Technology Category

• Machine Learning: Quantum Machine Learning
• Constraint Satisfaction and Optimization: Satisfiability
• Game Theory and Economic Paradigms: Imperfect Information

Application Category

• Security and Privacy: Large-scale security measurements
• Economics, Online Markets and Human Computation: LLM based quality controls for crowd work
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs

Abstract

We prove that any perfect quantum strategy for the two-prover game encoding a constraint satisfaction problem (CSP) can be simulated via a perfect classical strategy with an extra classical communication channel, whose size depends only on $(i)$ the size of the shared quantum system used in the quantum strategy, and $(ii)$ structural parameters of the CSP template. The result is obtained via a combinatorial characterisation of perfect classical strategies with extra communication channels and a geometric rounding procedure for the projection-valued measurements involved in quantum strategies. A key intermediate step of our proof is to establish that the gap between the classical chromatic number of graphs and its quantum variant is bounded when the quantum strategy involves shared quantum information of bounded size.

Problem

• Simulating quantum CSP strategies classically with communication
• Bounding quantum-classical chromatic number gap
• Characterizing perfect classical strategies with extra communication

Innovation

• Classical simulation of quantum strategies with communication
• Combinatorial characterization of classical strategies
• Geometric rounding for quantum measurements