Related papers: Quantum max-flow in the bridge graph
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Consider a sequence of finite regular graphs (GN) converging, in the sense of Benjamini-Schramm, to the infinite regular tree. We study the induced quantum graphs with equilateral edge lengths, Kirchhoff conditions (possibly with a non-zero…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
A water bridge refers to an experimental "flexible cable" made up of pure deionized water which can hang across two supports maintained with a sufficiently large voltage difference. The resulting electric fields within the deionized water…
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which…
We present a framework for quantifying information flow within general quantum processes. For this purpose, we introduce the signaling power of quantum channels and discuss its relevant operational properties. This function supports…
We discuss the connection between a class of distributed quantum games, with remotely located players, to the counter intuitive Braess' paradox of traffic flow that is an important design consideration in generic networks where the addition…
The problem of quantum turbulence in a channel with an inhomogeneous counterflow of superfluid turbulent helium is studied. \ The counterflow velocity $V_{ns}^{x}(y)$ along the channel is supposed to have a parabolic profile in the…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
We analyze the quantum entanglement properties of bosonic particles hopping over graph structures.Mode-entanglement of a graph vertex with respect the rest of the graph is generated, starting from a product state, by turning on for a finite…
Following our work [Phys. Rev. Lett. 125, 020401 (2020)], we discuss a semiclassical description of one-dimensional quantum tunneling through multibarrier potentials in terms of complex time. We start by defining a complex-extended…
Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and…
Motivated by remarkable properties of superfluid edge dislocations in solid Helium-4, we discuss a broad class of quantum systems -- boundaries in phase separated lattice states, magnetic domain walls, and ensembles of Luttinger liquids --…
We study the statistical properties of the scattering matrix associated with generic quantum graphs. The scattering matrix is the quantum analogue of the classical evolution operator on the graph. For the energy-averaged spectral form…
Recent advancements of intermediate-scale quantum processors have triggered tremendous interest in the exploration of practical quantum advantage. The simulation of fluid dynamics, a highly challenging problem in classical physics but vital…
We show a fast algorithm for determining the set of edges in a planar undirected unweighted graph, whose deletion reduces the maximum flow between two fixed vertices. This is a special case of the max flow vitality problem, that has been…
Discrete-time quantum walks provide a natural framework for quantum transport on complex networks. On regular structures, coin-walker entanglement has been widely used to characterize quantum transport and to support quantum algorithmic…
We review recent progress in understanding the physical meaning of quantum graph models through analysis of their vertex coupling approximations.
Temporal interaction networks capture the history of activities between entities along a timeline. At each interaction, some quantity of data (money, information, kbytes, etc.) flows from one vertex of the network to another. Flow-based…
The past years have seen a surge in quantum algorithms for computational fluid dynamics (CFD). These algorithms have in common that whilst promising a speed-up in the performance of the algorithm, no specific method of measurement has been…