Related papers: Quantum max-flow in the bridge graph
We develop a new theoretical framework for describing steady-state quantum transport phenomena, based on the general maximum-entropy principle of non-equilibrium statistical mechanics. The general form of the many-body density matrix is…
Quantum networks with bipartite resources and shared randomness present the simplest infrastructure for implementing a future quantum internet. Here, we shall investigate which kinds of entanglement can or cannot be generated from this kind…
The \emph{max-flow min-cut theorem} has been recently used in the theory of random tensor networks in quantum information theory, where it is helpful for computing the behavior of important physical quantities, such as the entanglement…
We address continuous-time quantum walks on graphs, and discuss whether and how quantum-limited measurements on the walker may extract information on the tunnelling amplitude between the nodes of the graphs. For a few remarkable families of…
We discuss maximum entangled states of quantum systems in terms of quantum fluctuations of all essential measurements responsible for manifestation of entanglement. Namely, we consider maximum entanglement as a property of states, for which…
This paper discusses the relationships between the Fiedler vector, the Cheeger constant, and threshold behaviors in networks of quantum resource nodes represented as Quantum Directed Acyclic Graphs (QDAGs). We explore how these mathematical…
Large-scale quantum networks have been employed to overcome practical constraints of transmissions and storage for single entangled systems. Our goal in this article is to explore the strong entanglement distribution of quantum networks. We…
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…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
We propose a model to implement and simulate different traffic-flow conditions in terms of quantum graphs hosting an ($N$+1)-level dot at each site, which allows us to keep track of the type and of the destination of each vehicle. By…
Quantum theory has shown its superiority in enhancing machine learning. However, facilitating quantum theory to enhance graph learning is in its infancy. This survey investigates the current advances in quantum graph learning (QGL) from…
We investigate entanglement dynamics in multipartite systems, establishing a quantitative concept of entanglement flow: both flow through individual particles, and flow along general networks of interacting particles. In the former case,…
We introduce an algorithmic framework based on tensor networks for computing fluid flows around immersed objects in curvilinear coordinates. We show that the tensor network simulations can be carried out solely using highly compressed…
Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
Understanding turbulence is the key to our comprehension of many natural and technological flow processes. At the heart of this phenomenon lies its intricate multi-scale nature, describing the coupling between different-sized eddies in…
This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…
The max-flow and max-coflow problem on directed graphs is studied in the common generalization to regular spaces, i.e., to kernels or row spaces of totally unimodular matrices. Exhibiting a submodular structure of the family of paths within…
A wireless quantum network is generated between multi-hop, where each hop consists of two entangled nodes. These nodes share a finite number of entangled two qubit systems randomly. Different types of wireless quantum bridges are generated…