Related papers: Quantum max-flow in the bridge graph
A theory of the transient spectroscopy of quantum well (QW) structures under a large applied bias is presented. An analytical model of the initial part of the transient current is proposed. The time constant of the transient current depends…
Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into…
We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point…
It is shown that effective quantum-state and entanglement transfer can be obtained by inducing a coherent dynamics in quantum wires with homogeneous intrawire interactions. This goal is accomplished by tuning the coupling between the wire…
Quantum backflow refers to the counterintuitive fact that the probability can flow in the direction opposite to the momentum of a quantum particle. This phenomenon has been seen to be small and fragile for one-dimensional systems, in which…
Quantum networks are of high interest nowadays and a quantum internet has been long envisioned. Network-entanglement adapts the notion of entanglement to the network scenario and network-entangled states are considered to be a resource to…
Recent progress in applying complex network theory to problems in quantum information has resulted in a beneficial crossover. Complex network methods have successfully been applied to transport and entanglement models while information…
Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…
Quantum networks are often modelled using Schroedinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
We derive algebraic bounds on achievable rates for quantum state transfer and entanglement generation in general quantum systems. We apply these bounds to graph-based models of local quantum spin systems to obtain speed limits on these…
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…
We demonstrate the possibility of a turbulent flow of electrons in graphene in the hydrodynamic region, by calculating the corresponding turbulent probability density function. This is used to calculate the contribution of the turbulent…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor…
In turbulent flows, energy flux refers to the transfer of kinetic energy across different scales of motion, a concept that is a cornerstone of turbulence theory. The direction of net energy flux is prescribed by the dimensionality of the…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…
Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks: a different kind of…
We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…
We study the transition to turbulence from the perspective of the velocity gradient tensor dynamics. Our work is motivated by the observation of nonlinear structures emerging during transition, as revealed by vortex identifiers such as the…