Related papers: Quantum transport in randomized quantum graphs
We calculate the admittance of a two-dimensional quantum point contact (QPC) using a Boltzman-like kinetic equation derived for a partial Wigner distribution function in an effective potential. We show that this approach leads to the known…
We consider random-access networks with nodes representing transmitter-receiver pairs whose signals interfere with each other depending on their vicinity. Data packets arrive at the nodes over time and form queues. The nodes can be either…
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
In this paper, we show that for any positive integer $m$ and $k\in [2]$, let $G$ be a $(2m+2k+2)$-connected graph and let $a_1,\ldots , a_m, s, t$ be any distinct vertices of $G$, there are $k$ internally disjoint $s$-$t$ paths $P_1,…
Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…
Quantum networks are essential to quantum information distributed applications, and communicating over them is a key challenge. Complex networks have rich and intriguing properties, which are as yet unexplored in the quantum setting. Here,…
We study theoretically the transfer of quantum information along bends in two-dimensional discrete lattices. Our analysis shows that the fidelity of the transfer decreases considerably, as a result of interactions in the neighbourhood of…
Consider the following broadcasting process run on a connected graph $G=(V,E)$. Suppose that $k \ge 2$ agents start on vertices selected from $V$ uniformly and independently at random. One of the agents has a message that she wants to…
The transport properties of a conduction junction model characterized by two mutually coupled channels that strongly differ in their couplings to the leads are investigated. Models of this type describe molecular redox junctions (where a…
A first principle theory of charge transport in spatially inhomogeneous quantum systems composed of any finite number of particles and subject to weak electro-magnetic fields is developed. Simple analytical expressions for the linear…
Scalability is currently one of the most sought-after objectives in the field of quantum computing. Distributing a quantum circuit across a quantum network is one way to facilitate large computations using current quantum computers. In this…
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…
Perfect (quantum) state transfer has been proved to be an effective model for quantum information processing. In this paper, we give a characterization of cubelike graphs having perfect edge state transfer. By using a lifting technique, we…
A promising way to scale up superconducting quantum computers is to link different devices together using propagating photons. Correspondingly, accurately modeling the quantum information transfer in such quantum interconnects is critical…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
The amount $Q$ of particles that are transported via a path of motion is characterized by its expectation value $<Q>$ and by its variance $Var(Q)$. We analyze what happens if a particle has two optional paths available to get from one site…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…
We discuss methods of Optimal Transportation Theory and its relations to problems in quantum mechanics. This essentially means that the cost function is some Hamiltonian $H(q,p)$ on a phase space (symplectic manifold), and the marginal…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…