Geodesic covering problems form a widely researched topic in graph theory. One such
problem is geodetic problem introduced by Harary et al.[Math. Comput. Modelling, 1993, 17 …

The glued-trees problem is the only example known to date for which quantum annealing
provides an exponential speedup, albeit by partly using excited-state evolution, in an …

In this paper, we analytically investigated the transmission properties of continuous time
quantum walks through two types of glued-tree graphs. By map** the glued-tree graphs …

This paper overviews the development of the quantum information technology and the
quantum computing over the years, highlighting its potential promising applications in …

En informatique théorique, le concept de marche aléatoire classique sur un graphe, c'est-à-
dire un réseau complexe de nœuds connectés les uns autres par des liens spécifiques, fut …

This dissertation studies analog quantum optimization, in particular, quantum annealing
(QA). QA is a limited model of quantum computation that might offer speedups for …