A quantum particle evolving by Schrödinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete space, this is replaced by the discrete or graph Laplacian, which gives rise to a continuous-time quantum walk. Besides this natural definition, some quantum walk algorithms instead use the adjacency matrix to effect the walk. While this is equivalent to the Laplacian for regular graphs, it is different for non-regular graphs, and is thus an inequivalent quantum walk. We algorithmically explore this distinction by analyzing search on the complete bipartite graph with multiple marked vertices, using both the Laplacian and adjacency matrix. 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. Thus the choice of the Laplacian or adjacency matrix to effect the walk has important algorithmic consequences.

We examine the effect of network heterogeneity on the performance of quantum search algorithms. To this end, we study quantum search on a tree for the oracle Hamiltonian formulation employed by continuous-time quantum walks. We use analytical and numerical arguments to show that the exponent of the asymptotic running time ∼ N β changes uniformly from β = 0.5 to β = 1 as the searched-for site is moved from the root of the tree towards the leaves. These results imply that the time complexity of the quantum search algorithm on a balanced tree is closely correlated with certain path-based centrality measures of the searched-for site.

The current COVID-19 pandemic is affecting different countries in different ways. The assortment of reporting techniques alongside other issues, such as underreporting and budgetary constraints, makes predicting the spread and lethality of the virus a challenging task. This work attempts to gain a better understanding of how COVID-19 will affect one of the least studied countries, namely Brazil. Currently, several Brazilian states are in a state of lock-down. However, there is political pressure for this type of measures to be lifted. This work considers the impact that such a termination would have on how the virus evolves locally. This was done by extending the SEIR model with an on / off strategy. Given the simplicity of SEIR we also attempted to gain more insight by developing a neural regressor. We chose to employ features that current clinical studies have pinpointed has having a connection to the lethality of COVID-19. We discuss how this data can be processed in order to obtain a robust assessment.

Stochastic models that predict adaptive filtering algorithms performance usually employ several assumptions in order to simplify the analysis. Although these simplifications facilitate the recursive update of the statistical quantities of interest, they by themselves may hamper the modeling accuracy. This paper simultaneously avoids for the first time the employment of two ubiquitous assumptions often adopted in the analysis of the least mean squares algorithm.The first of them is the so-called independence assumption, which presumes statistical independence between adaptive coefficients and input data. The second one assumes a sufficient-order configuration, in which the lengths of the unknown plant and the adaptive filter are equal. State equations that characterize both the mean and mean square performance of the deficient-length configuration without using the independence assumption are provided. The devised analysis, encompassing both transient and steady-state regimes, is not restricted neither to white nor to Gaussian input signals and is able to provide a proper step size upper bound that guarantees stability.

No abstract