75 citations · 175 across the 17 of their papers we have counts for
27 papers
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
David E. Roberson, Tim Seppelt
We show that feasibility of the level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability…
Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree
David E. Roberson
We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they pres…
Quantum symmetry vs nonlocal symmetry
David E. Roberson, Simon Schmidt
We introduce the notion of nonlocal symmetry of a graph , defined as a winning quantum correlation for the -automorphism game that cannot be produced classically. Recent conn…
Limit of Gaussian operations and measurements for Gaussian state discrimination, and its application to state comparison
David E. Roberson, Shuro Izumi, Wojciech Roga +3
We determine the optimal method of discriminating and comparing quantum states from a certain class of multimode Gaussian states and their mixtures when arbitrary global Gaussian o…
Graph isomorphism: Physical resources, optimization models, and algebraic characterizations
Laura Mančinska, David E. Roberson, Antonios Varvitsiotis
In the -isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either or ,…
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…