相关论文: Quantum automata, braid group and link polynomials

So-called separation automata are in the core of several recently invented quasi-polynomial time algorithms for parity games. An explicit $q$-state separation automaton implies an algorithm for parity games with running time polynomial in…

We construct a family of $q$ deformations of $E(2)$ group for nonzero complex parameters $|q|<1$ as locally compact braided quantum groups over the circle group $\mathbb{T}$ viewed as a quasitriangular quantum group with respect to the…

Tensor network theory and quantum simulation are respectively the key classical and quantum computing methods in understanding quantum many-body physics. Here, we introduce the framework of hybrid tensor networks with building blocks…

Kauffman and Lomonaco explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In the work of G.…

Quantum link models (QLMs) offer the realistic prospect for the practical implementation of lattice quantum electrodynamics (QED) on modern quantum simulators, and they provide a venue for exploring various nonergodic phenomena relevant to…

Construction of (colored) knot polynomials for double-fat graphs is further generalized to the case when "fingers" and "propagators" are substituting R-matrices in arbitrary closed braids with m-strands. Original version of arXiv:1504.00371…

The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…

In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…

A visualization for dynamics of a qudit spin vector in a time-dependent magnetic field is realized by means of mapping a solution for a spin vector on the three-dimensional spherical curve (vector hodograph). The obtained results obviously…

Computing the Jones polynomial of general link diagrams is known to be $\#$P-hard, while restricting the computation to braid closures on fixed number of strands allows for a polynomial time algorithm. We investigate polynomial time…

Exchanging particles on graphs, or more concretely on networks of quantum wires, has been proposed as a means to perform fault tolerant quantum computation. This was inspired by braiding of anyons in planar systems. However, exchanges on a…

We develop a diagrammatic calculus for representations of unrolled quantum $\mathfrak{sl}_2$ at a fourth root of unity. This allows us to prove Seifert-Torres type formulas for certain splice links using quantum algebraic methods, rather…

Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…

We construct a family of q-deformations of SU(2) for complex parameters q not equal to 0. For real q, the deformation coincides with Woronowicz' compact quantum SU_q(2) group. For q not real, SU_q(2) is only a braided compact quantum group…

The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We prove that a quantum circuit with $T$ gates whose underlying graph has treewidth $d$ can be simulated deterministically in…

We describe an alternative way of computing Alexander polynomials of knots/links, based on the Artin representation of the corresponding braids by automorphisms of a free group. Then we apply the same method to other representations of…

We introduce and study action of quantum groups on skew polynomial rings and related rings of quotients. This leads to a ``q-deformation'' of the Gel'fand-Kirillov conjecture which we partially prove. We propose a construction of…

Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…

In the present paper we introduce a quantum analogue of the classical folding of a simply-laced Lie algebra g to the non-simply-laced algebra g^sigma along a Dynkin diagram automorphism sigma of g For each quantum folding we replace g^sigma…

A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more…