3 citations · 3 across the 1 of their papers we have counts for
3 papers
quant-ph2023
Comparison among Classical, Probabilistic and Quantum Algorithms for Hamiltonian Cycle problem
Giuseppe Corrente, Carlo Vincenzo Stanzione, Vittoria Stanzione
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly onc…
quant-ph2021★ 3 cited
Translation of Quantum Circuits into Quantum Turing Machines for Deutsch and Deutsch-Jozsa Problems
Giuseppe Corrente
We want in this article to show the usefulness of Quantum Turing Machine (QTM) in a high-level didactic context as well as in theoretical studies. We use QTM to show its equivalenc…
cs.NI2020
Performance issues in content dissemination to metropolitan mobile users
Giuseppe Corrente
In this paper we consider a set of heterogeneous terminals in a urban area that are interested in collecting the information originated from several sources. This set includes mobi…