Related papers: Quantum Knitting
The probability of a random polygon (or a ring polymer) having a knot type $K$ should depend on the complexity of the knot $K$. Through computer simulation using knot invariants, we show that the knotting probability decreases exponentially…
The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…
We find a consistent formulation of the constraints of Quantum Gravity with a cosmological constant in terms of the Ashtekar new variables in the connection representation, including the existence of a state that is a solution to all the…
We address the question: Does there exist a non-trivial knot with a trivial Jones polynomial? To find such a knot, it is almost certainly sufficient to find a non-trivial braid on four strands in the kernel of the Burau representation. I…
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the…
We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…
Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the…
This survey explores knot polynomials and their categorification, culminating in the homological invariants of knots. We begin with an overview of classical knot polynomials, progressing towards the superpolynomial and its role in unifying…
We observe that any knot invariant extends to virtual knots. The isotopy classification problem for virtual knots is reduced to an algebraic problem formulated in terms of an algebra of arrow diagrams. We introduce a new notion of finite…
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…
Quantum computing (QC) is a new computational paradigm whose foundations relate to quantum physics. Notable progress has been made, driving the birth of a series of quantum-based algorithms that take advantage of quantum computational…
In this paper we discuss the applications of knotoids to modelling knots in open curves and produce new knotoid invariants. We show how invariants of knotoids generally give rise to well-behaved measures of how much an open curve is…
We solve the Jones conjecture, which states that the exponent sum in a minimal braid representation of a knot in S^3 is a knot invariant, by proving a generalized version of the original one. We apply contact geometry to study this problem…
Quantum algorithms based on quantum kernel methods have been investigated previously [1]. A quantum advantage is derived from the fact that it is possible to construct a family of datasets for which, only quantum processing can recognise…
This paper discusses relationships between topological entanglement and quantum entanglement. Specifically, we propose that for this comparison it is fundamental to view topological entanglements such as braids as "entanglement operators"…
Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantity can also serve to study a completely…
We briefly review the current situation with various relations between knot/braid polynomials (Chern-Simons correlation functions), ordinary and extended, considered as functions of the representation and of the knot topology. These include…
We describe a normal surface algorithm that decides whether a knot, with known degree of the colored Jones polynomial, satisfies the Strong Slope Conjecture. We also discuss possible simplifications of our algorithm and state related open…
Surprisingly Richard Thompson's groups have recently appeared in Jones' subfactor theory. Vaughan Jones is famous for linking theories that are a priori completely disconnected; for instance, his celebrated polynomial for links emanating…
Certain quantum topological invariants of three manifolds can be written in the form of the Gaussian sum. It is shown that such topological invariants can be approximated efficiently by a quantum computer. The invariants discussed here are…