Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Quantum polymorphism characterisation of commutativity gadgets in all quantum models
Eric Culf, Josse van Dobben de Bruyn, Peter Zeman
Commutativity gadgets provide a technique for lifting classical reductions between constraint satisfaction problems to quantum-sound reductions between the corresponding nonlocal g…
quant-ph2026
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
Prem Nigam Kar, David E. Roberson, Tim Seppelt +1
ManÄinska and Roberson [FOCS'20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al. [J…
quant-ph2025
Existence and nonexistence of commutativity gadgets for entangled CSPs
Eric Culf, Josse van Dobben de Bruyn, Matthijs Vernooij +1
Commutativity gadgets allow NP-hardness proofs for classical constraint satisfaction problems (CSPs) to be carried over to undecidability proofs for the corresponding entangled CSP…