The complexity of entangled graph colouring via polymorphisms

quant-ph, cs.CC

Submitted: 2026-10-01

Updated: 2026-10-01

Comments: 33 pages, 0 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Sources

• Existence and nonexistence of commutativity gadgets for entangled CSPs
• Quantum polymorphism characterisation of commutativity gadgets in all quantum models
• Quantum Polymorphisms and the Complexity of Quantum Constraint Satisfaction
• Binary Constraint System Games and Locally Commutative Reductions

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians