Topological quantum computing and the Jones polynomial

@inproceedings{Lomonaco2006TopologicalQC,
  title={Topological quantum computing and the Jones polynomial},
  author={Samuel J. Lomonaco and Louis H. Kauffman},
  booktitle={SPIE Defense + Commercial Sensing},
  year={2006}
}
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. 
A quantum manual for computing the Jones polynomial
The objective of this paper is to give experimentalists a quantum manual for implementing the Aharonov-Jones- Landau algorithm on an architecture of their choice. In particular, we explicitly applyExpand
Quantum knitting
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can beExpand
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
TLDR
It is concluded with direct proofs that evaluating the Jones polynomial of the plat closure at most primitive roots of unity is a #P-hard problem, while learning its most significant bit is PP-hard, circumventing the usual route through the TuttePolynomial and graph coloring. Expand
Gravitational Topological Quantum Computation
TLDR
Some applications of GTQC in quantum complexity theory and computability theory are discussed, particularly it is conjectured that the Khovanov polynomial for knots and links is more hard than #P-hard; and that the homeomorphism problem, which is noncomputable, maybe can be computed after all via a hyper-computer based onGTQC. Expand
$q$ - Deformed Spin Networks, Knot Polynomials and Anyonic Topological Quantum Computation
We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups.Expand
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
TLDR
An explicit and simplePolynomial quantum algorithm to approximate the Jones polynomial of an n strands braid with m crossings at any primitive root of unity e2πi/k, where the running time of the algorithm is polynometric in m, n and k. Expand
Quantum Algorithms For: Quantum Phase Estimation, Approximation Of The Tutte Polynomial And Black-box Structures
In this dissertation, we investigate three different problems in the field of Quantum computation. First, we discuss the quantum complexity of evaluating the Tutte polynomial of a planar graph.Expand
Introduction to topological quantum computation with non-Abelian anyons
TLDR
This work aims to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Expand
Quantum Algorithms
  • M. Mosca
  • Computer Science, Physics
  • Encyclopedia of Complexity and Systems Science
  • 2009
TLDR
This work provides an explicit algorithm for generating any prescribed interference pattern with an arbitrary precision for quantum algorithms and shows how they are related to diierent instances of quantum phase estimation. Expand
Efficient quantum processing of three–manifold topological invariants
A quantum algorithm for approximating efficiently three–manifold topological invariants in the framework of SU(2) Chern–Simons–Witten (CSW) topological quantum field theory at finite values of theExpand
...
1
2
3
4
...

References

SHOWING 1-10 OF 48 REFERENCES
Quantum computation and quantum information
  • T. Paul
  • Mathematics, Computer Science
  • Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers dealExpand
Quantum field theory and the Jones polynomial
It is shown that 2+1 dimensional quantum Yang-Mills theory, with an action consisting purely of the Chern-Simons term, is exactly soluble and gives a natural framework for understanding the JonesExpand
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
TLDR
It is concluded with direct proofs that evaluating the Jones polynomial of the plat closure at most primitive roots of unity is a #P-hard problem, while learning its most significant bit is PP-hard, circumventing the usual route through the TuttePolynomial and graph coloring. Expand
A Modular Functor Which is Universal¶for Quantum Computation
Abstract:We show that the topological modular functor from Witten–Chern–Simons theory is universal for quantum computation in the sense that a quantum circuit computation can be efficientlyExpand
Simulation of Topological Field Theories¶by Quantum Computers
Abstract: Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for aExpand
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
TLDR
An explicit and simplePolynomial quantum algorithm to approximate the Jones polynomial of an n strands braid with m crossings at any primitive root of unity e2πi/k, where the running time of the algorithm is polynometric in m, n and k. Expand
Topological Quantum Computation
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones poly-Expand
Quantum automata, braid group and link polynomials
TLDR
In this combinatorial framework, families of finite-states and discrete-time quantum automata capable of accepting the language generated by the braid group are implemented, whose transition amplitudes are colored Jones polynomials. Expand
Knot theory and statistical mechanics
This paper gives a self-contained exposition of the basic structure of quantum link invariants as state summations for a vacuum-vacuum scattering amplitude. Models of Vaughan Jones are expressed inExpand
Quantum complexity theory
TLDR
This dissertation proves that relative to an oracle chosen uniformly at random, the class NP cannot be solved on a quantum Turing machine in time $o(2\sp{n/2}).$ and gives evidence suggesting that quantum Turing Machines cannot efficiently solve all of NP. Expand
...
1
2
3
4
5
...