20 citations · 85 across the 19 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
quant-ph2025
Quantum Polymorphisms and the Complexity of Quantum Constraint Satisfaction
Lorenzo Ciardo, Gideo Joubert, Antoine Mottet
We introduce the concept of quantum polymorphisms to the complexity theory of quantum constraint satisfaction. Via this notion, we build an algebraic framework of reductions betwee…
cs.LO2025
Algebraic and algorithmic synergies between promise and infinite-domain CSPs
Antoine Mottet
We establish a framework that allows us to transfer results between some constraint satisfaction problems with infinite templates and promise constraint satisfaction problems. On t…