Busca quântica de dados XML usando algoritmo de Grover

This paper presents a quantum search algorithm implementation with small modifications. The algorithm idea is to be hybrid, capable to run on classical systems and quantum systems. We present the concepts of quantum search and introduced a pseudo-framework able to generate code for classical computers (C++) and quantum computers (QCL). The algorithms were submitted to simulations, which resulted in a comparative study of the operation of Grover’s algorithm on both systems, carrying out searches in a mass of data in XML format files. As a result, we see very similar numbers between classical and quantum systems, this creates an expectation that the search in real quantum computers is much more efficient.

Da receita à paixão: a mise en abyme em Clarice Lispector

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

Análise do efeito de entropia em computação quântica: simulações em ambiente paralelo

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

Maximally genuine multipartite entangled mixed X-states of N-qubits

For every possible spectrum of 2(N)-dimensional density operators, we construct an N-qubit X-state of the same spectrum and maximal genuine multipartite (GM-) concurrence, hence characterizing a global unitary transformation that -constrained to output X-states-maximizes the GM-concurrence of an arbitrary input mixed state of N qubits. We also apply semidefinite programming methods to obtain N-qubit X-states with maximal GM-concurrence for a given purity and to provide an alternative proof of optimality of a recently proposed set of density matrices for the purpose, the so-called X-MEMS. Furthermore, we introduce a numerical strategy to tailor a quantum operation that converts between any two given density matrices using a relatively small number of Kraus operators. We apply our strategy to design short operator-sum representations for the transformation between any given N-qubit mixed state and a corresponding X-MEMS of the same purity.

Protecting the root SWAP operation from general and residual errors by continuous dynamical decoupling

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

Computational speed-up with a single qudit

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

Protecting the √SWAP operation from general and residual errors by continuous dynamical decoupling

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

Protecting the √SWAP operation from general and residual errors by continuous dynamical decoupling

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