Standard deviation of a staggered quantum walk on a line of diamonds

• Ano de defesa: 2018
• Autor(a) principal: Silva, Cauê Francisco Teixeira da
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Laboratório Nacional de Computação Científica; Coordenação de Pós-Graduação e Aperfeiçoamento (COPGA); Brasil; LNCC; Programa de Pós-Graduação em Modelagem Computacional
• Palavras-chave em Português: Computadores quânticos; Tesselação de gráficos; Caminhada quântica escalonada; Desvio padrão; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::TEORIA DA COMPUTACAO
• Link de acesso: https://tede.lncc.br/handle/tede/285

The discovery of the quantum mechanics changed the physics world. Newton’s laws of motion cannot be applied to very small physical systems. The quantum mechanics has many applications, one of them is the quantum computation, which was discovered in the 80’s and has steadily grown from that time to nowadays. One powerful tool of quantum computation is the quantum walk, which is the quantum version of random walk. In this work, we study some quantum walk models. The coined model was the first one to be proposed, this model has a quadratic larger position standard deviation compared to the one of the random walk. The second model is the staggered quantum walk, which was proposed recently. This model makes a partition of the vertices of the graph into cliques, and a partition is called tessellation, establishing a new problem of graph theory, related to the problem of graph coloring. We study 2-tessellable graphs and prove a new theorem in graph theory. An expression of the standard deviation of a staggered quantum walk on the line-of-diamond graph is obtained using a special basis, which is derived from the staggered Fourier transform.