46 citations · 185 across the 17 of their papers we have counts for
17 papers
A Quantum Approach to the Discretizable Molecular Distance Geometry Problem
Carlile Lavor, Franklin Marquezino, Andres Oliveira +1
The Discretizable Molecular Distance Geometry Problem (DMDGP) aims to determine the three-dimensional protein structure using distance information from nuclear magnetic resonance e…
Quantum Walks can Unitarily Represent Random Walks on Finite Graphs
Matheus G. Andrade, Franklin de Lima Marquezino, Daniel R. Figueiredo
Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time inst…
Total tessellation cover and quantum walk
Alexandre Abreu, Luís Cunha, Celina de Figueiredo +3
We propose the total staggered quantum walk model and the total tessellation cover of a graph. This model uses the concept of total tessellation cover to describe the motion of the…
On the equivalence between quantum and random walks on finite graphs
Matheus G. Andrade, Franklin Marquezino, Daniel R. Figueiredo
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number o…
The Tessellation Cover Number of Good Tessellable Graphs
Alexandre Abreu, Luís Cunha, Celina de Figueiredo +4
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, and t…
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 $…