Related papers: Quantum max-flow in the bridge graph
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
In this note we present preliminary study on the relation between the quantum entanglement of boundary states and the quantum geometry in the bulk in the framework of spin networks. We conjecture that the emergence of space with non-zero…
Modern transportation network modeling increasingly involves the integration of diverse methodologies including sensor-based forecasting, reinforcement learning, classical flow optimization, and demand modeling that have traditionally been…
Multi-qubit graph states generated by the action of controlled phase shift operators on a separable quantum state of a system, in which all the qubits are in arbitrary identical states, are examined. The geometric measure of entanglement of…
In this paper we revisit the one-dimensional tunneling problem. We consider Kemble's approximation for the transmission coefficient. We show how this approximation can be extended to above-barrier energies by performing the analytical…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
In this work we introduce the concept of a quantum walk on a hypergraph. We show that the staggered quantum walk model is a special case of a quantum walk on a hypergraph.
To better understand the fundamental quandle of a knot or link, it can be useful to look at finite quotients of the quandle. One such quotient is the $n$-quandle (or, when $n=2$, the {\em involutory} quandle). Hoste and Shanahan \cite{HS2}…
The flow of kaons, i.e., the average kaon transverse momentum as a function of rapidity, and the associated flow parameter in heavy-ion collisions at SIS/GSI energies is investigated in the relativistic transport model. It is found that the…
Entanglement is a special feature of the quantum world that reflects the existence of subtle, often non-local, correlations between local degrees of freedom. In topological theories such non-local correlations can be given a very intuitive…
We examine transmission through a quantum graph vertex to which auxiliary edges with constant potentials are attached. We find a characterization of vertex couplings for which the transmission probability from a given "input" line to a…
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave…
If the nodes of a graph are considered to be identical barrels - featuring different water levels - and the edges to be (locked) water-filled pipes in between the barrels, consider the optimization problem of how much the water level in a…
Many quantum algorithms seek to output a specific bitstring solving the problem of interest--or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit…
We develop an efficient algorithm for determining optimal adaptive quantum estimation protocols with arbitrary quantum control operations between subsequent uses of a probed channel. We introduce a tensor network representation of an…
We conducted quantum simulations of strongly correlated systems using the quantum flow (QFlow) approach, which enables sampling large sub-spaces of the Hilbert space through coupled eigenvalue problems in reduced dimensionality active…
The Kolmogorov flow provides an ideal instance of a virtual channel flow: It has no boundaries, but nevertheless it possesses well defined mean flow in each half-wavelength. We exploit this remarkable feature for the purpose of…
We provide a versatile upper bound on the number of maximally entangled qubits, or private bits, shared by two parties via a generic adaptive communication protocol over a quantum network when the use of classical communication is not…
Dietrich Braess while working on traffic modelling, noticed that traffic flow in a network can be worsened by adding extra edges to an existing network. This seemingly counterintuitive phenomenon is known as the Braess paradox. We consider…
This paper explores the potential application of quantum and hybrid quantum-classical neural networks in power flow analysis. Experiments are conducted using two datasets based on 4-bus and 33-bus test systems. A systematic performance…