Related papers: Quantum Markov fields on graphs
We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.
The proposed theory of causally structured discrete fields studies integer values on directed edges of a self-similar graph with a propagation rule, which we define as a set of valid combinations of integer values and edge directions around…
We develop a general spectral framework to analyze quantum fractional revival in quantum spin networks. In particular, we introduce generalizations of the notions of cospectral and strongly cospectral vertices to arbitrary subsets of…
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
We analyze the equivalence between discrete-time coined quantum walks and Szegedy's quantum walks. We characterize a class of flip-flop coined models with generalized Grover coin on a graph $\Gamma$ that can be directly converted into…
In this paper we study the additive functionals of Markov chains via conditioning with respect to both past and future of the chain. We shall point out new sufficient projective conditions, which assure that the variance of partial sums of…
We study the loop clusters induced by Poissonian ensembles of Markov loops on a finite or countable graph (Markov loops can be viewed as excursions of Markov chains with a random starting point, up to re-rooting). Poissonian ensembles are…
We present general mappings between classical spin systems and quantum physics. More precisely, we show how to express partition functions and correlation functions of arbitrary classical spin models as inner products between quantum…
A general way to construct chain models with certain Lie algebraic or quantum Lie algebraic symmetries is presented. These symmetric models give rise to series of integrable systems. As an example the chain models with $A_n$ symmetry and…
We introduce block Markov chains (BMCs) indexed by an infinite rooted tree. It turns out that BMCs define a new class of tree-indexed Markovian processes. We clarify the structure of BMCs in connection with Markov chains (MCs) and Markov…
We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…
In Quantum Field Theory, scattering amplitudes are computed from propagators which, for internal lines, are built upon spin/polarization-sum relationships. In turn, these are normally constructed upon plane-wave solutions of the free field…
The asymptotic dynamics of quantum Markov chains generated by the most general physically relevant quantum operations is investigated. It is shown that it is confined to an attractor space on which the resulting quantum Markov chain is…
We investigate the entanglement properties of quantum states associated with directed graphs. Using a measure derived from the Fubini-Study metric, we quantitatively relate multipartite entanglement to the local connectivity of the graph.…
Poissonian ensembles of Markov loops on a finite graph define a random graph process in which the addition of a loop can merge more than two connected components. We study Markov loops on the complete graph derived from a simple random walk…
Graphs defined over a finite ring are well-studied in the literature. Due to their nature, these types of graphs connect several branches of mathematics, including algebra, number theory, matrix theory, and representation theory. In recent…
In this work, we present a comprehensive exploration of the entanglement and graph connectivity properties of graph states. We quantify the entanglement in pseudo graph states using the entanglement distance, a recently introduced measure…
An algorithm for estimating quasi-stationary distribution of finite state space Markov chains has been proven in a previous paper. Now this paper proves a similar algorithm that works for general state space Markov chains under very general…