activity
20212026
most citedSolution group representations as quantum symmetries of graphs

6 citations · 6 across the 8 of their papers we have counts for

collaborators

9 papers

math.CO2026

Topological and Geometric Perspectives on Homomorphism Indistinguishability

Josse van Dobben de Bruyn, Jérémie Marquès, David E. Roberson +3

Two graphs and are homomorphism indistinguishable over a graph class if, for every graph , the number of homomorphisms from to is e…

math.QA2025

Free Inhomogeneous Wreath Product of Quantum Groups

Josse van Dobben de Bruyn, Amaury Freslon, Prem Nigam Kar +2

We introduce the free inhomogeneous wreath product of compact matrix quantum groups, which generalizes the free wreath product (Bichon 2004). We use this to present a general techn…

math.QA2025

Group Invariant Quantum Latin Squares

Arnbjörg Soffía Árnadóttir, David E. Roberson

A quantum Latin square is an array of unit vectors where each row and column forms an orthonormal basis of a fixed complex vector space. We introduce the notion of $(G…

quant-ph2024

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. [JC…

math.QA2024

Quantum Sabidussi's Theorem

Arnbjörg Soffía Árnadóttir, Josse van Dobben de Bruyn, Prem Nigam Kar +2

Sabidussi's theorem [Duke Math. J. 28, 1961] gives necessary and sufficient conditions under which the automorphism group of a lexicographic product of two graphs is a wreath produ…

quant-ph2023

Transitive Nonlocal Games

Prem Nigam Kar, Jitendra Prakash, David E Roberson

We study a class of nonlocal games, called transitive games, for which the set of perfect strategies forms a semigroup. We establish several interesting correspondences of bisynchr…

math.QA2023

Quantum automorphism groups of trees

Josse van Dobben de Bruyn, Prem Nigam Kar, David E. Roberson +2

We give a characterisation of quantum automorphism groups of trees. In particular, for every tree, we show how to iteratively construct its quantum automorphism group using free pr…

math.QA2023

Asymmetric graphs with quantum symmetry

Josse van Dobben de Bruyn, David E. Roberson, Simon Schmidt

We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this…

math.QA2021★ 6 cited

Solution group representations as quantum symmetries of graphs

David Roberson, Simon Schmidt

In 2019, Aterias et al. constructed pairs of quantum isomorphic, non-isomorphic graphs from linear constraint systems. This article deals with quantum automorphisms and quantum iso…