Related papers: Efficiency of quantum and classical transport on g…
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical…
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…
We study the classical limit of quantum mechanics on graphs by introducing a Wigner function for graphs. The classical dynamics is compared to the quantum dynamics obtained from the propagator. In particular we consider extended open graphs…
We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition…
We characterize quantumness of the so-called quantum walks (whose dynamics is governed by quantum mechanics) by introducing two computable measures which are stronger than the variance of the walker's position probability distribution. The…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
Manipulating quantum systems undergoing non-Gaussian dynamics in a fast and accurate manner is becoming fundamental to many quantum applications. Here, we focus on classical and quantum protocols transferring a state across a double-well…
We show by general arguments that networks whose density of states contains few highly degenerate eigenvalues result in inefficient performances of continuous-time quantum walks (CTQW) over these networks, while systems whose eigenvalues…
We consider single-particle quantum transport on parametrized complex networks. Based on general arguments regarding the spectrum of the corresponding Hamiltonian, we derive bounds for a measure of the global transport efficiency defined by…
We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains, that is, classical Markov chains with added memory. We show that these can simulate quantum walks, allowing us…
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…
Physics based numerical simulation has been carried out to probe the sub-gap density of states (DOS) and underlying electron transport properties of amorphous oxide based thin film transistors (TFTs). The DOS model of TFTs consists of…
We study transport in topologically disordered networks that are subjected to an environment that induces classical diffusion. The dynamics is phenomenologically described within the framework of the recently introduced quantum stochastic…
The article deals with one- and two-particle quantum walks on a graph with Braess-like topology and analyzes the issue of network congestion in the quantum world. Our approach to the study of congestion in quantum networks is based on the…
We study quantum transport on finite discrete structures and we model the process by means of continuous-time quantum walks. A direct and effective comparison between quantum and classical walks can be attained based on the average…
We address routing of classical and quantum information over quantum network, and show how to exploit chirality to achieve nearly optimal and robust transport. In particular, we prove how continuous time chiral quantum walks over a minimal…
Quantum walks are accepted as a generic model for quantum transport. The character of the transport crucially depends on the properties of the walk like its geometry and the driving coin. We demonstrate that increasing transport distance…
We examine the stochastic energetics of directed quantum transport due to rectification of non-equilibrium thermal fluctuations. We calculate the quantum efficiency of a ratchet device both in presence and absence of an external load to…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
We quantify the effect of weighted loops at the source and target nodes of a graph on the strength of quantum state transfer between these vertices. We give lower bounds on loop weights that guarantee strong transfer fidelity that works for…