SIMULACIÓN DE CAMINATAS EN COMPUTACIÓN CUÁNTICA

Abstract

The components of the latest Intel processors (i7, i9), have the size of about 45 to 32 nm. respectively, then there is the question of the physicist Richard Feynman, How far is it possible, in theory, continue to make smaller machines under the laws of nature? The previous paragraph shows that we are approaching the borders of the subatomic, where only the laws of quantum mechanics we can predict the behavior of matter. Therefore this paper aims to show how it has been building on these laws, from the context of computing, giving rise to a new branch of research called, quantum computing. Focused on quantum walks, the method used for the design of quantum algorithms, and supported by quantum simulation software, generate graphs that allow me to compare classical with quantum walks and based on their probability distributions show the advantages of quantum algorithms in some applications, such as quantum information management. I begin with a simulation of quantum walks on a particle, and nally presenting some notions of algorithmic complexity, considering the perspective of how to handle level of quantum algorithms some of the problems considered hard (NP-complete) for which there are algorithms e cient