Quantum Algorithms, Paraconsistent Computation And Deutsch's Problem

dc.creatorAgudelo J.C.
dc.creatorCarnielli W.
dc.date2005
dc.date2015-06-26T14:09:59Z
dc.date2015-11-26T14:10:08Z
dc.date2015-06-26T14:09:59Z
dc.date2015-11-26T14:10:08Z
dc.date.accessioned2018-03-28T21:10:46Z
dc.date.available2018-03-28T21:10:46Z
dc.identifier0972741216; 9780972741217
dc.identifierProceedings Of The 2nd Indian International Conference On Artificial Intelligence, Iicai 2005. , v. , n. , p. 1609 - 1628, 2005.
dc.identifier
dc.identifier
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-38049020687&partnerID=40&md5=1db929bcd0faa38c2b742eafaf2d8b33
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/93932
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/93932
dc.identifier2-s2.0-38049020687
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1241431
dc.descriptionWe 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.
dc.description
dc.description
dc.description1609
dc.description1628
dc.descriptionAgudelo, J.C., Máquinas de turing paraconsistentes: Algunas posibles defini-ciones y consecuencias (2003) Graduation Project, Universidad EAFIT, , http://sigma.eafit.edu.co:90/~asicard/archivos/mtps.ps.gz
dc.descriptionAgudelo, J.C., Sicard, A., Máquinas de turing paraconsistentes: Una posible definición (2004) Matemáticas: Enseñanza Universitaria, 12 (2), pp. 37-51. , http://revistaerm.univalle.edu.co/Enlaces/volXII2.html
dc.descriptionBenioff, P., The computer as a physical system: A microscopic quantum mechanical hamiltonian model of computers as represented by Turing machines (1980) Journal of Statistical Physics, 22, pp. 563-591
dc.descriptionConiglio, W., Carnielli, M., Marcos, J., Logics of formal inconsistency (2005) Handbook of Philosophical Logic, 14. , http://www.cle.rniicamp.br/e-prints/vol5,nl,2005.html, To be published as a chapter in the, second edition, Kluwer Acad. Pub, vol 5, n. 1, 2005
dc.descriptionCarnielli, W.A., Many-valued logics and plausible reasoning (1990) Proceedings of the Twentieth International Symposium on Multiple-Valued Logic, pp. 328-335. , Charlotte, NC, USA, IEEE Computer Society
dc.descriptionCarnielli, W.A., Possible-translations semantics for paraconsistent logics (2000) Frontiers of Paraconsistent Logic: Proceedings of the I World Congress on Paraconsistency, pp. 149-163. , D. Batens, C. Mortensen, G. Priest, and J. P. Van Bendegem, editors, Logic and Computation Series, Baldock: Research Studies Press, King's College Publications
dc.descriptionCattaneo, G., Chiara, M.L.D., Giuntini, R., Leporini, R., An unsharp logic from quantum computation (2004) International Journal of Theoretical Physics, 43, pp. 1803-1817
dc.descriptionChuang, I.L., Nielsen, M.A., (2000) Quantum Computation and Quantum Information, , Cambridge: Cambridge University Press
dc.descriptionCleve, R., Ekert, A., Macchiavello, C., Mosca, M., Quantum algorithms revisited (1998) Proceedings of the Royal Society of London, 454, pp. 339-354. , Series A
dc.descriptionCopeland, J., Hipercomputation (2002) Minds and Machines, 12, pp. 461-502
dc.descriptionDeutsch, D., Quantum theory, the church-turing principle and the universal quantum computer (1985) Proceedings of the Royal Society of London, 400, pp. 97-117. , Series A
dc.descriptionDeutsch, D., Quantum computational networks (1989) Proceedings of the Royal Society of London, 425, pp. 73-90. , Series A
dc.descriptionEpstein, R.L., Carnielli, W.A., Computability: Computable functions (2000) Logic, and the Foundations of Mathematics, , Belmont, CA: Wads worth/Thomson Learning, 2a edition
dc.descriptionFeynman, R.P., Simulating physics with computers (1982) International Journal of Theoretical Physics, 21, pp. 467-488
dc.descriptionGruska, J., (1999) Quantum Computing, , Cambridge: McGraw-Hill International (UK) Limited
dc.descriptionLloyd, S., Braunstein, S.L., Quantum computation over continuous variables (1999) Physical Review Letters, 82 (8), pp. 1784-1787
dc.descriptionDe Almeida, J.M., (1999) Semǎnticas de Traduções Possiveis, , Master's Thesis, Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas
dc.descriptionMateus, P., Sernadas, A., Exogenous quantum logic (2004) Manuscript, , http://wslc.math.ist.utl.pt/ftp/pub/SernadasA/04-MS-fiblog24s.pdf, CLC, Department of Mathematics, IST., Available at
dc.descriptionOdifreddi, P., Classical recursion theory (1989) The Theory of Functions and Sets of Natural Numbers, 125. , Studies in Logic and the Foundations of Mathematics, volume, Amsterdam North-Holland
dc.descriptionOzawa, M., Nishimura, H., (1999) Local Transition Function of Quantum Turing Machines, , http://eirXiv.org/abs/quant-ph/9811069
dc.descriptionPenrose, R., (1989) The Emperor's New Mind: concerning Computers, Minds and the Laws of Physics, , Oxford: Oxford University Press
dc.descriptionRieffel, E., Polak, W., An introduction to quantum computing for non-physicists (2000) ACM Computing Surveys, 32 (3), pp. 300-335
dc.descriptionShor, P.W., Algorithms for quantum computation: Discrete log and factoring (1994) Proc. 35th Symposium on Foundations of Computer Science, pp. 124-134. , IEEE Computer Society Press
dc.descriptionShor, P.W., Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer (1997) SI AM Journal on Computing, 26 (5), pp. 1484-1509
dc.descriptionSicard, A., Computación paraconsistente (2002) Technical Report, Universi- Dad EAFIT, , http://sigma.eafit.edu.co:90/~asicard/archivos/proyectoCP.ps.gz
dc.descriptionSylvan, R., Copeland, J., Computability is logic-relative (2000) Sociative Logics and their Applications: Essays by the Late Richard Sylvan, pp. 189-199. , Graham Priest and Dominic Hyde, editors, London: Ashgate Publishing Company, 2000
dc.descriptionTuring, A.M., On computable numbers, with an application to the Entscheidungsproblem (1936) Proceedings of the London Mathematical Society, 43, pp. 230-265. , A correction, ibid, 1936-1937, pags, 544-546
dc.descriptionVeléz, M., Sicard, A., (2000) Sobre Un Modelo de Computación Cuántica Sobre Variables Continuas, , http://sigma.eafit.edu.co:90/~asicard/archivos/ccc.ps.gz
dc.descriptionYao, A.C., Quantum circuit complexity (1993) Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pp. 352-360. , IEEE Computer Society Press, Los Alamitos, CA
dc.languageen
dc.publisher
dc.relationProceedings of the 2nd Indian International Conference on Artificial Intelligence, IICAI 2005
dc.rightsfechado
dc.sourceScopus
dc.titleQuantum Algorithms, Paraconsistent Computation And Deutsch's Problem
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución