L
Luís Tarrataca
Researcher at Centro Federal de Educação Tecnológica Celso Suckow da Fonseca
Publications - 35
Citations - 350
Luís Tarrataca is an academic researcher from Centro Federal de Educação Tecnológica Celso Suckow da Fonseca. The author has contributed to research in topics: Quantum computer & Quantum algorithm. The author has an hindex of 10, co-authored 35 publications receiving 260 citations. Previous affiliations of Luís Tarrataca include Centro Federal de Educação Tecnológica de Minas Gerais & Technical University of Lisbon.
Papers
More filters
Journal ArticleDOI
Laplacian versus adjacency matrix in quantum walk search
TL;DR: This work algorithmically explores search on the complete bipartite graph with multiple marked vertices, using both the Laplacian and adjacency matrix, and finds that the two walks differ qualitatively and quantitatively in their required jumping rate, runtime, sampling of marked Vertices, and in what constitutes a natural initial state.
Journal ArticleDOI
Continuous-Time Quantum Search on Balanced Trees
TL;DR: Analytical and numerical arguments show that the exponent of the asymptotic running time of the quantum search algorithm on a balanced tree changes uniformly from $\beta=0.5$ to $\ beta=1$ as the searched-for site is moved from the root of the tree towards the leaves.
Book ChapterDOI
Context Inference for Mobile Applications in the UPCASE Project
André C. Santos,Luís Tarrataca,João M. P. Cardoso,Diogo R. Ferreira,Pedro C. Diniz,Paulo Chainho +5 more
TL;DR: In this paper, the authors describe a system architecture from raw data acquisition to feature extraction and context inference, which is based on a decision tree to learn and identify contexts automatically and dynamically at runtime.
Journal ArticleDOI
Exact Expectation Evaluation and Design of Variable Step-Size Adaptive Algorithms
TL;DR: It is argued that such a comparison can be misleading because the supposedly optimal step-size sequence sometimes induces divergence in the initial phase of learning, which occurs most often when the input signal is colored and/or heavy tailed.
Journal ArticleDOI
Laplacian versus Adjacency Matrix in Quantum Walk Search
TL;DR: In this paper, the authors consider the problem of quantum walk search on a complete bipartite graph with multiple marked vertices, using both the Laplacian and adjacency matrix.