Quantum polymorphism characterisation of commutativity gadgets in all quantum models
Eric Culf, Josse van Dobben de Bruyn, Peter Zeman

TL;DR
This paper develops a comprehensive framework for commutativity gadgets in quantum models, characterizing their existence through quantum polymorphism spaces and exploring their structural properties and separations.
Contribution
It introduces a unified approach to commutativity gadgets across quantum models, linking their existence to quantum polymorphism space collapses and analyzing their structure in relation to quantum permutation groups.
Findings
Existence of a commutativity gadget is equivalent to quantum polymorphisms collapsing to classical ones.
Robust and non-robust gadgets are characterized by stable commutativity in weighted polymorphism algebras.
Constructs relational structures with specific gadget properties, including separations between classes.
Abstract
Commutativity gadgets provide a technique for lifting classical reductions between constraint satisfaction problems to quantum-sound reductions between the corresponding nonlocal games. We develop a general framework for commutativity gadgets in the setting of quantum homomorphisms between finite relational structures. Building on the notion of quantum homomorphism spaces, we introduce a uniform notion of commutativity gadget capturing the finite-dimensional quantum, quantum approximate, and commuting-operator models. In the robust setting, we use the weighted-algebra formalism for approximate quantum homomorphisms to capture corresponding notions of robust commutativity gadgets. Our main results characterize both non-robust and robust commutativity gadgets purely in terms of quantum polymorphism spaces: in any model, existence of a commutativity gadget is equivalent to the collapse…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
