Franklin L. Marquezino

Anderson de Souza Barbosa

Matheus Romaneli

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023

Steane code analysis by randomized benchmarking.

[BibT_eX]

[DOI]

RAIRO Oper. Res., March, 2023

2022

A quantum approach to the discretizable molecular distance geometry problem.

[BibT_eX]

[DOI]

Carlile Lavor

Andrês Oliveira

Quantum Inf. Process., 2022

Total tessellation cover: Bounds, hardness, and applications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

A computational complexity comparative study of graph tessellation problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates.

[BibT_eX]

[DOI]

Edinelço Dalcumune

Celina Miraglia Herrera de Figueiredo

André da Cunha Ribeiro

J. Univers. Comput. Sci., 2021

2020

The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.

[BibT_eX]

[DOI]

Matheus Guedes de Andrade

Theor. Comput. Sci., 2020

On the equivalence between quantum and random walks on finite graphs.

[BibT_eX]

[DOI]

Daniel R. Figueiredo

Quantum Inf. Process., 2020

Total tessellation cover and quantum walk.

[BibT_eX]

[DOI]

CoRR, 2020

2019

A Primer on Quantum Computing

[BibT_eX]

[DOI]

Carlile Lavor

Springer Briefs in Computer Science, Springer, ISBN: 978-3-030-19065-1, 2019

Fourier 1-norm and quantum speed-up.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2019

The Tessellation Cover Number of Good Tessellable Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Quantum Query as a state decomposition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.

[BibT_eX]

[DOI]

Tharso D. Fernandes

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

The tessellation problem of quantum walks.

[BibT_eX]

[DOI]

Tharso D. Fernandes

CoRR, 2017

2016

QEDS: Um Simulador Clássico para Distinção de Elementos Quântico.

[BibT_eX]

[DOI]

Matheus Manzoli Ferreira

RITA, 2016

L<sub>1</sub>-norm and quantum speed-up.

[BibT_eX]

[DOI]

CoRR, 2016

Quantum query without unitary operators.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Preserving privacy in a smart grid scenario using quantum mechanics.

[BibT_eX]

[DOI]

Fábio Borges

Raqueline A. M. Santos

Secur. Commun. Networks, 2015

A new reversible circuit synthesis algorithm based on cycle representations of permutations.

[BibT_eX]

[DOI]

A. C. Ribeiro

Electron. Notes Discret. Math., 2015

2012

Cayley graphs and analysis of quantum cost for reversible circuit synthesis

[BibT_eX]

[DOI]

A. C. Ribeiro

CoRR, 2012

2011

Quantum search algorithms on hierarchical networks.

[BibT_eX]

[DOI]

Stefan Boettcher

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010

Analysis,Simulations and Algorithmic Applications of Quantum Walks.

[BibT_eX]

[DOI]

PhD thesis, 2010

Spatial search on a honeycomb network.

[BibT_eX]

[DOI]

Gonzalo Abal

Raul Donangelo

Math. Struct. Comput. Sci., 2010

Obtaining the Quantum Fourier Transform from the classical FFT with QR decomposition.

[BibT_eX]

[DOI]

F. D. Sasse

J. Comput. Appl. Math., 2010

Mixing Times in Quantum Walks on Two-Dimensional Grids.

[BibT_eX]

[DOI]

Gonzalo Abal

CoRR, 2010

2009

Decoherence in Search Algorithms.

[BibT_eX]

[DOI]

Gonzalo Abal

Raul Donangelo

Amanda C. Oliveira

CoRR, 2009

2008

The QWalk simulator of quantum walks.

[BibT_eX]

[DOI]