SEARCH · Engineering Papers

Results for “Disordered Systems and Neural Networks (cond-mat.dis-nn)”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

3 records

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Multioutput Convolutional Neural Network for Improved Parameter Extraction in Time-Resolved Electrostatic Force Microscopy Data

Time-resolved scanning probe microscopy methods, like time-resolved electrostatic force microscopy (trEFM), enable imaging of dynamic processes ranging from ion motion in batteries to electronic dynamics in microstructured thin film semiconductors for solar cells. Reconstructing the underlying physical dynamics from these techniques can be challenging due to the interplay of cantilever physics with the actual transient kinetics of interest in the resulting signal. Previously, quantitative trEFM used empirical calibration of the cantilever or feed-forward neural networks trained on simulated data to extract the physical dynamics of interest. Both these approaches are limited by interpreting the underlying signal as a single exponential function, which serves as an approximation but does not adequately reflect many realistic systems. Here, we present a multi-branched, multi-output convolutional neural network (CNN) that uses the trEFM signal in addition to the physical cantilever parameters as input. The trained CNN accurately extracts parameters describing both single-exponential and bi-exponential underlying functions, and more accurately reconstructs real experimental data in the presence of noise. This article demonstrates an application of physics-informed machine learning to complex signal processing tasks, enabling more efficient and accurate analysis of trEFM.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Anomalies of global symmetries on the lattice

't Hooft anomalies of global symmetries play a fundamental role in quantum many-body systems and quantum field theory (QFT). In this paper, we make a systematic analysis of lattice anomalies - the analog of 't Hooft anomalies in lattice systems - for which we give a precise definition. Crucially, a lattice anomaly is not a feature of a specific Hamiltonian, but rather is a topological invariant of the symmetry action. The controlled setting of lattice systems allows for a systematic and rigorous treatment of lattice anomalies, shorn of the technical challenges of QFT. We find that lattice anomalies reproduce the expected properties of QFT anomalies in many ways, but also have crucial differences. In particular, lattice anomalies and QFT anomalies are not, contrary to a common expectation, in one-to-one correspondence, and there can be non-trivial anomalies on the lattice that are infrared (IR) trivial: they admit symmetric trivial gapped ground states, and map to trivial QFT anomalies at low energies. Nevertheless, we show that lattice anomalies (including IR-trivial ones) have a number of interesting consequences in their own right, including connections to commuting projector models, phases of many-body localized (MBL) systems, and quantum cellular automata (QCA). We make substantial progress on the classification of lattice anomalies and develop several theoretical tools to characterize their consequences on symmetric Hamiltonians. Our work places symmetries of quantum many-body lattice systems into a unified theoretical framework and may also suggest new perspectives on symmetries in QFT.

Disordered Systems and Neural Networks (cond-mat.d↗

DOE OSTI2025

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗