arXiv Analytics

Sign in

arXiv:0909.1550 [quant-ph]AbstractReferencesReviewsResources

Experimental approximation of the Jones polynomial with DQC1

G. Passante, O. Moussa, C. A. Ryan, R. Laflamme

Published 2009-09-08, updated 2009-12-18Version 2

We present experimental results approximating the Jones polynomial using 4 qubits in a liquid state nuclear magnetic resonance quantum information processor. This is the first experimental implementation of a complete problem for the deterministic quantum computation with one quantum bit model of quantum computation, which uses a single qubit accompanied by a register of completely random states. The Jones polynomial is a knot invariant that is important not only to knot theory, but also to statistical mechanics and quantum field theory. The implemented algorithm is a modification of the algorithm developed by Shor and Jordan suitable for implementation in NMR. These experimental results show that for the restricted case of knots whose braid representations have four strands and exactly three crossings, identifying distinct knots is possible 91% of the time.

Comments: 5 figures. Version 2 changes: published version, minor errors corrected, slight changes to improve readability
Journal: PRL 103, 250501 (2009)
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:0909.1080 [quant-ph] (Published 2009-09-06)
NMR Quantum Calculations of the Jones Polynomial
Raimund Marx et al.
arXiv:quant-ph/0511096 (Published 2005-11-09, updated 2006-04-10)
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
arXiv:quant-ph/0605004 (Published 2006-04-29)
Topological Quantum Computing and the Jones Polynomial