Knot theory, jones polynomial and quantum computing

Authors:
Rūsiņš Freivalds
Affiliations:
Institute of Mathematics and Computer Science, University of Latvia, Rīga, Latvia
Venue:
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Year:
2005

Citing 6
Cited 2

New invariants in the theory of knots

American Mathematical Monthly
Quantum Complexity Theory

SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing

SIAM Journal on Computing
1-way quantum finite automata: strengths, weaknesses and generalizations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Guest Column: NP-complete problems and physical reality

ACM SIGACT News
On the power of quantum computation

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Automata on Gauss Words

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Planarity of knots, register automata and logspace computability

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Knot theory emerged in the nineteenth century for needs of physics and chemistry as these needs were understood those days. After that the interest of physicists and chemists was lost for about a century. Nowadays knot theory has made a comeback. Knot theory and other areas of topology are no more considered as abstract areas of classical mathematics remote from anything of practical interest. They have made deep impact on quantum field theory, quantum computation and complexity of computation.