Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1907.01310

Quantum Markov chains: recurrence, Schur functions and splitting rules

F. A. Grünbaum·C. F. Lardizabal·L. Velázquez
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 quantum Markov chains is examined in association with Schur functions, which codify information on the first return to some given state or subspace. Such objects possess important factorization and decomposition properties which allow us to obtain probabilistic results based solely on those parts of the graph where the dynamics takes place, the so-called splitting rules. These rules also yield an alternative to the folding trick to transform a doubly infinite system into a semi-infinite one which doubles the number of internal degrees of freedom. The generalization of Schur functions --so-called FR-functions-- to the general context of closed operators in Banach spaces is the key for the present applications to open quantum systems. An important class of examples included in this setting are the open quantum random walks, as described by S. Attal et al., but we will state results in terms of general completely positive trace preserving maps. We also take the opportunity to discuss basic results on recurrence of finite dimensional iterated quantum channels and quantum versions of Kac's Lemma, in close association with recent results on the subject.

Explore related subjects

math-phmath.FAmath.MPquant-ph

Keep this discovery

BibTeXRIS

F. A. Grünbaum, C. F. Lardizabal, L. Velázquez. 2019-07-02. Quantum Markov chains: recurrence, Schur functions and splitting rules. https://doi.org/10.1007/s00023-019-00863-7

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗