Related papers: Classification of Quantum Graphs on $M_2$ and thei…
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…
The quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the…
Motivated by topology, we develop a general theory of traces and shadows for an endobicategory, which is a~pair: bicategory $\mathbf{C}$ and endobifunctor $\Sigma\colon \mathbf C \to\mathbf C$. For a graded linear bicategory and a fixed…
The expressions for the $\hat{R}$--matrices for the quantum groups SO$_{q^2}$(5) and SO$_q$(6) in terms of the $\hat{R}$--matrices for Sp$_q$(2) and SL$_q$(4) are found, and the local isomorphisms of the corresponding quantum groups are…
Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a…
The paper considers the spectral determinant of quantum graph families with chaotic classical limit and no symmetries. The secular coefficients of the spectral determinant are found to follow distributions with zero mean and variance…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…
We obtain an explicit characterization of linear maps, in particular, quantum channels, which are covariant with respect to an irreducible representation ($U$) of a finite group ($G$), whenever $U \otimes U^c$ is simply reducible (with…
We give a combinatorial characterization of the group of quasiconformal homeomorphisms of a closed, oriented surface $S$ of genus at least $2$. In particular, we prove they are exactly the automorphisms of a graph of essential quasicircles…
We follow up on previous work which found that commonly used graph evolution moves lead to conserved quantities that can be expressed in terms of the braiding of the graph in its embedding space. We study non-embedded graphs under three…
We construct quantum models of two particles on a compact metric graph with singular two-particle interactions. The Hamiltonians are self-adjoint realisations of Laplacians acting on functions defined on pairs of edges in such a way that…
We show that a random graph studied by Ioffe and Levit is an example of an inhomogeneous random graph of the type studied by Bollobas, Janson and Riordan, which enables us to give a new, simple, proof of their result on a phase transition.
We classify up to isomorphism the quantum generalized Weyl algebras and determine their automorphism groups in all cases in a uniform way, including those where the parameter q is a root of unity, thereby completing the results obtained by…
We consider two Z/2Z-actions on the Podles generic quantum spheres. They yield, as noncommutative quotient spaces, the Klimek-Lesniewski q-disc and the quantum real projective space, respectively. The C*-algebras of all these quantum spaces…
The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…
A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…
Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of…
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…
We show that in the quantum query model the complexity of detecting a triangle in an undirected graph on $n$ nodes can be done using $O(n^{1+{3\over 7}}\log^{2}n)$ quantum queries. The same complexity bound applies for outputting the…
This expository article explains how planar diagrammatics naturally arise in the study of categorified quantum groups with a focus on the categorification of quantum sl2. We derive the definition of categorified quantum sl2 and highlight…