6 citations · 12 across the 7 of their papers we have counts for
Showing 2019 · math.QAShow all
2 papers · 2 filters
math.QA2019
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…
math.QA2019★ 6 cited
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…