Related papers: Efficiency of quantum and classical transport on g…
We present a quantum algorithm for sampling random spanning trees from a weighted graph in $\widetilde{O}(\sqrt{mn})$ time, where $n$ and $m$ denote the number of vertices and edges, respectively. Our algorithm has sublinear runtime for…
We develop a mathematically rigorous theory for the quantum transfer processes in degenerate donor-acceptor dimers in contact with a thermal environment. We calculate explicitly the transfer rates and the acceptor population efficiency. The…
Unidirectional light transport in one-dimensional nanomaterials at the quantum level is a crucial goal to achieve for upcoming computational devices. We here employ a full-quantum mechanical approach based on master equation to describe…
Quantum walks on translation invariant regular graphs spread quadratically faster than their classical counterparts. The same coherence that gives them this quantum speedup inhibits, or even stops their spread in the presence of disorder.…
We study quantum enhancement of transport in open systems in the presence of disorder and dephasing. Quantum coherence effects may significantly enhance transport in open systems even in the deep classical regime (where the decoherence rate…
We report the results of an in-depth study of the role of graph topology on quantum transport efficiency in random removal and Watts-Strogatz networks. By using four different environmental models -- noiseless, driving by classical random…
We study the quantum-mechanical transport on two-dimensional graphs by means of continuous-time quantum walks and analyse the effect of different boundary conditions (BCs). For periodic BCs in both directions, i.e., for tori, the problem…
Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…
The correspondence principle states that classical mechanics emerges from quantum mechanics in the appropriate limits. However, beyond this heuristic rule, an information-theoretic perspective reveals that classical mechanics is a…
This paper discusses continuous-time quantum walks and asymptotic state transfer in graphs with an involution. By providing quantitative bounds on the eigenvectors of the Hamiltonian, it provides an approach to achieving high-fidelity state…
A simple method to enhance the quality of communication is to send a carrier with its copies. Classical information theory says that information behaves quantitatively under copying. In other words, if a carrier is more informatic than…
Recently, De Martino et al have presented a general framework for the study of transportation phenomena on complex networks. One of their most significant achievements was a deeper understanding of the phase transition from the uncongested…
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
This paper deals with the large-scale behaviour of dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with general lower semicontinuous and convex energy densities. Our main contribution is a homogenisation result that describes…
We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim…
We consider the problem of energy transport in a chain of coupled quantum systems with the goal of shedding light on how nonclassical resources can affect transport. We study the cases for which either coherent or incoherent energy hopping…
In quantum information theory there is a construction for quantum channels, appropriately called a quantum graph, that generalizes the confusability graph construction for classical channels in classical information theory. In this paper,…
We analyze the process of informational exchange through complex networks by measuring network efficiencies. Aiming to study non-clustered systems, we propose a modification of this measure on the local level. We apply this method to an…
Physical systems that dissipate, mix and develop turbulence also irreversibly transport statistical density. In statistical physics, laws for these processes have a mathematical form and tractability that depends on whether the description…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…