Related papers: Quantum automata, braid group and link polynomials
Loop braid groups characterize the exchange of extended objects, namely loops, in three dimensional space generalizing the notion of braid groups that describe the exchange of point particles in two dimensional space. Their interest in…
An analysis of the motion of a relativistic electron under a linear constraint in four dimensions is presented. Interesting results are given that show that the state of the electron is well defined under the formalism of time optimal…
We consider the problem of minimising the number of states in a multiplicity tree automaton over the field of rational numbers. We give a minimisation algorithm that runs in polynomial time assuming unit-cost arithmetic. We also show that a…
It is well-known in physics that the limit of large quantum spin $S$ should be understood as a semiclassical limit. This raises the question of whether such emergent classicality facilitates the approximation of computationally hard quantum…
In topological quantum computation, quantum information is stored in states which are intrinsically protected from decoherence, and quantum gates are carried out by dragging particle-like excitations (quasiparticles) around one another in…
Tensor-network methods enable probing dynamics of strongly interacting quantum many-body systems, including gauge theories, via Hamiltonian simulation, hence bypassing sign problems. They also have the potential to inform efficient…
We realize constant-space quantum computation by measure-many two-way quantum finite automata and evaluate their language recognition power by analyzing patterns of their exotic behaviors and by exploring their structural properties. In…
The Standard Model of particle physics provides very accurate predictions of phenomena occurring at the sub-atomic level, but the reason for the choice of symmetry group and the large number of particles considered elementary, is still…
We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement is bounded for any bipartite split along an edge of the tree. This is achieved by expanding the {\em time-evolving block decimation}…
The irreducible representations of two intermediate Casimir elements associated to the recoupling of three identical irreducible representations of $U_q(\mathfrak{sl}_2)$ are considered. It is shown that these intermediate Casimirs are…
Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large even for automata recognizing regular expressions with a small…
This work is dedicated to the consideration of the construction of a representation of braid group generators from vertex models with $N$-states, which provides a great way to study the knot invariant. An algebraic formula is proposed for…
We introduce new $U_q\mathfrak{sl}_2$-invariant boundary conditions for the open XXZ spin chain. For generic values of $q$ we couple the bulk Hamiltonian to an infinite-dimensional Verma module on one or both boundaries of the spin chain,…
Quantum and q-deformed algebras find their application not only in mathematical physics and field theoretical context, but also in phenomenology of particle properties. We describe (i) the use of quantum algebras U_q(su_n) corresponding to…
It is not possible, using standard lattice techniques in Euclidean space, to calculate the complete fermionic spectrum of a quantum field theory. Algorithms running on quantum computers have the potential to access the theory with real-time…
This is a systematic introduction for physicists to the theory of algebras and groups with braid statistics, as developed over the last three years by the author. There are braided lines, braided planes, braided matrices and braided groups…
The connection between braided Hopf algebra structure and the quantum group covariance of deformed oscillators is constructed explicitly. In this context we provide deformations of the Hopf algebra of functions on SU(1,1). Quantum subgroups…
We continue the study of quantum A-polynomials -- equations for knot polynomials with respect to their coloring (representation-dependence) -- as the relations between different links, obtained by hanging additional ``simple'' components on…
There is a fundamental difficulty in generalizing weighted automata to the case of infinite words: in general the infinite sum-of-products from which the weight of a given word is derived will diverge. Many solutions to this problem have…
We show how networks of Wilson lines realize quantum groups U_q(sl(m)), for arbitrary m, in 3d SU(N) Chern-Simons theory. Lifting this construction to foams of surface operators in 4d theory we find that rich structure of junctions is…