Related papers: How symmetric is too symmetric for large quantum s…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…
Consider $ G:= PSL_2(\R)\equiv T^1\H^2$, a modular group $ \Gamma$, and the homogeneous space $ \Gamma\sm G \equiv T^1(\Gamma\sm\H^2)$. Endow $ G $, and then $ \Gamma\sm G $, with a canonical left-invariant metric, thereby equipping it with…
Dynamical quantum field theories (QFTs), such as those in which spacetimes are equipped with a metric and/or a field in the form of a smooth map to a target manifold, can be formulated axiomatically using the language of…
A geometric interpretation and generalisation for the Galois action on finite group character tables is sketched. The generalisation is a Galois action on the space Map_G(G^n,\bar{Q})/S_n for each finite G, where G acts by simultaneous…
Intersection growth concerns the asymptotic behavior of the index of the intersection of all subgroups of a group that have index at most n. In this note we show that the intersection growth of some groups may not be a nicely behaved…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
For any locality-preserving action of a group $G$ on a quantum spin chain one can define an anomaly index taking values in the group cohomology of $G$. The anomaly index is a kinematic quantity, it does not depend on the Hamiltonian. We…
In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…
We introduce an object called a \emph{subspace graph} that formalizes the technique of multidimensional quantum walks. Composing subspace graphs allows one to seamlessly combine quantum and classical reasoning, keeping a classical structure…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
Suppose that a compact quantum group ${\mathcal Q}$ acts faithfully on a smooth, compact, connected manifold $M$, i.e. has a $C^{\ast}$ (co)-action $\alpha$ on $C(M)$, such that $\alpha(C^\infty(M)) \subseteq C^\infty(M, {\mathcal Q})$ and…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
Quantum walk is a potent technique for building quantum algorithms. This paper examines the quantum walk search algorithm on complete multipartite graphs with multiple marked vertices, which has not been explored before. Two specific cases…
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…
Let $G$ be a finite group and let $c(G)$ be the number of cyclic subgroups of $G$. We study the function $\alpha(G) = c(G)/|G|$. We explore its basic properties and we point out a connection with the probability of commutation. For many…
We study the algebraic connectivity (or second Laplacian eigenvalue) of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$,…
It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…
We prove that counting copies of any graph $F$ in another graph $G$ can be achieved using basic matrix operations on the adjacency matrix of $G$. Moreover, the resulting algorithm is competitive for medium-sized $F$: our algorithm recovers…
This paper realizes of two families of combinatorial symmetric functions via the complex character theory of the finite general linear group $\mathrm{GL}_{n}(\mathbb{F}_{q})$: chromatic quasisymmetric functions and vertical strip LLT…