Pith. sign in

REVIEW 1 cited by

Topological Quantum Information, Khovanov Homology and the Jones Polynomial

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1001.0354 v3 pith:2NEVTXHN submitted 2010-01-04 math.GT math-phmath.MP

classification math.GTmath-phmath.MP
keywords polynomialquantumhomologykhovanovjonesalgorithmbracketcomplex
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper we give a quantum statistical interpretation for the bracket polynomial state sum <K> and for the Jones polynomial. We use this quantum mechanical interpretation to give a new quantum algorithm for computing the Jones polynomial. This algorithm is useful for its conceptual simplicity, and it applies to all values of the polynomial variable that lie on the unit circle in the complex plane. Letting C(K) denote the Hilbert space for this model, there is a natural unitary transformation U from C(K) to itself such that <K> = <F|U|F> where |F> is a sum over basis states for C(K). The quantum algorithm arises directly from this formula via the Hadamard Test. We then show that the framework for our quantum model for the bracket polynomial is a natural setting for Khovanov homology. The Hilbert space C(K) of our model has basis in one-to-one correspondence with the enhanced states of the bracket state summmation and is isomorphic with the chain complex for Khovanov homology with coefficients in the complex numbers. We show that for the Khovanov boundary operator d defined on C(K) we have the relationship dU + Ud = 0. Consequently, the unitary operator U acts on the Khovanov homology, and we therefore obtain a direct relationship between Khovanov homology and this quantum algorithm for the Jones polynomial. The formula for the Jones polynomial as a graded Euler characteristic is now expressed in terms of the eigenvalues of U and the Euler characteristics of the eigenspaces of U in the homology. The quantum algorithm given here is inefficient, and so it remains an open problem to determine better quantum algorithms that involve both the Jones polynomial and the Khovanov homology.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A quantum algorithm for Khovanov homology

    math.GT 2025-01 conditional novelty 8.0 of 10

    A conditional quantum algorithm for estimating the Betti numbers of Khovanov homology, together with DQC1, BQP, and #P hardness results for harder approximation regimes.

Pith tools