38 citations · 135 across the 25 of their papers we have counts for
4 papers · 2 filters
Sinkhorn algorithm for quantum permutation groups
Ion Nechita, Simon Schmidt, Moritz Weber
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogona…
Almost all trees have quantum symmetry
Luca Junk, Simon Schmidt, Moritz Weber
From the work of Erdős and Rényi from 1963 it is known that almost all graphs have no symmetry. In 2017, Lupini, Mančinska and Roberson proved a quantum counterpart: Almost all gra…
New products and -extensions of compact matrix quantum groups
Daniel Gromada, Moritz Weber
There are two very natural products of compact matrix quantum groups: the tensor product and the free product . We define a number of further products interpolatin…
Existence of quantum symmetries for graphs on up to seven vertices: a computer based approach
Christian Eder, Viktor Levandovskyy, Julien Schanz +3
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined b…