A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
Authors:
Top Cited Papers
- 19 March 2008
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 55 (3) , 395-421
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Approximate Counting and Quantum ComputationCombinatorics, Probability and Computing, 2005
- Exponential algorithmic speedup by a quantum walk2003
- Topological quantum computationBulletin of the American Mathematical Society, 2002
- A Modular Functor Which is Universal¶for Quantum ComputationCommunications in Mathematical Physics, 2002
- Simulation of Topological Field Theories¶by Quantum ComputersCommunications in Mathematical Physics, 2002
- P/NP, and the quantum field computerProceedings of the National Academy of Sciences, 1998
- Algebras associated to intermediate subfactorsInventiones Mathematicae, 1997
- Coxeter Graphs and Towers of Algebras1989
- An enumeration of knots and links, and some of their algebraic properties1970
- Theory of BraidsAnnals of Mathematics, 1947