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, a problem recognized as a universal problem, namely the hardest problem that a quantum computer can efficiently handle.
Spin Network Quantum Circuits
MARZUOLI, ANNALISA;
2017-01-01
Abstract
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, a problem recognized as a universal problem, namely the hardest problem that a quantum computer can efficiently handle.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
