Quantum
The complexity of entangled graph colouring via polymorphisms
Publication: quant-ph updates on arXiv.org
Author: Eric Culf
Source published: 05/10/2026, 04:00:00 UTC
Briefing created: 05/10/2026, 04:24:32 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 05/10/2026, 04:13:25 UTC.
Briefings
This preprint establishes that entangled graph coloring with more than three colors is undecidable, achieved via gap-preserving reductions using an entangled analogue of polymorphisms. The study contrasts this with prior hardness reductions based on commutativity gadgets, demonstrating that entangled CSPs require fundamentally different structural symmetries to prove complexity. The research utilizes the CSP dichotomy theorem to link decision complexity to the symmetries of relational structures, specifically polymorphisms, in both classical and entangled settings.
Key points
- Entangled graph coloring with more than three colors is proven undecidable via gap-preserving reductions using entangled polymorphisms.
- This result contrasts with prior hardness reductions based on commutativity gadgets, indicating distinct structural requirements for entangled CSPs.
Context and limitations
The evidence is from a preprint (arXiv:2610.02565v1) and does not include experimental verification or computational results. The study focuses on theoretical reductions rather than practical algorithmic performance or specific graph instances.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 05/10/2026, 04:24:32 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeib5xsepyw6x4p5du7a7lscsy76fx27ln7nl5jxjekh72thuci2vve