Seguir
Fernandes, Tharso
Fernandes, Tharso
Professor de matemática, Universidade Federal do Espírito Santo
E-mail confirmado em ufes.br
Título
Citado por
Citado por
Ano
The staggered quantum walk model
R Portugal, RAM Santos, TD Fernandes, DN Gonçalves
Quantum Information Processing 15, 85-101, 2016
1102016
Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians
R Portugal, TD Fernandes
Physical Review A 95 (4), 042341, 2017
232017
The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
A Abreu, L Cunha, C de Figueiredo, L Kowada, F Marquezino, D Posner, ...
Theoretical Computer Science 801, 175-191, 2020
142020
Complexity bounds on quantum search algorithms in finite-dimensional networks
S Boettcher, S Li, TD Fernandes, R Portugal
Physical Review A 98 (1), 012320, 2018
92018
An efficient quantum algorithm for the hidden subgroup problem over some non-abelian groups
DN Gonçalves, TD Fernandes, CMM Cosme
TEMA (São Carlos) 18 (2), 215-223, 2017
72017
Bounds and complexity for the tessellation problem
A Abreu, L Cunha, T Fernandes, C de Figueiredo, L Kowada, ...
Mat. Contemp 45, 22-30, 2017
32017
Problema do subgrupo oculto em grupos nilpotentes
TD Fernandes
Dissertaçao de Mestrado, Laboratório Nacional de Computaçao Cientıcia-LNCC …, 2008
22008
The tessellation problem of quantum walks
A Abreu, L Cunha, T Fernandes, C de Figueiredo, L Kowada, ...
arXiv preprint arXiv:1705.09014, 2017
12017
A Geometria fractal
LF Rosas, TD Fernandes
Proceeding Series of the Brazilian Society of Computational and Applied …, 2021
2021
Efficiency Bounds on Quantum Search Algorithms in low-dimensional Geometries
S Boettcher, S Li, T Fernandes, R Portugal
APS March Meeting Abstracts 2018, H39. 004, 2018
2018
Modelo de caminhadas quânticas escalonado
TD Fernandes, RJ Petrópolis
2017
Determining the Efficiency of Quantum Search Algorithms with the Renormalization Group.
S Boettcher, S Li, TD Fernandes, R Portugal
CoRR, 2017
2017
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–12