Caminhando em vértices e arestas com o passeio quântico contínuo no tempo

• Autor(a) principal: Silva, Cauê Francisco Teixeira da
• Data de Publicação: 2022
• Tipo de documento: Tese
• Idioma: por
• Título da fonte: Biblioteca Digital de Teses e Dissertações do LNCC
• Texto Completo: https://tede.lncc.br/handle/tede/361
• topic: Computação quântica; Passeio aleatório (Matemática); Teoria dos grafos; Markov, Processos de; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::TEORIA DA COMPUTACAO::ANALISE DE ALGORITMOS E COMPLEXIDADE DE COMPUTACAO

The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, which demands that the evolution operator is local in the sense that the walker must visit the neighboring locations before endeavoring to distant places. Usually, the Hamiltonian is obtained from either the adjacency or the laplacian matrix of the graph and the walker hops from vertices to neighboring vertices. In this work, we define a version of the continuous-time quantum walk that allows the walker to hop from vertices to edges and vice versa. As an application, we analyze the spatial search algorithm on the complete bipartite graph by modifying the new version of the Hamiltonian with an extra term that depends on the location of the marked vertex or marked edge, similar to what is done in the standard continuous-time quantum walk model. We show that the optimal running time to find either a vertex or an edge is O(√Ne) with success probability 1 − o(1), where Ne is the number of edges of the complete bipartite graph.