Related papers: The Jones polynomial: quantum algorithms and appli…
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 present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
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…
This paper connects two seemingly different ways of studying knots: quantum group invariants and the dynamics of Morse flows. For fibered knots, we define a two-variable series invariant by counting Morse flow loops in the complement. This…
This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…
Quantum computers promise to revolutionize our ability to simulate molecules, and cloud-based hardware is becoming increasingly accessible to a wide body of researchers. Algorithms such as Quantum Phase Estimation and the Variational…
It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…
We investigate the rational cohomology of the quotient of (generalized) braid groups by the commutator subgroup of the pure braid groups. We provide a combinatorial description of it using isomorphism classes of certain families of graphs.…
We have studied ${\rm SU}(2)_k$ anyon models, assessing their prospects for topological quantum computation. In particular, we have compared the Ising ($k=2$) anyon and Fibonacci ($k=3$) anyon models, motivated by their potential for future…
In this paper we describe connections among extraspecial 2-groups, unitary representations of the braid group and multi-qubit braiding quantum gates. We first construct new representations of extraspecial 2-groups. Extending the latter by…
Our main result has topological, combinatorial and computational flavor. It is motivated by a fundamental conjecture stating that computing Khovanov homology of a closed braid of fixed number of strands has polynomial time complexity. We…
We give a definition of coisotropic morphisms of shifted Poisson (i.e. $P_n$) algebras which is a derived version of the classical notion of coisotropic submanifolds. Using this we prove that an intersection of coisotropic morphisms of…
The colored Jones function of a knot is a sequence of Laurent polynomials in one variable, whose n-th term is the Jones polynomial of the knot colored with the n-dimensional irreducible representation of SL(2). It was recently shown by TTQ…
We first motivate the study of a certain quotient of the loop braid category, both for the mathematics underpinning recent approaches to topological quantum computation; and as a key example in non-semisimple higher representation theory.…
By now it is well established that the quantum dimensions of descendants of the adjoint representation can be described in a universal form, independent of a particular family of simple Lie algebras. The Rosso-Jones formula then implies a…
We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. The class contains for example the rooted triple consistency problem, forbidden subtree problems, the quartet…
Using various tools from representation theory and group theory, but without using hard classification theorems such as the classification of finite simple groups, we show that the Jones representations of braid groups are dense in the…
We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for…
In our preceding papers we started considering the categories of tangles with flat G-connections in their complements, where G is a simple complex algebraic group. The braiding (or the commutativity constraint) in such categories satisfies…
We compute the quantum double, braiding and other canonical Hopf algebra constructions for the bicrossproduct Hopf algebra $H$ associated to the factorization of a finite group into two subgroups. The representations of the quantum double…