We study numerically the behavior of continuous-time quantum walks over networks which are topologically equivalent to square lattices. On short time scales, when placing the initial excitation at a corner of the network, we observe a fast, directed transport through the network to the opposite corner. This transport is not ballistic in nature, but rather produced by quantum mechanical interference. In the long time limit, certain walks show an asymmetric limiting probability distribution; this feature depends on the starting site and, remarkably, on the precise size of the network. The limiting probability distributions show patterns which are correlated with the initial condition. This might have consequences for the application of continuous time quantum walk algorithms.Comment: 9 pages, 12 figures, revtex

No abstract

No abstract

We study the quantum-mechanical transport on two-dimensional graphs by means of continuous-time quantum walks and analyse the effect of different boundary conditions (BCs). For periodic BCs in both directions, i.e., for tori, the problem can be treated in a large measure analytically. Some of these results carry over to graphs which obey open boundary conditions (OBCs), such as cylinders or rectangles. Under OBCs the long time transition probabilities (LPs) also display asymmetries for certain graphs, as a function of their particular sizes. Interestingly, these effects do not show up in the marginal distributions, obtained by summing the LPs along one direction.

No abstract

The maximum likelihood strategy to the estimation of group parameters allows to derive in a general fashion optimal measurements, optimal signal states, and their relations with other information theoretical quantities. These results provide a deep insight into the general structure underlying optimal quantum estimation strategies. The entanglement between representation spaces and multiplicity spaces of the group action appear to be the unique kind of entanglement which is really useful for the optimal estimation of group parameters.

We numerically analyze the scaling behavior of experimentally accessible dynamical relaxation forms for polymer networks modeled by a finite multihierarchical structure. In the framework of generalized Gaussian structures, by making use of the eigenvalue spectrum of the connectivity matrix, we determine the averaged monomer displacement under local external forces as well as the mechanical relaxation quantities (storage and loss moduli). Hence we generalize the known analysis for both classes of fractals to the case of multihierarchical structure, for which even though we have a mixed growth algorithm, the above cited observables still give information about the two different underlying topologies. For very large lattices, reached via an algebraic procedure that avoids the numerical diagonalizations of the corresponding connectivity matrices, we depict the scaling of both component fractals in the intermediate time (frequency) domain, which manifests two different slopes.

We focus on perturbed regular hyperbranched fractals (pRHF), which are RHF whose f coordinated centers (f CC) are traps. We compute the mechanical properties (storage and loss modulus) and the average displacement in the framework of generalized Gaussian structures, by making use of the eigenvalue spectrum of the connectivity matrix. We generalize the analysis to the case of a connectivity matrix perturbed by a diagonal and pure imaginary operator. Although the above-cited observables in this new situation lose their original meaning, they still give important information about the underlying structures and they could help to analyze other phenomena where complex operators are involved. We obtain analytically the eigenvalue spectrum for pRHF. A drastic change was observed in the behavior of the studied quantities even for a very small perturbation strength. However, it is still possible to depict the scaling of the fractals in the intermediate time (frequency) domains.