Related papers: Quantum transport in randomized quantum graphs
Highly efficient transfer of quantum resources including quantum excitations, states, and information on quantum networks is an important task in quantum information science. Here, we propose a bipartite-graph framework for studying quantum…
We evaluate the particular performance of different quantum machine learning networks on a graph classification task. Quantum circuits with varying internal symmetry that completely, partially and not at all confer to the symmetry of the…
Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in…
The study explores perpendicular transport through macroscopically inhomogeneous three-dimensional disordered conductors using mesoscopic methods (real-space Green function technique in a two-probe measuring geometry). The nanoscale samples…
We study transfer learning for estimation in latent variable network models. In our setting, the conditional edge probability matrices given the latent variables are represented by $P$ for the source and $Q$ for the target. We wish to…
We consider the problem of a semiclassical description of quantum chaotic transport, when a tunnel barrier is present in one of the leads. Using a semiclassical approach formulated in terms of a matrix model, we obtain transport moments as…
Classification, the computational process of categorizing an input into pre-existing classes, is now a cornerstone in modern computation in the era of machine learning. Here we propose a new type of quantum classifier, based on quantum…
A blow-up of $n$ copies of a graph $G$ is the graph $\overset{n}\uplus~G$ obtained by replacing every vertex of $G$ by an independent set of size $n$, where the copies of vertices in $G$ are adjacent in the blow-up if and only if the…
We study the transport of a quantum particle through square lattices of various sizes by employing the tight-binding Hamiltonian from quantum percolation. Input and output semi-infinite chains are attached to the lattice either by diagonal…
For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…
In quantum information theory there is a construction for quantum channels, appropriately called a quantum graph, that generalizes the confusability graph construction for classical channels in classical information theory. In this paper,…
In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
We investigate quantum state transfer on a class of bipartite graphs, namely the butterfly graphs, within the framework of discrete-time quantum walks. These graphs facilitate the construction of scalable quantum networks that enable…
Distributing entanglement among multiple users is a fundamental problem in quantum networks, requiring an efficient solution. In this work, a protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in…
Quantum teleportation is not merely a fascinating corollary of quantum entanglement, it also finds utility in quantum processing and circuit compilation. In this paper, we measure and track the entanglement and fidelity of two-qubit states…
We study the transmission of a quantum particle along a straight input--output line to which a graph $\Gamma$ is attached at a point. In the point of contact we impose a singularity represented by a certain properly chosen scale-invariant…
In this work, we propose novel families of positional encodings tailored to graph neural networks obtained with quantum computers. These encodings leverage the long-range correlations inherent in quantum systems that arise from mapping the…
Quantum interference (QI) in molecular transport junctions can lead to dramatic reductions of the electron transmission at certain energies. In a recent work [Markussen et al., Nano Lett. 2010, 10, 4260] we showed how the presence of such…