Related papers: Graphical Evolution of Spin Network States
We develop online graph learning algorithms from streaming network data. Our goal is to track the (possibly) time-varying network topology, and effect memory and computational savings by processing the data on-the-fly as they are acquired.…
In many complex systems, states and interaction structure coevolve towards a dynamic equilibrium. For the adaptive contact process, we obtain approximate expressions for the degree distributions that characterize the interaction network in…
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 study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of…
The quantum description of time evolution in non-linear gravitational systems such as cosmological space-times is not well understood. We show, in the simplified setting of mini-superspace, that time evolution of this system can be obtained…
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, cover- ing areas as diverse as refactorings, network topologies or reconfigurable software. Being a formal method,…
This study investigates the quantum dynamics of a spin-1/2 particle confined to a curved path from the dynamics of a two-dimensional curved thin-layer system incorporating spin connection contributions. We demonstrate that the geodesic…
Using the signed laplacian matrix, and weighted and hybrid graphs, we present additional ways to interpret graphs as grid states. Hybrid graphs offer the most general interpretation. Existing graphical methods that characterize entanglement…
Networks are topological and geometric structures used to describe systems as different as the Internet, the brain or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying…
The edges of graphene and graphene like systems can host localized states with evanescent wave function with properties radically different from those of the Dirac electrons in bulk. This happens in a variety of situations, that are…
We present the construction of a physical Hamiltonian operator in the deparametrized model of loop quantum gravity coupled to a free scalar field. This construction is based on the use of the recently introduced curvature operator, and on…
We expand a set of notions recently introduced providing the general setting for a universal representation of the quantum structure on which quantum information stands. The dynamical evolution process associated with generic quantum…
In this article, we consider a spin-spin interaction network governed by $XX + YY$ Hamiltonian. The vertices and edges of the network represent the spin objects and their interactions, respectively. We take a privilege to switch on or off…
An anomaly-free operator corresponding to the Wheeler-DeWitt constraint of Lorentzian, four-dimensional, canonical, non-perturbative vacuum gravity is constructed in the continuum. This operator is entirely free of factor ordering…
Learning requires the traversal of inherently distinct cognitive states to produce behavioral adaptation. Yet, tools to explicitly measure these states with non-invasive imaging -- and to assess their dynamics during learning -- remain…
Fractional revival is a quantum transport phenomenon important for entanglement generation in spin networks. This takes place whenever a continuous-time quantum walk maps the characteristic vector of a vertex to a superposition of the…
We consider a process where a spin hops across a discrete network and at certain sites couples to static spins. While this setting is implementable in various scenarios (e.g quantum dots or coupled cavities) the physics of such processes is…
Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…
A random graph evolution rule is considered. The graph evolution is based on interactions of three vertices. The weight of a clique is the number of its interactions. The asymptotic behaviour of the weights is described. It is known that…
We study how the spin-statistics theorem relates to the geometric structures on phase space that are introduced in quantisation procedures (namely a U(1) bundle and connection). The relation can be proved in both the relativistic and the…