Related papers: Quantum vs classical Markov chains; Exactly solvab…
This paper constitutes a review on N=2 fractional supersymmetric Quantum Mechanics of order k. The presentation is based on the introduction of a generalized Weyl-Heisenberg algebra W_k. It is shown how a general Hamiltonian can be…
For integrable inhomogeneous supersymmetric spin chains (generalized graded magnets) constructed employing Y(gl(N|M))-invariant R-matrices in finite-dimensional representations we introduce the master T-operator which is a sort of…
We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…
Correct quantum Hamiltonians of a few exactly solvable models in two space-time dimensions are derived by taking into account operator solutions of the field equations. While two versions of the model with derivative coupling are found to…
We introduce the generalized equidistant Chebyshev polynomials T(k,h) of kind k of hyperkind h, where k,h are positive integers. They are obtained by a generalization of standard and monic Chebyshev polynomials of the first and second…
Qualitative features of the Manakov top are discussed for the classical and quantum versions of the problem. Energy-momentum diagram for this integrable classical problem and quantum joint spectrum of two commuting observables for…
For a Markov chain both the detailed balance condition and the cycle Kolmogorov condition are algebraic binomials. This remark suggests to study reversible Markov chains with the tool of Algebraic Statistics, such as toric statistical…
In this paper we provide new quantum algorithms with polynomial speed-up for a range of problems for which no such results were known, or we improve previous algorithms. First, we consider the approximation of the frequency moments $F_k$ of…
Using a newly introduced connection between the local and non-local description of open quantum system dynamics, we investigate the relationship between these two characterisations in the case of quantum semi-Markov processes. This class of…
There is a well-established theory linking certain semi-Markov chains and continuous-time random walks to time-fractional equations and anomalous diffusion. In this work, we go beyond the semi-Markov framework by considering some…
We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…
We survey the equations of continuous-time quantum walks on simple one-dimensional lattices, which include the finite and infinite lines and the finite cycle, and compare them with the classical continuous-time Markov chains. The focus of…
The quantum mechanical equivalent of parametric resonance is studied. A simple model of a periodically kicked harmonic oscillator is introduced which can be solved exactly. Classically stable and unstable regions in parameter space are…
Using density matrix renormalization group calculations, ground state properties of the spin-1 Heisenberg chain with exchange and quadratic single-ion anisotropies in an external field are studied, for special choices of the two kinds of…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
We provide a unified framework to compute the stationary distribution of any finite irreducible Markov chain or equivalently of any irreducible random walk on a finite semigroup $S$. Our methods use geometric finite semigroup theory via the…
Wiener used the Poisson kernel for the Hermite polynomials to deal with the classical Fourier transform. Askey, Atakishiyev and Suslov used this approach to obtain a q-Fourier transform by using the continuous q-Hermite polynomials. Rahman…
A classical problem for Markov chains is determining their stationary (or steady-state) distribution. This problem has an equally classical solution based on eigenvectors and linear equation systems. However, this approach does not scale to…
Reversibility is a key property of Markov chains, central to algorithms such as Metropolis-Hastings and other MCMC methods. Yet many applications yield non-reversible chains, motivating the problem of approximating them by reversible ones…