24 citations · 25 across the 5 of their papers we have counts for
5 papers
Quantum Search on Bipartite Multigraphs
Gustavo Alves Bezerra, Andris Ambainis, Renato Portugal
Quantum walks provide a powerful framework for achieving algorithmic speedup in quantum computing. This paper presents a quantum search algorithm for 2-tessellable graphs, a genera…
Hiperwalk: Simulation of Quantum Walks with Heterogeneous High-Performance Computing
Paulo Motta, Gustavo A. Bezerra, Anderson F. P. Santos +1
The Hiperwalk package is designed to facilitate the simulation of quantum walks using heterogeneous high-performance computing, taking advantage of the parallel processing power of…
Quantum Counting on the Complete Bipartite Graph
Gustavo A. Bezerra, Raqueline A. M. Santos, Renato Portugal
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm an…
Algoritmo de Contagem Quântico Aplicado ao Grafo Bipartido Completo
Gustavo Alves Bezerra
Studies on Quantum Computing have been developed since the 1980s, motivating researches on quantum algorithms better than any classical algorithm possible. An example of such algor…
Quantum walk-based search algorithms with multiple marked vertices
G. A. Bezerra, P. H. G. Lugão, R. Portugal
The quantum walk is a powerful tool to develop quantum algorithms, which usually are based on searching for a vertex in a graph with multiple marked vertices, Ambainis's quantum al…