Related papers: Infinite quantum permutations
We show that all orthogonal free quantum groups are isomorphic to variants of the free orthogonal Wang algebra, the hyperoctahedral quantum group or the quantum permutation group. We also obtain a description of their free complexification.…
In a recent paper of Bhowmick, Skalski and So{\l}tan the notion of a quantum group of automorphisms of a finite quantum group was introduced and, for a given finite quantum group G, existence of the universal quantum group acting on G by…
An exposition of quantum permutation groups where an alternative to the 'Gelfand picture' of compact quantum groups is proposed. This point of view is inspired by algebraic quantum mechanics and posits that states on the algebra of…
I describe how integrable quantum field theories in 2 spacetime dimensions are characterized by infinite dimensional quantum group symmetries, namely the q-deformations of affine Lie algebras, and their Yangian limit. These symmetries can…
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 property. Moreover, to the best of our knowledge, these are…
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
The study of graph C*-algebras has a long history in operator algebras. Surprisingly, their quantum symmetries have never been computed so far. We close this gap by proving that the quantum automorphism group of a finite, directed graph…
Mathematical core of quantum mechanics is the theory of unitary representations of symmetries of physical systems. We argue that quantum behavior is a natural result of extraction of "observable" information about systems containing…
We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
To any complex Hadamard matrix we associate a quantum permutation group. The correspondence is not one-to-one, but the quantum group encapsulates a number of subtle properties of the matrix. We investigate various aspects of the…
We study quantum automorphism group of vertex-transitive graphs using intertwinner spaces of the magic unitary matrix associated to this quantum subgroups of $S_n^+$. We also give some applications to quantum symmetries of circulant graphs…
We describe the notion of a quantum family of maps of a quantum space and that of a quantum commutant of such a family. Quantum commutants are quantum semigroups defined by a certain universal property. We give a few examples of these…
In this survey article we give basic introduction to the theory of quantum families of maps. We begin with a general look at non-commutative (or "quantum") topology. Then we formulate all our results in this language. Existence of quantum…
We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…
We consider a constructive modification of quantum-mechanical formalism. Replacement of a general unitary group by unitary representations of finite groups makes it possible to reproduce quantum formalism without loss of its empirical…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…
We give examples of finite quantum permutation groups which arise from the twisting construction or as bicrossed products associated to exact factorizations in finite groups. We also give examples of finite quantum groups which are not…