Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Trace as Coarse-Graining in Markov Dynamics

John Wyrick

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.28500.26247

Related papers

Interlaced coarse-graining for the dynamical cluster approximation

Urs R. Hähner, Peter Staar, Mi Jiang +2 more

Bulletin of the American Physical Society•Mar 16, 2016•0 citations

MONOTONICITY OF QUANTUM RELATIVE ENTROPY REVISITED

DÉNES PETZ

Monotonicity under coarse-graining is a crucial property of the quantum relative entropy. The aim of this paper is to investigate the condition of equality in the monotonicity theorem and in its consequences as the strong sub-additivity of von Neumann entropy, the Golden–Thompson trace inequality and the monotonicity of the Holevo quantitity. The relation to quantum Markov states is briefly indicated.

arXiv:quant-ph/0209053•Reviews in Mathematical Physics•Feb 26, 2003•213 citations

Characterizing Non-Markovian Dynamics

Dariusz Chruściński, Andrzej Kossakowski

Springer eBooks•Sep 28, 2012•1 citation

Predictive Holonomy and Minimal Completion of Coarse Dynamics

Maxim V. Churilov

A coarse description of a dynamical system generally fails to evolve autonomously: evolving and coarse-graining in different orders gives different predictions, and the compressed propagator fails the semigroup law. We show that this path dependence is the observable boundary of missing state. For a finite continuous-time Markov chain with generator $L$, coarse channel $C$, and stochastic section $R$ satisfying $CR=I$, define $P=RC$, $Q=I-P$, and $K=CLR$. The exact coarse propagator $T_t=C\mathrm{e}^{tL}R$ obeys a Volterra equation with memory kernel $\mathcal{M}(t)=CLQ\,\mathrm{e}^{tQLQ}\,QLR$. Every memory jet $\mathcal{M}^{(k)}(0)$ is recursively recoverable from the short-time derivatives of $T_t$ alone. The rank of the block Hankel operator $\mathbb{H}_{\infty}=(\mathcal{M}^{(i+j)}(0))_{i,j\geq 0}$ is exactly the smallest number of auxiliary linear state variables required to turn the coarse dynamics into an exact autonomous, time-homogeneous system. A minimal completion is constructible by Ho--Kalman factorization and is unique up to similarity. If $d=\min\{k:\mathcal{M}^{(k)}(0)\neq 0\}$, then every smooth classical $f$-divergence generically scales as $t^{2d+4}$. Exact Markov examples realize exponents $4,6,8$ and closure ranks $1,2,3$. We also derive finite-sample singular-value certificates for hidden predictive coordinates, including a matrix-Bernstein bound with intrinsic-variance control. Finally, histories are identified when they induce the same future law under every admissible intervention, yielding the minimal counterfactual predictive state. The results turn coarse-graining into a constructive state-completion problem and separate ordinary linear realization from the harder requirement of a positive or Markov realization.

quant-pharXiv:2610.13951•Aug 10, 2026

Dynamics with a memory: non-Markovian evolution

William C. Saslaw

Cambridge University Press eBooks•Jul 25, 1985•0 citations

Spin network Entanglement and Bulk-Boundary Map in Loop Quantum Gravity

Qian Chen

This thesis is dedicated to the study of open spin networks. We formulate quasi-local descriptions of loop quantum gravity. We investigate the coarse-graining procedure via tracing over bulk degrees of freedom, which encodes all that we can know about the quantum state of geometry from probing the boundary. We prove a boundary-to bulk universal reconstruction procedure, to be understood as a purification of the mixed boundary state into a pure bulk state. We then move to define multipartite entanglement in spin networks, and show the computation of entanglement excitation from holonomy operator, which also allows us to glimpse bulk curvature from entanglement. Moreover, by investigating another coarse-graining procedure - via gauge-fixing, which does not trace over any bulk degrees of freedom, we show a new interesting connection between bulk geometry and boundary observables via the dynamics of entanglement. Finally, we define the spin network entanglement between spin sub-networks, which correspond to spatial sub-regions. We then generalize the coarse-graining approach, and prove that the entanglement between spin sub-networks is preserved under the coarse-graining (via gauge-fixing).

arXiv:2306.02789•Jan 1, 2023•0 citations
A coarse description of a dynamical system generally fails to evolve autonomously: evolving and coarse-graining in different orders gives different predictions, and the compressed propagator fails the semigroup law. We show that this path dependence is the observable boundary of missing state. For a finite continuous-time Markov chain with generator LLL, coarse channel CCC, and stochastic section RRR satisfying CR=ICR=ICR=I, define P=RCP=RCP=RC, Q=I−PQ=I-PQ=I−P, and K=CLRK=CLRK=CLR. The exact coarse propagator Tt=CetLRT_t=C\mathrm{e}^{tL}RTt​=CetLR obeys a Volterra equation with memory kernel M(t)=CLQ etQLQ QLR\mathcal{M}(t)=CLQ\,\mathrm{e}^{tQLQ}\,QLRM(t)=CLQetQLQQLR. Every memory jet M(k)(0)\mathcal{M}^{(k)}(0)M(k)(0) is recursively recoverable from the short-time derivatives of TtT_tTt​ alone. The rank of the block Hankel operator H∞=(M(i+j)(0))i,j≥0\mathbb{H}_{\infty}=(\mathcal{M}^{(i+j)}(0))_{i,j\geq 0}H∞​=(M(i+j)(0))i,j≥0​ is exactly the smallest number of auxiliary linear state variables required to turn the coarse dynamics into an exact autonomous, time-homogeneous system. A minimal completion is constructible by Ho--Kalman factorization and is unique up to similarity. If d=min⁡{k:M(k)(0)≠0}d=\min\{k:\mathcal{M}^{(k)}(0)\neq 0\}d=min{k:M(k)(0)=0}, then every smooth classical fff-divergence generically scales as t2d+4t^{2d+4}t2d+4. Exact Markov examples realize exponents 4,6,84,6,84,6,8 and closure ranks 1,2,31,2,31,2,3. We also derive finite-sample singular-value certificates for hidden predictive coordinates, including a matrix-Bernstein bound with intrinsic-variance control. Finally, histories are identified when they induce the same future law under every admissible intervention, yielding the minimal counterfactual predictive state. The results turn coarse-graining into a constructive state-completion problem and separate ordinary linear realization from the harder requirement of a positive or Markov realization.
This thesis is dedicated to the study of open spin networks. We formulate quasi-local descriptions of loop quantum gravity. We investigate the coarse-graining procedure via tracing over bulk degrees of freedom, which encodes all that we can know about the quantum state of geometry from probing the boundary. We prove a boundary-to bulk universal reconstruction procedure, to be understood as a purification of the mixed boundary state into a pure bulk state. We then move to define multipartite entanglement in spin networks, and show the computation of entanglement excitation from holonomy operator, which also allows us to glimpse bulk curvature from entanglement. Moreover, by investigating another coarse-graining procedure - via gauge-fixing, which does not trace over any bulk degrees of freedom, we show a new interesting connection between bulk geometry and boundary observables via the dynamics of entanglement. Finally, we define the spin network entanglement between spin sub-networks, which correspond to spatial sub-regions. We then generalize the coarse-graining approach, and prove that the entanglement between spin sub-networks is preserved under the coarse-graining (via gauge-fixing).