Geometrical aspects of quantum walks on random two-dimensional structures

Approaching Disordered Quantum Dot Systems by Complex Networks with Spatial and Physical-Based Constraints

This paper focuses on modeling a disordered system of quantum dots (QDs) by using complex networks with spatial and physical-based constraints. The first constraint is that, although QDs (=nodes) are randomly distributed in a metric space, they have to fulfill the condition that there is a minimum inter-dot distance that cannot be violated (to minimize electron localization). The second constraint arises from our process of weighted link formation, which is consistent with the laws of quantum physics and statistics: it not only takes into account the overlap integrals but also Boltzmann factors to include the fact that an electron can hop from one QD to another with a different energy level. Boltzmann factors and coherence naturally arise from the Lindblad master equation. The weighted adjacency matrix leads to a Laplacian matrix and a time evolution operator that allows the computation of the electron probability distribution and quantum transport efficiency. The results suggest that there is an optimal inter-dot distance that helps reduce electron localization in QD clusters and make the wave function better extended. As a potential application, we provide recommendations for improving QD intermediate-band solar cells.

Modeling Quantum Dot Systems as Random Geometric Graphs with Probability Amplitude-Based Weighted Links

This paper focuses on modeling a disorder ensemble of quantum dots (QDs) as a special kind of Random Geometric Graphs (RGG) with weighted links. We compute any link weight as the overlap integral (or electron probability amplitude) between the QDs (=nodes) involved. This naturally leads to a weighted adjacency matrix, a Laplacian matrix, and a time evolution operator that have meaning in Quantum Mechanics. The model prohibits the existence of long-range links (shortcuts) between distant nodes because the electron cannot tunnel between two QDs that are too far away in the array. The spatial network generated by the proposed model captures inner properties of the QD system, which cannot be deduced from the simple interactions of their isolated components. It predicts the system quantum state, its time evolution, and the emergence of quantum transport when the network becomes connected.

Transport properties of continuous-time quantum walks on Sierpinski fractals

We model quantum transport, described by continuous-time quantum walks (CTQWs), on deterministic Sierpinski fractals, differentiating between Sierpinski gaskets and Sierpinski carpets, along with their dual structures. The transport efficiencies are defined in terms of the exact and the average return probabilities, as well as by the mean survival probability when absorbing traps are present. In the case of gaskets, localization can be identified already for small networks (generations). For carpets, our numerical results indicate a trend towards localization, but only for relatively large structures. The comparison of gaskets and carpets further implies that, distinct from the corresponding classical continuous-time random walk, the spectral dimension does not fully determine the evolution of the CTQW.