Jones gives quantum algorithm for Jones knot polynomial

Click For Summary
SUMMARY

The discussion centers on a polynomial quantum algorithm developed by Dorit Aharonov, Vaughan Jones, and Zeph Landau for approximating the Jones polynomial, a significant knot invariant in topology. This algorithm operates independently of Topological Quantum Field Theory (TQFT) and runs in polynomial time relative to the number of strands, crossings, and the primitive root of unity. The algorithm addresses a BQP-complete problem, providing a more accessible approach for computer scientists compared to previous works by Freedman, Kitaev, Larsen, and Wang, which relied heavily on TQFT. Additionally, the potential implications for quantum gravity and its connection to knot theory are highlighted as a promising area for further research.

PREREQUISITES
  • Understanding of the Jones polynomial and its significance in topology.
  • Familiarity with quantum algorithms and complexity classes, particularly BQP.
  • Knowledge of Topological Quantum Field Theory (TQFT) concepts.
  • Basic grasp of polynomial time complexity in algorithms.
NEXT STEPS
  • Research the implications of the Jones polynomial in quantum computing.
  • Explore the relationship between quantum gravity and knot theory.
  • Study the works of Freedman, Kitaev, Larsen, and Wang on TQFT.
  • Investigate other quantum algorithms that may benefit from the structure of Aharonov et al.'s algorithm.
USEFUL FOR

Researchers in quantum mathematics, computer scientists interested in quantum algorithms, and physicists exploring the intersection of quantum gravity and topology.

marcus
Science Advisor
Homework Helper
Gold Member
Dearly Missed
Messages
24,752
Reaction score
795
http://arxiv.org/abs/quant-ph/0511096
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
Dorit Aharonov, Vaughan Jones, Zeph Landau
26 pages

"The Jones polynmial, discovered in 1984, is an important knot invariant in topology, which is intimately connected to Topological Quantum Field Theory (TQFT). The works of Freedman, Kitaev, Larsen and Wang provide an efficient simulation of TQFT by a quantum computer, and vice versa. These results implicitly imply the existence of an efficient quantum algorithm that provides a certain additive approximation of the Jones polynomial at the fifth root of unity, and moreover, that this problem is BQP-complete. Unfortunately, this important algorithm was never explicitly formulated. Moreover, the results of Freedman et. al are heavily based on deep knowledge of TQFT, which makes the algorithm essentially inaccessible for computer scientists.
We provide an explicit and simple polynomial algorithm to approximate the Jones polynomial of an n strands braid with m crossings at the primitive k'th root of unity, for any k, where the running time of the algorithm is polynomial in m,n and k. Our algorithm does not use TQFT at all. By the results of Freedman et. al, our algorithm solves a BQP complete problem.
The algorithm we provide exhibits a structure which we hope is generalizable to other quantum algorithmic problems. A candidate of particular interest is the approximation of the partition function of the Potts model."

John Baez is inviting grad students to join him at UC Riverside for research in QUANTUM MATHEMATICS, remarks Peter Woit

in some approaches to Quantum Gravity the quantum states of the gravitational field are knots---just an idle thought. does gravity, in other words quantum spacetime geometry, connect to this at all?
 
Last edited:
Physics news on Phys.org
That's an interesting thought! It's possible that the work of Freedman, Kitaev, Larsen and Wang could provide insight into the connection between quantum gravity and knots, since their work provides an efficient simulation of Topological Quantum Field Theory (TQFT). Aharonov et. al's paper on the polynomial quantum algorithm for approximating the Jones polynomial could also be relevant, as it provides a polynomial algorithm to approximate knot invariants. It would be interesting to see if further research can be done to explore this connection.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
1K
Replies
24
Views
8K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 2 ·
Replies
2
Views
4K