Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/9810345

Quantum dynamics in canonical and micro-canonical ensembles. Part I. Anderson localization of electrons

V. Filinov·Yu. Lozovik·A. Filinov·I. Zacharov·A. Oparin
View original source ↗Read source document ↗Export metadata ↓

Abstract

The new numerical approach for consideration of quantum dynamics and calculations of the average values of quantum operators and time correlation functions in the Wigner representation of quantum statistical mechanics has been developed. The time correlation functions have been presented in the form of the integral of the Weyl's symbol of considered operators and the Fourier transform of the product of matrix elements of the dynamic propagators. For the last function the integral Wigner- Liouville's type equation has been derived. The numerical procedure for solving this equation combining both molecular dynamics and Monte Carlo methods has been developed. For electrons in disordered systems of scatterers the numerical results have been obtained for series of the average values of the quantum operators including position and momentum dispersions, average energy, energy distribution function as well as for the frequency dependencies of tensor of electron conductivity and permittivity according to quantum Kubo formula. Zero or very small value of static conductivity have been considered as the manifestation of Anderson localization of electrons in 1D case. Independent evidence of Anderson localization comes from the behaviour of the calculated time dependence of position dispersion.

Explore related subjects

cond-mat.dis-nnquant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V. Filinov, Yu. Lozovik, A. Filinov, I. Zacharov, A. Oparin. 1998-10-26. Quantum dynamics in canonical and micro-canonical ensembles. Part I. Anderson localization of electrons. https://doi.org/10.1088/0031-8949%2F58%2F4%2F003

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

KEEP EXPLORING

Related papers

arXiv2026

Deep-layered machines have a built-in Occam's razor

Many complex systems map vast numbers of microscopic descriptions onto far fewer macroscopic outcomes. Surprisingly, these input-output maps strongly favor simple outputs. In an exactly solvable deep-layered machine, we prove that simplicity bias strengthens with every layer. The probability of an output function $F$ approaches $\Pr(F)\propto 2^{-K(F)}$, where $K$ is the Kolmogorov complexity. Our results show that hierarchical composition alone can generate an intrinsic Occam's razor, suggesting a general mechanism for simplicity bias in learning and evolution.

cond-mat.dis-nn↗
arXiv2026

Neural Networks with Exciton-Polariton Waveguides

We propose and numerically study a scheme for neural networks using exciton-polariton waveguide meshes. These enable arbitrary programmable interlayer couplings suited to a restricted Boltzmann machine architecture where polariton phases act as stochastic network variables. We show that such a network can be trained using unsupervised Hebbian and anti-Hebbian updates. This allows the implementation of an associative memory, where the network recovers learned patterns from imperfect inputs.

cond-mat.dis-nn↗
arXiv2026

Finite-width shift of the edge of chaos in deep neural networks

Deep neural networks train best when they are initialised at the edge of chaos, the critical line in the plane of weight and bias variances on which the distance between two inputs neither grows nor shrinks with depth. The line is known for infinitely wide networks; at finite width it moves, and how it moves has been disputed. We treat the logarithm of the distance between two inputs through a network of width $N$ as a random walk and compute its drift and variance to order $1/N$. The edge of chaos moves to a larger weight variance, by $Δσ_w^2=-a_1/(N\,\partial_{σ_w^2}\lnχ_1)$, about $8/N$ for $\tanh$ networks at a bias variance of $0.05$, confirmed by simulations of the exact finite-width recursion. The shift describes a typical network; the average over many networks is dominated by rare networks in which the distance grows, and its critical point moves the other way, which explains why calculations and simulations have disagreed. Backpropagation follows the same random walk, so the shift applies to gradients unchanged. Along the edge of chaos, the information about the similarity of two inputs is constant until the compression over the depth exceeds about one nat, which fixes where to sit on the line. The results give an initialisation rule, Crinit, that places a network on its finite-width edge of chaos without a search. On MNIST and Fashion-MNIST at width $64$ it is more accurate than the standard rules at their usual settings, by a small margin in shallow networks and a large one in deep networks, where most standard rules fail; it trains in fewer steps, and it matches or beats the standard rules with a tuned gain.

cond-mat.dis-nn↗