A Lindblad-Pauli Framework for Coarse-Grained Chaotic Binary-State Dynamics

• URL: http://arxiv.org/abs/2512.17200v3
• Date: Thu, 25 Dec 2025 10:44:22 GMT
• Title: A Lindblad-Pauli Framework for Coarse-Grained Chaotic Binary-State Dynamics
• Authors: Yicong Qiu, Qiye Zheng,
• Abstract summary: We develop a two-state framework that embeds coarse-grained left/right statistics of the driven Duffing oscillator into a $2times2$ density-matrix representation.<n>For diagonal states the GKSL dynamics reduces to the classical two-state equation.<n>We derive closed-form solutions, an explicit Kraus representation, and practical diagnostics for the time-geneous first-order Markov assumption.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Coarse-graining a chaotic bistable oscillator into a binary symbol sequence is a standard reduction, but it often obscures the geometry of the reduced state space and structural constraints of physically meaningful stochastic evolution. We develop a two-state framework that embeds coarse-grained left/right statistics of the driven Duffing oscillator into a $2\times2$ density-matrix representation and models inter-well switching by a two-rate Gorini--Kossakowski--Sudarshan--Lindblad (GKSL) generator. For diagonal states the GKSL dynamics reduces to the classical two-state master equation.The density-matrix language permits an operational ``Bloch half-disk'' embedding with overlap parameter $c(\varepsilon)$ quantifying partition fuzziness; the GKSL model is fitted to diagonal marginals treating $c(\varepsilon)$ as diagnostic. We derive closed-form solutions, an explicit Kraus representation (generalized amplitude damping with dephasing and rotation), and practical diagnostics for the time-homogeneous first-order Markov assumption (order tests, Chapman--Kolmogorov consistency, run-length statistics, stationarity checks). When higher-order memory appears, we extend the framework via augmented Markov models, constructing CPTP maps through discrete-time Kraus representations; continuous-time GKSL generators may not exist for all empirical transition matrices. We provide a numerical pipeline with templates for validating the framework on Duffing simulations. The density-matrix formalism is an organizational convenience rather than claiming quantum-classical equivalence.

Related papers

• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Latent Object Permanence: Topological Phase Transitions, Free-Energy Principles, and Renormalization Group Flows in Deep Transformer Manifolds [0.5729426778193398]
  We study the emergence of multi-step reasoning in deep Transformer language models through a geometric and statistical-physics lens.<n>We formalize the forward pass as a discrete coarse-graining map and relate the appearance of stable "concept basins" to fixed points of this renormalization-like dynamics.<n>The resulting low-entropy regime is characterized by a spectral tail collapse and by the formation of transient, reusable object-like structures in representation space.
  arXiv  Detail & Related papers  (2026-01-16T23:11:02Z)
• Primal: A Unified Deterministic Framework for Quasi-Orthogonal Hashing and Manifold Learning [0.0]
  We present Primal, a deterministic framework that harnesses the number-theoretic independence of prime square roots to construct robust, tunable vector representations.<n>Our method exploits the Besic property to create irrational frequency modulations that guarantee non-repeating phase trajectories.<n> Empirical evaluations demonstrate that our framework yields superior retention and distribution tightness compared to random matrix projections.
  arXiv  Detail & Related papers  (2025-11-25T20:44:34Z)
• Optimal local basis truncation of lattice quantum many-body systems [0.0]
  We show how to optimally reduce the local basis of lattice quantum many-body (QMB) Hamiltonians.<n>The basis truncation exploits the most relevant eigenvalues of the estimated single-site reduced density matrix.
  arXiv  Detail & Related papers  (2025-09-22T16:22:54Z)
• MPQ-DMv2: Flexible Residual Mixed Precision Quantization for Low-Bit Diffusion Models with Temporal Distillation [74.34220141721231]
  We present MPQ-DMv2, an improved textbfMixed textbfPrecision textbfQuantization framework for extremely low-bit textbfDiffusion textbfModels.
  arXiv  Detail & Related papers  (2025-07-06T08:16:50Z)
• Sequential-Parallel Duality in Prefix Scannable Models [68.39855814099997]
  Recent developments have given rise to various models, such as Gated Linear Attention (GLA) and Mamba.<n>This raises a natural question: can we characterize the full class of neural sequence models that support near-constant-time parallel evaluation and linear-time, constant-space sequential inference?
  arXiv  Detail & Related papers  (2025-06-12T17:32:02Z)
• Explicit Density Approximation for Neural Implicit Samplers Using a Bernstein-Based Convex Divergence [6.110760886913874]
  We introduce dual-ISL, a novel likelihood-free objective for training implicit generative models.<n>We show that these theoretical advantages translate into practical ones.
  arXiv  Detail & Related papers  (2025-06-05T07:21:54Z)
• Zassenhaus Expansion in Solving the Schrödinger Equation [0.0]
  A fundamental challenge lies in approximating the unitary evolution operator ( e-imathcalHt ) where ( mathcalH ) is a large, typically non-commuting, Hermitian operator.<n>We present a refinement of the fixed-depth simulation framework introduced by E. K"okc"u et al, incorporating the second-order Zassenhaus expansion.<n>This yields a controlled, non-unitary approximation with error scaling as ( mathcalO(t
  arXiv  Detail & Related papers  (2025-05-14T14:48:47Z)
• Cloning Games, Black Holes and Cryptography [50.022147589030304]
  We introduce a new toolkit for analyzing cloning games.<n>This framework allows us to analyze a new cloning game based on binary phase states.<n>We show that the binary phase variantally optimal bound offers quantitative insights into information scrambling in idealized models of black holes.
  arXiv  Detail & Related papers  (2024-11-07T14:09:32Z)
• KPZ scaling from the Krylov space [83.88591755871734]
  Recently, a superdiffusion exhibiting the Kardar-Parisi-Zhang scaling in late-time correlators and autocorrelators has been reported. Inspired by these results, we explore the KPZ scaling in correlation functions using their realization in the Krylov operator basis.
  arXiv  Detail & Related papers  (2024-06-04T20:57:59Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• NAG-GS: Semi-Implicit, Accelerated and Robust Stochastic Optimizer [45.47667026025716]
  We propose a novel, robust and accelerated iteration that relies on two key elements. The convergence and stability of the obtained method, referred to as NAG-GS, are first studied extensively. We show that NAG-arity is competitive with state-the-art methods such as momentum SGD with weight decay and AdamW for the training of machine learning models.
  arXiv  Detail & Related papers  (2022-09-29T16:54:53Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.