Related papers: Quantum Probabilistic Spaces on Graphs for Topolog…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
Anyons, quasiparticles living in two-dimensional spaces with exotic exchange statistics, can serve as the fundamental units for fault-tolerant quantum computation. However, experimentally demonstrating anyonic statistics is a challenge due…
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 develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
The spin--network quantum simulator model, which essentially encodes the (quantum deformed) SU(2) Racah--Wigner tensor algebra, is particularly suitable to address problems arising in low dimensional topology and group theory. In this…
Topological quantum computing holding global anti-interference ability is realized by braiding some anyons, such as well-known Fibonacci anyons. Here, based on $SO(3)_2 $ theory we obtain a total of 6 anyon models utilizing…
Braiding operators corresponding to the third Reidemeister move in the theory of knots and links are realized in terms of parametrized unitary matrices for all dimensions. Two distinct classes are considered. Their (non-local) unitary…
In this paper we will present some ideas to use 3D topology for quantum computing extending ideas from a previous paper. Topological quantum computing used \textquotedblleft knotted\textquotedblright{} quantum states of topological phases…
We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wavefunction statistics. This operator is the analogue of the classical evolution operator on…
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
Braiding and fusion rules of topological excitations are indispensable topological invariants in topological quantum computation and topological orders. While excitations in 2D are always particle-like anyons, those in 3D incorporate not…
In spacetime dimensions of 4 (i.e., 3+1) and higher, topological orders exhibit spatially extended excitations like loops and membranes, which support diverse topological data characterizing braiding, fusion, and shrinking processes,…
We introduce a pentagon equation solver, available as part of SageMath, and use it to construct braid group representations associated to certain anyon systems. We recall the category-theoretic framework for topological quantum computation…
We show that a class of background independent models of quantum spacetime have local excitations that can be mapped to the first generation fermions of the standard model of particle physics. These states propagate coherently as they can…
Theoretical research into many-body quantum systems has mostly focused on regular structures which have a small, simple unit cell and where a vanishingly small number of pairs of the constituents directly interact. Motivated by advances in…
We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum…
The aim of this paper is to analyse algorithms for constructing presentations of graph braid groups from the point of view of anyonic quantum statistics on graphs. In the first part of this paper, we provide a comprehensive review of an…
We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains, that is, classical Markov chains with added memory. We show that these can simulate quantum walks, allowing us…
Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…