Spin Network Quantum Circuits

摘要

In this manuscript, a recent approach to quantum computation promoted by the authors, based on the theory of recoupling of quantum angular momenta instead of the conventional notion of q-bit (that simply mimicks the Booleam structure of the classical approach to computation), is reviewed and analyzed in its basic elements. In particular, the reach of the new scheme in terms of algorithmic complexity is discussed, focusing the attention on the quantum algorithm for generalized Jones polynomials of knots, (L;q; j(1), j(2), ... , j(M)), because the problem of approximating (L; q; {j(i)}) has been recognized to be a universal problem, namely the hardest problem that a quantum computer can efficiently handle. Copyright (c) 2017 John Wiley & Sons, Ltd.