Related papers: Efficiency of quantum and classical transport on g…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
We have proposed an efficient algorithm to calculate physical quantities in the translational invariant three-dimensional tensor networks, which is particularly relevant to the study of the three-dimensional classical statistical models and…
Continuous time quantum walks (CTQW) do not necessarily perform better than their classical counterparts, the continuous time random walks (CTRW). For one special graph, where a recent analysis showed that in a particular direction of…
We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data…
We consider quantum state transfer on finite graphs which are attached to infinite paths. The finite graph represents an operational quantum system for performing useful quantum information tasks. In contrast, the infinite paths represent…
In recent years, machine learning methods have been widely used to study physical systems that are challenging to solve with governing equations. Physicists and engineers are framing the data-driven paradigm as an alternative approach to…
We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the use of the Markov chains defined on the graph…
In quantum systems, one usually seeks to minimize dephasing noise and disorder. The efficiency of transport in a quantum system is usually degraded by the presence of noise and disorder. However, it has been shown that the combination of…
This paper explores the use of quantum computing, specifically the use of HHL and VQLS algorithms, to solve optimal power flow problem in electrical grids. We investigate the effectiveness of these quantum algorithms in comparison to…
A general method of quantum-to-classical reduction of quantum dynamics is described. The key aspect of our method is the similarity transformation of the Liouvillian, which provides a new perspective. In conventional studies of quantum…
Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks. In this work, we propose a protocol that utilizes a Bell sampling subroutine…
A simple statistical model for the effects of dephasing on electron transport in one-dimensional quantum systems is introduced, which allows to adjust the degree of phase and momentum randomization independently. Hence, the model is able to…
Transportation electrification introduces strong coupling between the power and transportation systems. In this paper, we generalize the classical notion of Braess' paradox to coupled power and transportation systems, and examine how the…
Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…
The Swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can be considered a classical operation because it does not entangle product states. Genuinely quantum operations could outperform Swap for the task of…
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…
Designing an operational architecture for the Quantum Internet is challenging in light of both fundamental limits imposed by physics laws and technological constraints. Here, we propose a method to abstract away most of the quantum-specific…
In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it…
Quantum graphs model processes in complex systems represented as spatial networks in various fields of natural science and technology. An example is the oscillations of elastic string networks, the nodes of which, besides the continuity…
The ability for quantum and conventional networks to operate in the same optical fibers would aid the deployment of quantum network technology on a large scale. Quantum teleportation is a fundamental operation in quantum networking, but has…