7 citations · 7 across the 2 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2019
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
Laura Mančinska, David E. Roberson
Over 50 years ago, Lovász proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--32…
quant-ph2018
Oddities of quantum colorings
Laura Mančinska, David E. Roberson
We study quantum analogs of graph colorings and chromatic number. Initially defined via an interactive protocol, quantum colorings can also be viewed as a natural operator relaxati…
quant-ph2015★ 7 cited
Deciding the existence of perfect entangled strategies for nonlocal games
Laura Mančinska, David E. Roberson, Antonios Varvitsiotis
First, we consider the problem of deciding whether a nonlocal game admits a perfect entangled strategy that uses projective measurements on a maximally entangled shared state. Via…