Work

Topological quantum computing and the Jones polynomial

Year: 2006

Type: conference-paper

Abstract: In this paper, we give a description of a recent quantum algorithm created by Aharonov, Jones, and Landau for approximating the values of the Jones polynomial at roots of unity of the form e2πi/k. This description is given with two objectives in mind. The first is to describe the algorithm in such a way as to make explicit the underlying and inherent control structure. The second is to make this algorithm accessible to a larger audience.

Source: Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

DOI: 10.1117/12.665361

Authors: Samuel J. Lomonaco, Jr., Louis H. Kauffman

Institutions: University of Maryland, Baltimore County, University of Illinois Chicago

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2031470792

FWCI: 5.042

Cites: 15

Cited by: 31

Related to: 10