Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/0606566

Giant suppression of the Drude conductivity due to quantum interference in disordered two-dimensional systems

G. M. Minkov·A. V. Germanenko·O. E. Rut·A. A. Sherstobitov·B. N. Zvonkov
View original source ↗Read source document ↗Export metadata ↓

Abstract

Temperature and magnetic field dependences of the conductivity in heavily doped, strongly disordered two-dimensional quantum well structures GaAs/In$_x$Ga$_{1-x}$As/GaAs are investigated within wide conductivity and temperature ranges. Role of the interference in the electron transport is studied in the regimes when the phase breaking length $L_ϕ$ crosses over the localization length $ξ\sim l\exp{(πk_Fl/2)}$ with lowering temperature, where $k_F$ and $l$ are the Fermi quasimomentum and mean free path, respectively. It has been shown that all the experimental data can be understood within framework of simple model of the conductivity over delocalized states. This model differs from the conventional model of the weak localization developed for $k_Fl\gg 1$ and $L_ϕ\llξ$ by one point: the value of the quantum interference contribution to the conductivity is restricted not only by the phase breaking length $L_ϕ$ but by the localization length $ξ$ as well. We show that just the quantity $(τ_ϕ^\ast)^{-1}=τ_ϕ^{-1}+τ_ξ^{-1}$ rather than $τ_ϕ^{-1}$, where $τ_ϕ\propto T^{-1}$ is the dephasing time and $τ_ξ\simτ\exp(πk_F l)$, is responsible for the temperature and magnetic field dependences of the conductivity over the wide range of temperature and disorder strength down to the conductivity of order $10^{-2} e^2/h$.

Explore related subjects

cond-mat.dis-nn

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G. M. Minkov, A. V. Germanenko, O. E. Rut, A. A. Sherstobitov, B. N. Zvonkov. 2006-06-22. Giant suppression of the Drude conductivity due to quantum interference in disordered two-dimensional systems. https://doi.org/10.1103/physrevb.75.235316

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

KEEP EXPLORING

Related papers

arXiv2026

Embedding stochastic dynamics in latent manifolds of recurrent neural networks

Recurrent neural networks (RNNs) provide a theoretical framework for understanding computation in biological neural circuits through their ability to support rich time-dependent behaviour. Whilst high-dimensional by construction, they can be used to encode low-dimensional dynamical systems, for example by restricting to low-rank connectivity, hence mirroring the emergence of latent neural manifolds found in empirical neural data. Here, we exploit a relationship between RNNs and a class of universal approximators to train networks that can represent arbitrary, nonlinear stochastic differential equations (SDEs), with given drift and diffusion coefficients, within a low-dimensional latent subspace. We show that RNNs can faithfully embed the drift and diffusion of a given SDE, including nonlinear and nonequilibrium dynamics such as chaotic attractors. We apply this approach by constructing RNN realisations of stochastic systems that transiently explore various attractors through both input-driven switching and autonomous transitions driven by nonequilibrium currents, which we interpret as models of associative and sequential (episodic) memory. To elucidate how these dynamics are encoded in the network, we introduce decompositions of the RNN based on its asymmetric connectivity and its time-irreversibility. Our results show that neural populations can implement a broad class of stochastic dynamics within low-dimensional manifolds, unifying ideas from the dynamics of neural computation, the theory of neural manifolds, associative memory, and nonequilibrium statistical mechanics.

cond-mat.dis-nn↗
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

Cup and Cap Topological Neural Network

Topological Deep Learning (TDL) is designed to learn features associated not only with nodes but also with edges, triangles and higher dimensional simplices. However, most TDL approaches, being based on boundary operators and Hodge Laplacians, have the limitation that features and signals cannot be lifted or lowered across more than one dimension per layer. To overcome this limitation, in this work, we propose the adoption of the cup and cap products. Specifically, we formulate the Cup and Cap Topological Neural Network (CCNN), a topological deep learning architecture designed to learn node-based variables (or 0-cochains) by taking into account their many-body interactions (e.g. triangles) present in the data. We validate CCNN by assessing its performance on the TopoBench datasets, demonstrating its competitive performance with respect to other simplicial complex neural networks.

cond-mat.dis-nn↗