Related papers: Quantum-rigid random quantum graphs

Let $S_n$ and $A_n$ denote the symmetric group and alternating group of degree $n$ with $n\geq 3$, respectively. Let $S$ be the set of all $3$-cycles in $S_n$. The \emph{complete alternating group graph}, denoted by $CAG_n$, is defined as…

In quantum resource theories (QRTs) certain quantum states and operations are deemed more valuable than others. While the determination of the ``free'' elements is usually guided by the constraints of some experimental setup, this can make…

We describe the structure of virtually solvable normal subgroups in the automorphism group of a right-angled Artin group ${\rm Aut}(A_\Gamma)$. In particular, we prove that a finite normal subgroup in ${\rm Aut}(A_\Gamma)$ has at most order…

We show that R-matricies of all simple quantum groups have the properties which permit to present quantum group twists as transitions to other coordinate frames on quantum spaces. This implies physical equivalence of field theories…

Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…

In Gen. Rel. Grav. (36, 111-126 (2004); in press, gr-qc/0410010) we have proposed a model unifying general relativity and quantum mechanics based on a noncommutative geometry. This geometry was developed in terms of a noncommutative algebra…

It is known that, for the algebra of functions on a Kleinian singularity, the parameter space of deformations and the parameter space of quantizations coincide. We prove that, for a Kleinian singularity of type $\mathbf{A}$ or $\mathbf{D}$,…

We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competitive with classical methods on scoring similarity between…

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…

We study the graph isomorphism game that arises in quantum information theory from the perspective of bigalois extensions of compact quantum groups. We show that every algebraic quantum isomorphism between a pair of (quantum) graphs $X$ and…

We introduce a class of multiqubit quantum states which generalizes graph states. These states correspond to an underlying mathematical hypergraph, i.e. a graph where edges connecting more than two vertices are considered. We derive a…

We prove the Andruskiewitsch-Dumas conjecture that the automorphism group of the positive part of the quantized universal enveloping algebra $U_q({\mathfrak{g}})$ of an arbitrary finite dimensional simple Lie algebra g is isomorphic to the…

Let $X$ be a smooth, projective, geometrically connected curve over a finite field $\mathbb{F}_q$, and let $G$ be a split semisimple algebraic group over $\mathbb{F}_q$. Its dual group $\hat{G}$ is a split reductive group over $\mathbb{Z}$.…

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…

In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…

Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…

Given a quantum permutation group $G\subset S_N^+$, with orbits having the same size $K$, we construct a universal matrix model $\pi:C(G)\to M_K(C(X))$, having the property that the images of the standard coordinates $u_{ij}\in C(G)$ are…

Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…

Let R be a finite commutative ring with unity, and let G = (V, E) be a simple graph. The zero-divisor graph, denoted by {\Gamma}(R) is a simple graph with vertex set as R, and two vertices x, y \in R are adjacent in {\Gamma}(R) if and only…

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…