Quantum n-coloring is undecidable for every n 3
quant-ph, math.CO
Submitted: 2026-10-04
Updated: 2026-10-04
Sources
- Quantum Polymorphisms and the Complexity of Quantum Constraint Satisfaction
- Graph Homomorphisms for Quantum Players
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