corner
corner

Phys. Rev. Lett. 103, 250501 (2009) [4 pages]

Experimental Approximation of the Jones Polynomial with One Quantum Bit

Download: PDF (290 kB) Buy this article Export: BibTeX or EndNote (RIS)

G. Passante1, O. Moussa1, C. A. Ryan1, and R. Laflamme1,2
1Institute for Quantum Computing and Department of Physics, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada
2Perimeter Institute for Theoretical Physics, Waterloo, Ontario, N2J 2W9, Canada

Received 17 September 2009; published 18 December 2009

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.

© 2009 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevLett.103.250501
DOI:
10.1103/PhysRevLett.103.250501
PACS:
03.67.Lx, 03.67.Ac, 76.60.-k