Related papers: Efficiency of quantum and classical transport on g…
Quantum transport across discrete structures is a relevant topic of solid state physics and quantum information science, which can be suitably studied in the context of continuous-time quantum walks. The addition of phases degrees of…
To investigate the effect of quantum coherence on electronic energy transfer, which is the subject of current interest in photosynthesis, we solve the problem of transport for the simplest model of an aggregate of monomers interacting…
We review possible mechanisms for energy transfer based on 'rare' or 'non-perturbative' effects, in physical systems that present a many-body localized phenomenology. The main focus is on classical systems, with or without quenched…
We study the transport efficiency of excitations on complex quantum networks with loops. For this we consider sequentially growing networks with different topologies of the sequential subgraphs. This can lead either to a universal complete…
The control of the quantum transport is an issue of current interest for the construction of new devices. In this work, we investigate this possibility in the realm of quantum graphs. The study allows the identification of two distinct…
An important challenge in quantum science is to fully understand the efficiency of energy flow in networks. Here we present a simple and intuitive explanation for the intriguing observation that optimally efficient networks are not purely…
Quantum algorithms for several problems in graph theory are considered. Classical algorithms for finding the lowest weight path between two points in a graph and for finding a minimal weight spanning tree involve searching over some space.…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
In this theoretical study, we analyze quantum walks on complex networks, which model network-based processes ranging from quantum computing to biology and even sociology. Specifically, we analytically relate the average long time…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
We investigate for which resource states an efficient classical simulation of measurement based quantum computation is possible. We show that the Schmidt--rank width, a measure recently introduced to assess universality of resource states,…
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…
In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph,…
We derive the explicit analytic expression for the efficiency at maximum power in a simple model of classical particle transport.
Quantum networks illustrate the use of connected nodes of quantum systems as the backbone of distributed quantum information processing. When the network nodes are entangled in graph states, such a quantum platform is indispensable to…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In…
We present evidence for a counter-intuitive behavior of semiconductor mesoscopic networks that is the analog of the Braess paradox encountered in classical networks. A numerical simulation of quantum transport in a two-branch mesoscopic…
We investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…
We have revealed general physical conditions for the {\it maximization} of the network throughput at which free flow conditions are ensured, i.e., traffic breakdown cannot occur in the whole traffic or transportation network. A physical…
The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine…