Quantum-accelerated constraint programming

“This work suggests that CP is a promising candidate application for early fault-tolerant quantum computers and beyond.”

Reassuring, maybe we’ll continue to be relevant when everyone has a quantum computer in their pocket. 🙂

Note also that “Contrary to myth, quantum computers are not known to be able to solve efficiently the very hard class called NP-complete problems.“

CP and quantum computing has a long history. See Tad Hogg’s Exploiting the Deep Structure of Constraint Satisfaction Problems with Quantum Computers from 1997.