Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.33436

Dynamic Pseudogap Model: Analytic Results vs Monte Carlo Numerics

Michael V. Sadovskii
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recently proposed dynamic pseudogap model analytical results for spectral density of an electron scattered by random time-dependent Gaussian field representing fluctuations with finite nesting vector ${\bf Q}$, characteristic oscillation frequency $ω_0$ and damping $γ$, leading to pseudogap formation, are compared with exact numerical solution by Monte Carlo (MC) approach. We consider both commensurate (real) and incommensurate (complex) fluctuations, for a wide range of parameters of the model. Electron Green's function is approximated either by a double Poisson series with history-dependent Bogoliubov gaps or by exact static continued fraction solution. In the coherent regime double-series representation provides description of dynamic sideband formation in the spectral density. As coherence is progressively lost, the theory crosses over to the quasistatic fluctuating-gap regime described by the exact continued-fraction solution. The exact MC solution overcomes the limitations of analytic approach, such as neglect of Magnus-type corrections in commuting approximation, and establish the limits of analytic approach, as well as confirming the exactness of continued fraction solution in static limit. In general, analytic expressions demonstrate rather satisfactory agreement with exact MC numerics within their limits, confirming the overall qualitative physical picture of dynamic pseudogap formation.

Explore related subjects

cond-mat.dis-nn

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael V. Sadovskii. 2026-10-24. Dynamic Pseudogap Model: Analytic Results vs Monte Carlo Numerics. https://arxiv.org/abs/2610.33436

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

KEEP EXPLORING

Related papers

arXiv2026

Optimality and annealing path planning of dynamical analog solvers

Recently proposed analog solvers based on dynamical systems, such as Ising machines, are promising platforms for large-scale combinatorial optimization. Yet, given the heuristic nature of the field, there is very limited insight on optimality guarantees of the solvers, as well as how parameter schedules shape dynamics and outcomes. Here, we develop a dynamical mean-field framework to analyze Ising-machine dynamics for finding the ground state energy of the Sherrington-Kirkpatrick(SK) model of spin glasses and identify mechanisms that enable rapid convergence to provenly near-optimal energies. For a fixed target energy density Ec, we show that solutions are typically reached within O(1) matrix vector multiplications, indicating constant time complexity. We further delineate theoretical limitations arising from different parameter-scheduling trajectories and demonstrate a pronounced benefit of temperature-only annealing for the Coherent Ising Machine. Building on these insights, we propose a general framework for designing optimized parameter schedules, thereby improving the practical effectiveness of Ising machines for complex optimization tasks. The superior performance of the dynamical solvers is illustrated by the attainment of the ground state energy of the SK model.

cond-mat.dis-nn↗
arXiv2026

Matter that learns what matters

Can a material learn what deserves its attention? We show that it can in a model optical network, in which action outcomes train a persistent record in each link. The record biases whether a source is consulted and sets how strongly it changes a stored answer, so useful sources gain attention and influence without being identified in advance. The network's experience thus shapes the information available for its future learning. Resonant readouts make this learning fragile: reinforcement can carry a record past resonance, where it persists but its influence weakens. We derive bounds within which relevant signals guide the answer, irrelevant signals are rejected and stored answers remain open to revision. These bounds guide a learning rule that limits reinforcement as records form; in simulations, it acquires useful records and keeps them functional. When relevance changes, an obsolete record can block its own replacement. A local state that strengthens negative writing after unsuccessful actions releases obsolete records and completes the learning sequence more often. How a memory is read should decide how it is written.

cond-mat.dis-nn↗
arXiv2026

Symmetry-driven in-situ physical adjoint computing beyond reciprocity

Nonreciprocity enriches wave control and information processing through directional transport, yet challenges conventional in-situ physical adjoint optimization, which relies on reciprocity to acquire adjoint responses. Here we demonstrate symmetry-driven in-situ physical adjoint computing (Sym-iPAC) in nonreciprocal systems, which enables access to adjoint responses on the original hardware through three classes of transpose symmetry: local geometric permutations, complex gauge reweighting, and latent symmetry in effective port dynamics revealed by Schur reduction. Experiments with programmable nonreciprocal microwave networks validate these transpose relations and yield adjoint gradients, enabling closed-loop optimization. These results establish experimentally accessible transpose symmetry as a route to in-situ physical adjoint computing beyond reciprocity.

cond-mat.dis-nn↗