Related papers: Quantum transport in randomized quantum graphs
We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge, referred to as a bridge. The parameter $\epsilon>0$ assigned at the bridge represents the strength of connectivity: if…
The metal-semiconductor contact is a major factor limiting the shrinking of transistor dimension to further increase device performance. In-plane edge contacts have the potential to achieve lower contact resistance due to stronger orbital…
We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph…
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…
The formation of metallic nanofilaments bridging two electrodes across an insulator is a mechanism for resistive switching. Examples of such phenomena include atomic synapses, which constitute a distinct class of memristive devices whose…
Quantum teleportation is a fundamental concept in quantum physics which now finds important applications at the heart of quantum technology including quantum relays, quantum repeaters and linear optics quantum computing (LOQC). Photonic…
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 study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external…
Ramsey theory enables re-shaping of the basic ideas of quantum mechanics. Quantum observables represented by linear Hermitian operators are seen as the vertices of a graph. Relations of commutation define the coloring of edges linking the…
A transport methodology to study the electron transport between quantum dots arrays based in Transfer Hamiltonian approach is presented. The interactions between the quantum dots and between the quantum dots and the electrodes are…
Quantum walks, an important tool in quantum computing, have been very successfully investigated using techniques in algebraic graph theory. We are motivated by the study of state transfer in continuous-time quantum walks, which is…
We present a set of modified quantum rate equations, with the help of the nonequilibrium Green's function and slave-particle techniques along with the correct quantization, for description of the quantum transport through an interacting…
Every route of a transport network approaching equilibrium can be represented by a vector of Euclidean space which length quantifies its segregation from the rest of the graph. We have empirically observed that the distribution of lengths…
We present a numerically exact study of charge transport and its fluctuations through a molecular junction driven out of equilibrium by a bias voltage, using the Inchworm quantum Monte Carlo (iQMC) method. After showing how the technique…
We develop a theory of electron transport through quantum dots that are weakly coupled to ferromagnetic leads. The theory covers both the linear and nonlinear transport regime, takes non-collinear magnetization of the leads into account,…
We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
A quantum finite multi-barrier system, with a periodic potential, is considered and exact expressions for its plane wave amplitudes are obtained using the Transfer Matrix method [10]. This quantum model is then associated with a stochastic…
Let $G$ be an $n$-vertex graph with $m$ edges. When asked a subset $S$ of vertices, a cut query on $G$ returns the number of edges of $G$ that have exactly one endpoint in $S$. We show that there is a bounded-error quantum algorithm that…