相关论文: The Jones polynomial: quantum algorithms and appli…

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…

In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations…

We give a topological formula of the loop expansion of the colored Jones polynomials by using identification of generic quantum sl2 representation with homological representations. This gives a direct topological proof of the…

The repertoire of problems theoretically solvable by a quantum computer recently expanded to include the approximate evaluation of knot invariants, specifically the Jones polynomial. The experimental implementation of this evaluation,…

The Slope Conjecture relates a quantum knot invariant, (the degree of the colored Jones polynomial of a knot) with a classical one (boundary slopes of incompressible surfaces in the knot complement). The degree of the colored Jones…

Aharonov, Jones, and Landau [Algorithmica 55, 395 (2009)] have presented a polynomial quantum algorithm for approximating the Jones polynomial. We investigate the bipartite entanglement properties in AJL's algorithm for three-strand braids.…

Given a knot, we develop methods for finding the braid representative that minimizes the number of simple walks. Such braids lead to an efficient method for computing the colored Jones polynomial of $K$, following an approach developed by…

This article was submitted to a volume under preparation, with Benson Farb as the editor, on the topic of open problems in surface mapping class groups. The braid group B_n is the mapping class group of an n-times punctured disk. The…

Character expansion is introduced and explicitly constructed for the (non-colored) HOMFLY polynomials of the simplest knots. Expansion coefficients are not the knot invariants and can depend on the choice of the braid realization. However,…

Knots and links represent a fundamental motif of non-local connectivity that permeates the physical sciences from string theory to protein folds. While spectral braiding has been explored in two-band non-Hermitian models across various…

We study a wide range of homologically-defined representations of surface braid groups and of mapping class groups of surfaces, including the Lawrence-Bigelow representations of the classical braid groups. These representations naturally…

Quantum signal processing is a powerful framework in quantum algorithms, playing a central role in Hamiltonian simulation and related applications. The sequence of polynomials implemented at each step of this protocol provides a polynomial…

The mathematical problem of localizing modular functors to neighborhoods of points is shown to be closely related to the physical problem of engineering a local Hamiltonian for a computationally universal quantum medium. For genus $=0$…

Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…

A conjecture of Jozsa (arXiv:quant-ph/0508124) states that any polynomial-time quantum computation can be simulated by polylogarithmic-depth quantum computation interleaved with polynomial-depth classical computation. Separately, Aaronson…

The Goeritz matrix is an alternative to the Kauffman bracket and, in addition, makes it possible to calculate the Jones polynomial faster with some minimal choice of a checkerboard surface of a link diagram. We introduce a modification of…

Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature, we provide a quantum algorithm that efficiently approximates the colored Jones polynomial. The construction is based on…

We show that the family of colored Jones polynomials of the closure of a braid compute weighted sums of abelianized Lefschetz numbers associated with the action of the braid on configuration spaces. The sum is over the number of…

In this paper, we give a description of a recent quantum algorithm created by Aharonov, Jones, and Landau for approximating the values of the Jones polynomial at roots of unity of the form exp(2$\pi$i/k). This description is given with two…

Circuit topology employs fundamental units of entanglement, known as soft contacts, for constructing knots from the bottom up, utilising circuit topology relations, namely parallel, series, cross, and concerted relations. In this article,…