• Corpus ID: 235358270

Dilation of stochastic matrices by coarse graining

  title={Dilation of stochastic matrices by coarse graining},
  author={Heinz-J{\"u}rgen Schmidt},
  • H. Schmidt
  • Published 7 June 2021
  • Physics, Mathematics
We consider two different ways of representing stochastic matrices by bi-stochastic ones acting on a larger probability space, referred to as “dilation by uniform coarse graining” and “environmental dilation”. The latter is motivated by analogy to the dilation of operations in quantum theory. Both types of dilation can be viewed as special cases of a general “dilation by coarse graining”. We also discuss the entropy balance and illustrate our results, among others, by an example of a stochastic… 

Figures from this paper


From quantum mechanics to classical statistical physics: Generalized Rokhsar–Kivelson Hamiltonians and the “Stochastic Matrix Form” decomposition
Abstract 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
Entropy, stochastic matrices, and quantum operations
Abstract The goal of the present paper is to derive some conditions on saturation of (strong) subadditivity inequality for the stochastic matrices. The notion of relative entropy of stochastic
On entropy-preserving stochastic averages
Abstract When an n × n doubly stochastic matrix A acts on R n on the left as a linear transformation and P is an n-long probability vector, we refer to the new probability vector AP as the stochastic
A Framework for Sequential Measurements and General Jarzynski Equations
Abstract We formulate a statistical model of two sequential measurements and prove a so-called J-equation that leads to various diversifications of the well-known Jarzynski equation including the
A Quantum Fluctuation Theorem
We consider a quantum system strongly driven by forces that are periodic in time. The theorem concerns the probability $P(e)$ of observing a given energy change $e$ after a number of cycles. If the
Quantum computation and quantum information
  • T. Paul
  • Mathematics, Computer Science
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
Subadditivity of Entropy for Stochastic Matrices
It is shown that the entropy of irreducible stochastic matrix P = (pij)i,j=1,...,N is irreducing iff for every i, j = 1, . . . , N there exists k ∈ N such that k is continuous and concave.
Scaling of matrices to achieve specified row and column sums
IfA is ann ×n matrix with strictly positive elements, then according to a theorem ofSinkhorn, there exist diagonal matricesD1 andD2 with strictly positive diagonal elements such thatD1A D2 is doubly
The Ehrhart Polynomial of the Birkhoff Polytope
This work presents a new, complex-analytic way to compute the Ehrhart polynomial of the Birkhoff polytope, that is, the function counting the integer points in the dilatedpolytope.