Related papers: Quantum transport in randomized quantum graphs
We explore theoretically how the coupling to cavity vacuum fields affects the electron transport in quantum conductors due to the counter-rotating-wave terms of light-matter interaction. We determine the quantum conductance in terms of the…
We examine conditions for a pair of strongly cospectral vertices to have pretty good quantum state transfer in terms of minimal polynomials, and provide cases where pretty good state transfer can be ruled out. We also provide new examples…
Quantum transport properties are instrumental to understanding quantum coherent transport processes. Potential applications of quantum transport are widespread, in areas ranging from quantum information science to quantum engineering, and…
We study pretty good quantum state transfer (i.e., state transfer that becomes arbitrarily close to perfect) between vertices of graphs with an involution in the presence of an energy potential. In particular, we show that if a graph has an…
We introduce a class of partial differential equations on metric graphs associated with mixed evolution: on some edges we consider diffusion processes, on other ones transport phenomena. This yields a system of equations with possibly…
Given an undirected, weighted graph, with $n$ vertices and $m$ edges, and two special vertices $s$ and $t$, the problem is to find the shortest path between them. We give two bounded-error quantum algorithms with improved runtime in the…
Transformers are increasingly employed for graph data, demonstrating competitive performance in diverse tasks. To incorporate graph information into these models, it is essential to enhance node and edge features with positional encodings.…
In this paper, we consider a sequence of open quantum graphs, with uniformly bounded data, and we are interested in the asymptotic distribution of their scattering resonances. Supposing that the number of leads in our quantum graphs is…
We theoretically consider charge transport through two quantum dots coupled in series. The corresponding full counting statistics for noninteracting electrons is investigated in the limits of sequential and coherent tunneling by means of a…
The conventional probabilistic point of view implies that if a particle has a probability $p$ to make a transition from one site to another site, then the average transport should be $<Q>=p}$ with a variance $Var(Q)=(1-p)p$. In the quantum…
Quantum walks on graphs are fundamental to quantum computing and have led to many interesting open problems in algebraic graph theory. This review article highlights three key classes of open problems in this domain; perfect state transfer,…
Given a known or unknown phase encoded in a higher-dimensional qudit gate, it is possible to send copies of a gate that encodes the phase to multiple receivers based on a generalized quantum teleportation. We extend this quantum gate…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
Potential and mass barriers in graphene introduce electron scattering, modulating transmission probabilities. Complex multi-barrier setups allow electron transmission to be controlled with high precision, but have a huge design space of…
We consider single-particle quantum transport on parametrized complex networks. Based on general arguments regarding the spectrum of the corresponding Hamiltonian, we derive bounds for a measure of the global transport efficiency defined by…
Effective routing of entanglements over a quantum network is a fundamental problem in quantum communication. Due to the fragility of quantum states, it is difficult to route entanglements at long distances. Graph states can be utilized for…
We introduce the task of random-receiver quantum communication, in which a sender transmits a quantum message to a receiver chosen from a list of n spatially separated parties. The choice of receiver is unknown to the sender, but is known…
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…
We summarize the main results of a microscopically based kinetic theory, applicable to open quantum point contacts (QPCs) driven up to high fields. The governing role of gauge invariance -- and the many-body sum rules for the electron gas…
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…