Hipercomputación desde la computación cuántica

Vista sencilla de ítem
dc.contributor.authorSicard, Andrésspa
dc.contributor.authorSuárez Ospina, Juan Davidspa
dc.contributor.authorVelez Gallego, Mario Cspa
dc.contributor.cvlacSuárez Ospina, Juan David [0001701150]spa
dc.contributor.googlescholarSuárez Ospina, Juan David [HzYRaoAAAAAJ]spa
dc.contributor.googlescholarVelez Gallego, Mario C [EZRgTpoAAAAJ]spa
dc.contributor.orcidSuárez Ospina, Juan David [0000-0002-0117-4972]spa
dc.contributor.orcidVelez Gallego, Mario C [0000-0002-1972-1284]spa
dc.date.accessioned2020-10-27T00:21:03Z
dc.date.available2020-10-27T00:21:03Z
dc.date.issued2006-12-01
dc.description.abstractUn hipercomputador computa funciones que son incomputables por una maquina de Turing. Recientemente, Tien D. Kieu ha propuesto un algoritmo hipercomputacional cuántico, el cual emplea como referente físico el oscilador armónico cuántico y resuelve en principio el decimo problema de Hilbert. Se realiza un análisis del algoritmo de Kieu y se deduce que esta sustentado en ciertas propiedades del ´algebra Weyl-Heisenberg, la cual es el ´algebra dinámica asociada al oscilador armónico cuántico; y en una cierta aplicación del teorema adiabático de la mecánica cuántica. Con base en el análisis realizado, se presenta una adaptación algebraica del algoritmo de Kieu, es decir, se presenta un algoritmo a la Kieu sobre el ´algebra de Lie su(1, 1). Debido a que el algebra su(1, 1) admite realizaciones en sistemas físicos en las areas de la ´óptica cuántica, la materia condensada y la física matemática, entre otras; la adaptación realizada amplia el espectro de posibilidades de implementación del algoritmo sobre uno de estos sistemas.spa
dc.description.abstractenglishA hypercomputer computes functions that are uncomputable by a computing machine. Turing. Recently, Tien D. Kieu has proposed a hypercomputational algorithm quantum, which uses the quantum harmonic oscillator as a physical reference and solves in principle Hilbert's tenth problem. An analysis of the Kieu algorithm is performed and it follows that it is supported by certain properties of the Weyl-Heisenberg algebra, which is the dynamical algebra associated with the quantum harmonic oscillator; and in a certain application of the adiabatic theorem of quantum mechanics. Based on the analysis carried out, an algebraic adaptation of Kieu's algorithm is presented, that is, an algorithm a la Kieu on the Lie algebra of him (1, 1). Because the algebra su(1, 1) supports realizations in physical systems in the areas of quantum optics, matter condensed and mathematical physics, among others; the adaptation carried out widens the spectrum of possibilities of implementing the algorithm on one of these systems.eng
dc.format.mimetypeapplication/pdfspa
dc.identifier.instnameinstname:Universidad Autónoma de Bucaramanga UNABspa
dc.identifier.issn2539-2115
dc.identifier.issn1657-2831
dc.identifier.repourlrepourl:https://repository.unab.edu.co
dc.identifier.urihttp://hdl.handle.net/20.500.12749/9006
dc.language.isospaspa
dc.publisherUniversidad Autónoma de Bucaramanga UNAB
dc.relationhttps://revistas.unab.edu.co/index.php/rcc/article/view/1050/1023
dc.relation.referencesJ. P. Antoine et al. Temporally stable coherent states for infinite well and P¨oschlTeller potentials. J. Math. Phys. 42(6), 2349–2387 (2001).
dc.relation.referencesJ. E. Avron y A. Elgart. Adiabatic theorem without a gap condition. Commun. Math. Phys. 203(2), 444–463 (1999).
dc.relation.referencesL. Blum et al. “Complexity and real computation”. New York: Springer-Verlag (1998).
dc.relation.referencesV. V. Borzov y E. V. Damaskinsky. Generalized coherent states for classical orthogonal polynomials. En V. S. Buldyrev et al, editores, “Proceedings of the International Seminar “Day on Diffraction’02””, p´ags. 47–53. IEEE Computer Society Press (2002).
dc.relation.referencesM. Braverman y S. Cook. Computing over the reals: Foundations for scientific computing. Notices of the AMS 53(3), 318–329 (2006).
dc.relation.referencesC. S. Calude. “Information and Randomness: An Algorithmic Perspective”. Springer, 2nd ed. (2002).
dc.relation.referencesI. L. Chuang y M. A. Nielsen. “Quantum Computation and Quantum Information”. Cambridge: Cambridge University Press (2000).
dc.relation.referencesS. B. Cooper. “Computability theory”. London: Chapman & Hall (2003).
dc.relation.referencesB. J. Copeland. Hypercomputation. Minds and Machines 12, 461–502 (2002).
dc.relation.referencesB. J. Copeland y D. Proudfoot. Alan Turing’s forgotten ideas in computer science. Scientific American 280(4), 76–81 (1999).
dc.relation.referencesD. Deutsch. Frequently Asked Questions about Quantum Computation. www.qubit.org/library/QuantumComputationFAQ.html, Septiembre, 2001.
dc.relation.referencesD. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400, 97–117 (1985).
dc.relation.referencesE. Farhi et al. A quantum adiabatic evolution algorithm applied to random instances of NP-complete problem. Science 292, 472–476 (2001).
dc.relation.referencesH.-S. Fu y R. Sasaki. Exponential and Laguerre squeezed states for su(1, 1) algebra and the Calogero-Sutherland model. Phys. Rev. A 53(6), 3836–3844 (1996).
dc.relation.referencesA. Hodges. Can quantum computing solve classically unsolvable problems? Preprint: arXiv.org/abs/quant-ph/0512248 (2005).
dc.relation.referencesT. D. Kieu. Quantum adiabatic algorithm for Hilbert´s tenth problem: I. The algorithm. Eprint: arXiv.org/abs/quant-ph/0310052 v2 (2003).
dc.relation.referencesT. D. Kieu. A reformulation of Hilbert’s tenth problem through quantum mechanics. Proc. R. Soc. Lond. A 460, 1535–1545 (2004).
dc.relation.referencesT. D. Kieu. An anatomy of a quantum adiabatic algorithm that transcends the Turing computability. International Journal of Quantum Computation 3(1), 177–182 (2005).
dc.relation.referencesT. D. Kieu. Hypercomputability of quantum adiabatic processes: Fact versus prejudices. Invited paper for a special issue of the Journal of Applied Mathematics and Computation on Hypercomputation. Preprint: arXiv.org/abs/quant-ph/0504101 (2005).
dc.relation.referencesT. D. Kieu. On the identification of the ground state based on occupation probabilities: An investigation of Smith’s apparent counterexample. Preprint: arXiv.org/abs/quantph/0602145 (2006).
dc.relation.referencesT. D. Kieu. Reply to Andrew Hodges. Preprint: arXiv.org/abs/quant-ph/0602214 v2 (2006).
dc.relation.referencesY. V. Matiyasevich. “Hilbert’s tenth problem”. Cambridge, Massachusetts: The MIT Press (1993).
dc.relation.referencesA. Messiah. “Quantum mechanics”, vol. II. New York: John Wiley & Sons (1990).
dc.relation.referencesT. Ord y T. D. Kieu. Using biased coins as oracles. Preprint: arxiv.org/abs/cs.OH/0401019 (2004).
dc.relation.referencesR. Pena-Mar ˜ ´ı. “Dise˜no de Programas. Formalismo y Abstracci´on”. Madrid: Pearson Educaci´on, 3a ed. (2005).
dc.relation.referencesT. Pheidas y K. Zahidi. Undecidability of existential theories of rings and fields: A survey. En J. Denef et al, editores, “Hilbert’s Tenth Problem: Relations with Arithmetic and Algebraic Geometry”, vol. 270 de “Contemporary Mathematics”, p´ags. 49–106. American Mathematical Society (2000).
dc.relation.referencesP. W. Shor. Why haven’t more quantum algorithms been found? Journal of the ACM 50(1), 87–90 (2003).
dc.relation.referencesA. Sicard, J. Ospina y M. V´ elez. Numerical simulations of a possible hypercomputational quantum algorithm. En B. Ribeiro et al, editores, “Adaptive and Natural Computing Algorithms. Proc. of the International Conference in Coimbra, Portugal”, p´ags. 272–275. SpringerWienNewYork (21st - 23rd March 2005).
dc.relation.referencesA. Sicard y M. V´ elez. Hipercomputaci´on: La pr´oxima generaci´on de la computaci´on te´orica. Revista Universidad EAFIT 123, 47–51 (2001).
dc.relation.referencesA. Sicard, M. V´ elez y J. Ospina. A possible hypercomputational quantum algorithm. En E. J. Donkor, A. R. Pirich y H. E. Brandt, editores, “Quantum Information and Computation III”, vol. 5815 de “Proc. of SPIE”, p´ags. 219–226. SPIE, Bellingham, WA (2005).
dc.relation.referencesW. D. Smith. Three counterexamples refuting Kieu’s plan for “quantum hypercomputation”; and some uncomputable quantum mechanical tasks. Accepted for publication in Applied Mathematics and Computation. Available online 3 March (2006).
dc.relation.referencesR. Srikanth. Computable functions, the Church-Turing thesis and the quantum measurement problem. Preprint: arXiv.org/abs/quant-ph/0402128 (2004).
dc.relation.referencesM. Stannett. Hypercomputation models. En C. Teuscher, editor, “Alan Turing: life and legaly of a great thinker”, p´ags. 135–157. Berlin: Springer (2003).
dc.relation.referencesB. Tsirelson. The quantum algorithm of Kieu does not solve the Hilbert’s tenth problem. Preprint: arXiv.org/abs/quant-ph/0111009 (2001).
dc.relation.referencesX.-G. Wang. Coherent states, displaced number states and Laguerre polynomial states for su(1, 1) Lie algebra. Int. J. Mod. Phys. B 14(10), 1093–1104 (2000).
dc.relation.referencesK. Weihrauch. “Computable Analysis: An Introduction”. Berlin: Springer-Verlag (2000).
dc.relation.urihttps://revistas.unab.edu.co/index.php/rcc/article/view/1050
dc.relation.urihttp://hdl.handle.net/20.500.12749/20387spa
dc.rightsDerechos de autor 2006 Revista Colombiana de Computación
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.rights.creativecommonsAttribution-NonCommercial-ShareAlike 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/co/
dc.sourceRevista Colombiana de Computación; Vol. 7 Núm. 2 (2006): Revista Colombiana de Computación; 66-82
dc.subjectInnovaciones tecnológicas
dc.subjectCiencia de los computadores
dc.subjectDesarrollo de tecnología
dc.subjectIngeniería de sistemas
dc.subjectInvestigaciones
dc.subjectTecnologías de la información y las comunicaciones
dc.subjectTIC´s
dc.subject.keywordsTechnological innovationseng
dc.subject.keywordsComputer scienceeng
dc.subject.keywordsTechnology developmenteng
dc.subject.keywordsSystems engineeringeng
dc.subject.keywordsInvestigationseng
dc.subject.keywordsInformation and communication technologieseng
dc.subject.keywordsICT'seng
dc.subject.keywordsHypercomputingeng
dc.subject.keywordsQuantum computingeng
dc.subject.keywordsHilbert's tenth problemeng
dc.subject.keywordsAdiabatic theoremeng
dc.subject.keywordsLie algebraeng
dc.subject.lembInnovaciones tecnológicasspa
dc.subject.lembCiencias de la computaciónspa
dc.subject.lembDesarrollo tecnológicospa
dc.subject.lembIngeniería de sistemasspa
dc.subject.lembInvestigacionesspa
dc.subject.lembTecnologías de la información y la comunicaciónspa
dc.subject.proposalHipercomputacionspa
dc.subject.proposalComputación cuánticaspa
dc.subject.proposalDecimo problema de Hilbertspa
dc.subject.proposalTeorema adiabaticospa
dc.subject.proposalAlgebra de Liespa
dc.titleHipercomputación desde la computación cuánticaspa
dc.title.translatedHypercomputing from quantum computingeng
dc.type.coarhttp://purl.org/coar/resource_type/c_7a1f
dc.type.driverinfo:eu-repo/semantics/article
dc.type.hasversioninfo:eu-repo/semantics/acceptedVersion
dc.type.localArtículospa
dc.type.redcolhttp://purl.org/redcol/resource_type/CJournalArticle

Archivos

Bloque original

Mostrando 1 - 1 de 1
Miniatura
Nombre:
2006_Articulo_Hipercomputación desde la computación cuántica.pdf
Tamaño:
312.09 KB
Formato:
Adobe Portable Document Format
Descripción:
Artículo
Descargar

Colecciones

Revista Colombiana de Computación