Papers
Topics
Authors
Recent
Search
2000 character limit reached

Circuit Complexity of Knot States in Chern-Simons theory

Published 25 Mar 2019 in hep-th, math-ph, and math.MP | (1903.10609v3)

Abstract: We compute an upper bound on the circuit complexity of quantum states in $3d$ Chern-Simons theory corresponding to certain classes of knots. Specifically, we deal with states in the torus Hilbert space of Chern-Simons that are the knot complements on the $3$-sphere of arbitrary torus knots. These can be constructed from the unknot state by using the Hilbert space representation of the $S$ and $T$ modular transformations of the torus as fundamental gates. The upper bound is saturated in the semiclassical limit of Chern-Simons theory. The results are then generalized for a family of multi-component links that are obtained by "Hopf-linking" different torus knots. We also use the braid word presentation of knots to discuss states on the punctured sphere Hilbert space associated with 2-bridge knots and links. The calculations present interesting number theoretic features related with continued fraction representations of rational numbers. In particular, we show that the minimization procedure defining the complexity naturally leads to regular continued fractions, allowing a geometric interpretation of the results in the Farey tesselation of the upper-half plane. Finally, we relate our discussion to the framework of path integral optimization by generalizing the original argument to non-trivial topologies.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.