Publication:
Problemas no tratables: enfoques de solución mediante aprendizaje por refuerzo, técnicas de optimización y computación cuántica

Thumbnail Image
Files

Files

Vallejo, Juan-2025.pdf (7.71 MB)
 Autorización.pdf (311.12 KB)
View Statistics
Reference Managers
Mendeley
Indexers
Google Scholar CORE
QR Code
QR Code
Authors

Authors

Vallejo Figueroa, Juan Pablo
Cañón Moreno, Maria José
Bermudez Mendoza, Daniel Esteban
Abstract (Spanish)
Este trabajo investiga algunos problemas no tratables, así como las características de las soluciones propuestas en el estado del arte actual en machine learning clásico y computación cuántica. Se analizan las relaciones, diferencias y similitudes entre estas soluciones, con el objetivo de proponer implementaciones concretas para experimentar con este tipo de soluciones.
Abstract (English)
This paper investigates some intractable problems, as well as the characteristics of the solutions proposed in the current state of the art in classical machine learning and quantum computing. The relationships, differences, and similarities between these solutions are analyzed, with the goal of proposing concrete implementations for experimenting with these types of solutions.
Extent
194 páginas
URI: https://repositorio.escuelaing.edu.co/handle/001/3576
Collections

Collections

GE - Trabajos de Grado Maestría en Ciencia de Datos
References

Dean, W. (2021). Computational Complexity Theory. In E. N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy (Fall 2021). Metaphy- sics Research Lab, Stanford University. https://plato.stanford.edu/ archives/fall2021/entries/computational-complexity/

Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., Milburn, G. J. (2007). Linear optical quantum computing with photonic qubits. *Reviews of Modern Physics*, 79(1), 135. https://doi.org/10.1103/RevModPhys.79.135

De Mol, L. (2021). Turing Machines. In E. N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy (Winter 2021). Metaphysics Research Lab, Stanford University. https://plato.stanford.edu/archives/win2021/ entries/turing-machine/

Nielsen, M.A., Chuang, I.L. (2010). Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press.

Held, M., & Karp, R. M. (1962). A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied mathematics, 10(1), 196-210.

Gambhir, S., & Soni, A. (2020). Entropy analysis in thermal engineering systems. Elsevier.

Skiscim, C. C., & Golden, B. L. (1983). Optimization by simulated annealing: A preliminary computational study for the tsp. Institute of Electrical and Electronics Engineers (IEEE).

Richard S. Sutton and Andrew G. Barto. (2018). REINFORCEMENT LEARNING: AN INTRODUCTION, Adaptive Computation and Machine Learning series, MIT Press (Bradford Book), Cambridge, Mass.

Haykin, S. Neural Networks - A comprehensive foundation (2001). Second Edition. Delhi, India. Prentice Hall.

Pittman, T. B., Jacobs, B. C., & Franson, J. D. (2004). Quan- tum computing using linear optics. *arXiv preprint quant-ph/0406192*. https://arxiv.org/abs/quant-ph/0406192

O’Brien, J. L., Pryde, G. J., White, A. G., Ralph, T. C., & Bran- ning, D. (2003). Experimental controlled-NOT logic gate for single photons in the coincidence basis. *Physical Review A*, 68(3), 032316. https://doi.org/10.1103/PhysRevA.68.032316

Regev, O. (2024). An Efficient Quantum Factoring Algorithm. ar- Xiv:2308.06572v3 [quant-ph]. https://doi.org/10.48550/arXiv.2308.06572

NVIDIA Official Site (2024). NVIDIA® cuOpt™ Microservi- ce. API for Route Optimization. https://www.nvidia.com/en-us/ ai-data-science/products/cuopt/