Work

Quantum search algorithms on hierarchical networks

Year: 2011

Type: conference-paper

Abstract: The “abstract search algorithm” is a well known quantum method to find a marked vertex in a graph. It has been applied with success to searching algorithms for the hypercube and the two-dimensional grid. In this work we provide an example for which that method fails to provide the best algorithm in terms of time complexity. We analyze search algorithms in degree-3 hierarchical networks using quantum walks driven by non-groverian coins. Our conclusions are based on numerical simulations, but the hierarchical structures of the graphs seems to allow analytical results.

Source: IEEE Information Theory Workshop (ITW)

DOI: 10.1109/itw.2011.6089429

Authors: Franklin de Lima Marquezino, Renato Portugal, Stefan Boettcher

Institutions: Universidade Federal do Rio de Janeiro, Laboratório Nacional de Computação Científica, Emory University

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2111993808

FWCI: 0.751

Cites: 11

Cited by: 7

Related to: