Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||Quantum Algorithms, Paraconsistent Computation And Deutsch's Problem|
|Abstract:||We present the new model of paraconsistent Turing machines and revise the models of quantum Turing machines and quantum circuits, stressing the concepts of entangled states and quantum parallelism which are important features for efficient quantum algorithms. We revise a quantum circuit that solves the Deutsch's problem, and then provide another solution to Deutsch's problem by means of paraconsistent Turing machines. This raises some interesting questions, and we close the paper by discussing some relationships between paraconsistent Turing machines and quantum Turing machines. Copyright © IICAI 2005.|
|Appears in Collections:||Artigos e Materiais de Revistas Científicas - Unicamp|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.