SearcharxivSearch

arXiv · 2606.29557

Propagation of chaos for Belavkin equations beyond pure states

Abstract

We use probabilistic and stochastic-analysis methods to prove trace-norm propagation of chaos for finite-dimensional quantum mean-field systems governed by Belavkin equations. The particles are density matrices, interact through a mean-field Hamiltonian, and are continuously monitored through independent diffusive observation channels. The limiting dynamics is a nonlinear matrix-valued McKean-Vlasov diffusion, random through its local observation record and coupled through the deterministic averaged state. The main result treats arbitrary one-particle density matrices, including mixed states, and both perfect and inefficient measurement regimes. Under strong tensorization of the initial data, every fixed marginal converges uniformly on compact time intervals to the tensor product of the nonlinear limiting filters, with an explicit quantitative bound. The proof combines purification, fully observed dilation, conditional expectation, relative entropy, and uniform stability of the associated Zakai equations. In the skew-adjoint measurement case, exterior observation noises disappear from the marginal equations and a stochastic BBGKY hierarchy is recovered. Under only marginal chaoticity of permutation-invariant initial states, we prove convergence of fixed marginals by an iteration of this hierarchy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gaoyue Guo. 2026-06-28. Propagation of chaos for Belavkin equations beyond pure states. https://arxiv.org/abs/2606.29557

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR