78 citations · 121 across the 5 of their papers we have counts for
5 papers
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
A. Abreu, L. Cunha, T. Fernandes +5
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $…
Complexity Bounds on Quantum Search Algorithms in finite-dimensional Networks
Stefan Boettcher, Shanshan Li, Tharso D. Fernandes +1
We establish a lower bound concerning the computational complexity of Grover's algorithms on fractal networks. This bound provides general predictions for the quantum advantage gai…
The tessellation problem of quantum walks
A. Abreu, L. Cunha, T. Fernandes +5
Quantum walks have received a great deal of attention recently because they can be used to develop new quantum algorithms and to simulate interesting quantum systems. In this work,…
Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians
Renato Portugal, Tharso D. Fernandes
Quantum search on the two-dimensional lattice with one marked vertex and cyclic boundary conditions is an important problem in the context of quantum algorithms with an interesting…
The Staggered Quantum Walk Model
R. Portugal, R. A. M. Santos, T. D. Fernandes +1
There are at least three models of discrete-time quantum walks (QWs) on graphs currently under active development. In this work we focus on the equivalence of two of them, known as…