Related papers: Quantum transport in randomized quantum graphs
Quantum network is fragile to disturbances when qubits are transmitted through quantum channel. Reliability is an essential requirement for a quantum network and even the future quantum internet. A metric is needed to describe the…
Thermodynamic transport coefficients can be calculated directly from quantum field theory without requiring analytic continuation to real time. We determine all second-order thermodynamic transport coefficients for the uncharged N-component…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…
We introduce quantum association schemes. This allows to define distance regular and strongly regular quantum graphs. We bring examples thereof. In addition, we formulate the duality for translation quantum association schemes corresponding…
The transition matrix elements between the correlated $N$ and $N\!+\!1$ electron states of a quantum dot are calculated by numerical diagonalization. They are the central ingredient for the linear and non--linear transport properties which…
From the scattering of semicoherent-state wavepackets at high magnetic field, we derive analytically the transmission coefficient of electrons in graphene in the quantum Hall regime through a smooth constriction described by a quadratic…
We explore the use of machine-learning techniques to detect quantum speedup in random walks on graphs. Specifically, we investigate the performance of three different neural-network architectures (variations on fully connected and…
In this paper, we provide a rigorous quantum mechanical derivation for the coherent photon transport characteristics of a two-level atom coupled to a waveguide without linearizing the coupling coefficient between the light and the atom. We…
In the future, ab initio quantum simulations of heavy ion collisions may become possible with large-scale fault-tolerant quantum computers. We propose a quantum algorithm for studying these collisions by looking at a class of observables…
Quantum point contacts are fundamental building blocks for mesoscopic transport experiments and play an important role in recent interference- and fractional quantum Hall experiments. However, it is not clear how electron-electron…
Quantum walks are roughly analogous to classical random walks, and like classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs it is useful to find the…
Entanglement, one of the clearest manifestations of non-classical physics, holds significant promise for technological applications such as more secure communications and faster computations. In this paper we explore the use of…
In this paper we present generic properties of quantum transport in mono-layer graphene. In the scheme of the Kubo-Geenwood formula, we compute the square spreading of wave packets of a given energy with is directly related to conductivity.…
Complex systems of interacting components often can be modeled by a simple graph $\mathcal{G}$ that consists of a set of $n$ nodes and a set of $m$ edges. Such a graph can be represented by an adjacency matrix $A\in\R^{n\times n}$, whose…
We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is…
Random quantum circuits take an input quantum state and randomize it. This is a task with a growing number of identified uses in quantum information processing. We suggest a scheme to implement random circuits in a weighted graph state. The…
The quantum transport formalism based on tight-binding models is known to be powerful in dealing with a wide range of open physical systems subject to external driving forces but is, at the same time, limited by the memory requirement's…
In this work we seek to generalize the connection between traversable wormholes and quantum channels. We do this via a connection between traversable wormholes and graph geometries on which we can perform quantum random walks for signal…
Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages…