Evaluating the Jones polynomial with tensor networks

Abstract

We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar graph with weighted edges that corresponds to the knot. For any integer $q$, we cast this partition function into tensor network form and employ fast tensor network contraction protocols to obtain the exact tensor trace, and thus the value of the Jones polynomial. By sampling random knots via a grid-walk procedure and computing the full tensor trace, we demonstrate numerically that the Jones polynomial can be evaluated in time that scales subexponentially with the number of crossings in the typical case. This allows us to evaluate the Jones polynomial of knots that are too complex to be treated with other available methods. Our results establish tensor network methods as a practical tool for the study of knots.

arXiv comment4 pages, 4 figures

References in corpus (20)

• Fault-tolerant quantum computation by anyons
• Tensor-Entanglement-Filtering Renormalization Approach and Symmetry Protected Topological Order
• Tensor renormalization group approach to 2D classical lattice models
• Accurate determination of tensor network state of quantum lattice models in two dimensions
• Coarse-graining renormalization by higher-order singular value decomposition
• Tensor Network Renormalization
• Algorithms for tensor network renormalization
• A New Algorithm for Numerical Calculation of Link Invariants
• Partition function of two- and three-dimensional Potts ferromagnets for arbitrary values of q>0
• Tensor network algorithm by coarse-graining tensor renormalization on finite periodic lattices
• On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers
• Simulation of Potts models with real q and no critical slowing down
• Zeros of Jones Polynomials for Families of Knots and Links
• Zeroes of the Jones polynomial
• A new algorithm for recognizing the unknot
• Models of Random Knots
• Low Depth Quantum Circuits for Ising Models
• A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
• Knots in Physics
• Post Quantum Cryptography from Mutant Prime Knots

Cited by in corpus (2)

• Hyper-optimized tensor network contraction
• Fast counting with tensor networks