Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/9803239

Parisi-Symmetry of the Many-Body Quantum Theory of randomly interacting fermionic systems

R. Oppermann·B. Rosenow
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show that fermion systems with random interactions lead to strong coupling of glassy order and fermionic correlations, which culminates in the implementation of Parisi replica permutation symmetry breaking (RPSB) in their T=0 quantum field theories. Precursor effects below fermionic AT-lines become stronger as the temperature decreases and play a crucial role within the entire low T regime. The Parisi ultrametric structure is shown to determine low energy excitations and the dynamic behaviour of fermionic correlations for large times, which is predicted to affect transport properties in metallic (and superconducting) spin glasses. Thus we reveal quantum dynamical fingerprints of the Parisi scheme. These effects, being strongest as T->0, are contrasted with quantum spin glass transitions at T=0 displaying only small RPSB corrections at low T. RPSB-effects moreover appear to influence the loci of the ground state transitions at O(T^0) and hence the phase diagrams. We derive a new representation of the T=0 Green's function which leads to a map of the fermionic (insulating) spin glass solution to the local limit solution of a Hubbard model with a random repulsive interaction. We obtain the distribution of the Hubbard interaction fluctuation and its dependence on the order of RPSB. A generalized mapping between metallic spin glass and random U Hubbard model is conjectured. The new representation of the Green's function at T=0 is suggested to be useful for generalizations to superconductors with spin glass phases.

Explore related subjects

cond-mat.dis-nncond-mat.str-el

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R. Oppermann, B. Rosenow. 1998-03-19. Parisi-Symmetry of the Many-Body Quantum Theory of randomly interacting fermionic systems. https://doi.org/10.1103/physrevb.60.10325

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↗