Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “FOS: Physical Sciences”

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.

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

At least 19 records

Data-driven particle dynamics: Structure-preserving coarse-graining for emergent behavior in non-equilibrium systems

Multiscale systems are ubiquitous in science and technology, but are notoriously challenging to simulate as short spatiotemporal scales must be appropriately linked to emergent bulk physics. When expensive high-dimensional dynamical systems are coarse-grained into low-dimensional models, the entropic loss of information leads to emergent physics which are dissipative, history-dependent, and stochastic. To machine learn coarse-grained dynamics from time-series observations of particle trajectories, we propose a framework using the metriplectic bracket formalism that preserves these properties by construction; most notably, the framework guarantees discrete notions of the first and second laws of thermodynamics, conservation of momentum, and a discrete fluctuation-dissipation balance crucial for capturing non-equilibrium statistics. We introduce the mathematical framework abstractly before specializing to a particle discretization. As labels are generally unavailable for entropic state variables, we introduce a novel self-supervised learning strategy to identify emergent structural variables. We validate the method on benchmark systems and demonstrate its utility on two challenging examples: (1) coarse-graining star polymers at challenging levels of coarse-graining while preserving non-equilibrium statistics, and (2) learning models from high-speed video of colloidal suspensions that capture coupling between local rearrangement events and emergent stochastic dynamics. We provide open-source implementations in both PyTorch and LAMMPS, enabling large-scale inference and extensibility to diverse particle-based systems.

Computational Engineering, Finance, and Science (c↗

Generative modeling enables molecular structure retrieval from Coulomb explosion imaging

Capturing the structural changes that molecules undergo during chemical reactions in real space and time is a long-standing dream and an essential prerequisite for understanding and ultimately controlling femtochemistry. A key approach to tackle this challenging task is Coulomb explosion imaging, which benefited decisively from recently emerging high-repetition-rate X-ray free-electron laser sources. With this technique, information on the molecular structure is inferred from the momentum distributions of the ions produced by the rapid Coulomb explosion of molecules. Retrieving molecular structures from these distributions poses a highly non-linear inverse problem that remains unsolved for molecules consisting of more than a few atoms. Here, we address this challenge using a diffusion-based Transformer neural network. We show that the network reconstructs unknown molecular geometries from ion-momentum distributions with a mean absolute error below one Bohr radius, which is half the length of a typical chemical bond.

Artificial Intelligence (cs.AI)↗

FM4NPP: A Scaling Foundation Model for Nuclear and Particle Physics

Large language models have revolutionized artificial intelligence by enabling large, generalizable models trained through self-supervision. This paradigm has inspired the development of scientific foundation models (FMs). However, applying this capability to experimental particle physics is challenging due to the sparse, spatially distributed nature of detector data, which differs dramatically from natural language. This work addresses if an FM for particle physics can scale and generalize across diverse tasks. We introduce a new dataset with more than 11 million particle collision events and a suite of downstream tasks and labeled data for evaluation. We propose a novel self-supervised training method for detector data and demonstrate its neural scalability with models that feature up to 188 million parameters. With frozen weights and task-specific adapters, this FM consistently outperforms baseline models across all downstream tasks. The performance also exhibits robust data-efficient adaptation. Further analysis reveals that the representations extracted by the FM are task-agnostic but can be specialized via a single linear mapping for different downstream tasks.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Domain Knowledge Guided Bayesian Optimization For Autonomous Alignment Of Complex Scientific Instruments

Bayesian Optimization (BO) is a powerful tool for optimizing complex non-linear systems. However, its performance degrades in high-dimensional problems with tightly coupled parameters and highly asymmetric objective landscapes, where rewards are sparse. In such needle-in-a-haystack scenarios, even advanced methods like trust-region BO (TurBO) often lead to unsatisfactory results. We propose a domain knowledge guided Bayesian Optimization approach, which leverages physical insight to fundamentally simplify the search problem by transforming coordinates to decouple input features and align the active subspaces with the primary search axes. We demonstrate this approach's efficacy on a challenging 12-dimensional, 6-crystal Split-and-Delay optical system, where conventional approaches, including standard BO, TuRBO and multi-objective BO, consistently led to unsatisfactory results. When combined with an reverse annealing exploration strategy, this approach reliably converges to the global optimum. The coordinate transformation itself is the key to this success, significantly accelerating the search by aligning input co-ordinate axes with the problem's active subspaces. As increasingly complex scientific instruments, from large telescopes to new spectrometers at X-ray Free Electron Lasers are deployed, the demand for robust high-dimensional optimization grows. Our results demonstrate a generalizable paradigm: leveraging physical insight to transform high-dimensional, coupled optimization problems into simpler representations can enable rapid and robust automated tuning for consistent high performance while still retaining current optimization algorithms.

FOS: Computer and information sciences↗

The Road to Useful Quantum Computers

Building a useful quantum computer is a grand science and engineering challenge, currently pursued intensely by teams around the world. In the 1980s, Richard Feynman and Yuri Manin observed independently that computers based on quantum mechanics might enable better simulations of quantum phenomena. Their vision remained an intellectual curiosity until Peter Shor published his famous quantum algorithm for integer factoring, and shortly thereafter a proof that errors in quantum computations can be corrected. Since then, quantum computing R&D has progressed rapidly, from small-scale experiments in university physics laboratories to well-funded industrial efforts and prototypes. Hype notwithstanding, quantum computers have yet to solve scientifically or practically important problems -- a target often called quantum utility. In this article, we describe the capabilities of contemporary quantum computers, compare them to the requirements of quantum utility, and illustrate how to track progress from today to utility. We highlight key science and engineering challenges on the road to quantum utility, touching on relevant aspects of our own research.

Emerging Technologies (cs.ET)↗

Self-driving thin film laboratory: autonomous epitaxial atomic-layer synthesis via real-time computer vision analysis of electron diffraction

Emerging materials science platforms with the ability to make autonomous decisions on the fly are fundamentally changing the outlook and protocols for materials optimization and discovery. Because AI-driven self-navigating schemes can effectively reduce the total number of iterations needed to arrive at the "answer" (i.e. the best stochiometric composition for a desired physical property, optimum materials processing parameters, etc.) by significant margins, they have the potential to revolutionize materials and chemical manufacturing processes at large in research laboratory settings as well as in industrial plants. Here, we demonstrate a successful implementation of real-time closed-loop autonomous navigation of a multi-dimensional materials synthesis parameter space for fabricating phase-pure epitaxial films of a metastable phase of a functional oxide in a combinatorial pulsed laser deposition chamber. Sequential epitaxial growth iterations in search of the optimized recipe to stabilize the desired crystal phase were performed using frame-by-frame quantitative computer vision analysis of reflection high-energy electron diffraction (RHEED) images of the unit-cell level film being deposited. The autonomous scheme regularly resulted in > 30-fold reduction in the number of required experiments compared to a comprehensive mapping of the parameter space. The real-time workflow developed here can be readily extended to a variety of thin film synthesis platforms opening the door for self-driving atomic-level materials design as well as autonomous optimization of semiconductor manufacturing.

36 MATERIALS SCIENCE↗

Distinguishing Thermal Fluctuations from Polaron Formation in Halide Perovskites

Recent angle-resolved photoelectron spectroscopy (ARPES) measurements of the hole effective mass in CsPbBr$_3$ revealed an enhancement of $\sim$50 % compared to the bare mass computed from first principles for CsPbBr$_3$ at $T = 0 K$. This large enhancement was interpreted as evidence of polaron formation. Employing accurate finite-temperature first-principles calculations, we show that the calculated hole effective mass of CsPbBr$_3$ at $T = 300 K$ can explain experimental results without invoking polarons. Thermal fluctuations are particularly strong in halide perovskites compared to conventional semiconductors such as Si and GaAs, and cannot be ignored when comparing with experiment. We not only resolve the debate on polaron formation in halide perovskites, but also demonstrate the general importance of including thermal fluctuations in first-principles calculations for strongly anharmonic materials.

36 MATERIALS SCIENCE↗

Measuring the Burgers vector of dislocations with dark-field X-ray microscopy

The subsurface dynamics of dislocations are essential to many properties of bulk crystalline materials. However, it is challenging to characterize a bulk crystal by conventional transmission electron microscopy (TEM) due to the limited penetration depth of electrons. A novel X-ray imaging technique – dark-field X-ray microscopy (DFXM) – was developed to image hierarchical dislocation structures in bulk crystals. While today's DFXM can effectively map the line structures of dislocations, it is still challenging to quantify the Burgers vectors, the key characterization governing the dislocation behaviors. Here, we extend the 'invisibility criterion' formalism from the TEM theory to the geometrical-optics model of DFXM and demonstrate the consistency between DFXM and dark-field TEM using multi-diffraction-peak imaging for a single edge dislocation. Due to the practical difficulty of multi-peak DFXM experiments, we further study how the Burgers vector effect is encoded for a single-peak DFXM experiment. Using the geometrical-optics DFXM simulation, we explore the asymmetry of rocking tilt scans at different rolling tilts and develop a new method to characterize the Burgers vector. The conclusions of this study advance our understanding of the use of DFXM in characterizing individual dislocations, enabling the connection from bulk DFXM imaging to dislocation mechanics.

36 MATERIALS SCIENCE↗

Discovery of spontaneous mesoscopic strain waves in nematic domains using dark-field x-ray microscopy

Electronic nematic order arises when correlated electrons spontaneously break the rotational symmetry of a crystal lattice. When electronic nematic order couples bilinearly to symmetry-breaking lattice strain, both appear together at a single ferroelastic phase transition, producing structural twin domains with distinct orientations of the nematic director. While the effects of applied strain on these domains are well established, the intrinsic behavior of spontaneous subdomain strain fields has remained unexplored. Here, we report the discovery of spontaneous mesoscopic strain waves within individual nematic domains of an iron-based superconductor, observed using dark-field x-ray microscopy (DFXM). Using this advanced full-field imaging technique, we visualize subdomain strain modulations emerging concurrently with nematic order. Elastic compatibility relations governing inhomogeneous strains provide a natural mechanism for the strain waves. Our findings reveal a broadly relevant form of strain self-organization and position DFXM as a powerful probe of the local interplay between lattice strain and electronic order.

36 MATERIALS SCIENCE↗

Complexity-theoretic foundations of BosonSampling with a linear number of modes

BosonSampling is the leading candidate for demonstrating quantum computational advantage in photonic systems. While we have recently seen many impressive experimental demonstrations, there is still a formidable distance between the complexity-theoretic hardness arguments and current experiments. One of the largest gaps involves the ratio of {particles} to modes -- all current hardness evidence assumes a dilute regime in which the number of linear optical modes scales at least quadratically in the number of particles. By contrast, current experiments operate in a saturated regime with a linear number of modes. In this paper we bridge this gap, bringing the hardness evidence for experiments in the saturated regime to the same level as had been previously established for the dilute regime. This involves proving a new worst-to-average-case reduction for computing the Permanent which is robust to both large numbers of row repetitions and also to distributions over matrices with correlated entries. We also apply similar arguments to give evidence for hardness of Gaussian BosonSampling in the saturated regime.

Computational Complexity (cs.CC)↗

Pseudorandomness from Subset States

We show it is possible to obtain quantum pseudorandomness and pseudoentanglement from random subset states -- i.e. quantum states which are equal superpositions over (pseudo)random subsets of strings. This answers an open question of Aaronson et al. [arXiv:2211.00747], who devised a similar construction augmented by pseudorandom phases. Our result follows from a direct calculation of the trace distance between t copies of random subset states and the Haar measure, via the representation theory of the symmetric group. We show that the trace distance is negligibly small, as long as the subsets are of an appropriate size which is neither too big nor too small. In particular, we analyze the action of basis permutations on the symmetric subspace, and show that the largest component is described by the Johnson scheme: the double-cosets of the symmetric group S N by the subgroup S t x S N-t . The Gelfand pair property of this setting implies that the matrix eigenbasis coincides with the symmetric group irreducible blocks, with the largest eigenblock asymptotically approaching the Haar average. An immediate corollary of our result is that quantum pseudorandom and pseudoentangled state ensembles do not require relative phases.

Computational Complexity (cs.CC)↗

On the hardness of learning ground state entanglement of geometrically local Hamiltonians

Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity of this problem, given the Hamiltonian as input. Our main result is that to show it is cryptographically hard to determine if the ground state of a geometrically local, polynomially gapped Hamiltonian on qudits (d=O(1)) has near-area law vs near-volume law entanglement. This improves prior work of Bouland et al. (arXiv:2311.12017) showing this for non-geometrically local Hamiltonians. In particular we show this problem is roughly factoring-hard in 1D, and LWE-hard in 2D. Our proof works by constructing a novel form of public-key pseudo-entanglement which is highly space-efficient, and combining this with a modification of Gottesman and Irani's quantum Turing machine to Hamiltonian construction. Our work suggests that the problem of learning so-called "gapless" quantum phases of matter might be intractable.

Computational Complexity (cs.CC)↗

Global Framework for Emulation of Nuclear Calculations

We introduce a hierarchical framework that combines ab initio many-body calculations with a Bayesian neural network, developing emulators capable of accurately predicting nuclear properties across isotopic chains simultaneously and being applicable to different regions of the nuclear chart. We benchmark our developments using the oxygen isotopic chain, achieving accurate results for ground-state energies and nuclear charge radii, while providing robust uncertainty quantification. Our framework enables global sensitivity analysis of nuclear binding energies and charge radii with respect to the low-energy constants that describe the nuclear force.

FOS: Computer and information sciences↗

Nuclear Data Adjustment for Nonlinear Applications in the OECD/NEA WPNCS SG14 Benchmark -- A Bayesian Inverse UQ-based Approach for Data Assimilation

The Organization for Economic Cooperation and Development (OECD) Working Party on Nuclear Criticality Safety (WPNCS) proposed a benchmark exercise to assess the performance of current nuclear data adjustment techniques applied to nonlinear applications and experiments with low correlation to applications. This work introduces Bayesian Inverse Uncertainty Quantification (IUQ) as a method for nuclear data adjustments in this benchmark, and compares IUQ to the more traditional methods of Generalized Linear Least Squares (GLLS) and Monte Carlo Bayes (MOCABA). Posterior predictions from IUQ showed agreement with GLLS and MOCABA for linear applications. When comparing GLLS, MOCABA, and IUQ posterior predictions to computed model responses using adjusted parameters, we observe that GLLS predictions fail to replicate computed response distributions for nonlinear applications, while MOCABA shows near agreement, and IUQ uses computed model responses directly. We also discuss observations on why experiments with low correlation to applications can be informative to nuclear data adjustments and identify some properties useful in selecting experiments for inclusion in nuclear data adjustment. Performance in this benchmark indicates potential for Bayesian IUQ in nuclear data adjustments.

FOS: Computer and information sciences↗

hls4ml: A Flexible, Open-Source Platform for Deep Learning Acceleration on Reconfigurable Hardware

We present hls4ml, a free and open-source platform that translates machine learning (ML) models from modern deep learning frameworks into high-level synthesis (HLS) code that can be integrated into full designs for field-programmable gate arrays (FPGAs) or application-specific integrated circuits (ASICs). With its flexible and modular design, hls4ml supports a large number of deep learning frameworks and can target HLS compilers from several vendors, including Vitis HLS, Intel oneAPI and Catapult HLS. Together with a wider eco-system for software-hardware co-design, hls4ml has enabled the acceleration of ML inference in a wide range of commercial and scientific applications where low latency, resource usage, and power consumption are critical. In this paper, we describe the structure and functionality of the hls4ml platform. The overarching design considerations for the generated HLS code are discussed, together with selected performance results.

FOS: Computer and information sciences↗

All-organic self-separating three-dimensionally nanoarchitected electrochemical energy storage devices

This work realizes a three-dimensionally (3D) nanoarchitected, all organic, "self-separating" lithium-ion electrochemical energy storage (EES) device that is cycled as a solid-state full cell. The device is enabled by a monolithic carbon anode with a co-continuous pore network, derived from the structure direction of resols by an ultra-large molar mass block copolymer (BCP), poly(styrene-block-2-dimethylaminoethyl methacrylate) (SA). Electropolymerization of a single-phase conductive and redox-active material, poly((2,3-dihydrothieno[3,4-b][1,4]dioxin-2-yl)methyl 9,10-dioxo-9,10-dihydroanthracene-2-carboxylate) (PAQEDOT), into the pore space provides the cathode of the cell. The device is electronically contacted to the relevant electrode network enabled by the co-continuous nature of each electrode. Electrochemical processing via cycling against external lithium in an electrolyte generates a solid electrolyte interphase (SEI) as a separator and lithiates the cell electrodes, after which the EES device is cycled in the solid state. While the full cell does not demonstrate high cyclability, the best full cell demonstrates a discharge capacity of 267 milliamp hours per gram (mAh/g). This work marks, to the best of knowledge of the authors, the first example of an all-organic materials derived 3D nanoarchitected EES device, as well as the first design of "self-separating" cell fabrication. Furthermore, generalization of the design to another co-continuous carbon form factor is demonstrated.

FOS: Physical sciences↗

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)↗

Precision Measurement of Neutrino Oscillation Parameters with 10 Years of Data from the NOvA Experiment

This Letter reports measurements of muon-neutrino disappearance and electron-neutrino appearance and the corresponding antineutrino processes between the two NOvA detectors in the NuMI neutrino beam. These measurements use a dataset with double the neutrino mode beam exposure that was previously analyzed, along with improved simulation and analysis techniques. A joint fit to these samples in the three-flavor paradigm results in the most precise single-experiment constraint on the atmospheric neutrino mass-splitting, $Δm^2_{32}= 2.431^{+0.036}_{-0.034} (-2.479^{+0.036}_{-0.036}) \times 10^{-3}$~eV$^2$ if the mass ordering is Normal (Inverted). In both orderings, a region close to maximal mixing with $\sin^2θ_{23}=0.55_{+0.06}^{-0.02}$ is preferred. The NOvA data show a mild preference for the Normal mass ordering with a Bayes factor of 2.4 (corresponding to 70% of the posterior probability), indicating that the Normal ordering is 2.4 times more probable than the Inverted ordering. When incorporating a 2D $Δm^2_{32}\textrm{--}\sin^2 2θ_{13}$ constraint based on Daya Bay data, this preference strengthens to a Bayes factor of 6.6 (87\%).

FOS: Physical sciences↗