Paper
10 May 2007 A 3-stranded quantum algorithm for the Jones Polynomial
Author Affiliations +
Abstract
Let K be a 3-stranded knot (or link), and let L denote the number of crossings in of K. Let ε1 and ε2 be two positive real numbers such that ε2≤1. In this paper, we create two algorithms for computing the value of the Jones polynomial VK(t) at all points t=exp(iφ) of the unit circle in the complex plane such that |φ|≤2π/3. The first algorithm, called the classical 3-stranded braid (3-SB) algorithm, is a classical deterministic algorithm that has time complexity O(L). The second, called the quantum 3-SB algorithm, is a quantum algorithm that computes an estimate of VK (exp (iφ)) within a precision of ε1 with a probability of success bounded below by 1-ε2. The execution time complexity of this algorithm is O(nL), where n is the ceiling function of (ln(4/ε2))/2ε21 . The compilation time complexity, i.e., an asymptotic measure of the amount of time to assemble the hardware that executes the algorithm, is O(L).
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Louis H. Kauffman and Samuel J. Lomonaco Jr. "A 3-stranded quantum algorithm for the Jones Polynomial", Proc. SPIE 6573, Quantum Information and Computation V, 65730T (10 May 2007); https://doi.org/10.1117/12.719399
Lens.org Logo
CITATIONS
Cited by 12 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Quantum computing

Quantum communications

Algorithm development

Algorithms

Computer science

Computing systems

Detection and tracking algorithms

RELATED CONTENT


Back to Top