TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT
2007 ◽
Vol 05
(01n02)
◽
pp. 223-228
◽
Keyword(s):
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.
1997 ◽
Vol 188
(3)
◽
pp. 501-520
◽
Keyword(s):
1999 ◽
Vol 08
(02)
◽
pp. 125-163
◽
Keyword(s):