Related papers: Quantum graphs, subfactors and tensor categories I
Let $\Uq$ be a quantum group. Regarding a (noncommutative) space with $\Uq$-symmetry as a $\Uq$-module algebra $A$, we may think of equivariant vector bundles on $A$ as projective $A$-modules with compatible $\Uq$-action. We construct an…
We define and study quantum permutations of infinite sets. This leads to discrete quantum groups which can be viewed as infinite variants of the quantum permutation groups introduced by Wang. More precisely, the resulting quantum groups…
Adapting a recent work of Brannan et al., on extending graph $C^*$-algebras to Quantum graphs, we introduce "Quantum Quivers" as an analogue of quivers where the edge and vertex set has been replaced by a $C^*$-algebra and the maps between…
This is a study of orbifold-quotients of quantum groups (quantum orbifolds $\Theta \rightrightarrows G_q$). These structures have been studied extensively in the case of the quantum $SU_2$ group. I will introduce a generalized mechanism…
Modular tensor categories are generalizations of the representation categories of quantum groups at roots of unity axiomatizing the properties necessary to produce 3-dimensional TQFTs. Although other constructions have since been found,…
The past few years have seen a revived interest in quantum geometrical characterizations of band structures due to the rapid development of topological insulators and semi-metals. Although the metric tensor has been connected to many…
The representations of the observable algebra of a low dimensional quantum field theory form the objects of a braided tensor category. The search for gauge symmetry in the theory amounts to finding an algebra which has the same…
We extend the usual process-theoretic view on locality and causality in subsystems (based on the tensor product case) to general quantum systems (i.e.\ possibly non-factor, finite-dimensional von Neumann algebras). To do so, we introduce a…
Based on our previous works, and in order to relate them with the theory of quantum graphs and the quantum computing principles, we once again try to introduce some newly developed technical structures just by relying on our toy example,…
Due to recent technological advances, actual quantum devices are being constructed and used to perform computations. As a result, many classical problems are being restated so as to be solved on quantum computers. Some examples include…
Graph Isomorphism is such an important problem in computer science, that it has been widely studied over the last decades. It is well known that it belongs to NP class, but is not NP-complete. It is thought to be of comparable difficulty to…
To each graph without loops and multiple edges we assign a family of rings. Categories of projective modules over these rings categorify $U^-_q(\mathfrak{g})$, where $\mathfrak{g}$ is the Kac-Moody Lie algebra associated with the graph.
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in…
We pick up a solvable ${\cal PT}-$symmetric quantum square well on an interval of $x \in := (-L,L)\mathbb{G}^{(2)}$ (with an $\alpha-$dependent non-Hermiticity given by Robin boundary conditions) and generalize it. In essence, we just…
We classify all compact quantum groups whose C*-algebra sits inside that of the free unitary quantum groups $U_{N}^{+}$. In other words, we classify all discrete quantum subgroups of $\widehat{U}_{N}^{+}$, thereby proving a quantum variant…
We use the language of von Neumann subfactors to investigate non-invertible symmetries in two dimensions. A fusion categorical symmetry $\mathcal{C}$, its module category $\mathcal{M}$, and a gauging labeled by an algebra object…
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…
Forgetting a subspace from a partial flag yields another partial flag composed of fewer subspaces. This induces a forgetful map $\pi : X \to X'$ between the corresponding flag varieties. We prove here that, for a degree large enough, the…
Associated to a finite graph $X$ is its quantum automorphism group $G$. The main problem is to compute the Poincar\'e series of $G$, meaning the series $f(z)=1+c_1z+c_2z^2+...$ whose coefficients are multiplicities of 1 into tensor powers…
One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor…