1 citations · 3 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…
Quantum search by continuous-time quantum walk on t-designs
Pedro H. G. Lugão, Renato Portugal
This work examines the time complexity of quantum search algorithms on combinatorial -designs with multiple marked elements using the continuous-time quantum walk. Through a det…
Quantum Hitting Time on the Complete Graph
R. A. M. Santos, R. Portugal
Quantum walks play an important role in the area of quantum algorithms. Many interesting problems can be reduced to searching marked states in a quantum Markov chain. In this conte…