Transport properties of continuous-time quantum walks on Sierpinski fractals

Continuous-Time Quantum Walk in Glued Trees: Localized State-Mediated Almost Perfect Quantum-State Transfer

In this work, the dynamics of a quantum walker on glued trees is revisited to understand the influence of the architecture of the graph on the efficiency of the transfer between the two roots. Instead of considering regular binary trees, we focus our attention on leafier structures where each parent node could give rise to a larger number of children. Through extensive numerical simulations, we uncover a significant dependence of the transfer on the underlying graph architecture, particularly influenced by the branching rate (M) relative to the root degree (N). Our study reveals that the behavior of the walker is isomorphic to that of a particle moving on a finite-size chain. This chain exhibits defects that originate in the specific nature of both the roots and the leaves. Therefore, the energy spectrum of the chain showcases rich features, which lead to diverse regimes for the quantum-state transfer. Notably, the formation of quasi-degenerate localized states due to significant disparities between M and N triggers a localization process on the roots. Through analytical development, we demonstrate that these states play a crucial role in facilitating almost perfect quantum beats between the roots, thereby enhancing the transfer efficiency. Our findings offer valuable insights into the mechanisms governing quantum-state transfer on trees, with potential applications for the transfer of quantum information.

Perturbed graphs achieve unit transport efficiency without environmental noise

Coherent transport of an excitation through a network corresponds to continuous-time quantum walk on a graph, and the transport properties of the system may be radically different depending on the graph and on the initial state. The transport efficiency, i.e., the integrated probability of trapping at a certain vertex, is a measure of the success rate of the transfer process. Purely coherent quantum transport is known to be less efficient than the observed excitation transport, e.g., in biological systems, and there is evidence that environmental noise is indeed crucial for excitation transport. At variance with this picture, we here address purely coherent transport on highly symmetric graphs, and show analytically that it is possible to enhance the transport efficiency without environmental noise, i.e., using only a minimal perturbation of the graph. In particular, we show that adding an extra weight to one or two edges, depending on whether the initial state is localized or in a superposition of two vertex states, breaks the inherent symmetries of the graph and may be sufficient to achieve unit transport efficiency. We also briefly discuss the conditions to obtain a null transport efficiency, i.e., to avoid trapping.

Fractal photonic topological insulators

Topological insulators constitute a novel state of matter with scatter-free edge states surrounding an insulating bulk. Conventional wisdom regards the insulating bulk as essential, since the invariants describing the topological properties of the system are defined therein. Here, we study fractal topological insulators based on exact fractals comprised exclusively of edge sites. We present experimental proof that, despite the lack of bulk bands, photonic lattices of helical waveguides support topologically protected chiral edge states. We show that light transport in our topological fractal system features increased velocities compared to the corresponding honeycomb lattice. By going beyond the confines of the bulk-boundary correspondence, our findings pave the way toward an expanded perception of topological insulators and open a new chapter of topological fractals.

Quantum transport on honeycomb networks

We study the transport properties on honeycomb networks motivated by graphene structures by using the continuous-time quantum walk (CTQW) model. For various relevant topologies we consider the average return probability and its long-time average as measures for the transport efficiency. These quantities are fully determined by the eigenvalues and the eigenvectors of the connectivity matrix of the network. For all networks derived from graphene structures we notice a nontrivial interplay between good spreading and localization effects. Flat graphene with similar number of hexagons along both directions shows a decrease in transport efficiency compared to more one-dimensional structures. This loss can be overcome by increasing the number of layers, thus creating a graphite network, but it gets less efficient when rolling up the sheets so that a nanotube structure is considered. We found peculiar results for honeycomb networks constructed from square graphene, i.e. the same number of hexagons along both directions of the graphene sheet. For these kind of networks we encounter significant differences between networks with an even or odd number of hexagons along one of the axes.

Quantum self-trapping on a star graph

The attractive Bose-Hubbard model is applied for describing the two-exciton dynamics in a nonlinear quantum star graph. When the excitons are created on the core of the star, it is shown that the interplay between the complex architecture of the network and the nonlinearity favors the occurrence of a real quantum self-trapping. Quite weak in the small nonlinearity limit, this self-localization is enhanced as the nonlinearity increases. This feature originates in the restructuring of the two-exciton eigenstates whose localized nature intensifies with the nonlinearity. Nevertheless, the quantum self-trapping is never complete since it is impossible to localize the entire exciton density, even in the strong nonlinearity limit.

Two-exciton bound state quantum self-trapping in an extended star graph

The attractive Bose-Hubbard model is applied for describing the quantum self-trapping in an extended star graph. In the strong coupling limit and when two excitons are created on the core of the star, the dynamics is dominated by pair states whose properties is governed by the branch number $N$. When $N=2$, the star reduces to a linear chain so that the energy does not self-localize. Conversely, when $N\geq3$, a restructuring of the eigenstates arises and a low-energy state occurs describing a pair localized on the core of the star. Preferentially excited, this localized state gives rise to a quantum self-trapping of the energy, a process that intensifies as $N$ increases.

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 Efficiency of Continuous-Time Quantum Walks on Graphs

Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting systems. In particular, the transport properties strongly depend on the initial state and specific features of the graph under investigation. In this paper, we address the role of graph topology, and investigate the transport properties of graphs with different regularity, symmetry, and connectivity. We neglect disorder and decoherence, and assume a single trap vertex that is accountable for the loss processes. In particular, for each graph, we analytically determine the subspace of states having maximum transport efficiency. Our results provide a set of benchmarks for environment-assisted quantum transport, and suggest that connectivity is a poor indicator for transport efficiency. Indeed, we observe some specific correlations between transport efficiency and connectivity for certain graphs, but, in general, they are uncorrelated.

Continuous-time quantum walk on an extended star graph: Disorder-enhanced trapping process

Using a tight binding model, we investigate the dynamics of an exciton on a disordered extended star graph whose central site acts as an energy trap. When compared with what happens in an ordered network, our results reveal that the disorder drastically improves the excitonic absorption that becomes complete. Moreover, we show the occurrence of an optimal disorder for which the absorption time is strongly minimized, a surprising effect that originates in a disorder-induced restructuring process of the exciton eigenstates. Finally, we also show the existence of an optimal value of the absorption rate that reduces even more the absorption time. The resulting superoptimized trapping process is interpreted as a positive interplay between both the disorder and the so-called superradiance transition.

Experimental two-dimensional quantum walk on a photonic chip

Quantum walks, in virtue of the coherent superposition and quantum interference, have exponential superiority over their classical counterpart in applications of quantum searching and quantum simulation. The quantum-enhanced power is highly related to the state space of quantum walks, which can be expanded by enlarging the photon number and/or the dimensions of the evolution network, but the former is considerably challenging due to probabilistic generation of single photons and multiplicative loss. We demonstrate a two-dimensional continuous-time quantum walk by using the external geometry of photonic waveguide arrays, rather than the inner degree of freedoms of photons. Using femtosecond laser direct writing, we construct a large-scale three-dimensional structure that forms a two-dimensional lattice with up to 49 × 49 nodes on a photonic chip. We demonstrate spatial two-dimensional quantum walks using heralded single photons and single photon-level imaging. We analyze the quantum transport properties via observing the ballistic evolution pattern and the variance profile, which agree well with simulation results. We further reveal the transient nature that is the unique feature for quantum walks of beyond one dimension. An architecture that allows a quantum walk to freely evolve in all directions and at a large scale, combining with defect and disorder control, may bring up powerful and versatile quantum walk machines for classically intractable problems.

Continuous-time quantum walk on an extended star graph: Trapping and superradiance transition

A tight-binding model is introduced for describing the dynamics of an exciton on an extended star graph whose central node is occupied by a trap. On this graph, the exciton dynamics is governed by two kinds of eigenstates: many eigenstates are associated with degenerate real eigenvalues insensitive to the trap, whereas three decaying eigenstates characterized by complex energies contribute to the trapping process. It is shown that the excitonic population absorbed by the trap depends on the size of the graph, only. By contrast, both the size parameters and the absorption rate control the dynamics of the trapping. When these parameters are judiciously chosen, the efficiency of the transfer is optimized resulting in the minimization of the absorption time. Analysis of the eigenstates reveals that such a feature arises around the superradiance transition. Moreover, depending on the size of the network, two situations are highlighted where the transport efficiency is either superoptimized or suboptimized.

Exciton-phonon dynamics on complex networks: Comparison between a perturbative approach and exact calculations

A method combining perturbation theory with a simplifying ansatz is used to describe the exciton-phonon dynamics in complex networks. This method, called PT^{*}, is compared to exact calculations based on the numerical diagonalization of the exciton-phonon Hamiltonian for eight small-sized networks. It is shown that the accuracy of PT^{*} depends on the nature of the network, and three different situations were identified. For most graphs, PT^{*} yields a very accurate description of the dynamics. By contrast, for the Wheel graph and the Apollonian network, PT^{*} reproduces the dynamics only when the exciton occupies a specific initial state. Finally, for the complete graph, PT^{*} breaks down. These different behaviors originate in the interplay between the degenerate nature of the excitonic energy spectrum and the strength of the exciton-phonon interaction so that a criterion is established to determine whether or not PT^{*} is relevant. When it succeeds, our study shows the undeniable advantage of PT^{*} in that it allows us to perform very fast simulations when compared to exact calculations that are restricted to small-sized networks.

Scaling relations in the diffusive infiltration in fractals

In a recent work on fluid infiltration in a Hele-Shaw cell with the pore-block geometry of Sierpinski carpets (SCs), the area filled by the invading fluid was shown to scale as F∼t^{n}, with n<1/2, thus providing a macroscopic realization of anomalous diffusion [Filipovitch et al., Water Resour. Res. 52, 5167 (2016)WRERAQ0043-139710.1002/2016WR018667]. The results agree with simulations of a diffusion equation with constant pressure at one of the borders of those fractals, but the exponent n is very different from the anomalous exponent ν=1/D_{W} of single-particle diffusion in the same fractals (D_{W} is the random-walk dimension). Here we use a scaling approach to show that those exponents are related as n=ν(D_{F}-D_{B}), where D_{F} and D_{B} are the fractal dimensions of the bulk and the border from which diffusing particles come, respectively. This relation is supported by accurate numerical estimates in two SCs and in two generalized Menger sponges (MSs), in which we performed simulations of single-particle random walks (RWs) with a rigid impermeable border and of a diffusive infiltration model in which that border is permanently filled with diffusing particles. This study includes one MS whose external border is also fractal. The exponent relation is also consistent with the recent simulational and experimental results on fluid infiltration in SCs, and explains the approximate quadratic dependence of n on D_{F} in these fractals. We also show that the mean-square displacement of single-particle RWs has log-periodic oscillations, whose periods are similar for fractals with the same scaling factor in the generator (even with different embedding dimensions), which is consistent with the discrete scale invariance scenario. The roughness of a diffusion front defined in the infiltration problem also shows this type of oscillation, which is enhanced in fractals with narrow channels between large lacunas.

Exciton-phonon system on a star graph: A perturbative approach

Based on the operatorial formulation of the perturbation theory, the properties of an exciton coupled with optical phonons on a star graph are investigated. Within this method, the dynamics is governed by an effective Hamiltonian, which accounts for exciton-phonon entanglement. The exciton is dressed by a virtual phonon cloud whereas the phonons are clothed by virtual excitonic transitions. In spite of the coupling with the phonons, it is shown that the energy spectrum of the dressed exciton resembles that of a bare exciton. The only differences originate in a polaronic mechanism that favors an energy shift and a decay of the exciton hopping constant. By contrast, the motion of the exciton allows the phonons to propagate over the graph so that the dressed normal modes drastically differ from the localized modes associated to bare phonons. They define extended vibrations whose properties depend on the state occupied by the exciton that accompanies the phonons. It is shown that the phonon frequencies, either red shifted or blue shifted, are very sensitive to the model parameter in general, and to the size of the graph in particular.