Efficient quantum circuits for approximating the Jones polynomial

MaRDI QIDQ3525305zbMATH OpenFDO

Authors Yumi Nakajima, Y. Kawano, Hiroshi Sekigawa

Publication date 12 September 2008

zbMATH Keywords

Jones polynomials approximationquantum circuitthe Aharonov-Jones-Landau (AJL) algorithm

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• A polynomial quantum algorithm for approximating the Jones polynomial
• A polynomial quantum algorithm for approximating the Jones polynomial
• The Jones polynomial: quantum algorithms and applications in quantum complexity theory
• scientific article; zbMATH DE number 2103527
• AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS

Cited in

(6)

• Topological quantum information, Khovanov homology and the Jones polynomial
• Quantum geometry and quantum algorithms
• scientific article; zbMATH DE number 5573021 (Why is no real title available?)
• scientific article; zbMATH DE number 2103527 (Why is no real title available?)
• A polynomial quantum algorithm for approximating the Jones polynomial
• A polynomial quantum algorithm for approximating the Jones polynomial

This page was built for publication: Efficient quantum circuits for approximating the Jones polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525305)