Efficiency of quantum and classical transport on graphs

Extended star graph as a light-harvesting-complex prototype: Excitonic absorption speedup by peripheral energy defect tuning

We study the quantum dynamics of a photoexcitation uniformly distributed at the periphery of an extended star network (with N_{B} branches of length L_{B}). More specifically, we address here the question of the energy absorption at the core of the network and how this process can be improved (or not) by the inclusion of peripheral defects with a tunable energy amplitude Δ. Our numerical simulations reveal the existence of optimal value of energy defect Δ^{*} which depends on the network architecture. Around this value, the absorption process presents a strong speedup (i.e., reduction of the absorption time) provided that L_{B}≤L_{B}^{*} with L_{B}^{*}≈12.5/ln(N_{B}). Analytical and numerical developments are then conducted to interpret this feature. We show that the origin of this speedup takes place in the hybridization of two upper-band excitonic eigenstates. This hybridization is important when L_{B}≤L_{B}^{*} and vanishes almost totally when L_{B}>L_{B}^{*}. These structural rules we draw here could represent a potential guide for the practical design of molecular nanonetwork dedicated to the realization of efficient photoexcitation absorption.

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.

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.

Network architectures supporting learnability

Human learners acquire complex interconnected networks of relational knowledge. The capacity for such learning naturally depends on two factors: the architecture (or informational structure) of the knowledge network itself and the architecture of the computational unit-the brain-that encodes and processes the information. That is, learning is reliant on integrated network architectures at two levels: the epistemic and the computational, or the conceptual and the neural. Motivated by a wish to understand conventional human knowledge, here, we discuss emerging work assessing network constraints on the learnability of relational knowledge, and theories from statistical physics that instantiate the principles of thermodynamics and information theory to offer an explanatory model for such constraints. We then highlight similarities between those constraints on the learnability of relational networks, at one level, and the physical constraints on the development of interconnected patterns in neural systems, at another level, both leading to hierarchically modular networks. To support our discussion of these similarities, we employ an operational distinction between the modeller (e.g. the human brain), the model (e.g. a single human's knowledge) and the modelled (e.g. the information present in our experiences). We then turn to a philosophical discussion of whether and how we can extend our observations to a claim regarding explanation and mechanism for knowledge acquisition. What relation between hierarchical networks, at the conceptual and neural levels, best facilitate learning? Are the architectures of optimally learnable networks a topological reflection of the architectures of comparably developed neural networks? Finally, we contribute to a unified approach to hierarchies and levels in biological networks by proposing several epistemological norms for analysing the computational brain and social epistemes, and for developing pedagogical principles conducive to curious thought. This article is part of the theme issue 'Unifying the essential concepts of biological networks: biological insights and philosophical foundations'.

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.

Fast and slow dynamics for classical and quantum walks on mean-field small world networks

This work investigates the dynamical properties of classical and quantum random walks on mean-field small-world (MFSW) networks in the continuous time version. The adopted formalism profits from the large number of exact mathematical properties of their adjacency and Laplacian matrices. Exact expressions for both transition probabilities in terms of Bessel functions are derived. Results are compared to numerical results obtained by working directly the Hamiltonian of the model. For the classical evolution, any infinitesimal amount of disorder causes an exponential decay to the asymptotic equilibrium state, in contrast to the polynomial behavior for the homogeneous case. The typical quantum oscillatory evolution has been characterized by local maxima. It indicates polynomial decay to equilibrium for any degree of disorder. The main finding of the work is the identification of a faster classical spreading as compared to the quantum counterpart. It stays in opposition to the well known diffusive and ballistic for, respectively, the classical and quantum spreading in the linear chain.

Random walks on jammed networks: Spectral properties

Using random walk analyses we explore diffusive transport on networks obtained from contacts between isotropically compressed, monodisperse, frictionless sphere packings generated over a range of pressures in the vicinity of the jamming transition p→0. For conductive particles in an insulating medium, conduction is determined by the particle contact network with nodes representing particle centers and edges contacts between particles. The transition rate is not homogeneous, but is distributed inhomogeneously due to the randomness of packing and concomitant disorder of the contact network, e.g., the distribution of the coordination number. A narrow escape time scale is used to write a Markov process for random walks on the particle contact network. This stochastic process is analyzed in terms of spectral density of the random, sparse, Euclidean and real, symmetric, positive, semidefinite transition rate matrix. Results show network structures derived from jammed particles have properties similar to ordered, euclidean lattices but also some unique properties that distinguish them from other structures that are in some sense more homogeneous. In particular, the distribution of eigenvalues of the transition rate matrix follow a power law with spectral dimension 3. However, quantitative details of the statistics of the eigenvectors show subtle differences with homogeneous lattices and allow us to distinguish between topological and geometric sources of disorder in the network.

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.

Fractional dynamics on networks: emergence of anomalous diffusion and Lévy flights

We introduce a formalism of fractional diffusion on networks based on a fractional Laplacian matrix that can be constructed directly from the eigenvalues and eigenvectors of the Laplacian matrix. This fractional approach allows random walks with long-range dynamics providing a general framework for anomalous diffusion and navigation, and inducing dynamically the small-world property on any network. We obtained exact results for the stationary probability distribution, the average fractional return probability, and a global time, showing that the efficiency to navigate the network is greater if we use a fractional random walk in comparison to a normal random walk. For the case of a ring, we obtain exact analytical results showing that the fractional transition and return probabilities follow a long-range power-law decay, leading to the emergence of Lévy flights on networks. Our general fractional diffusion formalism applies to regular, random, and complex networks and can be implemented from the spectral properties of the Laplacian matrix, providing an important tool to analyze anomalous diffusion on networks.

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.

Disorder-enhanced exciton delocalization in an extended dendrimer

The exciton dynamics in a disordered extended dendrimer is investigated numerically. Because a homogeneous dendrimer exhibits few highly degenerate energy levels, a dynamical localization arises when the exciton is initially located on the periphery. However, it is shown that the disorder lifts the degeneracy and favors a delocalization-relocalization transition. Weak disorder enhances the delocalized nature of the exciton and improves any quantum communication, whereas strong disorder prevents the exciton from propagating in accordance with the well-known Anderson theory.

Coherent exciton transport and trapping on long-range interacting cycles

We consider coherent exciton transport modeled by continuous-time quantum walks on long-range interacting cycles (LRICs), which are constructed by connecting all the two nodes of distance m in the cycle graph. LRIC has a symmetric structure and can be regarded as the extensions of the cycle graph (nearest-neighboring lattice). For small values of m , the classical and quantum return probabilities show power law behavior p(t) approximately t;{-0.5} and pi(t) approximately t;{-1} , respectively. However, for large values of m , the classical and quantum efficiency scales as p(t) approximately t;{-1} and pi(t) approximately t;{-2} . We give a theoretical explanation of this transition using the method of stationary phase approximation. In the long time limit, depending on the network size N and parameter m , the limiting probability distributions of quantum transport show various patterns. When the network size N is an even number, we find an asymmetric transition probability of quantum transport between the initial node and its opposite node. This asymmetry depends on the precise values of N and m . Finally, we study the transport processes in the presence of traps and find that the survival probability decays faster on networks of large m .

Continuous-time quantum walks on one-dimensional regular networks

In this paper, we consider continuous-time quantum walks (CTQWs) on a one-dimensional ring lattice of N nodes in which every node is connected to its 2m nearest neighbors ( m on either side). In the framework of the Bloch function ansatz, we calculate the space-time transition probabilities between two nodes of the lattice. We find that the transport of CTQWs between two different nodes is faster than that of the classical continuous-time random walks (CTRWs). The transport speed, which is defined by the ratio of the shortest path length and propagating time, increases with the connectivity parameter m for both CTQWs and CTRWs. For fixed parameter m , the transport of CTRWs gets slower with the increase of the shortest distance while the transport (speed) of CTQWs turns out to be a constant value. In the long-time limit, depending on the network size N and connectivity parameter m , the limiting probability distributions of CTQWs show various patterns. When the network size N is an even number, the probability of being at the original node differs from that of being at the opposite node, which also depends on the precise value of parameter m .

Universal behavior of quantum walks with long-range steps

Continuous-time quantum walks with long-range steps R(-gamma) (R being the distance between sites) on a discrete line behave in similar ways for all gamma > or =2 . This is in contrast to classical random walks, which for gamma>3 belong to a different universality class than for gamma < or =3 . We show that the average probabilities to be at the initial site after time t as well as the mean square displacements are of the same functional form for quantum walks with gamma =2, 4, and with nearest neighbor steps. We interpolate this result to arbitrary gamma > or =2 .

Diffusion on a heptagonal lattice

We study the diffusion phenomena on the negatively curved surface made up of congruent heptagons. Unlike the usual two-dimensional plane, this structure makes the boundary increase exponentially with the distance from the center, and hence the displacement of a classical random walker increases linearly in time. The diffusion of a quantum particle put on the heptagonal lattice is also studied in the framework of the tight-binding model Hamiltonian, and we again find the linear diffusion like the classical random walk. A comparison with diffusion on complex networks is also made.

Quantum transport on small-world networks: a continuous-time quantum walk approach

We consider the quantum mechanical transport of (coherent) excitons on small-world networks (SWNs). The SWNs are built from a one-dimensional ring of N nodes by randomly introducing B additional bonds between them. The exciton dynamics is modeled by continuous-time quantum walks, and we evaluate numerically the ensemble-averaged transition probability to reach any node of the network from the initially excited one. For sufficiently large B we find that the quantum mechanical transport through the SWNs is, first, very fast, given that the limiting value of the transition probability is reached very quickly, and second, that the transport does not lead to equipartition, given that on average the exciton is most likely to be found at the initial node.

Survival probabilities in coherent exciton transfer with trapping

In the quest for signatures of coherent transport we consider exciton trapping in the continuous-time quantum walk framework. The survival probability displays different decay domains, related to distinct regions of the spectrum of the Hamiltonian. For linear systems and at intermediate times the decay obeys a power law, in contrast with the corresponding exponential decay found in incoherent continuous-time random walk situations. To differentiate between the coherent and incoherent mechanisms, we present an experimental protocol based on a frozen Rydberg gas structured by optical dipole traps.