Related papers: Estimating Jones and HOMFLY polynomials with One C…
In this work, we describe our experience in learning the use of a computer proof assistant - specifically, Lean - from scratch, through proving formulae for the solutions of polynomial equations. Specifically, in this work we characterize…
We study the computational complexity of estimating the normalized trace $2^{-n}Tr[f(A)]$ for a log-local Hamiltonian $A$ acting on $n$ qubits. This problem arises naturally in the DQC1 model, yet its complexity is only understood for a…
HOMFLY polynomials are one of the major knot invariants being actively studied. They are difficult to compute in the general case but can be far more easily expressed in certain specific cases. In this paper, we examine two particular…
Starting from the free field realization of Kac-Moody Lie algebra, we define a generalized Yang-Yang function. Then for the Lie algebra of type $A_{n}$, we derive braiding and fusion matrix by braiding the thimble from the generalized…
The recently suggested bipartite analysis extends the Kauffman planar decomposition to arbitrary $N$, i.e. extends it from the Jones polynomial to the HOMFLY polynomial. This provides a generic and straightforward non-perturbative calculus…
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.…
We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive semi-definite Hamiltonians, our method has expected running-time that is almost linear in $(M/(\epsilon_{\rm…
Character expansion expresses extended HOMFLY polynomials through traces of products of finite dimensional R- and Racah mixing matrices. We conjecture that the mixing matrices are expressed entirely in terms of the eigenvalues of the…
The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…
We claim that HOMFLY polynomials for virtual knots, defined with the help of the matrix-model recursion relations, contain more parameters, than just the usual $q$ and $A = q^N$. These parameters preserve topological invariance and do not…
From analysis of a big variety of different knots we conclude that at q which is an root of unity, q^{2m}=1, HOMFLY polynomials in symmetric representations [r] satisfy recursion identity: H_{r+m} = H_r H_m for any A, which is a…
We provide an elementary introduction to topological quantum computation based on the Jones representation of the braid group. We first cover the Burau representation and Alexander polynomial. Then we discuss the Jones representation and…
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…
The numerical solution of the many-body problem of interacting electrons and ions is a key challenge in condensed matter physics, chemistry, and materials science. Traditional methods to solve the multi-component quantum Hamiltonian are…
Twisted links are obtained from a base link by starting with a $n$-braid representation, choosing several ($m$) adjacent strands, and applying one or more twists to the set. Various restrictions may be applied, e.g. the twists may be…
This paper computes the Jones polynomial and the invariants obstructing cosmetic surgery which are derived from it for two infinite families of knots, proving they satisfy the Purely Cosmetic Surgery Conjecture. Both the method of…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
A sequence $f_n(q)$ is $q$-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in $q$ and $q^n$. Our main theorems state that $q$-holonomicity is preserved under twisting, i.e., replacing $q$ by $\omega q$…
Colored HOMFLY-PT invariant, the generalization of the colored Jones polynomial, is one of the most important quantum invariants of links. This paper is devoted to investigating the basic structures of the colored HOMFLY-PT invariants of…
We generalize the recently discovered planar decomposition (Kauffman bracket) for the HOMFLY polynomials of bipartite knot/link diagrams to (anti)symmetrically colored HOMFLY polynomials. Cabling destroys planarity, but it is restored after…