Related papers: Quantum vs classical Markov chains; Exactly solvab…
A semi-Markov process method for obtaining general counting statistics for open quantum systems is extended to the scenario of resetting. The simultaneous presence of random resets and wave function collapses means that the quantum jump…
Monte Carlo algorithms often aim to draw from a distribution $\pi$ by simulating a Markov chain with transition kernel $P$ such that $\pi$ is invariant under $P$. However, there are many situations for which it is impractical or impossible…
15 exactly solvable inhomogeneous (spinless) fermion systems on one-dimensional lattices are constructed explicitly based on the discrete orthogonal polynomials of Askey scheme, e.g. the Krawtchouk, Hahn, Racah, Meixner, $q$-Racah…
A new model that maps a quantum random walk described by a Hadamard operator to a particular case of a random walk is presented. The model is represented by a Markov chain with a stochastic matrix, i.e., all the transition rates are…
Several explicit examples of quasi exactly solvable `discrete' quantum mechanical Hamiltonians are derived by deforming the well-known exactly solvable Hamiltonians of one degree of freedom. These are difference analogues of the well-known…
The nonlinear supersymmetry of one-dimensional systems is investigated in the context of the quantum anomaly problem. Any classical supersymmetric system characterized by the nonlinear in the Hamiltonian superalgebra is symplectomorphic to…
In this work we study the recurrence problem for quantum Markov chains, which are quantum versions of classical Markov chains introduced by S. Gudder and described in terms of completely positive maps. A notion of monitored recurrence for…
In the case of a quantum-classical hybrid system with a finite number of degrees of freedom, the problem of characterizing the most general dynamical semigroup is solved, under the restriction of being quasi-free. This is a generalization…
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…
We give an example of a transient reversible Markov chain that almost surely has only a finite number of cutpoints. We explain how this is relevant to a conjecture of Diaconis and Freedman and a question of Kaimanovich. We also answer…
Quantum Hamiltonians that are fine-tuned to their so-called Rokhsar-Kivelson (RK) points, first presented in the context of quantum dimer models, are defined by their representations in preferred bases in which their ground state wave…
This work explores classical discrete multiple orthogonal polynomials, including Hahn, Meixner of the first and second kinds, Kravchuk, and Charlier polynomials, with an arbitrary number of weights. Explicit expressions for the recursion…
Graphical Models have various applications in science and engineering which include physics, bioinformatics, telecommunication and etc. Usage of graphical models needs complex computations in order to evaluation of marginal functions,so…
We examine various generalizations, e.g. exactly solvable, quasi-exactly solvable and non-Hermitian variants, of a quantum nonlinear oscillator. For all these cases, the same mass function has been used and it has also been shown that the…
By modeling the interaction of an open quantum system with its environment through a natural generalization of the classical concept of continuous time random walk, we derive and characterize a class of non-Markovian master equations whose…
A comprehensive review of exactly solvable quantum mechanics is presented with the emphasis of the recently discovered multi-indexed orthogonal polynomials. The main subjects to be discussed are the factorised Hamiltonians, the general…
The procedure of the "quantum" linearization of the Hamiltonian ordinary differential equations with one degree of freedom is introduced. It is offered to be used for the classification of integrable equations of the Painleve type. By this…
Given random walk on a graph, the corresponding discrete-time quantum walk can be constructed using the method proposed by Szegedy. On the other hand, given a partition of the set of states of a Markov chain, one can study the corresponding…
PT-symmetric Hamiltonians and transfer matrices arise naturally in statistical mechanics. These classical and quantum models often require the use of complex or negative weights and thus fall outside of the conventional equilibrium…
Probabilistic graphical models play a crucial role in machine learning and have wide applications in various fields. One pivotal subset is undirected graphical models, also known as Markov random fields. In this work, we investigate the…