Searcharxiv⌕ Search

arXiv · cond-mat/0508116

Numerical Study of Spin Hall Transport in a Two Dimensional Hole Gas System

Abstract

We present a numerical study of the spin Hall effect in a two-dimensional hole gas (2DHG) system in the presence of disorder. We find that the spin Hall conductance (SHC), extrapolated to the thermodynamic limit, remains finite in a wide range of disorder strengths for a closed system on torus. But there is no intrinsic spin Hall accumulation as induced by an external electric field once the disorder is turned on. The latter is examined by performing a Laughlin's Gedanken gauge experiment numerically with the adiabatical insertion of a flux quantum in a belt-shaped sample, in which the absence of level crossing is found under the disorder effect. Without disorder, on the other hand, energy levels do cross each other, which results in an oscillating spin-density-modulation at the sample boundary after the insertion of one flux quantum in the belt-shaped system. But the corresponding net spin transfer is only about one order of magnitude smaller than what is expected from the bulk SHC. These apparently contradictory results can be attributed to the violation of the spin conservation law in such a system. We also briefly address the dissipative Fermi surface contribution to spin polarization, which may be relevant to experimental measurements.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

W. Q. Chen, Z. Y. Weng, D. N. Sheng. 2005-10-26. Numerical Study of Spin Hall Transport in a Two Dimensional Hole Gas System. https://doi.org/10.1103/physrevb.72.235315

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

KEEP EXPLORING

Related papers

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↗

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↗

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↗