Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:math/0105255 · Contemporary mathematics - American Mathematical Society

Quantum computing and the Jones polynomial

Louis Hirsch Kauffman

Published Jan 1, 2002• 55 citations
arXivHTMLPDF

Abstract

This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitary representation of the braid group. We discuss the evaluation of the polynomial as a generalized quantum amplitude and show how the braiding part of the evaluation can be construed as a quantum computation when the braiding representation is unitary. The question of an efficient quantum algorithm for computing the whole polynomial remains open.

DOI
10.1090/conm/305/05218

Related papers

The Jones polynomial: quantum algorithms and applications in quantum complexity theory

Paweł Wocjan, Jon Yard

We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl representations of the braid group. We use these to provide new quantum algorithms for approximately evaluating a family of specializations of the HOMFLYPT two-variable polynomial of trace closures of braids. We also give algorithms for approximating the Jones polynomial of a general class of closures of braids at roots of unity. Next we provide a self-contained proof of a result of Freedman et al.\ that any quantum computation can be replaced by an additive approximation of the Jones polynomial, evaluated at almost any primitive root of unity. Our proof encodes two-qubit unitaries into the rectangular representation of the eight-strand braid group. We then give QCMA-complete and PSPACE-complete problems which are based on braids. We conclude with direct proofs that evaluating the Jones polynomial of the plat closure at most primitive roots of unity is a \#P-hard problem, while learning its most significant bit is PP-hard, circumventing the usual route through the Tutte polynomial and graph coloring.

arXiv:quant-ph/0603069•Quantum Information and Computation•Jan 1, 2008•79 citations

Quantum Computation of Jones' Polynomials

V. Subramaniam, P. Ramadevi

It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a $2n$-strand braid. We recapitulate the construction of braid-group representations from vertex models. We present the eigenbases and eigenvalues for the braiding generators and its usefulness in direct evaluation of Jones' polynomial. The calculation suggests that it is possible to associate a series of unitary operators for any braid word. Hence we propose a quantum algorithm using these unitary operators as quantum gates acting on a $2n$ qubit state. We show that the quantum computation gives Jones' polynomial for achiral knots and links.

arXiv:quant-ph/0210095•Oct 12, 2002•12 citations

Local unitary representations of the braid group and their applications to quantum computing

Colleen Delaney, Eric C. Rowell, Zhenghan Wang

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 Jones polynomial and their application to anyonic quantum computation. Finally we outline the approximation of the Jones polynomial and explicit localizations of braid group representations.

arXiv:1604.06429•Revista Colombiana de Matemáticas•Jan 26, 2017•29 citations

Jones Polynomial from Quantum R-Matrices: Unifying Knot Theory and Topological Quantum Computation — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The Jones polynomial is a knot invariant constructible from quantum R-matrices (braid group representations), and its evaluation at roots of unity yields the computational resource for topological quantum computation — the same algebraic structure underlies both knot theory and TQFT. | MATH: Jones polynomial V_K(t) ∈ ℤ[t^{±1/2}]; skein relation: t⁻¹V(L₊) − tV(L₋) = (t^{1/2} − t^{−1/2})V(L₀). Braid group representation: ρ: B_n → GL(V^⊗n) via R-matrix satisfying Yang-Baxter equation (R⊗I)(I⊗R)(R⊗I) = (I⊗R)(R⊗I)(I⊗R). At t = e^{2πi/k}, the representation factors through Temperley-Lieb algebra TL_n(q) with q + q⁻¹ = −(t^{1/2} + t^{−1/2}). Quantum dimension d = −(q + q⁻¹) = [2]_q. Modular tensor category (MTC) data: fusion rules N_{ij}^k, S-matrix, T-matrix (topological spin), satisfying (ST)³ = e^{2πic/8}·S² (modularity). | CONNECTION: Root-of-unity evaluation t = e^{2πi/k} connects to: (1) quantum group U_q(sl₂) at q = e^{iπ/k} — deformation parameter is a root of unity, truncati Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 29, 2026•0 citations

Quantum algorithms for colored Jones polynomials

Louis Hirsch Kauffman, Samuel J. Lomonaco

We review the q-deformed spin networks and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. The simplest case of these models is the Fibonacci model, itself universal for quantum computation. We formulate these braid group representations in a form suitable for computation and algebraic work and apply them to quantum algorithms for the computation of colored Jones polynomials and the Witten-Reshetikhin-Turaev Invariants.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Mar 30, 2009•0 citations

Quantum solution of the relationship between the 19-vertex model and the Jones polynomial

T.K. Kassenova

Abstract The challenge is to create an efficient quantum algorithm for the bosonic model capable of calculating the Jones polynomials for a knot resulting from interweaving or interlacing n-vertices. This weave is the construction of braid group representations from nineteen-vertex model. We present eigenbases and eigenvalues for lattice generators and their usefulness for the direct computation of Jones polynomials. The calculation shows that the Temperley-Lieb operators can be used for any braid word. Therefore, we propose a quantum sequence using these singular operators as quantum gates operating on the state of n qubits. We show that quantum calculations give the Jones polynomial for achiral knots and links.

Journal of Physics Conference Series•Feb 1, 2024•1 citation
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitary representation of the braid group. We discuss the evaluation of the polynomial as a generalized quantum amplitude and show how the braiding part of the evaluation can be construed as a quantum computation when the braiding representation is unitary. The question of an efficient quantum algorithm for computing the whole polynomial remains open.
We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl representations of the braid group. We use these to provide new quantum algorithms for approximately evaluating a family of specializations of the HOMFLYPT two-variable polynomial of trace closures of braids. We also give algorithms for approximating the Jones polynomial of a general class of closures of braids at roots of unity. Next we provide a self-contained proof of a result of Freedman et al.\ that any quantum computation can be replaced by an additive approximation of the Jones polynomial, evaluated at almost any primitive root of unity. Our proof encodes two-qubit unitaries into the rectangular representation of the eight-strand braid group. We then give QCMA-complete and PSPACE-complete problems which are based on braids. We conclude with direct proofs that evaluating the Jones polynomial of the plat closure at most primitive roots of unity is a \#P-hard problem, while learning its most significant bit is PP-hard, circumventing the usual route through the Tutte polynomial and graph coloring.
It is a challenging problem to construct an efficient quantum algorithm which can compute the Jones' polynomial for any knot or link obtained from platting or capping of a 2n2n2n-strand braid. We recapitulate the construction of braid-group representations from vertex models. We present the eigenbases and eigenvalues for the braiding generators and its usefulness in direct evaluation of Jones' polynomial. The calculation suggests that it is possible to associate a series of unitary operators for any braid word. Hence we propose a quantum algorithm using these unitary operators as quantum gates acting on a 2n2n2n qubit state. We show that the quantum computation gives Jones' polynomial for achiral knots and links.
FINDING: The Jones polynomial is a knot invariant constructible from quantum R-matrices (braid group representations), and its evaluation at roots of unity yields the computational resource for topological quantum computation — the same algebraic structure underlies both knot theory and TQFT. | MATH: Jones polynomial V_K(t) ∈ ℤ[t^{±1/2}]; skein relation: t⁻¹V(L₊) − tV(L₋) = (t^{1/2} − t^{−1/2})V(L₀). Braid group representation: ρ: B_n → GL(V^⊗n) via R-matrix satisfying Yang-Baxter equation (R⊗I)(I⊗R)(R⊗I) = (I⊗R)(R⊗I)(I⊗R). At t = e^{2πi/k}, the representation factors through Temperley-Lieb algebra TL_n(q) with q + q⁻¹ = −(t^{1/2} + t^{−1/2}). Quantum dimension d = −(q + q⁻¹) = [2]_q. Modular tensor category (MTC) data: fusion rules N_{ij}^k, S-matrix, T-matrix (topological spin), satisfying (ST)³ = e^{2πic/8}·S² (modularity). | CONNECTION: Root-of-unity evaluation t = e^{2πi/k} connects to: (1) quantum group U_q(sl₂) at q = e^{iπ/k} — deformation parameter is a root of unity, truncati Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Abstract The challenge is to create an efficient quantum algorithm for the bosonic model capable of calculating the Jones polynomials for a knot resulting from interweaving or interlacing n-vertices. This weave is the construction of braid group representations from nineteen-vertex model. We present eigenbases and eigenvalues for lattice generators and their usefulness for the direct computation of Jones polynomials. The calculation shows that the Temperley-Lieb operators can be used for any braid word. Therefore, we propose a quantum sequence using these singular operators as quantum gates operating on the state of n qubits. We show that quantum calculations give the Jones polynomial for achiral knots and links.