Zobrazeno 1 - 10
of 124
pro vyhledávání: '"de Souza, Luciano"'
Autor:
de Souza, Luciano S., de Carvalho, Jonathan H. A., Santos, Henrique C. T., Ferreira, Tiago A. E.
There is a strong interest in quantum search algorithms, particularly in problems with multiple adjacent solutions. In the hypercube, part of the energy of the quantum system is retained in states adjacent to the target states, decreasing the chances
Externí odkaz:
http://arxiv.org/abs/2305.19614
Autor:
de Souza, Luciano S., de Carvalho, Jonathan H. A., Santos, Henrique C. T., Ferreira, Tiago A. E.
The lackadaisical quantum walk, a quantum analog of the lazy random walk, is obtained by adding a weighted self-loop transition to each state. Impacts of the self-loop weight $l$ on the final success probability in finding a solution make it a key pa
Externí odkaz:
http://arxiv.org/abs/2305.01121
Autor:
Santos, Henrique C. T., de Souza, Luciano S., de Carvalho, Jonathan H. A., Ferreira, Tiago A. E.
The need for computational resources grows as computational algorithms gain popularity in different sectors of the scientific community. This search has stimulated the development of several cloud platforms that abstract the complexity of computation
Externí odkaz:
http://arxiv.org/abs/2301.05770
Autor:
de Souza, Luciano, Cardoso, Maria das Graças, Konig, Isaac, de Souza, Stefânia Priscilla, Silva, Ana Luísa Rodrigues, Melo, Naiara, Marucci, Rosangela Cristina, Haddi, Khalid
Publikováno v:
In Industrial Crops & Products 15 November 2024 220
Autor:
de Souza, Luciano Freitas, Tonkikh, Andrei, Tucci-Piergiovanni, Sara, Sirdey, Renaud, Stan, Oana, Quero, Nicolas, Kuznetsov, Petr
Multi-party random number generation is a key building-block in many practical protocols. While straightforward to solve when all parties are trusted to behave correctly, the problem becomes much more difficult in the presence of faults. In this cont
Externí odkaz:
http://arxiv.org/abs/2109.04911
Publikováno v:
IEEE, 2019 8th Brazilian Conference on Intelligent Systems (BRACIS)
This work proposes a computational procedure that uses a quantum walk in a complete graph to train classical artificial neural networks. The idea is to apply the quantum walk to search the weight set values. However, it is necessary to simulate a qua
Externí odkaz:
http://arxiv.org/abs/2109.00128
Publikováno v:
IEEE Transactions on Computers, 13 January 2021
This paper proposes a computational procedure that applies a quantum algorithm to train classical artificial neural networks. The goal of the procedure is to apply quantum walk as a search algorithm in a complete graph to find all synaptic weights of
Externí odkaz:
http://arxiv.org/abs/2108.12448
Publikováno v:
Brazilian Conference on Intelligent Systems: Intelligent Systems pp 249-263, 2021
Adding self-loops at each vertex of a graph improves the performance of quantum walks algorithms over loopless algorithms. Many works approach quantum walks to search for a single marked vertex. In this article, we experimentally address several prob
Externí odkaz:
http://arxiv.org/abs/2108.09399
Autor:
de Carvalho, Jonathan H. A., de Souza, Luciano S., Neto, Fernando M. de Paula, Ferreira, Tiago A. E.
Publikováno v:
Information Sciences 622 (2023) 873-888
Quantum computing promises to improve the information processing power to levels unreachable by classical computation. Quantum walks are heading the development of quantum algorithms for searching information on graphs more efficiently than their cla
Externí odkaz:
http://arxiv.org/abs/2106.06274
An accountable distributed system provides means to detect deviations of system components from their expected behavior. It is natural to complement fault detection with a reconfiguration mechanism, so that the system could heal itself, by replacing
Externí odkaz:
http://arxiv.org/abs/2105.04909