Related papers: Quantum automata, braid group and link polynomials
A new type of algebras that represent a generalization of both quantum groups and braided groups is defined. These algebras are given by a pair of solutions of the Yang--Baxter equation that satisfy some additional conditions. Several…
Obtaining colored HOMFLY-PT polynomials for knots from 3-strand braid carrying arbitrary $SU(N)$ representation is still tedious. For a class of rank $r$ symmetric representations, $[r]$-colored HOMFLY-PT $H_{[r]}$ evaluation becomes…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…
Quantum networks are often modelled using Schroedinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article…
A new model of a Quantum Automaton (QA), working with qubits is proposed. The quantum states of the automaton can be pure or mixed and are represented by density operators. This is the appropriated approach to deal with measurements and…
Variational algorithms require architectures that naturally constrain the optimization space to run efficiently. Geometric quantum machine learning achieves this goal by encoding group structure into parameterized quantum circuits to…
In the 1920's Artin defined the braid group in an attempt to understand knots in a more algebraic setting. A braid is a certain arrangement of strings in three-dimensional space. It is a celebrated theorem of Alexander that every knot is…
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and…
We find an application in quantum finite automata for the ideas and results of [JL21] and [JL22]. We reformulate quantum finite automata with multiple-time measurements using the algebraic notion of near-ring. This gives a unified…
The ongoing progress in (nuclear) many-body theory is accompanied by an ever-rising increase in complexity of the underlying formalisms used to solve the stationary Schr\"odinger equation. The associated working equations at play in…
Little groups for preon branes (i.e. configurations of branes with maximal (n-1)/n fraction of survived supersymmetry) for dimensions d=2,3,...,11 are calculated for all massless, and partially for massive orbits. For massless orbits little…
We introduce an algebraic theory of integration on quantum planes and other braided spaces. In the one dimensional case we obtain a novel picture of the Jackson $q$-integral as indefinite integration on the braided group of functions in one…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
The Jones polynomial and the Kauffman bracket are constructed, and their relation with knot and link theory is described. The quantum groups and tangle functor formalisms for understanding these invariants and their descendents are given.…
We introduce a diagrammatic braided monoidal category, the quantum spin Brauer category, together with a full functor to the category of finite-dimensional, type $1$ modules for $U_q(\mathfrak{so}(N))$ or $U_q(\mathfrak{o}(N))$. This…
We construct a unique braid group action on modified $q$-Weyl algebra $\mathbf A_q(S)$. Under this action, we give a realization of the braid group action on quasi-split $\imath$quantum groups $^{\imath}\mathbf U(S)$ of type…
We construct an algorithm to simulate imaginary time evolution of translationally invariant spin systems with local interactions on an infinite, symmetric tree. We describe the state by symmetric iPEPS and use translation-invariant…
The aim of this work is to thoroughly investigate Buchi automata augmented with spatial constraints. The input trees of such an automaton are infinite k-ary Sigma-trees, with the nodes standing for time points, and Sigma including,…
A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum…
Quantum link models are a novel formulation of gauge theories in terms of discrete degrees of freedom. These degrees of freedom are described by quantum operators acting in a finite-dimensional Hilbert space. We show that for certain…