Showing quant-phShow all
2 papers · 1 filter
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…
quant-ph2025
Lifting the maximally-entangledness assumption in robust self-testing for synchronous games
Matthijs Vernooij, Yuming Zhao
Robust self-testing in non-local games allows a classical referee to certify that two untrustworthy players are able to perform a specific quantum strategy up to high precision. Pr…