A5063987136- Quantum Computing Algorithms and Architecture
- Education and Public Policy
- Academic Research in Diverse Fields
- Radiation Effects in Electronics
- Interconnection Networks and Systems
- Advanced Memory and Neural Computing
- Graph theory and applications
- Quantum-Dot Cellular Automata
- Business and Management Studies
- Quantum Information and Cryptography
- Quantum Mechanics and Applications
Laboratório Nacional de Computação Científica
2021-2024
Universidade Federal do Rio Grande do Norte
2019
The quantum walk is a powerful tool to develop algorithms, which usually are based on searching for vertex in graph with multiple marked vertices, Ambainis's algorithm solving the element distinctness problem being most shining example. In this work, we address of calculating analytical expressions time complexity finding using walk-based search algorithms vertices arbitrary graphs, extending previous methods Szegedy's walk, can be applied only bipartite graphs. Two examples coined...
Initial Network on Chip (NoCs) topologies tended to have a regular structure, aiming flexibility - performance for different applications, and multiple paths between routers. However, lack in if compared specific application generated topologies, often irregular. On the other hand, irregular may (multiple communication paths). Moreover, billion-transistor era, circuit components are more susceptible faults, transient permanent. Due cost of producing such circuits, it is desirable increase...
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in database. This based on phase estimation and uses evolution operator Grover’s because its nontrivial eigenvalues are dependent elements. Since can be viewed as walk complete graph, natural way extend use quantum-walk-based search noncomplete graphs instead operator. In this paper, we explore extension by analyzing coined bipartite graph with an arbitrary vertices. We show some depend vertices...
O Exame Nacional para Ingresso na Pós-Graduação em Computação (POSCOMP) é uma avaliação organizada pela Sociedade Brasileira de (SBC) cujo objetivo avaliar o egresso Computação. Este trabalho apresenta análise comparativa das edições 2014 a 2019 do POSCOMP com Currículo Referência (CR) da SBC homologado 2016. A partir dessa comparação, foram observados: (i) ausência aproximadamente 60% dos conteúdos CR nos exames; (ii) apenas 14 apresentam incidências significativas e contínuas (iii) os...
Studies on Quantum Computing have been developed since the 1980s, motivating researches quantum algorithms better than any classical algorithm possible. An example of such is Grover's algorithm, capable finding $k$ (marked) elements in an unordered database with $N$ using $O(\sqrt{N/k})$ steps. can be interpreted as a walk complete graph (with loops) containing vertices from which are marked. This interpretation motivated search other graphs -- bipartite graph, grid, and hypercube. Using...