TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT

2007 ◽  
Vol 05 (01n02) ◽  
pp. 223-228 ◽  
Author(s):  
ANNALISA MARZUOLI ◽  
MARIO RASETTI

We resort to considerations based on topological quantum field theory to outline the development of a possible quantum algorithm for the evaluation of the permanent of a 0 - 1 matrix. Such an algorithm might represent a breakthrough for quantum computation, since computing the permanent is considered a "universal problem", namely, one among the hardest problems that a quantum computer can efficiently handle.

2014 ◽  
Vol 29 (24) ◽  
pp. 1430025
Author(s):  
Alexey Sleptsov

We discuss relation between knot theory and topological quantum field theory. Also it is considered a theory of superpolynomial invariants of knots which generalizes all other known theories of knot invariants. We discuss a possible generalization of topological quantum field theory with the help of superpolynomial invariants.


1999 ◽  
Vol 08 (02) ◽  
pp. 125-163 ◽  
Author(s):  
Louis Crane ◽  
David Yetter

We show that any 3D topological quantum field theory satisfying physically reasonable factorizability conditions has associated to it in a natural way a Hopf algebra object in a suitable tensor category. We also show that all objects in the tensor category have the structure of left-left crossed bimodules over the Hopf algebra object. For 4D factorizable topological quantum filed theories, we provide by analogous methods a construction of a Hopf algebra category.


Sign in / Sign up

Export Citation Format

Share Document