Ensaios sobre computação e informação quânticas: fundamentação e simulações sobre o efeito da entropia

Pós-graduação em Ciência da Computação - IBILCE

Informação quântica e relatividade

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Computational speed-up with a single qudit

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Teoria quântica da computação

This undergraduate thesis aims formally define aspects of Quantum Turing Machine using as a basis quantum finite automata. We introduce the basic concepts of quantum mechanics and quantum computing through principles such as superposition, entanglement of quantum states, quantum bits and algorithms. We demonstrate the Bell's teleportation theorem, enunciated in the form of Deutsch-Jozsa definition for quantum algorithms. The way as the overall text were written omits formal aspects of quantum mechanics, encouraging computer scientists to understand the framework of quantum computation. We conclude our thesis by listing the Quantum Turing Machine's main limitations regarding the well-known Classical Turing Machines

An introduction to numerical methods in low-dimensional quantum systems

This is an introductory course to the Lanczos Method and Density Matrix Renormalization Group Algorithms (DMRG), two among the leading numerical techniques applied in studies of low-dimensional quantum models. The idea of studying the models on clusters of a finite size in order to extract their physical properties is briefly discussed. The important role played by the model symmetries is also examined. Special emphasis is given to the DMRG.