We consider the quantum mechanical transport of (coherent) excitons on small-world networks (SWN). The SWN are build 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 SWN is, first, very fast, given that the limiting value of the transition probability is reached very quickly; 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.
The Geometry of Transport in Quantum Walks and Parrondo's Paradox
Instituto de Física, Universidad Nacional Autónoma de México（墨西哥国立自治大学物理研究所）；Escuela de Ciencias Físicas y Matemáticas, Universidad de San Carlos de Guatemala（危地马拉圣卡洛斯大学物理与数学院）；Vienna Center for Quantum Science and Technology, Atominstitut, TU Wien（维也纳量子科学与技术中心，原子物理研究所，维也纳工业大学）
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 between source and target or adding redundant branches to the actual graph may surprisingly result in a significant enhancement of transport efficiency. We explain analytically the observed non-classical effects using the concept of trapped states for several intriguing geometries including the ladder graph, the Cayley tree and its modifications.
We study source-to-sink excitation transport on carbon nanotubes using the concept of quantum walks. In particular, we focus on transport properties of Grover coined quantum walks on ideal and percolation perturbed nanotubes with zig-zag and armchair chiralities. Using analytic and numerical methods we identify how geometric properties of nanotubes and different types of a sink altogether control the structure of trapped states and, as a result, the overall source-to-sink transport efficiency. It is shown that chirality of nanotubes splits behavior of the transport efficiency into a few typica…
Transport regimes of biphoton-state quantum walks in ordered and disordered arrays of nonlinear waveguides
Centro de Investigación en Ciencia e Ingeniería de Materiales, Universidad de Costa Rica（哥斯达黎加大学材料科学与工程研究中心）；Escuela de Física, Universidad de Costa Rica（哥斯达黎加大学物理学院）
We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with interconnecting links and the prescribed rule in which directions the walker will move at each vertex. While the former allows for the analysis of inhomogeneous quantum walks on graphs with vertices of varying degree, the latter offers us to choose, investigate, and compare quantum walks with different shift operators. The synthesis of both key ingredients const…
In this paper, we consider Szegedy's walk, a type of discrete time quantum walk, and corresponding continuous time quantum walk related to the birth and death chain. We show that the scaling limit of time averaged distribution for the continuous time quantum walk induces that of Szegedy's walk if there exists the spectral gap on so-called the corresponding Jacobi matrix .
We present numerical studies of quantum walks on \C60 and related graphene structures, to investigate their transport properties. Also known as a \emph{honeycomb lattice}, the lattice formed by carbon atoms in the graphene phase can be rolled up to form nanotubes of various dimensions. Graphene nanotubes have many important applications, some of which rely on their unusual electrical conductivity and related properties. Quantum walks on graphs provide an abstract setting in which to study such transport properties independent of the other chemical and physical properties of a physical substanc…
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 on the 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 si…
Quantum walks exhibit properties without classical analogues. One of those is the phenomenon of asymptotic trapping -- there can be non-zero probability of the quantum walker being localised in a finite part of the underlying graph indefinitely even though locally all directions of movement are assigned non-zero amplitudes at each step. We study quantum walks with the flip-flop shift operator and the Grover coin, where this effect has been identified previously. For the version of the walk further modified by a random dynamical disruption of the graph (percolated quantum walks) we provide a re…
We obtained analytical expressions considering a directed continuous-time quantum walk on a directed infinite line using Bessel functions, expanding previous results in the literature, for a general initial condition. We derive the equation for the probability distribution, and show how to recover normal and enhanced decay rates for the survival probability by adjusting the phase factor of the direction of the graph. Our result shows that the mean and standard deviation for a specific non-local initial condition does not depend on the direction.
We present a theoretical and numerical study of the competition between two opposite interference effects, namely interference-induced ballistic transport on one hand, and strong (Anderson) localization on the other. While the former effect allows for resistance free transport, the latter brings the transport to a complete halt. As a model system, we consider the quantum kicked rotor, where strong localization is observed in the discrete momentum coordinate. In this model, we introduce the ballistic transport in the form of a Hadamard quantum walk in that momentum coordinate. The two transport…
In this paper we show how using complex valued edge weights in a graph can completely suppress the flow of probability amplitude in a continuous time quantum walk to specific vertices of the graph when the edge weights, graph topology and initial state of the quantum walk satisfy certain conditions. The conditions presented in this paper are derived from the so-called chiral quantum walk, a variant of the continuous time quantum walk which incorporates directional bias with respect to site transfer probabilities between vertices of a graph by using complex edge weights. We examine the necessit…
In this work, we show that ma-QAOA is equivalent to a restriction of continuous-time quantum walks on dynamic graphs. We then show it is universal for computation by finding the appropriate $B$ and $C$ operators and angles that implement the universal gate set consisting of the Hadamard, $π/8$ and Controlled-Not gates in the ma-QAOA framework. This result begins to bridge the gap between the continuous-time quantum walk model and gate model of quantum computation.
We consider a discrete-time quantum walk, called the Grover walk, on a distance regular graph $X$. Given that $X$ has diameter $d$ and invertible adjacency matrix, we show that the square of the transition matrix of the Grover walk on $X$ is a product of at most $d$ commuting transition matrices of continuous-time quantum walks, each on some distance digraph of the line digraph of $X$. We also obtain a similar factorization for any graph $X$ in a Bose Mesner algebra.
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding time of the search algorithm. In addition, we gave some examples of graphs that we can calculate the success probability and the finding time.
We address continuous-time quantum walks on graphs, and discuss whether and how quantum-limited measurements on the walker may extract information on the tunnelling amplitude between the nodes of the graphs. For a few remarkable families of graphs, we evaluate the ultimate quantum bound to precision, i.e. we compute the quantum Fisher information (QFI), and assess the performances of incomplete measurements, i.e. measurements performed on a subset of the graph's nodes. We also optimize the QFI over the initial preparation of the walker and find the optimal measurement achieving the ultimate pr…
We characterize a close connection between the continuous-time quantum-walk model and a discrete-time quantum-walk version, based on the staggered model with Hamiltonians in a class of Cayley graphs, which can be considered as a discretization of continuous-time quantum walks. This connection provides examples of perfect state transfer and instantaneous uniform mixing in the staggered model. On the other hand, we provide some more examples of perfect state transfer and instantaneous uniform mixing in the staggered model that cannot be reproduced by the continuous-time model.
