2 citations · 2 across the 2 of their papers we have counts for
3 papers
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…
Cayley graphs and analysis of quantum cost for reversible circuit synthesis
A. C. Ribeiro, C. M. H. de Figueiredo, F. L. Marquezino +1
We propose the theory of Cayley graphs as a framework to analyse gate counts and quantum costs resulting from reversible circuit synthesis. Several methods have been proposed in th…
Comments on quant-ph/0506137: Fast quantum search algorithms by qubit comparisons exploiting global phase interference
L. A. B. Kowada, C. M. H. de Figueiredo, R. Portugal +1
Recently, Andreas de Vries proposed a quantum algorithm that would find an element in an unsorted database exponentially faster than Grover's algorithm. We show that de Vries' algo…