Related papers: Quantum Markov fields on graphs
This extended abstract reports on on-going research on quantum algorithmic approaches to the problem of generalised tree search that may exhibit effective quantum speedup, even in the presence of non-constant branching factors. Two…
We consider the coupling of quantum fields to classical gravity in the formalism of ensembles on configuration space, a model that allows a consistent formulation of interacting classical and quantum systems. Explicit calculations show that…
We propose an approach to quantize discrete networks (graphs with discrete edges). We introduce a new exact solution of discrete Schrodinger equation that is used to write the solution for quantum graphs. Formulation of the problem and…
In this paper, we introduce the concepts of $\omega$-limit sets and pseudo orbits for a tree-shift defined on a Markov-Cayley tree, extending the results of tree-shifts defined on $d$-trees [5,6]. Firstly, we establish the relationships…
The usual crossed product construction which associates to the homeomorphism $T$ of the locally compact space $X$ the C$^*$-algebra $C^*(X,T)$ is extended to the case of a partial local homeomorphism $T$. For example, the Cuntz-Krieger…
A new type of algebras that represent a generalization of both quantum groups and braided groups is defined. These algebras are given by a pair of solutions of the Yang--Baxter equation that satisfy some additional conditions. Several…
We clarify some aspects of quantum group gauge theory and its recent generalisations (by T. Brzezinski and the author) to braided group gauge theory and coalgebra gauge theory. We outline the diagrammatic version of the braided case. We…
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,…
We formulate some simple conditions under which a Markov chain may be approximated by the solution to a differential equation, with quantifiable error probabilities. The role of a choice of coordinate functions for the Markov chain is…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
We provide an introduction to enumerating and constructing invariants of group representations via character methods. The problem is contextualised via two case studies arising from our recent work: entanglement measures, for characterising…
We introduce a new class of graded rings extending the class of generalized Weyl algebras. These rings are orders in crossed products of the most general type, and we introduce their basic structure theory. We provide an extensive list of…
The Markov Chain Tree Theorem is extended to the max algebra and possible applications to ranking problems are discussed.
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
We construct a generalized controlled phased gate entangler for a multi-qubit state based on the geometrical structure of quantum systems. We also investigate relation between the generalized controlled phase construction of a quantum gate…
The theory of {\Gamma}-species is developed to allow species-theoretic study of quotient structures in a categorically rigorous fashion. This new approach is then applied to two graph-enumeration problems which were previously unsolved in…
We present a notion of generalized entanglement which goes beyond the conventional definition based on quantum subsystems. This is accomplished by directly defining entanglement as a property of quantum states relative to a distinguished…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
This work is dedicated to a new completely algebraic approach to Arakelov geometry, which doesn't require the variety under consideration to be generically smooth or projective. In order to construct such an approach we develop a theory of…
On basis of generalized 6j-symbols we give a formulation of topological quantum field theories for 3-manifolds including observables in the form of coloured graphs. It is shown that the 6j-symbols associated with deformations of the…