Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of symposia in applied mathematics

Quantum knots and mosaics

Samuel J. Lomonaco, Louis Hirsch Kauffman

Published Jan 1, 2010• 3 citations
Publisher

Abstract

In this paper, we give a precise and workable definition of a knot system, the states of which are called knots. This definition can be viewed as a blueprint for the construction of an actual physical system. Moreover, this definition of a knot system is intended to represent the quantum embodiment of a closed knotted physical piece of rope. A knot, as a state of this system, represents the state of such a knotted closed piece of rope, i.e., the particular spatial configuration of the knot tied in the rope. Associated with a knot system is a group of unitary transformations, called the ambient group, which represents all possible ways of moving the rope around (without cutting the rope, and without letting the rope pass through itself.) Of course, unlike a classical closed piece of rope, a knot can exhibit non-classical behavior, such as superposition and entanglement. This raises some interesting and puzzling questions about the relation between topological and entanglement. The knot type of a knot is simply the orbit of the knot under the action of the ambient group. We investigate observables which are invariants of knot type. We also study the Hamiltonians associated with the generators of the ambient group, and briefly look at the tunneling of overcrossings into undercrossings. A basic building block in this paper is a mosaic system which is a formal (rewriting) system of symbol strings. We conjecture that this formal system fully captures in an axiomatic way all of the properties of tame knot theory.

DOI
10.1090/psapm/068/2762148

Related papers

Quantum knots and lattices, or a blueprint for quantum systems that do rope tricks

Samuel J. Lomonaco, Louis Hirsch Kauffman

Using the cubic honeycomb (cubic tessellation) of Euclidean 3-space, we define a quantum system whose states, called quantum knots, represent a closed knotted piece of rope, i.e., represent the particular spatial configuration of a knot tied in a rope in 3-space. This quantum system, called a quantum knot system, is physically implementable in the same sense as Shor's quantum factoring algorithm is implementable. To define a quantum knot system, we replace the standard three Reidemeister knot moves with an equivalent set of three moves, called respectively wiggle, wag, and tug, so named because they mimic how a dog might wag its tail. We argue that these moves are in fact more "physics friendly" because, unlike the Reidemeister moves, they respect the differential geometry of 3-space, and moreover they can be transformed into infinitesimal moves. These three moves wiggle, wag, and tug generate a unitary group, called the lattice ambient group, which acts on the state space of the quantum system. The lattice ambient group represents all possible ways of moving a rope around in 3-space without cutting the rope, and without letting the rope pass through itself. We then investigate those quantum observables of the quantum knot system which are knot invariants. We also study Hamiltonians associated with the generators of the lattice ambient group. We conclude with a list of open questions.

arXiv:0910.5891•Proceedings of symposia in applied mathematics•Jan 1, 2010•17 citations

Topological aspects of quantum entanglement

Louis Hirsch Kauffman, Eshan Mehrotra

Kauffman and Lomonaco (New J Phys 4:73.1–73.18, 2002. arXiv:quant-ph/0401090 , New J Phys 6:134.1–134.40, 2004) explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In Alagic et al. (Yang–Baxter operators need quantum entanglement to distinguish knots, 2015. arXiv:1507.05979v1 ), it is shown that entanglement is a necessary condition for forming non-trivial invariants of knots from braid closures via solutions to the Yang–Baxter equation. We show that the arguments used by Alagic et al. (2015) generalize to essentially the same results for quantum invariant state summation models of knots. In one case (the unoriented swap case) we give an example of a Yang–Baxter operator, and associated quantum invariant, that can detect the Hopf link. Again this is analogous to the results of Alagic et al. (2015). We also give a class of R matrices that are entangling and are weak invariants of classical knots and links yet strong invariants of virtual knots and links. We also give an example of an SU(2) representation of the three-strand braid group that models the Jones polynomial for closures of three-strand braids. This invariant is a quantum model for the Jones polynomial restricted to three-strand braids, and it does not involve quantum entanglement. These relationships between topological braiding and quantum entanglement can be used as a framework for future work in understanding the properties of entangling gates in topological quantum computing. The paper ends with a discussion of the Aravind hypothesis about the direct relationship of knots and quantum entanglement and the $$ER = EPR$$ E R = E P R hypothesis about the relationship of quantum entanglement with the connectivity of space. We describe how, given a background space and a quantum tensor network, to construct a new topological space that welds the network and the background space together. This construction embodies the principle that quantum entanglement and topological connectivity are intimately related.

arXiv:1611.08047•Quantum Information Processing•Feb 2, 2019•27 citations

Quantum knitting

Silvano Garnerone, Annalisa Marzuoli, Mario Rasetti

We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of “knot invariants,” among which the Jones polynomial plays a prominent role, since it can be associated with observables in topological quantum field theory. Although the problem of computing the Jones polynomial is intractable in the framework of classical complexity theory, it has been recently recognized that a quantum computer is capable of approximating it in an efficient way. The quantum algorithms discussed here represent a breakthrough for quantum computation, since approximating the Jones polynomial is actually a “universal problem,” namely, the hardest problem that a quantum computer can efficiently handle.

arXiv:quant-ph/0606137•Laser Physics•Oct 30, 2006•14 citations

The Entangling Properties of Knots and Links

Eshan Mehrotra

It has been conjectured that quantum entanglement operators can be lifted to braiding operators by the way of the topological quantum field theory axioms set forth by Witten and Atiyah. Moreover, it can be readily shown that quantum link invariants need entanglement to construct topological invariants. Given these results and the already dense mathematical framework underlying topology and quantum field theory, we propose that, through the usage of quantum algebra and bracket models, we can identify a significant area of overlap where entangling R-matrix solutions to the Yang-Baxter equation can be used to construct invariants of knots and links. Such a connection illuminates the relationship between quantum and topological entanglement, and allows us to draw novel insights about properties of entangling gates, for example the question of what it is that allows some entangling R-matrices to generate topological invariants when others do not. In conclusion, by studying the boundary between topological and quantum entanglement we construct novel topological invariants that can have significant impact on the study of quantum computing and can help make progress towards the problem of representing the Artin braid group as unitary matrices.

•Jan 1, 2016•0 citations

Quantum knot mosaics and bounds of the growth constant

Dooho Choi, Hyoung-Jun Kim, Seungsang Oh +1 more

The discovery of the Jones polynomial made an important connection between quantum physics and knot theory. Kauffman and Lomonaco introduced the knot mosaic system to define the quantum knot system for the purpose of representing an actual physical quantum system. This paper is inspired by an open question about the knot mosaic enumeration suggested by them. A knot [Formula: see text]-mosaic is an [Formula: see text] array of 11 mosaic tiles representing a knot diagram by adjoining properly. The total number [Formula: see text] of knot [Formula: see text]-mosaics, which indicates the dimension of the Hilbert space of the quantum knot system, is known to grow in a quadratic exponential rate. Recently, Oh et al. developed the state matrix recursion method producing the exact enumeration of knot mosaics, which uses a recursion formula of state matrices. Furthermore, they showed the existence of the knot mosaic constant [Formula: see text] and found its upper and lower bounds in a series of papers. The latest upper bound was obtained through two new concepts: quasimosaics and cling mosaics. As a sequel to this research program, we adjust the state matrix recursion method to handle cling mosaics inside a quasimosaic, which is called the progressive state matrix recursion method. This method provides recursive matrix-relations producing a sharper bound of the knot mosaic constant: [Formula: see text]

Reviews in Mathematical Physics•Apr 11, 2024•0 citations

Expansions of quantum group invariants

S. Schaveling

In my research, we developed a method to distinguish knots. A knot is a mathematical depiction of the everyday knot that occurs in ropes and cords. The distinguishing of knots is a computationally hard problem, which is equivalent with the untangling of knots. Often, knots are distinguished by a so called knot invariant. Such an invariant is a label that can be attributed to any knot, such that the label is identical for two identical knots. The theory of knots is closely related to quantum computing and lattices of atoms. The distinguishing of knots is a problem that can be solved in an exponential number of computations, in the number of crossings of a knot. Our invariants can be computed in polynomial time. This means that the number of computations is a power of the number of crossings of a knot. Another advantage of our method is that for the knots that have been calculated, the invariant was able to distinguish as the most effective methods combined. In fact, by removing unnecessary information from the conventional knot invariants, we obtained an invariant that can be computed much faster, and is as effective as the usual invariants.

•Sep 1, 2020•1 citation
In this paper, we give a precise and workable definition of a knot system, the states of which are called knots. This definition can be viewed as a blueprint for the construction of an actual physical system.
Moreover, this definition of a knot system is intended to represent the quantum embodiment of a closed knotted physical piece of rope. A knot, as a state of this system, represents the state of such a knotted closed piece of rope, i.e., the particular spatial configuration of the knot tied in the rope. Associated with a knot system is a group of unitary transformations, called the ambient group, which represents all possible ways of moving the rope around (without cutting the rope, and without letting the rope pass through itself.)
Of course, unlike a classical closed piece of rope, a knot can exhibit non-classical behavior, such as superposition and entanglement. This raises some interesting and puzzling questions about the relation between topological and entanglement.
The knot type of a knot is simply the orbit of the knot under the action of the ambient group. We investigate observables which are invariants of knot type. We also study the Hamiltonians associated with the generators of the ambient group, and briefly look at the tunneling of overcrossings into undercrossings.
A basic building block in this paper is a mosaic system which is a formal (rewriting) system of symbol strings. We conjecture that this formal system fully captures in an axiomatic way all of the properties of tame knot theory.
Using the cubic honeycomb (cubic tessellation) of Euclidean 3-space, we define a quantum system whose states, called quantum knots, represent a closed knotted piece of rope, i.e., represent the particular spatial configuration of a knot tied in a rope in 3-space. This quantum system, called a quantum knot system, is physically implementable in the same sense as Shor's quantum factoring algorithm is implementable. To define a quantum knot system, we replace the standard three Reidemeister knot moves with an equivalent set of three moves, called respectively wiggle, wag, and tug, so named because they mimic how a dog might wag its tail. We argue that these moves are in fact more "physics friendly" because, unlike the Reidemeister moves, they respect the differential geometry of 3-space, and moreover they can be transformed into infinitesimal moves. These three moves wiggle, wag, and tug generate a unitary group, called the lattice ambient group, which acts on the state space of the quantum system. The lattice ambient group represents all possible ways of moving a rope around in 3-space without cutting the rope, and without letting the rope pass through itself. We then investigate those quantum observables of the quantum knot system which are knot invariants. We also study Hamiltonians associated with the generators of the lattice ambient group. We conclude with a list of open questions.
Kauffman and Lomonaco (New J Phys 4:73.1–73.18, 2002. arXiv:quant-ph/0401090 , New J Phys 6:134.1–134.40, 2004) explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In Alagic et al. (Yang–Baxter operators need quantum entanglement to distinguish knots, 2015. arXiv:1507.05979v1 ), it is shown that entanglement is a necessary condition for forming non-trivial invariants of knots from braid closures via solutions to the Yang–Baxter equation. We show that the arguments used by Alagic et al. (2015) generalize to essentially the same results for quantum invariant state summation models of knots. In one case (the unoriented swap case) we give an example of a Yang–Baxter operator, and associated quantum invariant, that can detect the Hopf link. Again this is analogous to the results of Alagic et al. (2015). We also give a class of R matrices that are entangling and are weak invariants of classical knots and links yet strong invariants of virtual knots and links. We also give an example of an SU(2) representation of the three-strand braid group that models the Jones polynomial for closures of three-strand braids. This invariant is a quantum model for the Jones polynomial restricted to three-strand braids, and it does not involve quantum entanglement. These relationships between topological braiding and quantum entanglement can be used as a framework for future work in understanding the properties of entangling gates in topological quantum computing. The paper ends with a discussion of the Aravind hypothesis about the direct relationship of knots and quantum entanglement and the ER=EPRER = EPRER=EPR E R = E P R hypothesis about the relationship of quantum entanglement with the connectivity of space. We describe how, given a background space and a quantum tensor network, to construct a new topological space that welds the network and the background space together. This construction embodies the principle that quantum entanglement and topological connectivity are intimately related.
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of “knot invariants,” among which the Jones polynomial plays a prominent role, since it can be associated with observables in topological quantum field theory. Although the problem of computing the Jones polynomial is intractable in the framework of classical complexity theory, it has been recently recognized that a quantum computer is capable of approximating it in an efficient way. The quantum algorithms discussed here represent a breakthrough for quantum computation, since approximating the Jones polynomial is actually a “universal problem,” namely, the hardest problem that a quantum computer can efficiently handle.
It has been conjectured that quantum entanglement operators can be lifted to braiding operators by the way of the topological quantum field theory axioms set forth by Witten and Atiyah. Moreover, it can be readily shown that quantum link invariants need entanglement to construct topological invariants. Given these results and the already dense mathematical framework underlying topology and quantum field theory, we propose that, through the usage of quantum algebra and bracket models, we can identify a significant area of overlap where entangling R-matrix solutions to the Yang-Baxter equation can be used to construct invariants of knots and links. Such a connection illuminates the relationship between quantum and topological entanglement, and allows us to draw novel insights about properties of entangling gates, for example the question of what it is that allows some entangling R-matrices to generate topological invariants when others do not. In conclusion, by studying the boundary between topological and quantum entanglement we construct novel topological invariants that can have significant impact on the study of quantum computing and can help make progress towards the problem of representing the Artin braid group as unitary matrices.
The discovery of the Jones polynomial made an important connection between quantum physics and knot theory. Kauffman and Lomonaco introduced the knot mosaic system to define the quantum knot system for the purpose of representing an actual physical quantum system. This paper is inspired by an open question about the knot mosaic enumeration suggested by them. A knot [Formula: see text]-mosaic is an [Formula: see text] array of 11 mosaic tiles representing a knot diagram by adjoining properly. The total number [Formula: see text] of knot [Formula: see text]-mosaics, which indicates the dimension of the Hilbert space of the quantum knot system, is known to grow in a quadratic exponential rate. Recently, Oh et al. developed the state matrix recursion method producing the exact enumeration of knot mosaics, which uses a recursion formula of state matrices. Furthermore, they showed the existence of the knot mosaic constant [Formula: see text] and found its upper and lower bounds in a series of papers. The latest upper bound was obtained through two new concepts: quasimosaics and cling mosaics. As a sequel to this research program, we adjust the state matrix recursion method to handle cling mosaics inside a quasimosaic, which is called the progressive state matrix recursion method. This method provides recursive matrix-relations producing a sharper bound of the knot mosaic constant: [Formula: see text]
In my research, we developed a method to distinguish knots. A knot is a mathematical depiction of the everyday knot that occurs in ropes and cords. The distinguishing of knots is a computationally hard problem, which is equivalent with the untangling of knots. Often, knots are distinguished by a so called knot invariant. Such an invariant is a label that can be attributed to any knot, such that the label is identical for two identical knots. The theory of knots is closely related to quantum computing and lattices of atoms. The distinguishing of knots is a problem that can be solved in an exponential number of computations, in the number of crossings of a knot. Our invariants can be computed in polynomial time. This means that the number of computations is a power of the number of crossings of a knot. Another advantage of our method is that for the knots that have been calculated, the invariant was able to distinguish as the most effective methods combined. In fact, by removing unnecessary information from the conventional knot invariants, we obtained an invariant that can be computed much faster, and is as effective as the usual invariants.