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

Scientific American

Computing with Quantum Knots

Graham P. Collins

Published Apr 1, 2006• 76 citations
Publisher
DOI
10.1038/scientificamerican0406-56

Related papers

Knot Theory, Jones Polynomial and Quantum Computing

Rūsiņš Freivalds

Lecture notes in computer science•Jan 1, 2005•4 citations

Topological Quantum Computation: The Quantum Knot in the Handkerchief.

Johannes K. Slingerland

ERCIM news/ERCIM news online edition•Jan 1, 2011•0 citations

Quantum knots and knotted zeros: part II (Conference Presentation)

Samuel J. Lomonaco, Louis Hirsch Kauffman

•May 14, 2019•0 citations

Quantum Knots Revisited

Samuel J. Lomonaco

•Jan 1, 2018•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

Tying quantum knots

David S. Hall, Michael Ray, Konstantin Tiurev +3 more

Nature Physics•Jan 18, 2016•180 citations
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.